ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.292 by sf-exg, Mon Mar 22 09:57:01 2010 UTC vs.
Revision 1.447 by root, Sat Jun 22 16:25:53 2019 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
…		…
26	puts ("stdin ready");	28	puts ("stdin ready");
27	// for one-shot events, one must manually stop the watcher	29	// for one-shot events, one must manually stop the watcher
28	// with its corresponding stop function.	30	// with its corresponding stop function.
29	ev_io_stop (EV_A_ w);	31	ev_io_stop (EV_A_ w);
30		32
31	// this causes all nested ev_loop's to stop iterating	33	// this causes all nested ev_run's to stop iterating
32	ev_unloop (EV_A_ EVUNLOOP_ALL);	34	ev_break (EV_A_ EVBREAK_ALL);
33	}	35	}
34		36
35	// another callback, this time for a time-out	37	// another callback, this time for a time-out
36	static void	38	static void
37	timeout_cb (EV_P_ ev_timer *w, int revents)	39	timeout_cb (EV_P_ ev_timer *w, int revents)
38	{	40	{
39	puts ("timeout");	41	puts ("timeout");
40	// this causes the innermost ev_loop to stop iterating	42	// this causes the innermost ev_run to stop iterating
41	ev_unloop (EV_A_ EVUNLOOP_ONE);	43	ev_break (EV_A_ EVBREAK_ONE);
42	}	44	}
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);
…		…
56	// simple non-repeating 5.5 second timeout	58	// simple non-repeating 5.5 second timeout
57	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);	59	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
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_loop (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
…		…
75	While this document tries to be as complete as possible in documenting	77	While this document tries to be as complete as possible in documenting
76	libev, its usage and the rationale behind its design, it is not a tutorial	78	libev, its usage and the rationale behind its design, it is not a tutorial
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	Familarity 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
…		…
95	details of the event, and then hand it over to libev by I<starting> the	105	details of the event, and then hand it over to libev by I<starting> the
96	watcher.	106	watcher.
97		107
98	=head2 FEATURES	108	=head2 FEATURES
99		109
100	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the	110	Libev supports C<select>, C<poll>, the Linux-specific aio and C<epoll>
101	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms	111	interfaces, the BSD-specific C<kqueue> and the Solaris-specific event port
102	for file descriptor events (C<ev_io>), the Linux C<inotify> interface	112	mechanisms for file descriptor events (C<ev_io>), the Linux C<inotify>
103	(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner	113	interface (for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
104	inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative	114	inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
105	timers (C<ev_timer>), absolute timers with customised rescheduling	115	timers (C<ev_timer>), absolute timers with customised rescheduling
106	(C<ev_periodic>), synchronous signals (C<ev_signal>), process status	116	(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
107	change events (C<ev_child>), and event watchers dealing with the event	117	change events (C<ev_child>), and event watchers dealing with the event
108	loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and	118	loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
…		…
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 (somewhere	139	the (fractional) number of seconds since the (POSIX) epoch (in practice
130	near the beginning of 1970, details are complicated, don't ask). This	140	somewhere near the beginning of 1970, details are complicated, don't
131	type is called C<ev_tstamp>, which is what you should use too. It usually	141	ask). This type is called C<ev_tstamp>, which is what you should use
132	aliases to the C<double> type in C. When you need to do any calculations	142	too. It usually aliases to the C<double> type in C. When you need to do
133	on it, you should treat it as some floating point value. Unlike the name	143	any calculations on it, you should treat it as some floating point value.
		144
134	component C<stamp> might indicate, it is also used for time differences	145	Unlike the name component C<stamp> might indicate, it is also used for
135	throughout libev.	146	time differences (e.g. delays) throughout libev.
136		147
137	=head1 ERROR HANDLING	148	=head1 ERROR HANDLING
138		149
139	Libev knows three classes of errors: operating system errors, usage errors	150	Libev knows three classes of errors: operating system errors, usage errors
140	and internal errors (bugs).	151	and internal errors (bugs).
…		…
164		175
165	=item ev_tstamp ev_time ()	176	=item ev_tstamp ev_time ()
166		177
167	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
168	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
169	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>.
170		182
171	=item ev_sleep (ev_tstamp interval)	183	=item ev_sleep (ev_tstamp interval)
172		184
173	Sleep for the given interval: The current thread will be blocked until	185	Sleep for the given interval: The current thread will be blocked
174	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
175	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 >>).
176		194
177	=item int ev_version_major ()	195	=item int ev_version_major ()
178		196
179	=item int ev_version_minor ()	197	=item int ev_version_minor ()
180		198
…		…
191	as this indicates an incompatible change. Minor versions are usually	209	as this indicates an incompatible change. Minor versions are usually
192	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
193	not a problem.	211	not a problem.
194		212
195	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
196	version.	214	version (note, however, that this will not detect other ABI mismatches,
		215	such as LFS or reentrancy).
197		216
198	assert (("libev version mismatch",	217	assert (("libev version mismatch",
199	ev_version_major () == EV_VERSION_MAJOR	218	ev_version_major () == EV_VERSION_MAJOR
200	&& ev_version_minor () >= EV_VERSION_MINOR));	219	&& ev_version_minor () >= EV_VERSION_MINOR));
201		220
…		…
212	assert (("sorry, no epoll, no sex",	231	assert (("sorry, no epoll, no sex",
213	ev_supported_backends () & EVBACKEND_EPOLL));	232	ev_supported_backends () & EVBACKEND_EPOLL));
214		233
215	=item unsigned int ev_recommended_backends ()	234	=item unsigned int ev_recommended_backends ()
216		235
217	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
218	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
219	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
220	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
221	(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
222	libev will probe for if you specify no backends explicitly.	242	probe for if you specify no backends explicitly.
223		243
224	=item unsigned int ev_embeddable_backends ()	244	=item unsigned int ev_embeddable_backends ()
225		245
226	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
227	is the theoretical, all-platform, value. To find which backends	247	value is platform-specific but can include backends not available on the
228	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
229	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	249	the current system, you would need to look at C<ev_embeddable_backends ()
230	recommended ones.	250	& ev_supported_backends ()>, likewise for recommended ones.
231		251
232	See the description of C<ev_embed> watchers for more info.	252	See the description of C<ev_embed> watchers for more info.
233		253
234	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]	254	=item ev_set_allocator (void *(*cb)(void *ptr, long size) throw ())
235		255
236	Sets the allocation function to use (the prototype is similar - the	256	Sets the allocation function to use (the prototype is similar - the
237	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
238	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
239	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
…		…
245		265
246	You could override this function in high-availability programs to, say,	266	You could override this function in high-availability programs to, say,
247	free some memory if it cannot allocate memory, to use a special allocator,	267	free some memory if it cannot allocate memory, to use a special allocator,
248	or even to sleep a while and retry until some memory is available.	268	or even to sleep a while and retry until some memory is available.
249		269
		270	Example: The following is the C<realloc> function that libev itself uses
		271	which should work with C<realloc> and C<free> functions of all kinds and
		272	is probably a good basis for your own implementation.
		273
		274	static void *
		275	ev_realloc_emul (void *ptr, long size) EV_NOEXCEPT
		276	{
		277	if (size)
		278	return realloc (ptr, size);
		279
		280	free (ptr);
		281	return 0;
		282	}
		283
250	Example: Replace the libev allocator with one that waits a bit and then	284	Example: Replace the libev allocator with one that waits a bit and then
251	retries (example requires a standards-compliant C<realloc>).	285	retries.
252		286
253	static void *	287	static void *
254	persistent_realloc (void *ptr, size_t size)	288	persistent_realloc (void *ptr, size_t size)
255	{	289	{
		290	if (!size)
		291	{
		292	free (ptr);
		293	return 0;
		294	}
		295
256	for (;;)	296	for (;;)
257	{	297	{
258	void *newptr = realloc (ptr, size);	298	void *newptr = realloc (ptr, size);
259		299
260	if (newptr)	300	if (newptr)
…		…
265	}	305	}
266		306
267	...	307	...
268	ev_set_allocator (persistent_realloc);	308	ev_set_allocator (persistent_realloc);
269		309
270	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]	310	=item ev_set_syserr_cb (void (*cb)(const char *msg) throw ())
271		311
272	Set the callback function to call on a retryable system call error (such	312	Set the callback function to call on a retryable system call error (such
273	as failed select, poll, epoll_wait). The message is a printable string	313	as failed select, poll, epoll_wait). The message is a printable string
274	indicating the system call or subsystem causing the problem. If this	314	indicating the system call or subsystem causing the problem. If this
275	callback is set, then libev will expect it to remedy the situation, no	315	callback is set, then libev will expect it to remedy the situation, no
…		…
287	}	327	}
288		328
289	...	329	...
290	ev_set_syserr_cb (fatal_error);	330	ev_set_syserr_cb (fatal_error);
291		331
		332	=item ev_feed_signal (int signum)
		333
		334	This function can be used to "simulate" a signal receive. It is completely
		335	safe to call this function at any time, from any context, including signal
		336	handlers or random threads.
		337
		338	Its main use is to customise signal handling in your process, especially
		339	in the presence of threads. For example, you could block signals
		340	by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
		341	creating any loops), and in one thread, use C<sigwait> or any other
		342	mechanism to wait for signals, then "deliver" them to libev by calling
		343	C<ev_feed_signal>.
		344
292	=back	345	=back
293		346
294	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	347	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
295		348
296	An event loop is described by a C<struct ev_loop *> (the C<struct>	349	An event loop is described by a C<struct ev_loop *> (the C<struct> is
297	is I<not> optional in this case, as there is also an C<ev_loop>	350	I<not> optional in this case unless libev 3 compatibility is disabled, as
298	I<function>).	351	libev 3 had an C<ev_loop> function colliding with the struct name).
299		352
300	The library knows two types of such loops, the I<default> loop, which	353	The library knows two types of such loops, the I<default> loop, which
301	supports signals and child events, and dynamically created loops which do	354	supports child process events, and dynamically created event loops which
302	not.	355	do not.
303		356
304	=over 4	357	=over 4
305		358
306	=item struct ev_loop *ev_default_loop (unsigned int flags)	359	=item struct ev_loop *ev_default_loop (unsigned int flags)
307		360
308	This will initialise the default event loop if it hasn't been initialised	361	This returns the "default" event loop object, which is what you should
309	yet and return it. If the default loop could not be initialised, returns	362	normally use when you just need "the event loop". Event loop objects and
310	false. If it already was initialised it simply returns it (and ignores the	363	the C<flags> parameter are described in more detail in the entry for
311	flags. If that is troubling you, check C<ev_backend ()> afterwards).	364	C<ev_loop_new>.
		365
		366	If the default loop is already initialised then this function simply
		367	returns it (and ignores the flags. If that is troubling you, check
		368	C<ev_backend ()> afterwards). Otherwise it will create it with the given
		369	flags, which should almost always be C<0>, unless the caller is also the
		370	one calling C<ev_run> or otherwise qualifies as "the main program".
312		371
313	If you don't know what event loop to use, use the one returned from this	372	If you don't know what event loop to use, use the one returned from this
314	function.	373	function (or via the C<EV_DEFAULT> macro).
315		374
316	Note that this function is I<not> thread-safe, so if you want to use it	375	Note that this function is I<not> thread-safe, so if you want to use it
317	from multiple threads, you have to lock (note also that this is unlikely,	376	from multiple threads, you have to employ some kind of mutex (note also
318	as loops cannot be shared easily between threads anyway).	377	that this case is unlikely, as loops cannot be shared easily between
		378	threads anyway).
319		379
320	The default loop is the only loop that can handle C<ev_signal> and	380	The default loop is the only loop that can handle C<ev_child> watchers,
321	C<ev_child> watchers, and to do this, it always registers a handler	381	and to do this, it always registers a handler for C<SIGCHLD>. If this is
322	for C<SIGCHLD>. If this is a problem for your application you can either	382	a problem for your application you can either create a dynamic loop with
323	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you	383	C<ev_loop_new> which doesn't do that, or you can simply overwrite the
324	can simply overwrite the C<SIGCHLD> signal handler I<after> calling	384	C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
325	C<ev_default_init>.	385
		386	Example: This is the most typical usage.
		387
		388	if (!ev_default_loop (0))
		389	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
		390
		391	Example: Restrict libev to the select and poll backends, and do not allow
		392	environment settings to be taken into account:
		393
		394	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
		395
		396	=item struct ev_loop *ev_loop_new (unsigned int flags)
		397
		398	This will create and initialise a new event loop object. If the loop
		399	could not be initialised, returns false.
		400
		401	This function is thread-safe, and one common way to use libev with
		402	threads is indeed to create one loop per thread, and using the default
		403	loop in the "main" or "initial" thread.
326		404
327	The flags argument can be used to specify special behaviour or specific	405	The flags argument can be used to specify special behaviour or specific
328	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	406	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
329		407
330	The following flags are supported:	408	The following flags are supported:
…		…
340		418
341	If this flag bit is or'ed into the flag value (or the program runs setuid	419	If this flag bit is or'ed into the flag value (or the program runs setuid
342	or setgid) then libev will I<not> look at the environment variable	420	or setgid) then libev will I<not> look at the environment variable
343	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will	421	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
344	override the flags completely if it is found in the environment. This is	422	override the flags completely if it is found in the environment. This is
345	useful to try out specific backends to test their performance, or to work	423	useful to try out specific backends to test their performance, to work
346	around bugs.	424	around bugs, or to make libev threadsafe (accessing environment variables
		425	cannot be done in a threadsafe way, but usually it works if no other
		426	thread modifies them).
347		427
348	=item C<EVFLAG_FORKCHECK>	428	=item C<EVFLAG_FORKCHECK>
349		429
350	Instead of calling C<ev_loop_fork> manually after a fork, you can also	430	Instead of calling C<ev_loop_fork> manually after a fork, you can also
351	make libev check for a fork in each iteration by enabling this flag.	431	make libev check for a fork in each iteration by enabling this flag.
352		432
353	This works by calling C<getpid ()> on every iteration of the loop,	433	This works by calling C<getpid ()> on every iteration of the loop,
354	and thus this might slow down your event loop if you do a lot of loop	434	and thus this might slow down your event loop if you do a lot of loop
355	iterations and little real work, but is usually not noticeable (on my	435	iterations and little real work, but is usually not noticeable (on my
356	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence	436	GNU/Linux system for example, C<getpid> is actually a simple 5-insn
357	without a system call and thus I<very> fast, but my GNU/Linux system also has	437	sequence without a system call and thus I<very> fast, but my GNU/Linux
358	C<pthread_atfork> which is even faster).	438	system also has C<pthread_atfork> which is even faster). (Update: glibc
		439	versions 2.25 apparently removed the C<getpid> optimisation again).
359		440
360	The big advantage of this flag is that you can forget about fork (and	441	The big advantage of this flag is that you can forget about fork (and
361	forget about forgetting to tell libev about forking) when you use this	442	forget about forgetting to tell libev about forking, although you still
362	flag.	443	have to ignore C<SIGPIPE>) when you use this flag.
363		444
364	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>	445	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
365	environment variable.	446	environment variable.
366		447
367	=item C<EVFLAG_NOINOTIFY>	448	=item C<EVFLAG_NOINOTIFY>
368		449
369	When this flag is specified, then libev will not attempt to use the	450	When this flag is specified, then libev will not attempt to use the
370	I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and	451	I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
371	testing, this flag can be useful to conserve inotify file descriptors, as	452	testing, this flag can be useful to conserve inotify file descriptors, as
372	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.	453	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
373		454
374	=item C<EVFLAG_SIGNALFD>	455	=item C<EVFLAG_SIGNALFD>
375		456
376	When this flag is specified, then libev will attempt to use the	457	When this flag is specified, then libev will attempt to use the
377	I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API	458	I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API
378	delivers signals synchronously, which makes it both faster and might make	459	delivers signals synchronously, which makes it both faster and might make
379	it possible to get the queued signal data. It can also simplify signal	460	it possible to get the queued signal data. It can also simplify signal
380	handling with threads, as long as you properly block signals in your	461	handling with threads, as long as you properly block signals in your
381	threads that are not interested in handling them.	462	threads that are not interested in handling them.
382		463
383	Signalfd will not be used by default as this changes your signal mask, and	464	Signalfd will not be used by default as this changes your signal mask, and
384	there are a lot of shoddy libraries and programs (glib's threadpool for	465	there are a lot of shoddy libraries and programs (glib's threadpool for
385	example) that can't properly initialise their signal masks.	466	example) that can't properly initialise their signal masks.
		467
		468	=item C<EVFLAG_NOSIGMASK>
		469
		470	When this flag is specified, then libev will avoid to modify the signal
		471	mask. Specifically, this means you have to make sure signals are unblocked
		472	when you want to receive them.
		473
		474	This behaviour is useful when you want to do your own signal handling, or
		475	want to handle signals only in specific threads and want to avoid libev
		476	unblocking the signals.
		477
		478	It's also required by POSIX in a threaded program, as libev calls
		479	C<sigprocmask>, whose behaviour is officially unspecified.
		480
		481	This flag's behaviour will become the default in future versions of libev.
386		482
387	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	483	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
388		484
389	This is your standard select(2) backend. Not I<completely> standard, as	485	This is your standard select(2) backend. Not I<completely> standard, as
390	libev tries to roll its own fd_set with no limits on the number of fds,	486	libev tries to roll its own fd_set with no limits on the number of fds,
…		…
418	=item C<EVBACKEND_EPOLL> (value 4, Linux)	514	=item C<EVBACKEND_EPOLL> (value 4, Linux)
419		515
420	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9	516	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
421	kernels).	517	kernels).
422		518
423	For few fds, this backend is a bit little slower than poll and select,	519	For few fds, this backend is a bit little slower than poll and select, but
424	but it scales phenomenally better. While poll and select usually scale	520	it scales phenomenally better. While poll and select usually scale like
425	like O(total_fds) where n is the total number of fds (or the highest fd),	521	O(total_fds) where total_fds is the total number of fds (or the highest
426	epoll scales either O(1) or O(active_fds).	522	fd), epoll scales either O(1) or O(active_fds).
427		523
428	The epoll mechanism deserves honorable mention as the most misdesigned	524	The epoll mechanism deserves honorable mention as the most misdesigned
429	of the more advanced event mechanisms: mere annoyances include silently	525	of the more advanced event mechanisms: mere annoyances include silently
430	dropping file descriptors, requiring a system call per change per file	526	dropping file descriptors, requiring a system call per change per file
431	descriptor (and unnecessary guessing of parameters), problems with dup and	527	descriptor (and unnecessary guessing of parameters), problems with dup,
		528	returning before the timeout value, resulting in additional iterations
		529	(and only giving 5ms accuracy while select on the same platform gives
432	so on. The biggest issue is fork races, however - if a program forks then	530	0.1ms) and so on. The biggest issue is fork races, however - if a program
433	I<both> parent and child process have to recreate the epoll set, which can	531	forks then I<both> parent and child process have to recreate the epoll
434	take considerable time (one syscall per file descriptor) and is of course	532	set, which can take considerable time (one syscall per file descriptor)
435	hard to detect.	533	and is of course hard to detect.
436		534
437	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	535	Epoll is also notoriously buggy - embedding epoll fds I<should> work,
438	of course I<doesn't>, and epoll just loves to report events for totally	536	but of course I<doesn't>, and epoll just loves to report events for
439	I<different> file descriptors (even already closed ones, so one cannot	537	totally I<different> file descriptors (even already closed ones, so
440	even remove them from the set) than registered in the set (especially	538	one cannot even remove them from the set) than registered in the set
441	on SMP systems). Libev tries to counter these spurious notifications by	539	(especially on SMP systems). Libev tries to counter these spurious
442	employing an additional generation counter and comparing that against the	540	notifications by employing an additional generation counter and comparing
443	events to filter out spurious ones, recreating the set when required.	541	that against the events to filter out spurious ones, recreating the set
		542	when required. Epoll also erroneously rounds down timeouts, but gives you
		543	no way to know when and by how much, so sometimes you have to busy-wait
		544	because epoll returns immediately despite a nonzero timeout. And last
		545	not least, it also refuses to work with some file descriptors which work
		546	perfectly fine with C<select> (files, many character devices...).
		547
		548	Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
		549	cobbled together in a hurry, no thought to design or interaction with
		550	others. Oh, the pain, will it ever stop...
444		551
445	While stopping, setting and starting an I/O watcher in the same iteration	552	While stopping, setting and starting an I/O watcher in the same iteration
446	will result in some caching, there is still a system call per such	553	will result in some caching, there is still a system call per such
447	incident (because the same I<file descriptor> could point to a different	554	incident (because the same I<file descriptor> could point to a different
448	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	555	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
460	All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or	567	All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
461	faster than epoll for maybe up to a hundred file descriptors, depending on	568	faster than epoll for maybe up to a hundred file descriptors, depending on
462	the usage. So sad.	569	the usage. So sad.
463		570
464	While nominally embeddable in other event loops, this feature is broken in	571	While nominally embeddable in other event loops, this feature is broken in
465	all kernel versions tested so far.	572	a lot of kernel revisions, but probably(!) works in current versions.
		573
		574	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
		575	C<EVBACKEND_POLL>.
		576
		577	=item C<EVBACKEND_LINUXAIO> (value 64, Linux)
		578
		579	Use the linux-specific linux aio (I<not> C<< aio(7) >>) event interface
		580	available in post-4.18 kernels.
		581
		582	If this backend works for you (as of this writing, it was very
		583	experimental and only supports a subset of file types), it is the best
		584	event interface available on linux and might be well worth it enabling it
		585	- if it isn't available in your kernel this will be detected and another
		586	backend will be chosen.
		587
		588	This backend can batch oneshot requests and uses a user-space ring buffer
		589	to receive events. It also doesn't suffer from most of the design problems
		590	of epoll (such as not being able to remove event sources from the epoll
		591	set), and generally sounds too good to be true. Because, this being the
		592	linux kernel, of course it suffers from a whole new set of limitations.
		593
		594	For one, it is not easily embeddable (but probably could be done using
		595	an event fd at some extra overhead). It also is subject to various
		596	arbitrary limits that can be configured in F</proc/sys/fs/aio-max-nr>
		597	and F</proc/sys/fs/aio-nr>), which could lead to it being skipped during
		598	initialisation.
		599
		600	Most problematic in practise, however, is that, like kqueue, it requires
		601	special support from drivers, and, not surprisingly, not all drivers
		602	implement it. For example, in linux 4.19, tcp sockets, pipes, event fds,
		603	files, F</dev/null> and a few others are supported, but ttys are not, so
		604	this is not (yet?) a generic event polling interface but is probably still
		605	be very useful in a web server or similar program.
466		606
467	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	607	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
468	C<EVBACKEND_POLL>.	608	C<EVBACKEND_POLL>.
469		609
470	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)	610	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
…		…
485		625
486	It scales in the same way as the epoll backend, but the interface to the	626	It scales in the same way as the epoll backend, but the interface to the
487	kernel is more efficient (which says nothing about its actual speed, of	627	kernel is more efficient (which says nothing about its actual speed, of
488	course). While stopping, setting and starting an I/O watcher does never	628	course). While stopping, setting and starting an I/O watcher does never
489	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to	629	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
490	two event changes per incident. Support for C<fork ()> is very bad (but	630	two event changes per incident. Support for C<fork ()> is very bad (you
491	sane, unlike epoll) and it drops fds silently in similarly hard-to-detect	631	might have to leak fd's on fork, but it's more sane than epoll) and it
492	cases	632	drops fds silently in similarly hard-to-detect cases.
493		633
494	This backend usually performs well under most conditions.	634	This backend usually performs well under most conditions.
495		635
496	While nominally embeddable in other event loops, this doesn't work	636	While nominally embeddable in other event loops, this doesn't work
497	everywhere, so you might need to test for this. And since it is broken	637	everywhere, so you might need to test for this. And since it is broken
…		…
514	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	654	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
515		655
516	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	656	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
517	it's really slow, but it still scales very well (O(active_fds)).	657	it's really slow, but it still scales very well (O(active_fds)).
518		658
519	Please note that Solaris event ports can deliver a lot of spurious
520	notifications, so you need to use non-blocking I/O or other means to avoid
521	blocking when no data (or space) is available.
522
523	While this backend scales well, it requires one system call per active	659	While this backend scales well, it requires one system call per active
524	file descriptor per loop iteration. For small and medium numbers of file	660	file descriptor per loop iteration. For small and medium numbers of file
525	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	661	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
526	might perform better.	662	might perform better.
527		663
528	On the positive side, with the exception of the spurious readiness	664	On the positive side, this backend actually performed fully to
529	notifications, this backend actually performed fully to specification
530	in all tests and is fully embeddable, which is a rare feat among the	665	specification in all tests and is fully embeddable, which is a rare feat
531	OS-specific backends (I vastly prefer correctness over speed hacks).	666	among the OS-specific backends (I vastly prefer correctness over speed
		667	hacks).
		668
		669	On the negative side, the interface is I<bizarre> - so bizarre that
		670	even sun itself gets it wrong in their code examples: The event polling
		671	function sometimes returns events to the caller even though an error
		672	occurred, but with no indication whether it has done so or not (yes, it's
		673	even documented that way) - deadly for edge-triggered interfaces where you
		674	absolutely have to know whether an event occurred or not because you have
		675	to re-arm the watcher.
		676
		677	Fortunately libev seems to be able to work around these idiocies.
532		678
533	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	679	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
534	C<EVBACKEND_POLL>.	680	C<EVBACKEND_POLL>.
535		681
536	=item C<EVBACKEND_ALL>	682	=item C<EVBACKEND_ALL>
537		683
538	Try all backends (even potentially broken ones that wouldn't be tried	684	Try all backends (even potentially broken ones that wouldn't be tried
539	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	685	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
540	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	686	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
541		687
542	It is definitely not recommended to use this flag.	688	It is definitely not recommended to use this flag, use whatever
		689	C<ev_recommended_backends ()> returns, or simply do not specify a backend
		690	at all.
		691
		692	=item C<EVBACKEND_MASK>
		693
		694	Not a backend at all, but a mask to select all backend bits from a
		695	C<flags> value, in case you want to mask out any backends from a flags
		696	value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
543		697
544	=back	698	=back
545		699
546	If one or more of the backend flags are or'ed into the flags value,	700	If one or more of the backend flags are or'ed into the flags value,
547	then only these backends will be tried (in the reverse order as listed	701	then only these backends will be tried (in the reverse order as listed
548	here). If none are specified, all backends in C<ev_recommended_backends	702	here). If none are specified, all backends in C<ev_recommended_backends
549	()> will be tried.	703	()> will be tried.
550		704
551	Example: This is the most typical usage.
552
553	if (!ev_default_loop (0))
554	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
555
556	Example: Restrict libev to the select and poll backends, and do not allow
557	environment settings to be taken into account:
558
559	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
560
561	Example: Use whatever libev has to offer, but make sure that kqueue is
562	used if available (warning, breaks stuff, best use only with your own
563	private event loop and only if you know the OS supports your types of
564	fds):
565
566	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
567
568	=item struct ev_loop *ev_loop_new (unsigned int flags)
569
570	Similar to C<ev_default_loop>, but always creates a new event loop that is
571	always distinct from the default loop.
572
573	Note that this function I<is> thread-safe, and one common way to use
574	libev with threads is indeed to create one loop per thread, and using the
575	default loop in the "main" or "initial" thread.
576
577	Example: Try to create a event loop that uses epoll and nothing else.	705	Example: Try to create a event loop that uses epoll and nothing else.
578		706
579	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	707	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
580	if (!epoller)	708	if (!epoller)
581	fatal ("no epoll found here, maybe it hides under your chair");	709	fatal ("no epoll found here, maybe it hides under your chair");
582		710
		711	Example: Use whatever libev has to offer, but make sure that kqueue is
		712	used if available.
		713
		714	struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
		715
		716	Example: Similarly, on linux, you mgiht want to take advantage of the
		717	linux aio backend if possible, but fall back to something else if that
		718	isn't available.
		719
		720	struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_LINUXAIO);
		721
583	=item ev_default_destroy ()	722	=item ev_loop_destroy (loop)
584		723
585	Destroys the default loop (frees all memory and kernel state etc.). None	724	Destroys an event loop object (frees all memory and kernel state
586	of the active event watchers will be stopped in the normal sense, so	725	etc.). None of the active event watchers will be stopped in the normal
587	e.g. C<ev_is_active> might still return true. It is your responsibility to	726	sense, so e.g. C<ev_is_active> might still return true. It is your
588	either stop all watchers cleanly yourself I<before> calling this function,	727	responsibility to either stop all watchers cleanly yourself I<before>
589	or cope with the fact afterwards (which is usually the easiest thing, you	728	calling this function, or cope with the fact afterwards (which is usually
590	can just ignore the watchers and/or C<free ()> them for example).	729	the easiest thing, you can just ignore the watchers and/or C<free ()> them
		730	for example).
591		731
592	Note that certain global state, such as signal state (and installed signal	732	Note that certain global state, such as signal state (and installed signal
593	handlers), will not be freed by this function, and related watchers (such	733	handlers), will not be freed by this function, and related watchers (such
594	as signal and child watchers) would need to be stopped manually.	734	as signal and child watchers) would need to be stopped manually.
595		735
596	In general it is not advisable to call this function except in the	736	This function is normally used on loop objects allocated by
597	rare occasion where you really need to free e.g. the signal handling	737	C<ev_loop_new>, but it can also be used on the default loop returned by
		738	C<ev_default_loop>, in which case it is not thread-safe.
		739
		740	Note that it is not advisable to call this function on the default loop
		741	except in the rare occasion where you really need to free its resources.
598	pipe fds. If you need dynamically allocated loops it is better to use	742	If you need dynamically allocated loops it is better to use C<ev_loop_new>
599	C<ev_loop_new> and C<ev_loop_destroy>.	743	and C<ev_loop_destroy>.
600		744
601	=item ev_loop_destroy (loop)	745	=item ev_loop_fork (loop)
602		746
603	Like C<ev_default_destroy>, but destroys an event loop created by an
604	earlier call to C<ev_loop_new>.
605
606	=item ev_default_fork ()
607
608	This function sets a flag that causes subsequent C<ev_loop> iterations	747	This function sets a flag that causes subsequent C<ev_run> iterations
609	to reinitialise the kernel state for backends that have one. Despite the	748	to reinitialise the kernel state for backends that have one. Despite
610	name, you can call it anytime, but it makes most sense after forking, in	749	the name, you can call it anytime you are allowed to start or stop
611	the child process (or both child and parent, but that again makes little	750	watchers (except inside an C<ev_prepare> callback), but it makes most
612	sense). You I<must> call it in the child before using any of the libev	751	sense after forking, in the child process. You I<must> call it (or use
613	functions, and it will only take effect at the next C<ev_loop> iteration.	752	C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
614		753
		754	In addition, if you want to reuse a loop (via this function or
		755	C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
		756
615	Again, you I<have> to call it on I<any> loop that you want to re-use after	757	Again, you I<have> to call it on I<any> loop that you want to re-use after
616	a fork, I<even if you do not plan to use the loop in the parent>. This is	758	a fork, I<even if you do not plan to use the loop in the parent>. This is
617	because some kernel interfaces *cough* I<kqueue> *cough* do funny things	759	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
618	during fork.	760	during fork.
619		761
620	On the other hand, you only need to call this function in the child	762	On the other hand, you only need to call this function in the child
621	process if and only if you want to use the event loop in the child. If you	763	process if and only if you want to use the event loop in the child. If
622	just fork+exec or create a new loop in the child, you don't have to call	764	you just fork+exec or create a new loop in the child, you don't have to
623	it at all.	765	call it at all (in fact, C<epoll> is so badly broken that it makes a
		766	difference, but libev will usually detect this case on its own and do a
		767	costly reset of the backend).
624		768
625	The function itself is quite fast and it's usually not a problem to call	769	The function itself is quite fast and it's usually not a problem to call
626	it just in case after a fork. To make this easy, the function will fit in	770	it just in case after a fork.
627	quite nicely into a call to C<pthread_atfork>:
628		771
		772	Example: Automate calling C<ev_loop_fork> on the default loop when
		773	using pthreads.
		774
		775	static void
		776	post_fork_child (void)
		777	{
		778	ev_loop_fork (EV_DEFAULT);
		779	}
		780
		781	...
629	pthread_atfork (0, 0, ev_default_fork);	782	pthread_atfork (0, 0, post_fork_child);
630
631	=item ev_loop_fork (loop)
632
633	Like C<ev_default_fork>, but acts on an event loop created by
634	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
635	after fork that you want to re-use in the child, and how you keep track of
636	them is entirely your own problem.
637		783
638	=item int ev_is_default_loop (loop)	784	=item int ev_is_default_loop (loop)
639		785
640	Returns true when the given loop is, in fact, the default loop, and false	786	Returns true when the given loop is, in fact, the default loop, and false
641	otherwise.	787	otherwise.
642		788
643	=item unsigned int ev_iteration (loop)	789	=item unsigned int ev_iteration (loop)
644		790
645	Returns the current iteration count for the loop, which is identical to	791	Returns the current iteration count for the event loop, which is identical
646	the number of times libev did poll for new events. It starts at C<0> and	792	to the number of times libev did poll for new events. It starts at C<0>
647	happily wraps around with enough iterations.	793	and happily wraps around with enough iterations.
648		794
649	This value can sometimes be useful as a generation counter of sorts (it	795	This value can sometimes be useful as a generation counter of sorts (it
650	"ticks" the number of loop iterations), as it roughly corresponds with	796	"ticks" the number of loop iterations), as it roughly corresponds with
651	C<ev_prepare> and C<ev_check> calls - and is incremented between the	797	C<ev_prepare> and C<ev_check> calls - and is incremented between the
652	prepare and check phases.	798	prepare and check phases.
653		799
654	=item unsigned int ev_depth (loop)	800	=item unsigned int ev_depth (loop)
655		801
656	Returns the number of times C<ev_loop> was entered minus the number of	802	Returns the number of times C<ev_run> was entered minus the number of
657	times C<ev_loop> was exited, in other words, the recursion depth.	803	times C<ev_run> was exited normally, in other words, the recursion depth.
658		804
659	Outside C<ev_loop>, this number is zero. In a callback, this number is	805	Outside C<ev_run>, this number is zero. In a callback, this number is
660	C<1>, unless C<ev_loop> was invoked recursively (or from another thread),	806	C<1>, unless C<ev_run> was invoked recursively (or from another thread),
661	in which case it is higher.	807	in which case it is higher.
662		808
663	Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread	809	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
664	etc.), doesn't count as "exit" - consider this as a hint to avoid such	810	throwing an exception etc.), doesn't count as "exit" - consider this
665	ungentleman behaviour unless it's really convenient.	811	as a hint to avoid such ungentleman-like behaviour unless it's really
		812	convenient, in which case it is fully supported.
666		813
667	=item unsigned int ev_backend (loop)	814	=item unsigned int ev_backend (loop)
668		815
669	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	816	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
670	use.	817	use.
…		…
679		826
680	=item ev_now_update (loop)	827	=item ev_now_update (loop)
681		828
682	Establishes the current time by querying the kernel, updating the time	829	Establishes the current time by querying the kernel, updating the time
683	returned by C<ev_now ()> in the progress. This is a costly operation and	830	returned by C<ev_now ()> in the progress. This is a costly operation and
684	is usually done automatically within C<ev_loop ()>.	831	is usually done automatically within C<ev_run ()>.
685		832
686	This function is rarely useful, but when some event callback runs for a	833	This function is rarely useful, but when some event callback runs for a
687	very long time without entering the event loop, updating libev's idea of	834	very long time without entering the event loop, updating libev's idea of
688	the current time is a good idea.	835	the current time is a good idea.
689		836
690	See also L<The special problem of time updates> in the C<ev_timer> section.	837	See also L</The special problem of time updates> in the C<ev_timer> section.
691		838
692	=item ev_suspend (loop)	839	=item ev_suspend (loop)
693		840
694	=item ev_resume (loop)	841	=item ev_resume (loop)
695		842
696	These two functions suspend and resume a loop, for use when the loop is	843	These two functions suspend and resume an event loop, for use when the
697	not used for a while and timeouts should not be processed.	844	loop is not used for a while and timeouts should not be processed.
698		845
699	A typical use case would be an interactive program such as a game: When	846	A typical use case would be an interactive program such as a game: When
700	the user presses C<^Z> to suspend the game and resumes it an hour later it	847	the user presses C<^Z> to suspend the game and resumes it an hour later it
701	would be best to handle timeouts as if no time had actually passed while	848	would be best to handle timeouts as if no time had actually passed while
702	the program was suspended. This can be achieved by calling C<ev_suspend>	849	the program was suspended. This can be achieved by calling C<ev_suspend>
…		…
704	C<ev_resume> directly afterwards to resume timer processing.	851	C<ev_resume> directly afterwards to resume timer processing.
705		852
706	Effectively, all C<ev_timer> watchers will be delayed by the time spend	853	Effectively, all C<ev_timer> watchers will be delayed by the time spend
707	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers	854	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
708	will be rescheduled (that is, they will lose any events that would have	855	will be rescheduled (that is, they will lose any events that would have
709	occured while suspended).	856	occurred while suspended).
710		857
711	After calling C<ev_suspend> you B<must not> call I<any> function on the	858	After calling C<ev_suspend> you B<must not> call I<any> function on the
712	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>	859	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
713	without a previous call to C<ev_suspend>.	860	without a previous call to C<ev_suspend>.
714		861
715	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	862	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
716	event loop time (see C<ev_now_update>).	863	event loop time (see C<ev_now_update>).
717		864
718	=item ev_loop (loop, int flags)	865	=item bool ev_run (loop, int flags)
719		866
720	Finally, this is it, the event handler. This function usually is called	867	Finally, this is it, the event handler. This function usually is called
721	after you have initialised all your watchers and you want to start	868	after you have initialised all your watchers and you want to start
722	handling events.	869	handling events. It will ask the operating system for any new events, call
		870	the watcher callbacks, and then repeat the whole process indefinitely: This
		871	is why event loops are called I<loops>.
723		872
724	If the flags argument is specified as C<0>, it will not return until	873	If the flags argument is specified as C<0>, it will keep handling events
725	either no event watchers are active anymore or C<ev_unloop> was called.	874	until either no event watchers are active anymore or C<ev_break> was
		875	called.
726		876
		877	The return value is false if there are no more active watchers (which
		878	usually means "all jobs done" or "deadlock"), and true in all other cases
		879	(which usually means " you should call C<ev_run> again").
		880
727	Please note that an explicit C<ev_unloop> is usually better than	881	Please note that an explicit C<ev_break> is usually better than
728	relying on all watchers to be stopped when deciding when a program has	882	relying on all watchers to be stopped when deciding when a program has
729	finished (especially in interactive programs), but having a program	883	finished (especially in interactive programs), but having a program
730	that automatically loops as long as it has to and no longer by virtue	884	that automatically loops as long as it has to and no longer by virtue
731	of relying on its watchers stopping correctly, that is truly a thing of	885	of relying on its watchers stopping correctly, that is truly a thing of
732	beauty.	886	beauty.
733		887
		888	This function is I<mostly> exception-safe - you can break out of a
		889	C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
		890	exception and so on. This does not decrement the C<ev_depth> value, nor
		891	will it clear any outstanding C<EVBREAK_ONE> breaks.
		892
734	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	893	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
735	those events and any already outstanding ones, but will not block your	894	those events and any already outstanding ones, but will not wait and
736	process in case there are no events and will return after one iteration of	895	block your process in case there are no events and will return after one
737	the loop.	896	iteration of the loop. This is sometimes useful to poll and handle new
		897	events while doing lengthy calculations, to keep the program responsive.
738		898
739	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	899	A flags value of C<EVRUN_ONCE> will look for new events (waiting if
740	necessary) and will handle those and any already outstanding ones. It	900	necessary) and will handle those and any already outstanding ones. It
741	will block your process until at least one new event arrives (which could	901	will block your process until at least one new event arrives (which could
742	be an event internal to libev itself, so there is no guarantee that a	902	be an event internal to libev itself, so there is no guarantee that a
743	user-registered callback will be called), and will return after one	903	user-registered callback will be called), and will return after one
744	iteration of the loop.	904	iteration of the loop.
745		905
746	This is useful if you are waiting for some external event in conjunction	906	This is useful if you are waiting for some external event in conjunction
747	with something not expressible using other libev watchers (i.e. "roll your	907	with something not expressible using other libev watchers (i.e. "roll your
748	own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	908	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
749	usually a better approach for this kind of thing.	909	usually a better approach for this kind of thing.
750		910
751	Here are the gory details of what C<ev_loop> does:	911	Here are the gory details of what C<ev_run> does (this is for your
		912	understanding, not a guarantee that things will work exactly like this in
		913	future versions):
752		914
		915	- Increment loop depth.
		916	- Reset the ev_break status.
753	- Before the first iteration, call any pending watchers.	917	- Before the first iteration, call any pending watchers.
		918	LOOP:
754	* If EVFLAG_FORKCHECK was used, check for a fork.	919	- If EVFLAG_FORKCHECK was used, check for a fork.
755	- If a fork was detected (by any means), queue and call all fork watchers.	920	- If a fork was detected (by any means), queue and call all fork watchers.
756	- Queue and call all prepare watchers.	921	- Queue and call all prepare watchers.
		922	- If ev_break was called, goto FINISH.
757	- If we have been forked, detach and recreate the kernel state	923	- If we have been forked, detach and recreate the kernel state
758	as to not disturb the other process.	924	as to not disturb the other process.
759	- Update the kernel state with all outstanding changes.	925	- Update the kernel state with all outstanding changes.
760	- Update the "event loop time" (ev_now ()).	926	- Update the "event loop time" (ev_now ()).
761	- Calculate for how long to sleep or block, if at all	927	- Calculate for how long to sleep or block, if at all
762	(active idle watchers, EVLOOP_NONBLOCK or not having	928	(active idle watchers, EVRUN_NOWAIT or not having
763	any active watchers at all will result in not sleeping).	929	any active watchers at all will result in not sleeping).
764	- Sleep if the I/O and timer collect interval say so.	930	- Sleep if the I/O and timer collect interval say so.
		931	- Increment loop iteration counter.
765	- Block the process, waiting for any events.	932	- Block the process, waiting for any events.
766	- Queue all outstanding I/O (fd) events.	933	- Queue all outstanding I/O (fd) events.
767	- Update the "event loop time" (ev_now ()), and do time jump adjustments.	934	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
768	- Queue all expired timers.	935	- Queue all expired timers.
769	- Queue all expired periodics.	936	- Queue all expired periodics.
770	- Unless any events are pending now, queue all idle watchers.	937	- Queue all idle watchers with priority higher than that of pending events.
771	- Queue all check watchers.	938	- Queue all check watchers.
772	- Call all queued watchers in reverse order (i.e. check watchers first).	939	- Call all queued watchers in reverse order (i.e. check watchers first).
773	Signals and child watchers are implemented as I/O watchers, and will	940	Signals and child watchers are implemented as I/O watchers, and will
774	be handled here by queueing them when their watcher gets executed.	941	be handled here by queueing them when their watcher gets executed.
775	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	942	- If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
776	were used, or there are no active watchers, return, otherwise	943	were used, or there are no active watchers, goto FINISH, otherwise
777	continue with step *.	944	continue with step LOOP.
		945	FINISH:
		946	- Reset the ev_break status iff it was EVBREAK_ONE.
		947	- Decrement the loop depth.
		948	- Return.
778		949
779	Example: Queue some jobs and then loop until no events are outstanding	950	Example: Queue some jobs and then loop until no events are outstanding
780	anymore.	951	anymore.
781		952
782	... queue jobs here, make sure they register event watchers as long	953	... queue jobs here, make sure they register event watchers as long
783	... as they still have work to do (even an idle watcher will do..)	954	... as they still have work to do (even an idle watcher will do..)
784	ev_loop (my_loop, 0);	955	ev_run (my_loop, 0);
785	... jobs done or somebody called unloop. yeah!	956	... jobs done or somebody called break. yeah!
786		957
787	=item ev_unloop (loop, how)	958	=item ev_break (loop, how)
788		959
789	Can be used to make a call to C<ev_loop> return early (but only after it	960	Can be used to make a call to C<ev_run> return early (but only after it
790	has processed all outstanding events). The C<how> argument must be either	961	has processed all outstanding events). The C<how> argument must be either
791	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	962	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
792	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	963	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
793		964
794	This "unloop state" will be cleared when entering C<ev_loop> again.	965	This "break state" will be cleared on the next call to C<ev_run>.
795		966
796	It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls.	967	It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
		968	which case it will have no effect.
797		969
798	=item ev_ref (loop)	970	=item ev_ref (loop)
799		971
800	=item ev_unref (loop)	972	=item ev_unref (loop)
801		973
802	Ref/unref can be used to add or remove a reference count on the event	974	Ref/unref can be used to add or remove a reference count on the event
803	loop: Every watcher keeps one reference, and as long as the reference	975	loop: Every watcher keeps one reference, and as long as the reference
804	count is nonzero, C<ev_loop> will not return on its own.	976	count is nonzero, C<ev_run> will not return on its own.
805		977
806	This is useful when you have a watcher that you never intend to	978	This is useful when you have a watcher that you never intend to
807	unregister, but that nevertheless should not keep C<ev_loop> from	979	unregister, but that nevertheless should not keep C<ev_run> from
808	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>	980	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
809	before stopping it.	981	before stopping it.
810		982
811	As an example, libev itself uses this for its internal signal pipe: It	983	As an example, libev itself uses this for its internal signal pipe: It
812	is not visible to the libev user and should not keep C<ev_loop> from	984	is not visible to the libev user and should not keep C<ev_run> from
813	exiting if no event watchers registered by it are active. It is also an	985	exiting if no event watchers registered by it are active. It is also an
814	excellent way to do this for generic recurring timers or from within	986	excellent way to do this for generic recurring timers or from within
815	third-party libraries. Just remember to I<unref after start> and I<ref	987	third-party libraries. Just remember to I<unref after start> and I<ref
816	before stop> (but only if the watcher wasn't active before, or was active	988	before stop> (but only if the watcher wasn't active before, or was active
817	before, respectively. Note also that libev might stop watchers itself	989	before, respectively. Note also that libev might stop watchers itself
818	(e.g. non-repeating timers) in which case you have to C<ev_ref>	990	(e.g. non-repeating timers) in which case you have to C<ev_ref>
819	in the callback).	991	in the callback).
820		992
821	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	993	Example: Create a signal watcher, but keep it from keeping C<ev_run>
822	running when nothing else is active.	994	running when nothing else is active.
823		995
824	ev_signal exitsig;	996	ev_signal exitsig;
825	ev_signal_init (&exitsig, sig_cb, SIGINT);	997	ev_signal_init (&exitsig, sig_cb, SIGINT);
826	ev_signal_start (loop, &exitsig);	998	ev_signal_start (loop, &exitsig);
827	evf_unref (loop);	999	ev_unref (loop);
828		1000
829	Example: For some weird reason, unregister the above signal handler again.	1001	Example: For some weird reason, unregister the above signal handler again.
830		1002
831	ev_ref (loop);	1003	ev_ref (loop);
832	ev_signal_stop (loop, &exitsig);	1004	ev_signal_stop (loop, &exitsig);
…		…
852	overhead for the actual polling but can deliver many events at once.	1024	overhead for the actual polling but can deliver many events at once.
853		1025
854	By setting a higher I<io collect interval> you allow libev to spend more	1026	By setting a higher I<io collect interval> you allow libev to spend more
855	time collecting I/O events, so you can handle more events per iteration,	1027	time collecting I/O events, so you can handle more events per iteration,
856	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	1028	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
857	C<ev_timer>) will be not affected. Setting this to a non-null value will	1029	C<ev_timer>) will not be affected. Setting this to a non-null value will
858	introduce an additional C<ev_sleep ()> call into most loop iterations. The	1030	introduce an additional C<ev_sleep ()> call into most loop iterations. The
859	sleep time ensures that libev will not poll for I/O events more often then	1031	sleep time ensures that libev will not poll for I/O events more often then
860	once per this interval, on average.	1032	once per this interval, on average (as long as the host time resolution is
		1033	good enough).
861		1034
862	Likewise, by setting a higher I<timeout collect interval> you allow libev	1035	Likewise, by setting a higher I<timeout collect interval> you allow libev
863	to spend more time collecting timeouts, at the expense of increased	1036	to spend more time collecting timeouts, at the expense of increased
864	latency/jitter/inexactness (the watcher callback will be called	1037	latency/jitter/inexactness (the watcher callback will be called
865	later). C<ev_io> watchers will not be affected. Setting this to a non-null	1038	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
871	usually doesn't make much sense to set it to a lower value than C<0.01>,	1044	usually doesn't make much sense to set it to a lower value than C<0.01>,
872	as this approaches the timing granularity of most systems. Note that if	1045	as this approaches the timing granularity of most systems. Note that if
873	you do transactions with the outside world and you can't increase the	1046	you do transactions with the outside world and you can't increase the
874	parallelity, then this setting will limit your transaction rate (if you	1047	parallelity, then this setting will limit your transaction rate (if you
875	need to poll once per transaction and the I/O collect interval is 0.01,	1048	need to poll once per transaction and the I/O collect interval is 0.01,
876	then you can't do more than 100 transations per second).	1049	then you can't do more than 100 transactions per second).
877		1050
878	Setting the I<timeout collect interval> can improve the opportunity for	1051	Setting the I<timeout collect interval> can improve the opportunity for
879	saving power, as the program will "bundle" timer callback invocations that	1052	saving power, as the program will "bundle" timer callback invocations that
880	are "near" in time together, by delaying some, thus reducing the number of	1053	are "near" in time together, by delaying some, thus reducing the number of
881	times the process sleeps and wakes up again. Another useful technique to	1054	times the process sleeps and wakes up again. Another useful technique to
…		…
889	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);	1062	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
890		1063
891	=item ev_invoke_pending (loop)	1064	=item ev_invoke_pending (loop)
892		1065
893	This call will simply invoke all pending watchers while resetting their	1066	This call will simply invoke all pending watchers while resetting their
894	pending state. Normally, C<ev_loop> does this automatically when required,	1067	pending state. Normally, C<ev_run> does this automatically when required,
895	but when overriding the invoke callback this call comes handy.	1068	but when overriding the invoke callback this call comes handy. This
		1069	function can be invoked from a watcher - this can be useful for example
		1070	when you want to do some lengthy calculation and want to pass further
		1071	event handling to another thread (you still have to make sure only one
		1072	thread executes within C<ev_invoke_pending> or C<ev_run> of course).
896		1073
897	=item int ev_pending_count (loop)	1074	=item int ev_pending_count (loop)
898		1075
899	Returns the number of pending watchers - zero indicates that no watchers	1076	Returns the number of pending watchers - zero indicates that no watchers
900	are pending.	1077	are pending.
901		1078
902	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))	1079	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
903		1080
904	This overrides the invoke pending functionality of the loop: Instead of	1081	This overrides the invoke pending functionality of the loop: Instead of
905	invoking all pending watchers when there are any, C<ev_loop> will call	1082	invoking all pending watchers when there are any, C<ev_run> will call
906	this callback instead. This is useful, for example, when you want to	1083	this callback instead. This is useful, for example, when you want to
907	invoke the actual watchers inside another context (another thread etc.).	1084	invoke the actual watchers inside another context (another thread etc.).
908		1085
909	If you want to reset the callback, use C<ev_invoke_pending> as new	1086	If you want to reset the callback, use C<ev_invoke_pending> as new
910	callback.	1087	callback.
911		1088
912	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))	1089	=item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ())
913		1090
914	Sometimes you want to share the same loop between multiple threads. This	1091	Sometimes you want to share the same loop between multiple threads. This
915	can be done relatively simply by putting mutex_lock/unlock calls around	1092	can be done relatively simply by putting mutex_lock/unlock calls around
916	each call to a libev function.	1093	each call to a libev function.
917		1094
918	However, C<ev_loop> can run an indefinite time, so it is not feasible to	1095	However, C<ev_run> can run an indefinite time, so it is not feasible
919	wait for it to return. One way around this is to wake up the loop via	1096	to wait for it to return. One way around this is to wake up the event
920	C<ev_unloop> and C<av_async_send>, another way is to set these I<release>	1097	loop via C<ev_break> and C<ev_async_send>, another way is to set these
921	and I<acquire> callbacks on the loop.	1098	I<release> and I<acquire> callbacks on the loop.
922		1099
923	When set, then C<release> will be called just before the thread is	1100	When set, then C<release> will be called just before the thread is
924	suspended waiting for new events, and C<acquire> is called just	1101	suspended waiting for new events, and C<acquire> is called just
925	afterwards.	1102	afterwards.
926		1103
…		…
929		1106
930	While event loop modifications are allowed between invocations of	1107	While event loop modifications are allowed between invocations of
931	C<release> and C<acquire> (that's their only purpose after all), no	1108	C<release> and C<acquire> (that's their only purpose after all), no
932	modifications done will affect the event loop, i.e. adding watchers will	1109	modifications done will affect the event loop, i.e. adding watchers will
933	have no effect on the set of file descriptors being watched, or the time	1110	have no effect on the set of file descriptors being watched, or the time
934	waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it	1111	waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
935	to take note of any changes you made.	1112	to take note of any changes you made.
936		1113
937	In theory, threads executing C<ev_loop> will be async-cancel safe between	1114	In theory, threads executing C<ev_run> will be async-cancel safe between
938	invocations of C<release> and C<acquire>.	1115	invocations of C<release> and C<acquire>.
939		1116
940	See also the locking example in the C<THREADS> section later in this	1117	See also the locking example in the C<THREADS> section later in this
941	document.	1118	document.
942		1119
943	=item ev_set_userdata (loop, void *data)	1120	=item ev_set_userdata (loop, void *data)
944		1121
945	=item ev_userdata (loop)	1122	=item void *ev_userdata (loop)
946		1123
947	Set and retrieve a single C<void *> associated with a loop. When	1124	Set and retrieve a single C<void *> associated with a loop. When
948	C<ev_set_userdata> has never been called, then C<ev_userdata> returns	1125	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
949	C<0.>	1126	C<0>.
950		1127
951	These two functions can be used to associate arbitrary data with a loop,	1128	These two functions can be used to associate arbitrary data with a loop,
952	and are intended solely for the C<invoke_pending_cb>, C<release> and	1129	and are intended solely for the C<invoke_pending_cb>, C<release> and
953	C<acquire> callbacks described above, but of course can be (ab-)used for	1130	C<acquire> callbacks described above, but of course can be (ab-)used for
954	any other purpose as well.	1131	any other purpose as well.
955		1132
956	=item ev_loop_verify (loop)	1133	=item ev_verify (loop)
957		1134
958	This function only does something when C<EV_VERIFY> support has been	1135	This function only does something when C<EV_VERIFY> support has been
959	compiled in, which is the default for non-minimal builds. It tries to go	1136	compiled in, which is the default for non-minimal builds. It tries to go
960	through all internal structures and checks them for validity. If anything	1137	through all internal structures and checks them for validity. If anything
961	is found to be inconsistent, it will print an error message to standard	1138	is found to be inconsistent, it will print an error message to standard
…		…
972		1149
973	In the following description, uppercase C<TYPE> in names stands for the	1150	In the following description, uppercase C<TYPE> in names stands for the
974	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer	1151	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
975	watchers and C<ev_io_start> for I/O watchers.	1152	watchers and C<ev_io_start> for I/O watchers.
976		1153
977	A watcher is a structure that you create and register to record your	1154	A watcher is an opaque structure that you allocate and register to record
978	interest in some event. For instance, if you want to wait for STDIN to	1155	your interest in some event. To make a concrete example, imagine you want
979	become readable, you would create an C<ev_io> watcher for that:	1156	to wait for STDIN to become readable, you would create an C<ev_io> watcher
		1157	for that:
980		1158
981	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)	1159	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
982	{	1160	{
983	ev_io_stop (w);	1161	ev_io_stop (w);
984	ev_unloop (loop, EVUNLOOP_ALL);	1162	ev_break (loop, EVBREAK_ALL);
985	}	1163	}
986		1164
987	struct ev_loop *loop = ev_default_loop (0);	1165	struct ev_loop *loop = ev_default_loop (0);
988		1166
989	ev_io stdin_watcher;	1167	ev_io stdin_watcher;
990		1168
991	ev_init (&stdin_watcher, my_cb);	1169	ev_init (&stdin_watcher, my_cb);
992	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	1170	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
993	ev_io_start (loop, &stdin_watcher);	1171	ev_io_start (loop, &stdin_watcher);
994		1172
995	ev_loop (loop, 0);	1173	ev_run (loop, 0);
996		1174
997	As you can see, you are responsible for allocating the memory for your	1175	As you can see, you are responsible for allocating the memory for your
998	watcher structures (and it is I<usually> a bad idea to do this on the	1176	watcher structures (and it is I<usually> a bad idea to do this on the
999	stack).	1177	stack).
1000		1178
1001	Each watcher has an associated watcher structure (called C<struct ev_TYPE>	1179	Each watcher has an associated watcher structure (called C<struct ev_TYPE>
1002	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).	1180	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
1003		1181
1004	Each watcher structure must be initialised by a call to C<ev_init	1182	Each watcher structure must be initialised by a call to C<ev_init (watcher
1005	(watcher *, callback)>, which expects a callback to be provided. This	1183	*, callback)>, which expects a callback to be provided. This callback is
1006	callback gets invoked each time the event occurs (or, in the case of I/O	1184	invoked each time the event occurs (or, in the case of I/O watchers, each
1007	watchers, each time the event loop detects that the file descriptor given	1185	time the event loop detects that the file descriptor given is readable
1008	is readable and/or writable).	1186	and/or writable).
1009		1187
1010	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>	1188	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
1011	macro to configure it, with arguments specific to the watcher type. There	1189	macro to configure it, with arguments specific to the watcher type. There
1012	is also a macro to combine initialisation and setting in one call: C<<	1190	is also a macro to combine initialisation and setting in one call: C<<
1013	ev_TYPE_init (watcher *, callback, ...) >>.	1191	ev_TYPE_init (watcher *, callback, ...) >>.
…		…
1064		1242
1065	=item C<EV_PREPARE>	1243	=item C<EV_PREPARE>
1066		1244
1067	=item C<EV_CHECK>	1245	=item C<EV_CHECK>
1068		1246
1069	All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts	1247	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to
1070	to gather new events, and all C<ev_check> watchers are invoked just after	1248	gather new events, and all C<ev_check> watchers are queued (not invoked)
1071	C<ev_loop> has gathered them, but before it invokes any callbacks for any	1249	just after C<ev_run> has gathered them, but before it queues any callbacks
		1250	for any received events. That means C<ev_prepare> watchers are the last
		1251	watchers invoked before the event loop sleeps or polls for new events, and
		1252	C<ev_check> watchers will be invoked before any other watchers of the same
		1253	or lower priority within an event loop iteration.
		1254
1072	received events. Callbacks of both watcher types can start and stop as	1255	Callbacks of both watcher types can start and stop as many watchers as
1073	many watchers as they want, and all of them will be taken into account	1256	they want, and all of them will be taken into account (for example, a
1074	(for example, a C<ev_prepare> watcher might start an idle watcher to keep	1257	C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1075	C<ev_loop> from blocking).	1258	blocking).
1076		1259
1077	=item C<EV_EMBED>	1260	=item C<EV_EMBED>
1078		1261
1079	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1262	The embedded event loop specified in the C<ev_embed> watcher needs attention.
1080		1263
1081	=item C<EV_FORK>	1264	=item C<EV_FORK>
1082		1265
1083	The event loop has been resumed in the child process after fork (see	1266	The event loop has been resumed in the child process after fork (see
1084	C<ev_fork>).	1267	C<ev_fork>).
		1268
		1269	=item C<EV_CLEANUP>
		1270
		1271	The event loop is about to be destroyed (see C<ev_cleanup>).
1085		1272
1086	=item C<EV_ASYNC>	1273	=item C<EV_ASYNC>
1087		1274
1088	The given async watcher has been asynchronously notified (see C<ev_async>).	1275	The given async watcher has been asynchronously notified (see C<ev_async>).
1089		1276
…		…
1199		1386
1200	=item callback ev_cb (ev_TYPE *watcher)	1387	=item callback ev_cb (ev_TYPE *watcher)
1201		1388
1202	Returns the callback currently set on the watcher.	1389	Returns the callback currently set on the watcher.
1203		1390
1204	=item ev_cb_set (ev_TYPE *watcher, callback)	1391	=item ev_set_cb (ev_TYPE *watcher, callback)
1205		1392
1206	Change the callback. You can change the callback at virtually any time	1393	Change the callback. You can change the callback at virtually any time
1207	(modulo threads).	1394	(modulo threads).
1208		1395
1209	=item ev_set_priority (ev_TYPE *watcher, int priority)	1396	=item ev_set_priority (ev_TYPE *watcher, int priority)
…		…
1227	or might not have been clamped to the valid range.	1414	or might not have been clamped to the valid range.
1228		1415
1229	The default priority used by watchers when no priority has been set is	1416	The default priority used by watchers when no priority has been set is
1230	always C<0>, which is supposed to not be too high and not be too low :).	1417	always C<0>, which is supposed to not be too high and not be too low :).
1231		1418
1232	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of	1419	See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1233	priorities.	1420	priorities.
1234		1421
1235	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1422	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1236		1423
1237	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1424	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
…		…
1262	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1449	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1263	functions that do not need a watcher.	1450	functions that do not need a watcher.
1264		1451
1265	=back	1452	=back
1266		1453
		1454	See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
		1455	OWN COMPOSITE WATCHERS> idioms.
1267		1456
1268	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1457	=head2 WATCHER STATES
1269		1458
1270	Each watcher has, by default, a member C<void *data> that you can change	1459	There are various watcher states mentioned throughout this manual -
1271	and read at any time: libev will completely ignore it. This can be used	1460	active, pending and so on. In this section these states and the rules to
1272	to associate arbitrary data with your watcher. If you need more data and	1461	transition between them will be described in more detail - and while these
1273	don't want to allocate memory and store a pointer to it in that data	1462	rules might look complicated, they usually do "the right thing".
1274	member, you can also "subclass" the watcher type and provide your own
1275	data:
1276		1463
1277	struct my_io	1464	=over 4
1278	{
1279	ev_io io;
1280	int otherfd;
1281	void *somedata;
1282	struct whatever *mostinteresting;
1283	};
1284		1465
1285	...	1466	=item initialised
1286	struct my_io w;
1287	ev_io_init (&w.io, my_cb, fd, EV_READ);
1288		1467
1289	And since your callback will be called with a pointer to the watcher, you	1468	Before a watcher can be registered with the event loop it has to be
1290	can cast it back to your own type:	1469	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
		1470	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1291		1471
1292	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)	1472	In this state it is simply some block of memory that is suitable for
1293	{	1473	use in an event loop. It can be moved around, freed, reused etc. at
1294	struct my_io *w = (struct my_io *)w_;	1474	will - as long as you either keep the memory contents intact, or call
1295	...	1475	C<ev_TYPE_init> again.
1296	}
1297		1476
1298	More interesting and less C-conformant ways of casting your callback type	1477	=item started/running/active
1299	instead have been omitted.
1300		1478
1301	Another common scenario is to use some data structure with multiple	1479	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1302	embedded watchers:	1480	property of the event loop, and is actively waiting for events. While in
		1481	this state it cannot be accessed (except in a few documented ways), moved,
		1482	freed or anything else - the only legal thing is to keep a pointer to it,
		1483	and call libev functions on it that are documented to work on active watchers.
1303		1484
1304	struct my_biggy	1485	=item pending
1305	{
1306	int some_data;
1307	ev_timer t1;
1308	ev_timer t2;
1309	}
1310		1486
1311	In this case getting the pointer to C<my_biggy> is a bit more	1487	If a watcher is active and libev determines that an event it is interested
1312	complicated: Either you store the address of your C<my_biggy> struct	1488	in has occurred (such as a timer expiring), it will become pending. It will
1313	in the C<data> member of the watcher (for woozies), or you need to use	1489	stay in this pending state until either it is stopped or its callback is
1314	some pointer arithmetic using C<offsetof> inside your watchers (for real	1490	about to be invoked, so it is not normally pending inside the watcher
1315	programmers):	1491	callback.
1316		1492
1317	#include <stddef.h>	1493	The watcher might or might not be active while it is pending (for example,
		1494	an expired non-repeating timer can be pending but no longer active). If it
		1495	is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
		1496	but it is still property of the event loop at this time, so cannot be
		1497	moved, freed or reused. And if it is active the rules described in the
		1498	previous item still apply.
1318		1499
1319	static void	1500	It is also possible to feed an event on a watcher that is not active (e.g.
1320	t1_cb (EV_P_ ev_timer *w, int revents)	1501	via C<ev_feed_event>), in which case it becomes pending without being
1321	{	1502	active.
1322	struct my_biggy big = (struct my_biggy *)
1323	(((char *)w) - offsetof (struct my_biggy, t1));
1324	}
1325		1503
1326	static void	1504	=item stopped
1327	t2_cb (EV_P_ ev_timer *w, int revents)	1505
1328	{	1506	A watcher can be stopped implicitly by libev (in which case it might still
1329	struct my_biggy big = (struct my_biggy *)	1507	be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1330	(((char *)w) - offsetof (struct my_biggy, t2));	1508	latter will clear any pending state the watcher might be in, regardless
1331	}	1509	of whether it was active or not, so stopping a watcher explicitly before
		1510	freeing it is often a good idea.
		1511
		1512	While stopped (and not pending) the watcher is essentially in the
		1513	initialised state, that is, it can be reused, moved, modified in any way
		1514	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1515	it again).
		1516
		1517	=back
1332		1518
1333	=head2 WATCHER PRIORITY MODELS	1519	=head2 WATCHER PRIORITY MODELS
1334		1520
1335	Many event loops support I<watcher priorities>, which are usually small	1521	Many event loops support I<watcher priorities>, which are usually small
1336	integers that influence the ordering of event callback invocation	1522	integers that influence the ordering of event callback invocation
…		…
1379		1565
1380	For example, to emulate how many other event libraries handle priorities,	1566	For example, to emulate how many other event libraries handle priorities,
1381	you can associate an C<ev_idle> watcher to each such watcher, and in	1567	you can associate an C<ev_idle> watcher to each such watcher, and in
1382	the normal watcher callback, you just start the idle watcher. The real	1568	the normal watcher callback, you just start the idle watcher. The real
1383	processing is done in the idle watcher callback. This causes libev to	1569	processing is done in the idle watcher callback. This causes libev to
1384	continously poll and process kernel event data for the watcher, but when	1570	continuously poll and process kernel event data for the watcher, but when
1385	the lock-out case is known to be rare (which in turn is rare :), this is	1571	the lock-out case is known to be rare (which in turn is rare :), this is
1386	workable.	1572	workable.
1387		1573
1388	Usually, however, the lock-out model implemented that way will perform	1574	Usually, however, the lock-out model implemented that way will perform
1389	miserably under the type of load it was designed to handle. In that case,	1575	miserably under the type of load it was designed to handle. In that case,
…		…
1403	{	1589	{
1404	// stop the I/O watcher, we received the event, but	1590	// stop the I/O watcher, we received the event, but
1405	// are not yet ready to handle it.	1591	// are not yet ready to handle it.
1406	ev_io_stop (EV_A_ w);	1592	ev_io_stop (EV_A_ w);
1407		1593
1408	// start the idle watcher to ahndle the actual event.	1594	// start the idle watcher to handle the actual event.
1409	// it will not be executed as long as other watchers	1595	// it will not be executed as long as other watchers
1410	// with the default priority are receiving events.	1596	// with the default priority are receiving events.
1411	ev_idle_start (EV_A_ &idle);	1597	ev_idle_start (EV_A_ &idle);
1412	}	1598	}
1413		1599
…		…
1463	In general you can register as many read and/or write event watchers per	1649	In general you can register as many read and/or write event watchers per
1464	fd as you want (as long as you don't confuse yourself). Setting all file	1650	fd as you want (as long as you don't confuse yourself). Setting all file
1465	descriptors to non-blocking mode is also usually a good idea (but not	1651	descriptors to non-blocking mode is also usually a good idea (but not
1466	required if you know what you are doing).	1652	required if you know what you are doing).
1467		1653
1468	If you cannot use non-blocking mode, then force the use of a
1469	known-to-be-good backend (at the time of this writing, this includes only
1470	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1471	descriptors for which non-blocking operation makes no sense (such as
1472	files) - libev doesn't guarentee any specific behaviour in that case.
1473
1474	Another thing you have to watch out for is that it is quite easy to	1654	Another thing you have to watch out for is that it is quite easy to
1475	receive "spurious" readiness notifications, that is your callback might	1655	receive "spurious" readiness notifications, that is, your callback might
1476	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1656	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1477	because there is no data. Not only are some backends known to create a	1657	because there is no data. It is very easy to get into this situation even
1478	lot of those (for example Solaris ports), it is very easy to get into	1658	with a relatively standard program structure. Thus it is best to always
1479	this situation even with a relatively standard program structure. Thus	1659	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1480	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1481	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1660	preferable to a program hanging until some data arrives.
1482		1661
1483	If you cannot run the fd in non-blocking mode (for example you should	1662	If you cannot run the fd in non-blocking mode (for example you should
1484	not play around with an Xlib connection), then you have to separately	1663	not play around with an Xlib connection), then you have to separately
1485	re-test whether a file descriptor is really ready with a known-to-be good	1664	re-test whether a file descriptor is really ready with a known-to-be good
1486	interface such as poll (fortunately in our Xlib example, Xlib already	1665	interface such as poll (fortunately in the case of Xlib, it already does
1487	does this on its own, so its quite safe to use). Some people additionally	1666	this on its own, so its quite safe to use). Some people additionally
1488	use C<SIGALRM> and an interval timer, just to be sure you won't block	1667	use C<SIGALRM> and an interval timer, just to be sure you won't block
1489	indefinitely.	1668	indefinitely.
1490		1669
1491	But really, best use non-blocking mode.	1670	But really, best use non-blocking mode.
1492		1671
1493	=head3 The special problem of disappearing file descriptors	1672	=head3 The special problem of disappearing file descriptors
1494		1673
1495	Some backends (e.g. kqueue, epoll) need to be told about closing a file	1674	Some backends (e.g. kqueue, epoll, linuxaio) need to be told about closing
1496	descriptor (either due to calling C<close> explicitly or any other means,	1675	a file descriptor (either due to calling C<close> explicitly or any other
1497	such as C<dup2>). The reason is that you register interest in some file	1676	means, such as C<dup2>). The reason is that you register interest in some
1498	descriptor, but when it goes away, the operating system will silently drop	1677	file descriptor, but when it goes away, the operating system will silently
1499	this interest. If another file descriptor with the same number then is	1678	drop this interest. If another file descriptor with the same number then
1500	registered with libev, there is no efficient way to see that this is, in	1679	is registered with libev, there is no efficient way to see that this is,
1501	fact, a different file descriptor.	1680	in fact, a different file descriptor.
1502		1681
1503	To avoid having to explicitly tell libev about such cases, libev follows	1682	To avoid having to explicitly tell libev about such cases, libev follows
1504	the following policy: Each time C<ev_io_set> is being called, libev	1683	the following policy: Each time C<ev_io_set> is being called, libev
1505	will assume that this is potentially a new file descriptor, otherwise	1684	will assume that this is potentially a new file descriptor, otherwise
1506	it is assumed that the file descriptor stays the same. That means that	1685	it is assumed that the file descriptor stays the same. That means that
…		…
1520		1699
1521	There is no workaround possible except not registering events	1700	There is no workaround possible except not registering events
1522	for potentially C<dup ()>'ed file descriptors, or to resort to	1701	for potentially C<dup ()>'ed file descriptors, or to resort to
1523	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1702	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1524		1703
		1704	=head3 The special problem of files
		1705
		1706	Many people try to use C<select> (or libev) on file descriptors
		1707	representing files, and expect it to become ready when their program
		1708	doesn't block on disk accesses (which can take a long time on their own).
		1709
		1710	However, this cannot ever work in the "expected" way - you get a readiness
		1711	notification as soon as the kernel knows whether and how much data is
		1712	there, and in the case of open files, that's always the case, so you
		1713	always get a readiness notification instantly, and your read (or possibly
		1714	write) will still block on the disk I/O.
		1715
		1716	Another way to view it is that in the case of sockets, pipes, character
		1717	devices and so on, there is another party (the sender) that delivers data
		1718	on its own, but in the case of files, there is no such thing: the disk
		1719	will not send data on its own, simply because it doesn't know what you
		1720	wish to read - you would first have to request some data.
		1721
		1722	Since files are typically not-so-well supported by advanced notification
		1723	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1724	to files, even though you should not use it. The reason for this is
		1725	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1726	usually a tty, often a pipe, but also sometimes files or special devices
		1727	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1728	F</dev/urandom>), and even though the file might better be served with
		1729	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1730	it "just works" instead of freezing.
		1731
		1732	So avoid file descriptors pointing to files when you know it (e.g. use
		1733	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1734	when you rarely read from a file instead of from a socket, and want to
		1735	reuse the same code path.
		1736
1525	=head3 The special problem of fork	1737	=head3 The special problem of fork
1526		1738
1527	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1739	Some backends (epoll, kqueue, probably linuxaio) do not support C<fork ()>
1528	useless behaviour. Libev fully supports fork, but needs to be told about	1740	at all or exhibit useless behaviour. Libev fully supports fork, but needs
1529	it in the child.	1741	to be told about it in the child if you want to continue to use it in the
		1742	child.
1530		1743
1531	To support fork in your programs, you either have to call	1744	To support fork in your child processes, you have to call C<ev_loop_fork
1532	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1745	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1533	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1746	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1534	C<EVBACKEND_POLL>.
1535		1747
1536	=head3 The special problem of SIGPIPE	1748	=head3 The special problem of SIGPIPE
1537		1749
1538	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1750	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1539	when writing to a pipe whose other end has been closed, your program gets	1751	when writing to a pipe whose other end has been closed, your program gets
…		…
1621	...	1833	...
1622	struct ev_loop *loop = ev_default_init (0);	1834	struct ev_loop *loop = ev_default_init (0);
1623	ev_io stdin_readable;	1835	ev_io stdin_readable;
1624	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1836	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1625	ev_io_start (loop, &stdin_readable);	1837	ev_io_start (loop, &stdin_readable);
1626	ev_loop (loop, 0);	1838	ev_run (loop, 0);
1627		1839
1628		1840
1629	=head2 C<ev_timer> - relative and optionally repeating timeouts	1841	=head2 C<ev_timer> - relative and optionally repeating timeouts
1630		1842
1631	Timer watchers are simple relative timers that generate an event after a	1843	Timer watchers are simple relative timers that generate an event after a
…		…
1637	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1849	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1638	monotonic clock option helps a lot here).	1850	monotonic clock option helps a lot here).
1639		1851
1640	The callback is guaranteed to be invoked only I<after> its timeout has	1852	The callback is guaranteed to be invoked only I<after> its timeout has
1641	passed (not I<at>, so on systems with very low-resolution clocks this	1853	passed (not I<at>, so on systems with very low-resolution clocks this
1642	might introduce a small delay). If multiple timers become ready during the	1854	might introduce a small delay, see "the special problem of being too
		1855	early", below). If multiple timers become ready during the same loop
1643	same loop iteration then the ones with earlier time-out values are invoked	1856	iteration then the ones with earlier time-out values are invoked before
1644	before ones of the same priority with later time-out values (but this is	1857	ones of the same priority with later time-out values (but this is no
1645	no longer true when a callback calls C<ev_loop> recursively).	1858	longer true when a callback calls C<ev_run> recursively).
1646		1859
1647	=head3 Be smart about timeouts	1860	=head3 Be smart about timeouts
1648		1861
1649	Many real-world problems involve some kind of timeout, usually for error	1862	Many real-world problems involve some kind of timeout, usually for error
1650	recovery. A typical example is an HTTP request - if the other side hangs,	1863	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1725		1938
1726	In this case, it would be more efficient to leave the C<ev_timer> alone,	1939	In this case, it would be more efficient to leave the C<ev_timer> alone,
1727	but remember the time of last activity, and check for a real timeout only	1940	but remember the time of last activity, and check for a real timeout only
1728	within the callback:	1941	within the callback:
1729		1942
		1943	ev_tstamp timeout = 60.;
1730	ev_tstamp last_activity; // time of last activity	1944	ev_tstamp last_activity; // time of last activity
		1945	ev_timer timer;
1731		1946
1732	static void	1947	static void
1733	callback (EV_P_ ev_timer *w, int revents)	1948	callback (EV_P_ ev_timer *w, int revents)
1734	{	1949	{
1735	ev_tstamp now = ev_now (EV_A);	1950	// calculate when the timeout would happen
1736	ev_tstamp timeout = last_activity + 60.;	1951	ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1737		1952
1738	// if last_activity + 60. is older than now, we did time out	1953	// if negative, it means we the timeout already occurred
1739	if (timeout < now)	1954	if (after < 0.)
1740	{	1955	{
1741	// timeout occured, take action	1956	// timeout occurred, take action
1742	}	1957	}
1743	else	1958	else
1744	{	1959	{
1745	// callback was invoked, but there was some activity, re-arm	1960	// callback was invoked, but there was some recent
1746	// the watcher to fire in last_activity + 60, which is	1961	// activity. simply restart the timer to time out
1747	// guaranteed to be in the future, so "again" is positive:	1962	// after "after" seconds, which is the earliest time
1748	w->repeat = timeout - now;	1963	// the timeout can occur.
		1964	ev_timer_set (w, after, 0.);
1749	ev_timer_again (EV_A_ w);	1965	ev_timer_start (EV_A_ w);
1750	}	1966	}
1751	}	1967	}
1752		1968
1753	To summarise the callback: first calculate the real timeout (defined	1969	To summarise the callback: first calculate in how many seconds the
1754	as "60 seconds after the last activity"), then check if that time has	1970	timeout will occur (by calculating the absolute time when it would occur,
1755	been reached, which means something I<did>, in fact, time out. Otherwise	1971	C<last_activity + timeout>, and subtracting the current time, C<ev_now
1756	the callback was invoked too early (C<timeout> is in the future), so	1972	(EV_A)> from that).
1757	re-schedule the timer to fire at that future time, to see if maybe we have
1758	a timeout then.
1759		1973
1760	Note how C<ev_timer_again> is used, taking advantage of the	1974	If this value is negative, then we are already past the timeout, i.e. we
1761	C<ev_timer_again> optimisation when the timer is already running.	1975	timed out, and need to do whatever is needed in this case.
		1976
		1977	Otherwise, we now the earliest time at which the timeout would trigger,
		1978	and simply start the timer with this timeout value.
		1979
		1980	In other words, each time the callback is invoked it will check whether
		1981	the timeout occurred. If not, it will simply reschedule itself to check
		1982	again at the earliest time it could time out. Rinse. Repeat.
1762		1983
1763	This scheme causes more callback invocations (about one every 60 seconds	1984	This scheme causes more callback invocations (about one every 60 seconds
1764	minus half the average time between activity), but virtually no calls to	1985	minus half the average time between activity), but virtually no calls to
1765	libev to change the timeout.	1986	libev to change the timeout.
1766		1987
1767	To start the timer, simply initialise the watcher and set C<last_activity>	1988	To start the machinery, simply initialise the watcher and set
1768	to the current time (meaning we just have some activity :), then call the	1989	C<last_activity> to the current time (meaning there was some activity just
1769	callback, which will "do the right thing" and start the timer:	1990	now), then call the callback, which will "do the right thing" and start
		1991	the timer:
1770		1992
		1993	last_activity = ev_now (EV_A);
1771	ev_init (timer, callback);	1994	ev_init (&timer, callback);
1772	last_activity = ev_now (loop);	1995	callback (EV_A_ &timer, 0);
1773	callback (loop, timer, EV_TIMER);
1774		1996
1775	And when there is some activity, simply store the current time in	1997	When there is some activity, simply store the current time in
1776	C<last_activity>, no libev calls at all:	1998	C<last_activity>, no libev calls at all:
1777		1999
		2000	if (activity detected)
1778	last_actiivty = ev_now (loop);	2001	last_activity = ev_now (EV_A);
		2002
		2003	When your timeout value changes, then the timeout can be changed by simply
		2004	providing a new value, stopping the timer and calling the callback, which
		2005	will again do the right thing (for example, time out immediately :).
		2006
		2007	timeout = new_value;
		2008	ev_timer_stop (EV_A_ &timer);
		2009	callback (EV_A_ &timer, 0);
1779		2010
1780	This technique is slightly more complex, but in most cases where the	2011	This technique is slightly more complex, but in most cases where the
1781	time-out is unlikely to be triggered, much more efficient.	2012	time-out is unlikely to be triggered, much more efficient.
1782
1783	Changing the timeout is trivial as well (if it isn't hard-coded in the
1784	callback :) - just change the timeout and invoke the callback, which will
1785	fix things for you.
1786		2013
1787	=item 4. Wee, just use a double-linked list for your timeouts.	2014	=item 4. Wee, just use a double-linked list for your timeouts.
1788		2015
1789	If there is not one request, but many thousands (millions...), all	2016	If there is not one request, but many thousands (millions...), all
1790	employing some kind of timeout with the same timeout value, then one can	2017	employing some kind of timeout with the same timeout value, then one can
…		…
1817	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is	2044	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
1818	rather complicated, but extremely efficient, something that really pays	2045	rather complicated, but extremely efficient, something that really pays
1819	off after the first million or so of active timers, i.e. it's usually	2046	off after the first million or so of active timers, i.e. it's usually
1820	overkill :)	2047	overkill :)
1821		2048
		2049	=head3 The special problem of being too early
		2050
		2051	If you ask a timer to call your callback after three seconds, then
		2052	you expect it to be invoked after three seconds - but of course, this
		2053	cannot be guaranteed to infinite precision. Less obviously, it cannot be
		2054	guaranteed to any precision by libev - imagine somebody suspending the
		2055	process with a STOP signal for a few hours for example.
		2056
		2057	So, libev tries to invoke your callback as soon as possible I<after> the
		2058	delay has occurred, but cannot guarantee this.
		2059
		2060	A less obvious failure mode is calling your callback too early: many event
		2061	loops compare timestamps with a "elapsed delay >= requested delay", but
		2062	this can cause your callback to be invoked much earlier than you would
		2063	expect.
		2064
		2065	To see why, imagine a system with a clock that only offers full second
		2066	resolution (think windows if you can't come up with a broken enough OS
		2067	yourself). If you schedule a one-second timer at the time 500.9, then the
		2068	event loop will schedule your timeout to elapse at a system time of 500
		2069	(500.9 truncated to the resolution) + 1, or 501.
		2070
		2071	If an event library looks at the timeout 0.1s later, it will see "501 >=
		2072	501" and invoke the callback 0.1s after it was started, even though a
		2073	one-second delay was requested - this is being "too early", despite best
		2074	intentions.
		2075
		2076	This is the reason why libev will never invoke the callback if the elapsed
		2077	delay equals the requested delay, but only when the elapsed delay is
		2078	larger than the requested delay. In the example above, libev would only invoke
		2079	the callback at system time 502, or 1.1s after the timer was started.
		2080
		2081	So, while libev cannot guarantee that your callback will be invoked
		2082	exactly when requested, it I<can> and I<does> guarantee that the requested
		2083	delay has actually elapsed, or in other words, it always errs on the "too
		2084	late" side of things.
		2085
1822	=head3 The special problem of time updates	2086	=head3 The special problem of time updates
1823		2087
1824	Establishing the current time is a costly operation (it usually takes at	2088	Establishing the current time is a costly operation (it usually takes
1825	least two system calls): EV therefore updates its idea of the current	2089	at least one system call): EV therefore updates its idea of the current
1826	time only before and after C<ev_loop> collects new events, which causes a	2090	time only before and after C<ev_run> collects new events, which causes a
1827	growing difference between C<ev_now ()> and C<ev_time ()> when handling	2091	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1828	lots of events in one iteration.	2092	lots of events in one iteration.
1829		2093
1830	The relative timeouts are calculated relative to the C<ev_now ()>	2094	The relative timeouts are calculated relative to the C<ev_now ()>
1831	time. This is usually the right thing as this timestamp refers to the time	2095	time. This is usually the right thing as this timestamp refers to the time
1832	of the event triggering whatever timeout you are modifying/starting. If	2096	of the event triggering whatever timeout you are modifying/starting. If
1833	you suspect event processing to be delayed and you I<need> to base the	2097	you suspect event processing to be delayed and you I<need> to base the
1834	timeout on the current time, use something like this to adjust for this:	2098	timeout on the current time, use something like the following to adjust
		2099	for it:
1835		2100
1836	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	2101	ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
1837		2102
1838	If the event loop is suspended for a long time, you can also force an	2103	If the event loop is suspended for a long time, you can also force an
1839	update of the time returned by C<ev_now ()> by calling C<ev_now_update	2104	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1840	()>.	2105	()>, although that will push the event time of all outstanding events
		2106	further into the future.
		2107
		2108	=head3 The special problem of unsynchronised clocks
		2109
		2110	Modern systems have a variety of clocks - libev itself uses the normal
		2111	"wall clock" clock and, if available, the monotonic clock (to avoid time
		2112	jumps).
		2113
		2114	Neither of these clocks is synchronised with each other or any other clock
		2115	on the system, so C<ev_time ()> might return a considerably different time
		2116	than C<gettimeofday ()> or C<time ()>. On a GNU/Linux system, for example,
		2117	a call to C<gettimeofday> might return a second count that is one higher
		2118	than a directly following call to C<time>.
		2119
		2120	The moral of this is to only compare libev-related timestamps with
		2121	C<ev_time ()> and C<ev_now ()>, at least if you want better precision than
		2122	a second or so.
		2123
		2124	One more problem arises due to this lack of synchronisation: if libev uses
		2125	the system monotonic clock and you compare timestamps from C<ev_time>
		2126	or C<ev_now> from when you started your timer and when your callback is
		2127	invoked, you will find that sometimes the callback is a bit "early".
		2128
		2129	This is because C<ev_timer>s work in real time, not wall clock time, so
		2130	libev makes sure your callback is not invoked before the delay happened,
		2131	I<measured according to the real time>, not the system clock.
		2132
		2133	If your timeouts are based on a physical timescale (e.g. "time out this
		2134	connection after 100 seconds") then this shouldn't bother you as it is
		2135	exactly the right behaviour.
		2136
		2137	If you want to compare wall clock/system timestamps to your timers, then
		2138	you need to use C<ev_periodic>s, as these are based on the wall clock
		2139	time, where your comparisons will always generate correct results.
1841		2140
1842	=head3 The special problems of suspended animation	2141	=head3 The special problems of suspended animation
1843		2142
1844	When you leave the server world it is quite customary to hit machines that	2143	When you leave the server world it is quite customary to hit machines that
1845	can suspend/hibernate - what happens to the clocks during such a suspend?	2144	can suspend/hibernate - what happens to the clocks during such a suspend?
…		…
1875		2174
1876	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	2175	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1877		2176
1878	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)	2177	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
1879		2178
1880	Configure the timer to trigger after C<after> seconds. If C<repeat>	2179	Configure the timer to trigger after C<after> seconds (fractional and
1881	is C<0.>, then it will automatically be stopped once the timeout is	2180	negative values are supported). If C<repeat> is C<0.>, then it will
1882	reached. If it is positive, then the timer will automatically be	2181	automatically be stopped once the timeout is reached. If it is positive,
1883	configured to trigger again C<repeat> seconds later, again, and again,	2182	then the timer will automatically be configured to trigger again C<repeat>
1884	until stopped manually.	2183	seconds later, again, and again, until stopped manually.
1885		2184
1886	The timer itself will do a best-effort at avoiding drift, that is, if	2185	The timer itself will do a best-effort at avoiding drift, that is, if
1887	you configure a timer to trigger every 10 seconds, then it will normally	2186	you configure a timer to trigger every 10 seconds, then it will normally
1888	trigger at exactly 10 second intervals. If, however, your program cannot	2187	trigger at exactly 10 second intervals. If, however, your program cannot
1889	keep up with the timer (because it takes longer than those 10 seconds to	2188	keep up with the timer (because it takes longer than those 10 seconds to
1890	do stuff) the timer will not fire more than once per event loop iteration.	2189	do stuff) the timer will not fire more than once per event loop iteration.
1891		2190
1892	=item ev_timer_again (loop, ev_timer *)	2191	=item ev_timer_again (loop, ev_timer *)
1893		2192
1894	This will act as if the timer timed out and restart it again if it is	2193	This will act as if the timer timed out, and restarts it again if it is
1895	repeating. The exact semantics are:	2194	repeating. It basically works like calling C<ev_timer_stop>, updating the
		2195	timeout to the C<repeat> value and calling C<ev_timer_start>.
1896		2196
		2197	The exact semantics are as in the following rules, all of which will be
		2198	applied to the watcher:
		2199
		2200	=over 4
		2201
1897	If the timer is pending, its pending status is cleared.	2202	=item If the timer is pending, the pending status is always cleared.
1898		2203
1899	If the timer is started but non-repeating, stop it (as if it timed out).	2204	=item If the timer is started but non-repeating, stop it (as if it timed
		2205	out, without invoking it).
1900		2206
1901	If the timer is repeating, either start it if necessary (with the	2207	=item If the timer is repeating, make the C<repeat> value the new timeout
1902	C<repeat> value), or reset the running timer to the C<repeat> value.	2208	and start the timer, if necessary.
1903		2209
		2210	=back
		2211
1904	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a	2212	This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
1905	usage example.	2213	usage example.
1906		2214
1907	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)	2215	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1908		2216
1909	Returns the remaining time until a timer fires. If the timer is active,	2217	Returns the remaining time until a timer fires. If the timer is active,
…		…
1948	}	2256	}
1949		2257
1950	ev_timer mytimer;	2258	ev_timer mytimer;
1951	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	2259	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1952	ev_timer_again (&mytimer); /* start timer */	2260	ev_timer_again (&mytimer); /* start timer */
1953	ev_loop (loop, 0);	2261	ev_run (loop, 0);
1954		2262
1955	// and in some piece of code that gets executed on any "activity":	2263	// and in some piece of code that gets executed on any "activity":
1956	// reset the timeout to start ticking again at 10 seconds	2264	// reset the timeout to start ticking again at 10 seconds
1957	ev_timer_again (&mytimer);	2265	ev_timer_again (&mytimer);
1958		2266
…		…
1962	Periodic watchers are also timers of a kind, but they are very versatile	2270	Periodic watchers are also timers of a kind, but they are very versatile
1963	(and unfortunately a bit complex).	2271	(and unfortunately a bit complex).
1964		2272
1965	Unlike C<ev_timer>, periodic watchers are not based on real time (or	2273	Unlike C<ev_timer>, periodic watchers are not based on real time (or
1966	relative time, the physical time that passes) but on wall clock time	2274	relative time, the physical time that passes) but on wall clock time
1967	(absolute time, the thing you can read on your calender or clock). The	2275	(absolute time, the thing you can read on your calendar or clock). The
1968	difference is that wall clock time can run faster or slower than real	2276	difference is that wall clock time can run faster or slower than real
1969	time, and time jumps are not uncommon (e.g. when you adjust your	2277	time, and time jumps are not uncommon (e.g. when you adjust your
1970	wrist-watch).	2278	wrist-watch).
1971		2279
1972	You can tell a periodic watcher to trigger after some specific point	2280	You can tell a periodic watcher to trigger after some specific point
…		…
1977	C<ev_timer>, which would still trigger roughly 10 seconds after starting	2285	C<ev_timer>, which would still trigger roughly 10 seconds after starting
1978	it, as it uses a relative timeout).	2286	it, as it uses a relative timeout).
1979		2287
1980	C<ev_periodic> watchers can also be used to implement vastly more complex	2288	C<ev_periodic> watchers can also be used to implement vastly more complex
1981	timers, such as triggering an event on each "midnight, local time", or	2289	timers, such as triggering an event on each "midnight, local time", or
1982	other complicated rules. This cannot be done with C<ev_timer> watchers, as	2290	other complicated rules. This cannot easily be done with C<ev_timer>
1983	those cannot react to time jumps.	2291	watchers, as those cannot react to time jumps.
1984		2292
1985	As with timers, the callback is guaranteed to be invoked only when the	2293	As with timers, the callback is guaranteed to be invoked only when the
1986	point in time where it is supposed to trigger has passed. If multiple	2294	point in time where it is supposed to trigger has passed. If multiple
1987	timers become ready during the same loop iteration then the ones with	2295	timers become ready during the same loop iteration then the ones with
1988	earlier time-out values are invoked before ones with later time-out values	2296	earlier time-out values are invoked before ones with later time-out values
1989	(but this is no longer true when a callback calls C<ev_loop> recursively).	2297	(but this is no longer true when a callback calls C<ev_run> recursively).
1990		2298
1991	=head3 Watcher-Specific Functions and Data Members	2299	=head3 Watcher-Specific Functions and Data Members
1992		2300
1993	=over 4	2301	=over 4
1994		2302
…		…
2029		2337
2030	Another way to think about it (for the mathematically inclined) is that	2338	Another way to think about it (for the mathematically inclined) is that
2031	C<ev_periodic> will try to run the callback in this mode at the next possible	2339	C<ev_periodic> will try to run the callback in this mode at the next possible
2032	time where C<time = offset (mod interval)>, regardless of any time jumps.	2340	time where C<time = offset (mod interval)>, regardless of any time jumps.
2033		2341
2034	For numerical stability it is preferable that the C<offset> value is near	2342	The C<interval> I<MUST> be positive, and for numerical stability, the
2035	C<ev_now ()> (the current time), but there is no range requirement for	2343	interval value should be higher than C<1/8192> (which is around 100
2036	this value, and in fact is often specified as zero.	2344	microseconds) and C<offset> should be higher than C<0> and should have
		2345	at most a similar magnitude as the current time (say, within a factor of
		2346	ten). Typical values for offset are, in fact, C<0> or something between
		2347	C<0> and C<interval>, which is also the recommended range.
2037		2348
2038	Note also that there is an upper limit to how often a timer can fire (CPU	2349	Note also that there is an upper limit to how often a timer can fire (CPU
2039	speed for example), so if C<interval> is very small then timing stability	2350	speed for example), so if C<interval> is very small then timing stability
2040	will of course deteriorate. Libev itself tries to be exact to be about one	2351	will of course deteriorate. Libev itself tries to be exact to be about one
2041	millisecond (if the OS supports it and the machine is fast enough).	2352	millisecond (if the OS supports it and the machine is fast enough).
…		…
2071		2382
2072	NOTE: I<< This callback must always return a time that is higher than or	2383	NOTE: I<< This callback must always return a time that is higher than or
2073	equal to the passed C<now> value >>.	2384	equal to the passed C<now> value >>.
2074		2385
2075	This can be used to create very complex timers, such as a timer that	2386	This can be used to create very complex timers, such as a timer that
2076	triggers on "next midnight, local time". To do this, you would calculate the	2387	triggers on "next midnight, local time". To do this, you would calculate
2077	next midnight after C<now> and return the timestamp value for this. How	2388	the next midnight after C<now> and return the timestamp value for
2078	you do this is, again, up to you (but it is not trivial, which is the main	2389	this. Here is a (completely untested, no error checking) example on how to
2079	reason I omitted it as an example).	2390	do this:
		2391
		2392	#include <time.h>
		2393
		2394	static ev_tstamp
		2395	my_rescheduler (ev_periodic *w, ev_tstamp now)
		2396	{
		2397	time_t tnow = (time_t)now;
		2398	struct tm tm;
		2399	localtime_r (&tnow, &tm);
		2400
		2401	tm.tm_sec = tm.tm_min = tm.tm_hour = 0; // midnight current day
		2402	++tm.tm_mday; // midnight next day
		2403
		2404	return mktime (&tm);
		2405	}
		2406
		2407	Note: this code might run into trouble on days that have more then two
		2408	midnights (beginning and end).
2080		2409
2081	=back	2410	=back
2082		2411
2083	=item ev_periodic_again (loop, ev_periodic *)	2412	=item ev_periodic_again (loop, ev_periodic *)
2084		2413
…		…
2122	Example: Call a callback every hour, or, more precisely, whenever the	2451	Example: Call a callback every hour, or, more precisely, whenever the
2123	system time is divisible by 3600. The callback invocation times have	2452	system time is divisible by 3600. The callback invocation times have
2124	potentially a lot of jitter, but good long-term stability.	2453	potentially a lot of jitter, but good long-term stability.
2125		2454
2126	static void	2455	static void
2127	clock_cb (struct ev_loop *loop, ev_io *w, int revents)	2456	clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
2128	{	2457	{
2129	... its now a full hour (UTC, or TAI or whatever your clock follows)	2458	... its now a full hour (UTC, or TAI or whatever your clock follows)
2130	}	2459	}
2131		2460
2132	ev_periodic hourly_tick;	2461	ev_periodic hourly_tick;
…		…
2149		2478
2150	ev_periodic hourly_tick;	2479	ev_periodic hourly_tick;
2151	ev_periodic_init (&hourly_tick, clock_cb,	2480	ev_periodic_init (&hourly_tick, clock_cb,
2152	fmod (ev_now (loop), 3600.), 3600., 0);	2481	fmod (ev_now (loop), 3600.), 3600., 0);
2153	ev_periodic_start (loop, &hourly_tick);	2482	ev_periodic_start (loop, &hourly_tick);
2154		2483
2155		2484
2156	=head2 C<ev_signal> - signal me when a signal gets signalled!	2485	=head2 C<ev_signal> - signal me when a signal gets signalled!
2157		2486
2158	Signal watchers will trigger an event when the process receives a specific	2487	Signal watchers will trigger an event when the process receives a specific
2159	signal one or more times. Even though signals are very asynchronous, libev	2488	signal one or more times. Even though signals are very asynchronous, libev
2160	will try it's best to deliver signals synchronously, i.e. as part of the	2489	will try its best to deliver signals synchronously, i.e. as part of the
2161	normal event processing, like any other event.	2490	normal event processing, like any other event.
2162		2491
2163	If you want signals to be delivered truly asynchronously, just use	2492	If you want signals to be delivered truly asynchronously, just use
2164	C<sigaction> as you would do without libev and forget about sharing	2493	C<sigaction> as you would do without libev and forget about sharing
2165	the signal. You can even use C<ev_async> from a signal handler to	2494	the signal. You can even use C<ev_async> from a signal handler to
…		…
2169	only within the same loop, i.e. you can watch for C<SIGINT> in your	2498	only within the same loop, i.e. you can watch for C<SIGINT> in your
2170	default loop and for C<SIGIO> in another loop, but you cannot watch for	2499	default loop and for C<SIGIO> in another loop, but you cannot watch for
2171	C<SIGINT> in both the default loop and another loop at the same time. At	2500	C<SIGINT> in both the default loop and another loop at the same time. At
2172	the moment, C<SIGCHLD> is permanently tied to the default loop.	2501	the moment, C<SIGCHLD> is permanently tied to the default loop.
2173		2502
2174	When the first watcher gets started will libev actually register something	2503	Only after the first watcher for a signal is started will libev actually
2175	with the kernel (thus it coexists with your own signal handlers as long as	2504	register something with the kernel. It thus coexists with your own signal
2176	you don't register any with libev for the same signal).	2505	handlers as long as you don't register any with libev for the same signal.
2177		2506
2178	If possible and supported, libev will install its handlers with	2507	If possible and supported, libev will install its handlers with
2179	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should	2508	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2180	not be unduly interrupted. If you have a problem with system calls getting	2509	not be unduly interrupted. If you have a problem with system calls getting
2181	interrupted by signals you can block all signals in an C<ev_check> watcher	2510	interrupted by signals you can block all signals in an C<ev_check> watcher
…		…
2184	=head3 The special problem of inheritance over fork/execve/pthread_create	2513	=head3 The special problem of inheritance over fork/execve/pthread_create
2185		2514
2186	Both the signal mask (C<sigprocmask>) and the signal disposition	2515	Both the signal mask (C<sigprocmask>) and the signal disposition
2187	(C<sigaction>) are unspecified after starting a signal watcher (and after	2516	(C<sigaction>) are unspecified after starting a signal watcher (and after
2188	stopping it again), that is, libev might or might not block the signal,	2517	stopping it again), that is, libev might or might not block the signal,
2189	and might or might not set or restore the installed signal handler.	2518	and might or might not set or restore the installed signal handler (but
		2519	see C<EVFLAG_NOSIGMASK>).
2190		2520
2191	While this does not matter for the signal disposition (libev never	2521	While this does not matter for the signal disposition (libev never
2192	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2522	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2193	C<execve>), this matters for the signal mask: many programs do not expect	2523	C<execve>), this matters for the signal mask: many programs do not expect
2194	certain signals to be blocked.	2524	certain signals to be blocked.
…		…
2208		2538
2209	So I can't stress this enough: I<If you do not reset your signal mask when	2539	So I can't stress this enough: I<If you do not reset your signal mask when
2210	you expect it to be empty, you have a race condition in your code>. This	2540	you expect it to be empty, you have a race condition in your code>. This
2211	is not a libev-specific thing, this is true for most event libraries.	2541	is not a libev-specific thing, this is true for most event libraries.
2212		2542
		2543	=head3 The special problem of threads signal handling
		2544
		2545	POSIX threads has problematic signal handling semantics, specifically,
		2546	a lot of functionality (sigfd, sigwait etc.) only really works if all
		2547	threads in a process block signals, which is hard to achieve.
		2548
		2549	When you want to use sigwait (or mix libev signal handling with your own
		2550	for the same signals), you can tackle this problem by globally blocking
		2551	all signals before creating any threads (or creating them with a fully set
		2552	sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
		2553	loops. Then designate one thread as "signal receiver thread" which handles
		2554	these signals. You can pass on any signals that libev might be interested
		2555	in by calling C<ev_feed_signal>.
		2556
2213	=head3 Watcher-Specific Functions and Data Members	2557	=head3 Watcher-Specific Functions and Data Members
2214		2558
2215	=over 4	2559	=over 4
2216		2560
2217	=item ev_signal_init (ev_signal *, callback, int signum)	2561	=item ev_signal_init (ev_signal *, callback, int signum)
…		…
2232	Example: Try to exit cleanly on SIGINT.	2576	Example: Try to exit cleanly on SIGINT.
2233		2577
2234	static void	2578	static void
2235	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)	2579	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2236	{	2580	{
2237	ev_unloop (loop, EVUNLOOP_ALL);	2581	ev_break (loop, EVBREAK_ALL);
2238	}	2582	}
2239		2583
2240	ev_signal signal_watcher;	2584	ev_signal signal_watcher;
2241	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	2585	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2242	ev_signal_start (loop, &signal_watcher);	2586	ev_signal_start (loop, &signal_watcher);
…		…
2351		2695
2352	=head2 C<ev_stat> - did the file attributes just change?	2696	=head2 C<ev_stat> - did the file attributes just change?
2353		2697
2354	This watches a file system path for attribute changes. That is, it calls	2698	This watches a file system path for attribute changes. That is, it calls
2355	C<stat> on that path in regular intervals (or when the OS says it changed)	2699	C<stat> on that path in regular intervals (or when the OS says it changed)
2356	and sees if it changed compared to the last time, invoking the callback if	2700	and sees if it changed compared to the last time, invoking the callback
2357	it did.	2701	if it did. Starting the watcher C<stat>'s the file, so only changes that
		2702	happen after the watcher has been started will be reported.
2358		2703
2359	The path does not need to exist: changing from "path exists" to "path does	2704	The path does not need to exist: changing from "path exists" to "path does
2360	not exist" is a status change like any other. The condition "path does not	2705	not exist" is a status change like any other. The condition "path does not
2361	exist" (or more correctly "path cannot be stat'ed") is signified by the	2706	exist" (or more correctly "path cannot be stat'ed") is signified by the
2362	C<st_nlink> field being zero (which is otherwise always forced to be at	2707	C<st_nlink> field being zero (which is otherwise always forced to be at
…		…
2592	Apart from keeping your process non-blocking (which is a useful	2937	Apart from keeping your process non-blocking (which is a useful
2593	effect on its own sometimes), idle watchers are a good place to do	2938	effect on its own sometimes), idle watchers are a good place to do
2594	"pseudo-background processing", or delay processing stuff to after the	2939	"pseudo-background processing", or delay processing stuff to after the
2595	event loop has handled all outstanding events.	2940	event loop has handled all outstanding events.
2596		2941
		2942	=head3 Abusing an C<ev_idle> watcher for its side-effect
		2943
		2944	As long as there is at least one active idle watcher, libev will never
		2945	sleep unnecessarily. Or in other words, it will loop as fast as possible.
		2946	For this to work, the idle watcher doesn't need to be invoked at all - the
		2947	lowest priority will do.
		2948
		2949	This mode of operation can be useful together with an C<ev_check> watcher,
		2950	to do something on each event loop iteration - for example to balance load
		2951	between different connections.
		2952
		2953	See L</Abusing an ev_check watcher for its side-effect> for a longer
		2954	example.
		2955
2597	=head3 Watcher-Specific Functions and Data Members	2956	=head3 Watcher-Specific Functions and Data Members
2598		2957
2599	=over 4	2958	=over 4
2600		2959
2601	=item ev_idle_init (ev_idle *, callback)	2960	=item ev_idle_init (ev_idle *, callback)
…		…
2612	callback, free it. Also, use no error checking, as usual.	2971	callback, free it. Also, use no error checking, as usual.
2613		2972
2614	static void	2973	static void
2615	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)	2974	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2616	{	2975	{
		2976	// stop the watcher
		2977	ev_idle_stop (loop, w);
		2978
		2979	// now we can free it
2617	free (w);	2980	free (w);
		2981
2618	// now do something you wanted to do when the program has	2982	// now do something you wanted to do when the program has
2619	// no longer anything immediate to do.	2983	// no longer anything immediate to do.
2620	}	2984	}
2621		2985
2622	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2986	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
…		…
2624	ev_idle_start (loop, idle_watcher);	2988	ev_idle_start (loop, idle_watcher);
2625		2989
2626		2990
2627	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2991	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2628		2992
2629	Prepare and check watchers are usually (but not always) used in pairs:	2993	Prepare and check watchers are often (but not always) used in pairs:
2630	prepare watchers get invoked before the process blocks and check watchers	2994	prepare watchers get invoked before the process blocks and check watchers
2631	afterwards.	2995	afterwards.
2632		2996
2633	You I<must not> call C<ev_loop> or similar functions that enter	2997	You I<must not> call C<ev_run> (or similar functions that enter the
2634	the current event loop from either C<ev_prepare> or C<ev_check>	2998	current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2635	watchers. Other loops than the current one are fine, however. The	2999	C<ev_check> watchers. Other loops than the current one are fine,
2636	rationale behind this is that you do not need to check for recursion in	3000	however. The rationale behind this is that you do not need to check
2637	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	3001	for recursion in those watchers, i.e. the sequence will always be
2638	C<ev_check> so if you have one watcher of each kind they will always be	3002	C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2639	called in pairs bracketing the blocking call.	3003	kind they will always be called in pairs bracketing the blocking call.
2640		3004
2641	Their main purpose is to integrate other event mechanisms into libev and	3005	Their main purpose is to integrate other event mechanisms into libev and
2642	their use is somewhat advanced. They could be used, for example, to track	3006	their use is somewhat advanced. They could be used, for example, to track
2643	variable changes, implement your own watchers, integrate net-snmp or a	3007	variable changes, implement your own watchers, integrate net-snmp or a
2644	coroutine library and lots more. They are also occasionally useful if	3008	coroutine library and lots more. They are also occasionally useful if
…		…
2662	with priority higher than or equal to the event loop and one coroutine	3026	with priority higher than or equal to the event loop and one coroutine
2663	of lower priority, but only once, using idle watchers to keep the event	3027	of lower priority, but only once, using idle watchers to keep the event
2664	loop from blocking if lower-priority coroutines are active, thus mapping	3028	loop from blocking if lower-priority coroutines are active, thus mapping
2665	low-priority coroutines to idle/background tasks).	3029	low-priority coroutines to idle/background tasks).
2666		3030
2667	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	3031	When used for this purpose, it is recommended to give C<ev_check> watchers
2668	priority, to ensure that they are being run before any other watchers	3032	highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2669	after the poll (this doesn't matter for C<ev_prepare> watchers).	3033	any other watchers after the poll (this doesn't matter for C<ev_prepare>
		3034	watchers).
2670		3035
2671	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not	3036	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2672	activate ("feed") events into libev. While libev fully supports this, they	3037	activate ("feed") events into libev. While libev fully supports this, they
2673	might get executed before other C<ev_check> watchers did their job. As	3038	might get executed before other C<ev_check> watchers did their job. As
2674	C<ev_check> watchers are often used to embed other (non-libev) event	3039	C<ev_check> watchers are often used to embed other (non-libev) event
2675	loops those other event loops might be in an unusable state until their	3040	loops those other event loops might be in an unusable state until their
2676	C<ev_check> watcher ran (always remind yourself to coexist peacefully with	3041	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2677	others).	3042	others).
		3043
		3044	=head3 Abusing an C<ev_check> watcher for its side-effect
		3045
		3046	C<ev_check> (and less often also C<ev_prepare>) watchers can also be
		3047	useful because they are called once per event loop iteration. For
		3048	example, if you want to handle a large number of connections fairly, you
		3049	normally only do a bit of work for each active connection, and if there
		3050	is more work to do, you wait for the next event loop iteration, so other
		3051	connections have a chance of making progress.
		3052
		3053	Using an C<ev_check> watcher is almost enough: it will be called on the
		3054	next event loop iteration. However, that isn't as soon as possible -
		3055	without external events, your C<ev_check> watcher will not be invoked.
		3056
		3057	This is where C<ev_idle> watchers come in handy - all you need is a
		3058	single global idle watcher that is active as long as you have one active
		3059	C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
		3060	will not sleep, and the C<ev_check> watcher makes sure a callback gets
		3061	invoked. Neither watcher alone can do that.
2678		3062
2679	=head3 Watcher-Specific Functions and Data Members	3063	=head3 Watcher-Specific Functions and Data Members
2680		3064
2681	=over 4	3065	=over 4
2682		3066
…		…
2806		3190
2807	if (timeout >= 0)	3191	if (timeout >= 0)
2808	// create/start timer	3192	// create/start timer
2809		3193
2810	// poll	3194	// poll
2811	ev_loop (EV_A_ 0);	3195	ev_run (EV_A_ 0);
2812		3196
2813	// stop timer again	3197	// stop timer again
2814	if (timeout >= 0)	3198	if (timeout >= 0)
2815	ev_timer_stop (EV_A_ &to);	3199	ev_timer_stop (EV_A_ &to);
2816		3200
…		…
2883		3267
2884	=over 4	3268	=over 4
2885		3269
2886	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)	3270	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
2887		3271
2888	=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)	3272	=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
2889		3273
2890	Configures the watcher to embed the given loop, which must be	3274	Configures the watcher to embed the given loop, which must be
2891	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be	3275	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
2892	invoked automatically, otherwise it is the responsibility of the callback	3276	invoked automatically, otherwise it is the responsibility of the callback
2893	to invoke it (it will continue to be called until the sweep has been done,	3277	to invoke it (it will continue to be called until the sweep has been done,
2894	if you do not want that, you need to temporarily stop the embed watcher).	3278	if you do not want that, you need to temporarily stop the embed watcher).
2895		3279
2896	=item ev_embed_sweep (loop, ev_embed *)	3280	=item ev_embed_sweep (loop, ev_embed *)
2897		3281
2898	Make a single, non-blocking sweep over the embedded loop. This works	3282	Make a single, non-blocking sweep over the embedded loop. This works
2899	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most	3283	similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2900	appropriate way for embedded loops.	3284	appropriate way for embedded loops.
2901		3285
2902	=item struct ev_loop *other [read-only]	3286	=item struct ev_loop *other [read-only]
2903		3287
2904	The embedded event loop.	3288	The embedded event loop.
…		…
2914	used).	3298	used).
2915		3299
2916	struct ev_loop *loop_hi = ev_default_init (0);	3300	struct ev_loop *loop_hi = ev_default_init (0);
2917	struct ev_loop *loop_lo = 0;	3301	struct ev_loop *loop_lo = 0;
2918	ev_embed embed;	3302	ev_embed embed;
2919		3303
2920	// see if there is a chance of getting one that works	3304	// see if there is a chance of getting one that works
2921	// (remember that a flags value of 0 means autodetection)	3305	// (remember that a flags value of 0 means autodetection)
2922	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	3306	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2923	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	3307	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
2924	: 0;	3308	: 0;
…		…
2938	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	3322	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2939		3323
2940	struct ev_loop *loop = ev_default_init (0);	3324	struct ev_loop *loop = ev_default_init (0);
2941	struct ev_loop *loop_socket = 0;	3325	struct ev_loop *loop_socket = 0;
2942	ev_embed embed;	3326	ev_embed embed;
2943		3327
2944	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	3328	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2945	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	3329	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2946	{	3330	{
2947	ev_embed_init (&embed, 0, loop_socket);	3331	ev_embed_init (&embed, 0, loop_socket);
2948	ev_embed_start (loop, &embed);	3332	ev_embed_start (loop, &embed);
…		…
2956		3340
2957	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	3341	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
2958		3342
2959	Fork watchers are called when a C<fork ()> was detected (usually because	3343	Fork watchers are called when a C<fork ()> was detected (usually because
2960	whoever is a good citizen cared to tell libev about it by calling	3344	whoever is a good citizen cared to tell libev about it by calling
2961	C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the	3345	C<ev_loop_fork>). The invocation is done before the event loop blocks next
2962	event loop blocks next and before C<ev_check> watchers are being called,	3346	and before C<ev_check> watchers are being called, and only in the child
2963	and only in the child after the fork. If whoever good citizen calling	3347	after the fork. If whoever good citizen calling C<ev_default_fork> cheats
2964	C<ev_default_fork> cheats and calls it in the wrong process, the fork	3348	and calls it in the wrong process, the fork handlers will be invoked, too,
2965	handlers will be invoked, too, of course.	3349	of course.
2966		3350
2967	=head3 The special problem of life after fork - how is it possible?	3351	=head3 The special problem of life after fork - how is it possible?
2968		3352
2969	Most uses of C<fork()> consist of forking, then some simple calls to ste	3353	Most uses of C<fork ()> consist of forking, then some simple calls to set
2970	up/change the process environment, followed by a call to C<exec()>. This	3354	up/change the process environment, followed by a call to C<exec()>. This
2971	sequence should be handled by libev without any problems.	3355	sequence should be handled by libev without any problems.
2972		3356
2973	This changes when the application actually wants to do event handling	3357	This changes when the application actually wants to do event handling
2974	in the child, or both parent in child, in effect "continuing" after the	3358	in the child, or both parent in child, in effect "continuing" after the
…		…
2990	disadvantage of having to use multiple event loops (which do not support	3374	disadvantage of having to use multiple event loops (which do not support
2991	signal watchers).	3375	signal watchers).
2992		3376
2993	When this is not possible, or you want to use the default loop for	3377	When this is not possible, or you want to use the default loop for
2994	other reasons, then in the process that wants to start "fresh", call	3378	other reasons, then in the process that wants to start "fresh", call
2995	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying	3379	C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
2996	the default loop will "orphan" (not stop) all registered watchers, so you	3380	Destroying the default loop will "orphan" (not stop) all registered
2997	have to be careful not to execute code that modifies those watchers. Note	3381	watchers, so you have to be careful not to execute code that modifies
2998	also that in that case, you have to re-register any signal watchers.	3382	those watchers. Note also that in that case, you have to re-register any
		3383	signal watchers.
2999		3384
3000	=head3 Watcher-Specific Functions and Data Members	3385	=head3 Watcher-Specific Functions and Data Members
3001		3386
3002	=over 4	3387	=over 4
3003		3388
3004	=item ev_fork_init (ev_signal *, callback)	3389	=item ev_fork_init (ev_fork *, callback)
3005		3390
3006	Initialises and configures the fork watcher - it has no parameters of any	3391	Initialises and configures the fork watcher - it has no parameters of any
3007	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,	3392	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3008	believe me.	3393	really.
3009		3394
3010	=back	3395	=back
3011		3396
3012		3397
		3398	=head2 C<ev_cleanup> - even the best things end
		3399
		3400	Cleanup watchers are called just before the event loop is being destroyed
		3401	by a call to C<ev_loop_destroy>.
		3402
		3403	While there is no guarantee that the event loop gets destroyed, cleanup
		3404	watchers provide a convenient method to install cleanup hooks for your
		3405	program, worker threads and so on - you just to make sure to destroy the
		3406	loop when you want them to be invoked.
		3407
		3408	Cleanup watchers are invoked in the same way as any other watcher. Unlike
		3409	all other watchers, they do not keep a reference to the event loop (which
		3410	makes a lot of sense if you think about it). Like all other watchers, you
		3411	can call libev functions in the callback, except C<ev_cleanup_start>.
		3412
		3413	=head3 Watcher-Specific Functions and Data Members
		3414
		3415	=over 4
		3416
		3417	=item ev_cleanup_init (ev_cleanup *, callback)
		3418
		3419	Initialises and configures the cleanup watcher - it has no parameters of
		3420	any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
		3421	pointless, I assure you.
		3422
		3423	=back
		3424
		3425	Example: Register an atexit handler to destroy the default loop, so any
		3426	cleanup functions are called.
		3427
		3428	static void
		3429	program_exits (void)
		3430	{
		3431	ev_loop_destroy (EV_DEFAULT_UC);
		3432	}
		3433
		3434	...
		3435	atexit (program_exits);
		3436
		3437
3013	=head2 C<ev_async> - how to wake up another event loop	3438	=head2 C<ev_async> - how to wake up an event loop
3014		3439
3015	In general, you cannot use an C<ev_loop> from multiple threads or other	3440	In general, you cannot use an C<ev_loop> from multiple threads or other
3016	asynchronous sources such as signal handlers (as opposed to multiple event	3441	asynchronous sources such as signal handlers (as opposed to multiple event
3017	loops - those are of course safe to use in different threads).	3442	loops - those are of course safe to use in different threads).
3018		3443
3019	Sometimes, however, you need to wake up another event loop you do not	3444	Sometimes, however, you need to wake up an event loop you do not control,
3020	control, for example because it belongs to another thread. This is what	3445	for example because it belongs to another thread. This is what C<ev_async>
3021	C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you	3446	watchers do: as long as the C<ev_async> watcher is active, you can signal
3022	can signal it by calling C<ev_async_send>, which is thread- and signal	3447	it by calling C<ev_async_send>, which is thread- and signal safe.
3023	safe.
3024		3448
3025	This functionality is very similar to C<ev_signal> watchers, as signals,	3449	This functionality is very similar to C<ev_signal> watchers, as signals,
3026	too, are asynchronous in nature, and signals, too, will be compressed	3450	too, are asynchronous in nature, and signals, too, will be compressed
3027	(i.e. the number of callback invocations may be less than the number of	3451	(i.e. the number of callback invocations may be less than the number of
3028	C<ev_async_sent> calls).	3452	C<ev_async_send> calls). In fact, you could use signal watchers as a kind
3029		3453	of "global async watchers" by using a watcher on an otherwise unused
3030	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not	3454	signal, and C<ev_feed_signal> to signal this watcher from another thread,
3031	just the default loop.	3455	even without knowing which loop owns the signal.
3032		3456
3033	=head3 Queueing	3457	=head3 Queueing
3034		3458
3035	C<ev_async> does not support queueing of data in any way. The reason	3459	C<ev_async> does not support queueing of data in any way. The reason
3036	is that the author does not know of a simple (or any) algorithm for a	3460	is that the author does not know of a simple (or any) algorithm for a
…		…
3128	trust me.	3552	trust me.
3129		3553
3130	=item ev_async_send (loop, ev_async *)	3554	=item ev_async_send (loop, ev_async *)
3131		3555
3132	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3556	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3133	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3557	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3558	returns.
		3559
3134	C<ev_feed_event>, this call is safe to do from other threads, signal or	3560	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3135	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3561	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3136	section below on what exactly this means).	3562	embedding section below on what exactly this means).
3137		3563
3138	Note that, as with other watchers in libev, multiple events might get	3564	Note that, as with other watchers in libev, multiple events might get
3139	compressed into a single callback invocation (another way to look at this	3565	compressed into a single callback invocation (another way to look at
3140	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3566	this is that C<ev_async> watchers are level-triggered: they are set on
3141	reset when the event loop detects that).	3567	C<ev_async_send>, reset when the event loop detects that).
3142		3568
3143	This call incurs the overhead of a system call only once per event loop	3569	This call incurs the overhead of at most one extra system call per event
3144	iteration, so while the overhead might be noticeable, it doesn't apply to	3570	loop iteration, if the event loop is blocked, and no syscall at all if
3145	repeated calls to C<ev_async_send> for the same event loop.	3571	the event loop (or your program) is processing events. That means that
		3572	repeated calls are basically free (there is no need to avoid calls for
		3573	performance reasons) and that the overhead becomes smaller (typically
		3574	zero) under load.
3146		3575
3147	=item bool = ev_async_pending (ev_async *)	3576	=item bool = ev_async_pending (ev_async *)
3148		3577
3149	Returns a non-zero value when C<ev_async_send> has been called on the	3578	Returns a non-zero value when C<ev_async_send> has been called on the
3150	watcher but the event has not yet been processed (or even noted) by the	3579	watcher but the event has not yet been processed (or even noted) by the
…		…
3167		3596
3168	There are some other functions of possible interest. Described. Here. Now.	3597	There are some other functions of possible interest. Described. Here. Now.
3169		3598
3170	=over 4	3599	=over 4
3171		3600
3172	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)	3601	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback, arg)
3173		3602
3174	This function combines a simple timer and an I/O watcher, calls your	3603	This function combines a simple timer and an I/O watcher, calls your
3175	callback on whichever event happens first and automatically stops both	3604	callback on whichever event happens first and automatically stops both
3176	watchers. This is useful if you want to wait for a single event on an fd	3605	watchers. This is useful if you want to wait for a single event on an fd
3177	or timeout without having to allocate/configure/start/stop/free one or	3606	or timeout without having to allocate/configure/start/stop/free one or
…		…
3205	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3634	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3206		3635
3207	=item ev_feed_fd_event (loop, int fd, int revents)	3636	=item ev_feed_fd_event (loop, int fd, int revents)
3208		3637
3209	Feed an event on the given fd, as if a file descriptor backend detected	3638	Feed an event on the given fd, as if a file descriptor backend detected
3210	the given events it.	3639	the given events.
3211		3640
3212	=item ev_feed_signal_event (loop, int signum)	3641	=item ev_feed_signal_event (loop, int signum)
3213		3642
3214	Feed an event as if the given signal occurred (C<loop> must be the default	3643	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3215	loop!).	3644	which is async-safe.
3216		3645
3217	=back	3646	=back
		3647
		3648
		3649	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
		3650
		3651	This section explains some common idioms that are not immediately
		3652	obvious. Note that examples are sprinkled over the whole manual, and this
		3653	section only contains stuff that wouldn't fit anywhere else.
		3654
		3655	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3656
		3657	Each watcher has, by default, a C<void *data> member that you can read
		3658	or modify at any time: libev will completely ignore it. This can be used
		3659	to associate arbitrary data with your watcher. If you need more data and
		3660	don't want to allocate memory separately and store a pointer to it in that
		3661	data member, you can also "subclass" the watcher type and provide your own
		3662	data:
		3663
		3664	struct my_io
		3665	{
		3666	ev_io io;
		3667	int otherfd;
		3668	void *somedata;
		3669	struct whatever *mostinteresting;
		3670	};
		3671
		3672	...
		3673	struct my_io w;
		3674	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3675
		3676	And since your callback will be called with a pointer to the watcher, you
		3677	can cast it back to your own type:
		3678
		3679	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
		3680	{
		3681	struct my_io *w = (struct my_io *)w_;
		3682	...
		3683	}
		3684
		3685	More interesting and less C-conformant ways of casting your callback
		3686	function type instead have been omitted.
		3687
		3688	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3689
		3690	Another common scenario is to use some data structure with multiple
		3691	embedded watchers, in effect creating your own watcher that combines
		3692	multiple libev event sources into one "super-watcher":
		3693
		3694	struct my_biggy
		3695	{
		3696	int some_data;
		3697	ev_timer t1;
		3698	ev_timer t2;
		3699	}
		3700
		3701	In this case getting the pointer to C<my_biggy> is a bit more
		3702	complicated: Either you store the address of your C<my_biggy> struct in
		3703	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3704	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3705	real programmers):
		3706
		3707	#include <stddef.h>
		3708
		3709	static void
		3710	t1_cb (EV_P_ ev_timer *w, int revents)
		3711	{
		3712	struct my_biggy big = (struct my_biggy *)
		3713	(((char *)w) - offsetof (struct my_biggy, t1));
		3714	}
		3715
		3716	static void
		3717	t2_cb (EV_P_ ev_timer *w, int revents)
		3718	{
		3719	struct my_biggy big = (struct my_biggy *)
		3720	(((char *)w) - offsetof (struct my_biggy, t2));
		3721	}
		3722
		3723	=head2 AVOIDING FINISHING BEFORE RETURNING
		3724
		3725	Often you have structures like this in event-based programs:
		3726
		3727	callback ()
		3728	{
		3729	free (request);
		3730	}
		3731
		3732	request = start_new_request (..., callback);
		3733
		3734	The intent is to start some "lengthy" operation. The C<request> could be
		3735	used to cancel the operation, or do other things with it.
		3736
		3737	It's not uncommon to have code paths in C<start_new_request> that
		3738	immediately invoke the callback, for example, to report errors. Or you add
		3739	some caching layer that finds that it can skip the lengthy aspects of the
		3740	operation and simply invoke the callback with the result.
		3741
		3742	The problem here is that this will happen I<before> C<start_new_request>
		3743	has returned, so C<request> is not set.
		3744
		3745	Even if you pass the request by some safer means to the callback, you
		3746	might want to do something to the request after starting it, such as
		3747	canceling it, which probably isn't working so well when the callback has
		3748	already been invoked.
		3749
		3750	A common way around all these issues is to make sure that
		3751	C<start_new_request> I<always> returns before the callback is invoked. If
		3752	C<start_new_request> immediately knows the result, it can artificially
		3753	delay invoking the callback by using a C<prepare> or C<idle> watcher for
		3754	example, or more sneakily, by reusing an existing (stopped) watcher and
		3755	pushing it into the pending queue:
		3756
		3757	ev_set_cb (watcher, callback);
		3758	ev_feed_event (EV_A_ watcher, 0);
		3759
		3760	This way, C<start_new_request> can safely return before the callback is
		3761	invoked, while not delaying callback invocation too much.
		3762
		3763	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
		3764
		3765	Often (especially in GUI toolkits) there are places where you have
		3766	I<modal> interaction, which is most easily implemented by recursively
		3767	invoking C<ev_run>.
		3768
		3769	This brings the problem of exiting - a callback might want to finish the
		3770	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
		3771	a modal "Are you sure?" dialog is still waiting), or just the nested one
		3772	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
		3773	other combination: In these cases, a simple C<ev_break> will not work.
		3774
		3775	The solution is to maintain "break this loop" variable for each C<ev_run>
		3776	invocation, and use a loop around C<ev_run> until the condition is
		3777	triggered, using C<EVRUN_ONCE>:
		3778
		3779	// main loop
		3780	int exit_main_loop = 0;
		3781
		3782	while (!exit_main_loop)
		3783	ev_run (EV_DEFAULT_ EVRUN_ONCE);
		3784
		3785	// in a modal watcher
		3786	int exit_nested_loop = 0;
		3787
		3788	while (!exit_nested_loop)
		3789	ev_run (EV_A_ EVRUN_ONCE);
		3790
		3791	To exit from any of these loops, just set the corresponding exit variable:
		3792
		3793	// exit modal loop
		3794	exit_nested_loop = 1;
		3795
		3796	// exit main program, after modal loop is finished
		3797	exit_main_loop = 1;
		3798
		3799	// exit both
		3800	exit_main_loop = exit_nested_loop = 1;
		3801
		3802	=head2 THREAD LOCKING EXAMPLE
		3803
		3804	Here is a fictitious example of how to run an event loop in a different
		3805	thread from where callbacks are being invoked and watchers are
		3806	created/added/removed.
		3807
		3808	For a real-world example, see the C<EV::Loop::Async> perl module,
		3809	which uses exactly this technique (which is suited for many high-level
		3810	languages).
		3811
		3812	The example uses a pthread mutex to protect the loop data, a condition
		3813	variable to wait for callback invocations, an async watcher to notify the
		3814	event loop thread and an unspecified mechanism to wake up the main thread.
		3815
		3816	First, you need to associate some data with the event loop:
		3817
		3818	typedef struct {
		3819	mutex_t lock; /* global loop lock */
		3820	ev_async async_w;
		3821	thread_t tid;
		3822	cond_t invoke_cv;
		3823	} userdata;
		3824
		3825	void prepare_loop (EV_P)
		3826	{
		3827	// for simplicity, we use a static userdata struct.
		3828	static userdata u;
		3829
		3830	ev_async_init (&u->async_w, async_cb);
		3831	ev_async_start (EV_A_ &u->async_w);
		3832
		3833	pthread_mutex_init (&u->lock, 0);
		3834	pthread_cond_init (&u->invoke_cv, 0);
		3835
		3836	// now associate this with the loop
		3837	ev_set_userdata (EV_A_ u);
		3838	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3839	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3840
		3841	// then create the thread running ev_run
		3842	pthread_create (&u->tid, 0, l_run, EV_A);
		3843	}
		3844
		3845	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3846	solely to wake up the event loop so it takes notice of any new watchers
		3847	that might have been added:
		3848
		3849	static void
		3850	async_cb (EV_P_ ev_async *w, int revents)
		3851	{
		3852	// just used for the side effects
		3853	}
		3854
		3855	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3856	protecting the loop data, respectively.
		3857
		3858	static void
		3859	l_release (EV_P)
		3860	{
		3861	userdata *u = ev_userdata (EV_A);
		3862	pthread_mutex_unlock (&u->lock);
		3863	}
		3864
		3865	static void
		3866	l_acquire (EV_P)
		3867	{
		3868	userdata *u = ev_userdata (EV_A);
		3869	pthread_mutex_lock (&u->lock);
		3870	}
		3871
		3872	The event loop thread first acquires the mutex, and then jumps straight
		3873	into C<ev_run>:
		3874
		3875	void *
		3876	l_run (void *thr_arg)
		3877	{
		3878	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		3879
		3880	l_acquire (EV_A);
		3881	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3882	ev_run (EV_A_ 0);
		3883	l_release (EV_A);
		3884
		3885	return 0;
		3886	}
		3887
		3888	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3889	signal the main thread via some unspecified mechanism (signals? pipe
		3890	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3891	have been called (in a while loop because a) spurious wakeups are possible
		3892	and b) skipping inter-thread-communication when there are no pending
		3893	watchers is very beneficial):
		3894
		3895	static void
		3896	l_invoke (EV_P)
		3897	{
		3898	userdata *u = ev_userdata (EV_A);
		3899
		3900	while (ev_pending_count (EV_A))
		3901	{
		3902	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3903	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3904	}
		3905	}
		3906
		3907	Now, whenever the main thread gets told to invoke pending watchers, it
		3908	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3909	thread to continue:
		3910
		3911	static void
		3912	real_invoke_pending (EV_P)
		3913	{
		3914	userdata *u = ev_userdata (EV_A);
		3915
		3916	pthread_mutex_lock (&u->lock);
		3917	ev_invoke_pending (EV_A);
		3918	pthread_cond_signal (&u->invoke_cv);
		3919	pthread_mutex_unlock (&u->lock);
		3920	}
		3921
		3922	Whenever you want to start/stop a watcher or do other modifications to an
		3923	event loop, you will now have to lock:
		3924
		3925	ev_timer timeout_watcher;
		3926	userdata *u = ev_userdata (EV_A);
		3927
		3928	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3929
		3930	pthread_mutex_lock (&u->lock);
		3931	ev_timer_start (EV_A_ &timeout_watcher);
		3932	ev_async_send (EV_A_ &u->async_w);
		3933	pthread_mutex_unlock (&u->lock);
		3934
		3935	Note that sending the C<ev_async> watcher is required because otherwise
		3936	an event loop currently blocking in the kernel will have no knowledge
		3937	about the newly added timer. By waking up the loop it will pick up any new
		3938	watchers in the next event loop iteration.
		3939
		3940	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3941
		3942	While the overhead of a callback that e.g. schedules a thread is small, it
		3943	is still an overhead. If you embed libev, and your main usage is with some
		3944	kind of threads or coroutines, you might want to customise libev so that
		3945	doesn't need callbacks anymore.
		3946
		3947	Imagine you have coroutines that you can switch to using a function
		3948	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3949	and that due to some magic, the currently active coroutine is stored in a
		3950	global called C<current_coro>. Then you can build your own "wait for libev
		3951	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3952	the differing C<;> conventions):
		3953
		3954	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3955	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3956
		3957	That means instead of having a C callback function, you store the
		3958	coroutine to switch to in each watcher, and instead of having libev call
		3959	your callback, you instead have it switch to that coroutine.
		3960
		3961	A coroutine might now wait for an event with a function called
		3962	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3963	matter when, or whether the watcher is active or not when this function is
		3964	called):
		3965
		3966	void
		3967	wait_for_event (ev_watcher *w)
		3968	{
		3969	ev_set_cb (w, current_coro);
		3970	switch_to (libev_coro);
		3971	}
		3972
		3973	That basically suspends the coroutine inside C<wait_for_event> and
		3974	continues the libev coroutine, which, when appropriate, switches back to
		3975	this or any other coroutine.
		3976
		3977	You can do similar tricks if you have, say, threads with an event queue -
		3978	instead of storing a coroutine, you store the queue object and instead of
		3979	switching to a coroutine, you push the watcher onto the queue and notify
		3980	any waiters.
		3981
		3982	To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
		3983	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3984
		3985	// my_ev.h
		3986	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3987	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3988	#include "../libev/ev.h"
		3989
		3990	// my_ev.c
		3991	#define EV_H "my_ev.h"
		3992	#include "../libev/ev.c"
		3993
		3994	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3995	F<my_ev.c> into your project. When properly specifying include paths, you
		3996	can even use F<ev.h> as header file name directly.
3218		3997
3219		3998
3220	=head1 LIBEVENT EMULATION	3999	=head1 LIBEVENT EMULATION
3221		4000
3222	Libev offers a compatibility emulation layer for libevent. It cannot	4001	Libev offers a compatibility emulation layer for libevent. It cannot
3223	emulate the internals of libevent, so here are some usage hints:	4002	emulate the internals of libevent, so here are some usage hints:
3224		4003
3225	=over 4	4004	=over 4
		4005
		4006	=item * Only the libevent-1.4.1-beta API is being emulated.
		4007
		4008	This was the newest libevent version available when libev was implemented,
		4009	and is still mostly unchanged in 2010.
3226		4010
3227	=item * Use it by including <event.h>, as usual.	4011	=item * Use it by including <event.h>, as usual.
3228		4012
3229	=item * The following members are fully supported: ev_base, ev_callback,	4013	=item * The following members are fully supported: ev_base, ev_callback,
3230	ev_arg, ev_fd, ev_res, ev_events.	4014	ev_arg, ev_fd, ev_res, ev_events.
…		…
3236	=item * Priorities are not currently supported. Initialising priorities	4020	=item * Priorities are not currently supported. Initialising priorities
3237	will fail and all watchers will have the same priority, even though there	4021	will fail and all watchers will have the same priority, even though there
3238	is an ev_pri field.	4022	is an ev_pri field.
3239		4023
3240	=item * In libevent, the last base created gets the signals, in libev, the	4024	=item * In libevent, the last base created gets the signals, in libev, the
3241	first base created (== the default loop) gets the signals.	4025	base that registered the signal gets the signals.
3242		4026
3243	=item * Other members are not supported.	4027	=item * Other members are not supported.
3244		4028
3245	=item * The libev emulation is I<not> ABI compatible to libevent, you need	4029	=item * The libev emulation is I<not> ABI compatible to libevent, you need
3246	to use the libev header file and library.	4030	to use the libev header file and library.
3247		4031
3248	=back	4032	=back
3249		4033
3250	=head1 C++ SUPPORT	4034	=head1 C++ SUPPORT
		4035
		4036	=head2 C API
		4037
		4038	The normal C API should work fine when used from C++: both ev.h and the
		4039	libev sources can be compiled as C++. Therefore, code that uses the C API
		4040	will work fine.
		4041
		4042	Proper exception specifications might have to be added to callbacks passed
		4043	to libev: exceptions may be thrown only from watcher callbacks, all other
		4044	callbacks (allocator, syserr, loop acquire/release and periodic reschedule
		4045	callbacks) must not throw exceptions, and might need a C<noexcept>
		4046	specification. If you have code that needs to be compiled as both C and
		4047	C++ you can use the C<EV_NOEXCEPT> macro for this:
		4048
		4049	static void
		4050	fatal_error (const char *msg) EV_NOEXCEPT
		4051	{
		4052	perror (msg);
		4053	abort ();
		4054	}
		4055
		4056	...
		4057	ev_set_syserr_cb (fatal_error);
		4058
		4059	The only API functions that can currently throw exceptions are C<ev_run>,
		4060	C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
		4061	because it runs cleanup watchers).
		4062
		4063	Throwing exceptions in watcher callbacks is only supported if libev itself
		4064	is compiled with a C++ compiler or your C and C++ environments allow
		4065	throwing exceptions through C libraries (most do).
		4066
		4067	=head2 C++ API
3251		4068
3252	Libev comes with some simplistic wrapper classes for C++ that mainly allow	4069	Libev comes with some simplistic wrapper classes for C++ that mainly allow
3253	you to use some convenience methods to start/stop watchers and also change	4070	you to use some convenience methods to start/stop watchers and also change
3254	the callback model to a model using method callbacks on objects.	4071	the callback model to a model using method callbacks on objects.
3255		4072
3256	To use it,	4073	To use it,
3257		4074
3258	#include <ev++.h>	4075	#include <ev++.h>
3259		4076
3260	This automatically includes F<ev.h> and puts all of its definitions (many	4077	This automatically includes F<ev.h> and puts all of its definitions (many
3261	of them macros) into the global namespace. All C++ specific things are	4078	of them macros) into the global namespace. All C++ specific things are
3262	put into the C<ev> namespace. It should support all the same embedding	4079	put into the C<ev> namespace. It should support all the same embedding
…		…
3265	Care has been taken to keep the overhead low. The only data member the C++	4082	Care has been taken to keep the overhead low. The only data member the C++
3266	classes add (compared to plain C-style watchers) is the event loop pointer	4083	classes add (compared to plain C-style watchers) is the event loop pointer
3267	that the watcher is associated with (or no additional members at all if	4084	that the watcher is associated with (or no additional members at all if
3268	you disable C<EV_MULTIPLICITY> when embedding libev).	4085	you disable C<EV_MULTIPLICITY> when embedding libev).
3269		4086
3270	Currently, functions, and static and non-static member functions can be	4087	Currently, functions, static and non-static member functions and classes
3271	used as callbacks. Other types should be easy to add as long as they only	4088	with C<operator ()> can be used as callbacks. Other types should be easy
3272	need one additional pointer for context. If you need support for other	4089	to add as long as they only need one additional pointer for context. If
3273	types of functors please contact the author (preferably after implementing	4090	you need support for other types of functors please contact the author
3274	it).	4091	(preferably after implementing it).
		4092
		4093	For all this to work, your C++ compiler either has to use the same calling
		4094	conventions as your C compiler (for static member functions), or you have
		4095	to embed libev and compile libev itself as C++.
3275		4096
3276	Here is a list of things available in the C<ev> namespace:	4097	Here is a list of things available in the C<ev> namespace:
3277		4098
3278	=over 4	4099	=over 4
3279		4100
…		…
3289	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.	4110	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
3290		4111
3291	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of	4112	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
3292	the same name in the C<ev> namespace, with the exception of C<ev_signal>	4113	the same name in the C<ev> namespace, with the exception of C<ev_signal>
3293	which is called C<ev::sig> to avoid clashes with the C<signal> macro	4114	which is called C<ev::sig> to avoid clashes with the C<signal> macro
3294	defines by many implementations.	4115	defined by many implementations.
3295		4116
3296	All of those classes have these methods:	4117	All of those classes have these methods:
3297		4118
3298	=over 4	4119	=over 4
3299		4120
…		…
3340	myclass obj;	4161	myclass obj;
3341	ev::io iow;	4162	ev::io iow;
3342	iow.set <myclass, &myclass::io_cb> (&obj);	4163	iow.set <myclass, &myclass::io_cb> (&obj);
3343		4164
3344	=item w->set (object *)	4165	=item w->set (object *)
3345
3346	This is an B<experimental> feature that might go away in a future version.
3347		4166
3348	This is a variation of a method callback - leaving out the method to call	4167	This is a variation of a method callback - leaving out the method to call
3349	will default the method to C<operator ()>, which makes it possible to use	4168	will default the method to C<operator ()>, which makes it possible to use
3350	functor objects without having to manually specify the C<operator ()> all	4169	functor objects without having to manually specify the C<operator ()> all
3351	the time. Incidentally, you can then also leave out the template argument	4170	the time. Incidentally, you can then also leave out the template argument
…		…
3363	void operator() (ev::io &w, int revents)	4182	void operator() (ev::io &w, int revents)
3364	{	4183	{
3365	...	4184	...
3366	}	4185	}
3367	}	4186	}
3368		4187
3369	myfunctor f;	4188	myfunctor f;
3370		4189
3371	ev::io w;	4190	ev::io w;
3372	w.set (&f);	4191	w.set (&f);
3373		4192
…		…
3391	Associates a different C<struct ev_loop> with this watcher. You can only	4210	Associates a different C<struct ev_loop> with this watcher. You can only
3392	do this when the watcher is inactive (and not pending either).	4211	do this when the watcher is inactive (and not pending either).
3393		4212
3394	=item w->set ([arguments])	4213	=item w->set ([arguments])
3395		4214
3396	Basically the same as C<ev_TYPE_set>, with the same arguments. Must be	4215	Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
		4216	with the same arguments. Either this method or a suitable start method
3397	called at least once. Unlike the C counterpart, an active watcher gets	4217	must be called at least once. Unlike the C counterpart, an active watcher
3398	automatically stopped and restarted when reconfiguring it with this	4218	gets automatically stopped and restarted when reconfiguring it with this
3399	method.	4219	method.
		4220
		4221	For C<ev::embed> watchers this method is called C<set_embed>, to avoid
		4222	clashing with the C<set (loop)> method.
3400		4223
3401	=item w->start ()	4224	=item w->start ()
3402		4225
3403	Starts the watcher. Note that there is no C<loop> argument, as the	4226	Starts the watcher. Note that there is no C<loop> argument, as the
3404	constructor already stores the event loop.	4227	constructor already stores the event loop.
3405		4228
		4229	=item w->start ([arguments])
		4230
		4231	Instead of calling C<set> and C<start> methods separately, it is often
		4232	convenient to wrap them in one call. Uses the same type of arguments as
		4233	the configure C<set> method of the watcher.
		4234
3406	=item w->stop ()	4235	=item w->stop ()
3407		4236
3408	Stops the watcher if it is active. Again, no C<loop> argument.	4237	Stops the watcher if it is active. Again, no C<loop> argument.
3409		4238
3410	=item w->again () (C<ev::timer>, C<ev::periodic> only)	4239	=item w->again () (C<ev::timer>, C<ev::periodic> only)
…		…
3422		4251
3423	=back	4252	=back
3424		4253
3425	=back	4254	=back
3426		4255
3427	Example: Define a class with an IO and idle watcher, start one of them in	4256	Example: Define a class with two I/O and idle watchers, start the I/O
3428	the constructor.	4257	watchers in the constructor.
3429		4258
3430	class myclass	4259	class myclass
3431	{	4260	{
3432	ev::io io ; void io_cb (ev::io &w, int revents);	4261	ev::io io ; void io_cb (ev::io &w, int revents);
		4262	ev::io io2 ; void io2_cb (ev::io &w, int revents);
3433	ev::idle idle; void idle_cb (ev::idle &w, int revents);	4263	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3434		4264
3435	myclass (int fd)	4265	myclass (int fd)
3436	{	4266	{
3437	io .set <myclass, &myclass::io_cb > (this);	4267	io .set <myclass, &myclass::io_cb > (this);
		4268	io2 .set <myclass, &myclass::io2_cb > (this);
3438	idle.set <myclass, &myclass::idle_cb> (this);	4269	idle.set <myclass, &myclass::idle_cb> (this);
3439		4270
3440	io.start (fd, ev::READ);	4271	io.set (fd, ev::WRITE); // configure the watcher
		4272	io.start (); // start it whenever convenient
		4273
		4274	io2.start (fd, ev::READ); // set + start in one call
3441	}	4275	}
3442	};	4276	};
3443		4277
3444		4278
3445	=head1 OTHER LANGUAGE BINDINGS	4279	=head1 OTHER LANGUAGE BINDINGS
…		…
3484	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.	4318	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
3485		4319
3486	=item D	4320	=item D
3487		4321
3488	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	4322	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
3489	be found at L<http://proj.llucax.com.ar/wiki/evd>.	4323	be found at L<http://www.llucax.com.ar/proj/ev.d/index.html>.
3490		4324
3491	=item Ocaml	4325	=item Ocaml
3492		4326
3493	Erkki Seppala has written Ocaml bindings for libev, to be found at	4327	Erkki Seppala has written Ocaml bindings for libev, to be found at
3494	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4328	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
…		…
3497		4331
3498	Brian Maher has written a partial interface to libev for lua (at the	4332	Brian Maher has written a partial interface to libev for lua (at the
3499	time of this writing, only C<ev_io> and C<ev_timer>), to be found at	4333	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3500	L<http://github.com/brimworks/lua-ev>.	4334	L<http://github.com/brimworks/lua-ev>.
3501		4335
		4336	=item Javascript
		4337
		4338	Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
		4339
		4340	=item Others
		4341
		4342	There are others, and I stopped counting.
		4343
3502	=back	4344	=back
3503		4345
3504		4346
3505	=head1 MACRO MAGIC	4347	=head1 MACRO MAGIC
3506		4348
…		…
3519	loop argument"). The C<EV_A> form is used when this is the sole argument,	4361	loop argument"). The C<EV_A> form is used when this is the sole argument,
3520	C<EV_A_> is used when other arguments are following. Example:	4362	C<EV_A_> is used when other arguments are following. Example:
3521		4363
3522	ev_unref (EV_A);	4364	ev_unref (EV_A);
3523	ev_timer_add (EV_A_ watcher);	4365	ev_timer_add (EV_A_ watcher);
3524	ev_loop (EV_A_ 0);	4366	ev_run (EV_A_ 0);
3525		4367
3526	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,	4368	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3527	which is often provided by the following macro.	4369	which is often provided by the following macro.
3528		4370
3529	=item C<EV_P>, C<EV_P_>	4371	=item C<EV_P>, C<EV_P_>
…		…
3542	suitable for use with C<EV_A>.	4384	suitable for use with C<EV_A>.
3543		4385
3544	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	4386	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
3545		4387
3546	Similar to the other two macros, this gives you the value of the default	4388	Similar to the other two macros, this gives you the value of the default
3547	loop, if multiple loops are supported ("ev loop default").	4389	loop, if multiple loops are supported ("ev loop default"). The default loop
		4390	will be initialised if it isn't already initialised.
		4391
		4392	For non-multiplicity builds, these macros do nothing, so you always have
		4393	to initialise the loop somewhere.
3548		4394
3549	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>	4395	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
3550		4396
3551	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the	4397	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
3552	default loop has been initialised (C<UC> == unchecked). Their behaviour	4398	default loop has been initialised (C<UC> == unchecked). Their behaviour
…		…
3569	}	4415	}
3570		4416
3571	ev_check check;	4417	ev_check check;
3572	ev_check_init (&check, check_cb);	4418	ev_check_init (&check, check_cb);
3573	ev_check_start (EV_DEFAULT_ &check);	4419	ev_check_start (EV_DEFAULT_ &check);
3574	ev_loop (EV_DEFAULT_ 0);	4420	ev_run (EV_DEFAULT_ 0);
3575		4421
3576	=head1 EMBEDDING	4422	=head1 EMBEDDING
3577		4423
3578	Libev can (and often is) directly embedded into host	4424	Libev can (and often is) directly embedded into host
3579	applications. Examples of applications that embed it include the Deliantra	4425	applications. Examples of applications that embed it include the Deliantra
…		…
3619	ev_vars.h	4465	ev_vars.h
3620	ev_wrap.h	4466	ev_wrap.h
3621		4467
3622	ev_win32.c required on win32 platforms only	4468	ev_win32.c required on win32 platforms only
3623		4469
3624	ev_select.c only when select backend is enabled (which is enabled by default)	4470	ev_select.c only when select backend is enabled
3625	ev_poll.c only when poll backend is enabled (disabled by default)	4471	ev_poll.c only when poll backend is enabled
3626	ev_epoll.c only when the epoll backend is enabled (disabled by default)	4472	ev_epoll.c only when the epoll backend is enabled
		4473	ev_linuxaio.c only when the linux aio backend is enabled
3627	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)	4474	ev_kqueue.c only when the kqueue backend is enabled
3628	ev_port.c only when the solaris port backend is enabled (disabled by default)	4475	ev_port.c only when the solaris port backend is enabled
3629		4476
3630	F<ev.c> includes the backend files directly when enabled, so you only need	4477	F<ev.c> includes the backend files directly when enabled, so you only need
3631	to compile this single file.	4478	to compile this single file.
3632		4479
3633	=head3 LIBEVENT COMPATIBILITY API	4480	=head3 LIBEVENT COMPATIBILITY API
…		…
3671	users of libev and the libev code itself must be compiled with compatible	4518	users of libev and the libev code itself must be compiled with compatible
3672	settings.	4519	settings.
3673		4520
3674	=over 4	4521	=over 4
3675		4522
		4523	=item EV_COMPAT3 (h)
		4524
		4525	Backwards compatibility is a major concern for libev. This is why this
		4526	release of libev comes with wrappers for the functions and symbols that
		4527	have been renamed between libev version 3 and 4.
		4528
		4529	You can disable these wrappers (to test compatibility with future
		4530	versions) by defining C<EV_COMPAT3> to C<0> when compiling your
		4531	sources. This has the additional advantage that you can drop the C<struct>
		4532	from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
		4533	typedef in that case.
		4534
		4535	In some future version, the default for C<EV_COMPAT3> will become C<0>,
		4536	and in some even more future version the compatibility code will be
		4537	removed completely.
		4538
3676	=item EV_STANDALONE (h)	4539	=item EV_STANDALONE (h)
3677		4540
3678	Must always be C<1> if you do not use autoconf configuration, which	4541	Must always be C<1> if you do not use autoconf configuration, which
3679	keeps libev from including F<config.h>, and it also defines dummy	4542	keeps libev from including F<config.h>, and it also defines dummy
3680	implementations for some libevent functions (such as logging, which is not	4543	implementations for some libevent functions (such as logging, which is not
3681	supported). It will also not define any of the structs usually found in	4544	supported). It will also not define any of the structs usually found in
3682	F<event.h> that are not directly supported by the libev core alone.	4545	F<event.h> that are not directly supported by the libev core alone.
3683		4546
3684	In standalone mode, libev will still try to automatically deduce the	4547	In standalone mode, libev will still try to automatically deduce the
3685	configuration, but has to be more conservative.	4548	configuration, but has to be more conservative.
		4549
		4550	=item EV_USE_FLOOR
		4551
		4552	If defined to be C<1>, libev will use the C<floor ()> function for its
		4553	periodic reschedule calculations, otherwise libev will fall back on a
		4554	portable (slower) implementation. If you enable this, you usually have to
		4555	link against libm or something equivalent. Enabling this when the C<floor>
		4556	function is not available will fail, so the safe default is to not enable
		4557	this.
3686		4558
3687	=item EV_USE_MONOTONIC	4559	=item EV_USE_MONOTONIC
3688		4560
3689	If defined to be C<1>, libev will try to detect the availability of the	4561	If defined to be C<1>, libev will try to detect the availability of the
3690	monotonic clock option at both compile time and runtime. Otherwise no	4562	monotonic clock option at both compile time and runtime. Otherwise no
…		…
3776	If programs implement their own fd to handle mapping on win32, then this	4648	If programs implement their own fd to handle mapping on win32, then this
3777	macro can be used to override the C<close> function, useful to unregister	4649	macro can be used to override the C<close> function, useful to unregister
3778	file descriptors again. Note that the replacement function has to close	4650	file descriptors again. Note that the replacement function has to close
3779	the underlying OS handle.	4651	the underlying OS handle.
3780		4652
		4653	=item EV_USE_WSASOCKET
		4654
		4655	If defined to be C<1>, libev will use C<WSASocket> to create its internal
		4656	communication socket, which works better in some environments. Otherwise,
		4657	the normal C<socket> function will be used, which works better in other
		4658	environments.
		4659
3781	=item EV_USE_POLL	4660	=item EV_USE_POLL
3782		4661
3783	If defined to be C<1>, libev will compile in support for the C<poll>(2)	4662	If defined to be C<1>, libev will compile in support for the C<poll>(2)
3784	backend. Otherwise it will be enabled on non-win32 platforms. It	4663	backend. Otherwise it will be enabled on non-win32 platforms. It
3785	takes precedence over select.	4664	takes precedence over select.
…		…
3789	If defined to be C<1>, libev will compile in support for the Linux	4668	If defined to be C<1>, libev will compile in support for the Linux
3790	C<epoll>(7) backend. Its availability will be detected at runtime,	4669	C<epoll>(7) backend. Its availability will be detected at runtime,
3791	otherwise another method will be used as fallback. This is the preferred	4670	otherwise another method will be used as fallback. This is the preferred
3792	backend for GNU/Linux systems. If undefined, it will be enabled if the	4671	backend for GNU/Linux systems. If undefined, it will be enabled if the
3793	headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4672	headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
		4673
		4674	=item EV_USE_LINUXAIO
		4675
		4676	If defined to be C<1>, libev will compile in support for the Linux
		4677	aio backend. Due to it's currenbt limitations it has to be requested
		4678	explicitly. If undefined, it will be enabled on linux, otherwise
		4679	disabled.
3794		4680
3795	=item EV_USE_KQUEUE	4681	=item EV_USE_KQUEUE
3796		4682
3797	If defined to be C<1>, libev will compile in support for the BSD style	4683	If defined to be C<1>, libev will compile in support for the BSD style
3798	C<kqueue>(2) backend. Its actual availability will be detected at runtime,	4684	C<kqueue>(2) backend. Its actual availability will be detected at runtime,
…		…
3820	If defined to be C<1>, libev will compile in support for the Linux inotify	4706	If defined to be C<1>, libev will compile in support for the Linux inotify
3821	interface to speed up C<ev_stat> watchers. Its actual availability will	4707	interface to speed up C<ev_stat> watchers. Its actual availability will
3822	be detected at runtime. If undefined, it will be enabled if the headers	4708	be detected at runtime. If undefined, it will be enabled if the headers
3823	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4709	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
3824		4710
		4711	=item EV_NO_SMP
		4712
		4713	If defined to be C<1>, libev will assume that memory is always coherent
		4714	between threads, that is, threads can be used, but threads never run on
		4715	different cpus (or different cpu cores). This reduces dependencies
		4716	and makes libev faster.
		4717
		4718	=item EV_NO_THREADS
		4719
		4720	If defined to be C<1>, libev will assume that it will never be called from
		4721	different threads (that includes signal handlers), which is a stronger
		4722	assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
		4723	libev faster.
		4724
3825	=item EV_ATOMIC_T	4725	=item EV_ATOMIC_T
3826		4726
3827	Libev requires an integer type (suitable for storing C<0> or C<1>) whose	4727	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
3828	access is atomic with respect to other threads or signal contexts. No such	4728	access is atomic with respect to other threads or signal contexts. No
3829	type is easily found in the C language, so you can provide your own type	4729	such type is easily found in the C language, so you can provide your own
3830	that you know is safe for your purposes. It is used both for signal handler "locking"	4730	type that you know is safe for your purposes. It is used both for signal
3831	as well as for signal and thread safety in C<ev_async> watchers.	4731	handler "locking" as well as for signal and thread safety in C<ev_async>
		4732	watchers.
3832		4733
3833	In the absence of this define, libev will use C<sig_atomic_t volatile>	4734	In the absence of this define, libev will use C<sig_atomic_t volatile>
3834	(from F<signal.h>), which is usually good enough on most platforms.	4735	(from F<signal.h>), which is usually good enough on most platforms.
3835		4736
3836	=item EV_H (h)	4737	=item EV_H (h)
…		…
3863	will have the C<struct ev_loop *> as first argument, and you can create	4764	will have the C<struct ev_loop *> as first argument, and you can create
3864	additional independent event loops. Otherwise there will be no support	4765	additional independent event loops. Otherwise there will be no support
3865	for multiple event loops and there is no first event loop pointer	4766	for multiple event loops and there is no first event loop pointer
3866	argument. Instead, all functions act on the single default loop.	4767	argument. Instead, all functions act on the single default loop.
3867		4768
		4769	Note that C<EV_DEFAULT> and C<EV_DEFAULT_> will no longer provide a
		4770	default loop when multiplicity is switched off - you always have to
		4771	initialise the loop manually in this case.
		4772
3868	=item EV_MINPRI	4773	=item EV_MINPRI
3869		4774
3870	=item EV_MAXPRI	4775	=item EV_MAXPRI
3871		4776
3872	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to	4777	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
…		…
3886	EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,	4791	EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3887	EV_ASYNC_ENABLE, EV_CHILD_ENABLE.	4792	EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3888		4793
3889	If undefined or defined to be C<1> (and the platform supports it), then	4794	If undefined or defined to be C<1> (and the platform supports it), then
3890	the respective watcher type is supported. If defined to be C<0>, then it	4795	the respective watcher type is supported. If defined to be C<0>, then it
3891	is not. Disabling watcher types mainly saves codesize.	4796	is not. Disabling watcher types mainly saves code size.
3892		4797
3893	=item EV_FEATURES	4798	=item EV_FEATURES
3894		4799
3895	If you need to shave off some kilobytes of code at the expense of some	4800	If you need to shave off some kilobytes of code at the expense of some
3896	speed (but with the full API), you can define this symbol to request	4801	speed (but with the full API), you can define this symbol to request
…		…
3908	#define EV_USE_POLL 1	4813	#define EV_USE_POLL 1
3909	#define EV_CHILD_ENABLE 1	4814	#define EV_CHILD_ENABLE 1
3910	#define EV_ASYNC_ENABLE 1	4815	#define EV_ASYNC_ENABLE 1
3911		4816
3912	The actual value is a bitset, it can be a combination of the following	4817	The actual value is a bitset, it can be a combination of the following
3913	values:	4818	values (by default, all of these are enabled):
3914		4819
3915	=over 4	4820	=over 4
3916		4821
3917	=item C<1> - faster/larger code	4822	=item C<1> - faster/larger code
3918		4823
3919	Use larger code to speed up some operations.	4824	Use larger code to speed up some operations.
3920		4825
3921	Currently this is used to override some inlining decisions (enlarging the roughly	4826	Currently this is used to override some inlining decisions (enlarging the
3922	30% code size on amd64.	4827	code size by roughly 30% on amd64).
3923		4828
3924	When optimising for size, use of compiler flags such as C<-Os> with	4829	When optimising for size, use of compiler flags such as C<-Os> with
3925	gcc recommended, as well as C<-DNDEBUG>, as libev contains a number of	4830	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
3926	assertions.	4831	assertions.
3927		4832
		4833	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4834	(e.g. gcc with C<-Os>).
		4835
3928	=item C<2> - faster/larger data structures	4836	=item C<2> - faster/larger data structures
3929		4837
3930	Replaces the small 2-heap for timer management by a faster 4-heap, larger	4838	Replaces the small 2-heap for timer management by a faster 4-heap, larger
3931	hash table sizes and so on. This will usually further increase codesize	4839	hash table sizes and so on. This will usually further increase code size
3932	and can additionally have an effect on the size of data structures at	4840	and can additionally have an effect on the size of data structures at
3933	runtime.	4841	runtime.
		4842
		4843	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4844	(e.g. gcc with C<-Os>).
3934		4845
3935	=item C<4> - full API configuration	4846	=item C<4> - full API configuration
3936		4847
3937	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and	4848	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
3938	enables multiplicity (C<EV_MULTIPLICITY>=1).	4849	enables multiplicity (C<EV_MULTIPLICITY>=1).
…		…
3970	With an intelligent-enough linker (gcc+binutils are intelligent enough	4881	With an intelligent-enough linker (gcc+binutils are intelligent enough
3971	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by	4882	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
3972	your program might be left out as well - a binary starting a timer and an	4883	your program might be left out as well - a binary starting a timer and an
3973	I/O watcher then might come out at only 5Kb.	4884	I/O watcher then might come out at only 5Kb.
3974		4885
		4886	=item EV_API_STATIC
		4887
		4888	If this symbol is defined (by default it is not), then all identifiers
		4889	will have static linkage. This means that libev will not export any
		4890	identifiers, and you cannot link against libev anymore. This can be useful
		4891	when you embed libev, only want to use libev functions in a single file,
		4892	and do not want its identifiers to be visible.
		4893
		4894	To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that
		4895	wants to use libev.
		4896
		4897	This option only works when libev is compiled with a C compiler, as C++
		4898	doesn't support the required declaration syntax.
		4899
3975	=item EV_AVOID_STDIO	4900	=item EV_AVOID_STDIO
3976		4901
3977	If this is set to C<1> at compiletime, then libev will avoid using stdio	4902	If this is set to C<1> at compiletime, then libev will avoid using stdio
3978	functions (printf, scanf, perror etc.). This will increase the codesize	4903	functions (printf, scanf, perror etc.). This will increase the code size
3979	somewhat, but if your program doesn't otherwise depend on stdio and your	4904	somewhat, but if your program doesn't otherwise depend on stdio and your
3980	libc allows it, this avoids linking in the stdio library which is quite	4905	libc allows it, this avoids linking in the stdio library which is quite
3981	big.	4906	big.
3982		4907
3983	Note that error messages might become less precise when this option is	4908	Note that error messages might become less precise when this option is
…		…
3987		4912
3988	The highest supported signal number, +1 (or, the number of	4913	The highest supported signal number, +1 (or, the number of
3989	signals): Normally, libev tries to deduce the maximum number of signals	4914	signals): Normally, libev tries to deduce the maximum number of signals
3990	automatically, but sometimes this fails, in which case it can be	4915	automatically, but sometimes this fails, in which case it can be
3991	specified. Also, using a lower number than detected (C<32> should be	4916	specified. Also, using a lower number than detected (C<32> should be
3992	good for about any system in existance) can save some memory, as libev	4917	good for about any system in existence) can save some memory, as libev
3993	statically allocates some 12-24 bytes per signal number.	4918	statically allocates some 12-24 bytes per signal number.
3994		4919
3995	=item EV_PID_HASHSIZE	4920	=item EV_PID_HASHSIZE
3996		4921
3997	C<ev_child> watchers use a small hash table to distribute workload by	4922	C<ev_child> watchers use a small hash table to distribute workload by
…		…
4029	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it	4954	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
4030	will be C<0>.	4955	will be C<0>.
4031		4956
4032	=item EV_VERIFY	4957	=item EV_VERIFY
4033		4958
4034	Controls how much internal verification (see C<ev_loop_verify ()>) will	4959	Controls how much internal verification (see C<ev_verify ()>) will
4035	be done: If set to C<0>, no internal verification code will be compiled	4960	be done: If set to C<0>, no internal verification code will be compiled
4036	in. If set to C<1>, then verification code will be compiled in, but not	4961	in. If set to C<1>, then verification code will be compiled in, but not
4037	called. If set to C<2>, then the internal verification code will be	4962	called. If set to C<2>, then the internal verification code will be
4038	called once per loop, which can slow down libev. If set to C<3>, then the	4963	called once per loop, which can slow down libev. If set to C<3>, then the
4039	verification code will be called very frequently, which will slow down	4964	verification code will be called very frequently, which will slow down
…		…
4043	will be C<0>.	4968	will be C<0>.
4044		4969
4045	=item EV_COMMON	4970	=item EV_COMMON
4046		4971
4047	By default, all watchers have a C<void *data> member. By redefining	4972	By default, all watchers have a C<void *data> member. By redefining
4048	this macro to a something else you can include more and other types of	4973	this macro to something else you can include more and other types of
4049	members. You have to define it each time you include one of the files,	4974	members. You have to define it each time you include one of the files,
4050	though, and it must be identical each time.	4975	though, and it must be identical each time.
4051		4976
4052	For example, the perl EV module uses something like this:	4977	For example, the perl EV module uses something like this:
4053		4978
…		…
4122	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	5047	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4123		5048
4124	#include "ev_cpp.h"	5049	#include "ev_cpp.h"
4125	#include "ev.c"	5050	#include "ev.c"
4126		5051
4127	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	5052	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4128		5053
4129	=head2 THREADS AND COROUTINES	5054	=head2 THREADS AND COROUTINES
4130		5055
4131	=head3 THREADS	5056	=head3 THREADS
4132		5057
…		…
4183	default loop and triggering an C<ev_async> watcher from the default loop	5108	default loop and triggering an C<ev_async> watcher from the default loop
4184	watcher callback into the event loop interested in the signal.	5109	watcher callback into the event loop interested in the signal.
4185		5110
4186	=back	5111	=back
4187		5112
4188	=head4 THREAD LOCKING EXAMPLE	5113	See also L</THREAD LOCKING EXAMPLE>.
4189
4190	Here is a fictitious example of how to run an event loop in a different
4191	thread than where callbacks are being invoked and watchers are
4192	created/added/removed.
4193
4194	For a real-world example, see the C<EV::Loop::Async> perl module,
4195	which uses exactly this technique (which is suited for many high-level
4196	languages).
4197
4198	The example uses a pthread mutex to protect the loop data, a condition
4199	variable to wait for callback invocations, an async watcher to notify the
4200	event loop thread and an unspecified mechanism to wake up the main thread.
4201
4202	First, you need to associate some data with the event loop:
4203
4204	typedef struct {
4205	mutex_t lock; /* global loop lock */
4206	ev_async async_w;
4207	thread_t tid;
4208	cond_t invoke_cv;
4209	} userdata;
4210
4211	void prepare_loop (EV_P)
4212	{
4213	// for simplicity, we use a static userdata struct.
4214	static userdata u;
4215
4216	ev_async_init (&u->async_w, async_cb);
4217	ev_async_start (EV_A_ &u->async_w);
4218
4219	pthread_mutex_init (&u->lock, 0);
4220	pthread_cond_init (&u->invoke_cv, 0);
4221
4222	// now associate this with the loop
4223	ev_set_userdata (EV_A_ u);
4224	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4225	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4226
4227	// then create the thread running ev_loop
4228	pthread_create (&u->tid, 0, l_run, EV_A);
4229	}
4230
4231	The callback for the C<ev_async> watcher does nothing: the watcher is used
4232	solely to wake up the event loop so it takes notice of any new watchers
4233	that might have been added:
4234
4235	static void
4236	async_cb (EV_P_ ev_async *w, int revents)
4237	{
4238	// just used for the side effects
4239	}
4240
4241	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4242	protecting the loop data, respectively.
4243
4244	static void
4245	l_release (EV_P)
4246	{
4247	userdata *u = ev_userdata (EV_A);
4248	pthread_mutex_unlock (&u->lock);
4249	}
4250
4251	static void
4252	l_acquire (EV_P)
4253	{
4254	userdata *u = ev_userdata (EV_A);
4255	pthread_mutex_lock (&u->lock);
4256	}
4257
4258	The event loop thread first acquires the mutex, and then jumps straight
4259	into C<ev_loop>:
4260
4261	void *
4262	l_run (void *thr_arg)
4263	{
4264	struct ev_loop *loop = (struct ev_loop *)thr_arg;
4265
4266	l_acquire (EV_A);
4267	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4268	ev_loop (EV_A_ 0);
4269	l_release (EV_A);
4270
4271	return 0;
4272	}
4273
4274	Instead of invoking all pending watchers, the C<l_invoke> callback will
4275	signal the main thread via some unspecified mechanism (signals? pipe
4276	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4277	have been called (in a while loop because a) spurious wakeups are possible
4278	and b) skipping inter-thread-communication when there are no pending
4279	watchers is very beneficial):
4280
4281	static void
4282	l_invoke (EV_P)
4283	{
4284	userdata *u = ev_userdata (EV_A);
4285
4286	while (ev_pending_count (EV_A))
4287	{
4288	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4289	pthread_cond_wait (&u->invoke_cv, &u->lock);
4290	}
4291	}
4292
4293	Now, whenever the main thread gets told to invoke pending watchers, it
4294	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4295	thread to continue:
4296
4297	static void
4298	real_invoke_pending (EV_P)
4299	{
4300	userdata *u = ev_userdata (EV_A);
4301
4302	pthread_mutex_lock (&u->lock);
4303	ev_invoke_pending (EV_A);
4304	pthread_cond_signal (&u->invoke_cv);
4305	pthread_mutex_unlock (&u->lock);
4306	}
4307
4308	Whenever you want to start/stop a watcher or do other modifications to an
4309	event loop, you will now have to lock:
4310
4311	ev_timer timeout_watcher;
4312	userdata *u = ev_userdata (EV_A);
4313
4314	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4315
4316	pthread_mutex_lock (&u->lock);
4317	ev_timer_start (EV_A_ &timeout_watcher);
4318	ev_async_send (EV_A_ &u->async_w);
4319	pthread_mutex_unlock (&u->lock);
4320
4321	Note that sending the C<ev_async> watcher is required because otherwise
4322	an event loop currently blocking in the kernel will have no knowledge
4323	about the newly added timer. By waking up the loop it will pick up any new
4324	watchers in the next event loop iteration.
4325		5114
4326	=head3 COROUTINES	5115	=head3 COROUTINES
4327		5116
4328	Libev is very accommodating to coroutines ("cooperative threads"):	5117	Libev is very accommodating to coroutines ("cooperative threads"):
4329	libev fully supports nesting calls to its functions from different	5118	libev fully supports nesting calls to its functions from different
4330	coroutines (e.g. you can call C<ev_loop> on the same loop from two	5119	coroutines (e.g. you can call C<ev_run> on the same loop from two
4331	different coroutines, and switch freely between both coroutines running	5120	different coroutines, and switch freely between both coroutines running
4332	the loop, as long as you don't confuse yourself). The only exception is	5121	the loop, as long as you don't confuse yourself). The only exception is
4333	that you must not do this from C<ev_periodic> reschedule callbacks.	5122	that you must not do this from C<ev_periodic> reschedule callbacks.
4334		5123
4335	Care has been taken to ensure that libev does not keep local state inside	5124	Care has been taken to ensure that libev does not keep local state inside
4336	C<ev_loop>, and other calls do not usually allow for coroutine switches as	5125	C<ev_run>, and other calls do not usually allow for coroutine switches as
4337	they do not call any callbacks.	5126	they do not call any callbacks.
4338		5127
4339	=head2 COMPILER WARNINGS	5128	=head2 COMPILER WARNINGS
4340		5129
4341	Depending on your compiler and compiler settings, you might get no or a	5130	Depending on your compiler and compiler settings, you might get no or a
…		…
4352	maintainable.	5141	maintainable.
4353		5142
4354	And of course, some compiler warnings are just plain stupid, or simply	5143	And of course, some compiler warnings are just plain stupid, or simply
4355	wrong (because they don't actually warn about the condition their message	5144	wrong (because they don't actually warn about the condition their message
4356	seems to warn about). For example, certain older gcc versions had some	5145	seems to warn about). For example, certain older gcc versions had some
4357	warnings that resulted an extreme number of false positives. These have	5146	warnings that resulted in an extreme number of false positives. These have
4358	been fixed, but some people still insist on making code warn-free with	5147	been fixed, but some people still insist on making code warn-free with
4359	such buggy versions.	5148	such buggy versions.
4360		5149
4361	While libev is written to generate as few warnings as possible,	5150	While libev is written to generate as few warnings as possible,
4362	"warn-free" code is not a goal, and it is recommended not to build libev	5151	"warn-free" code is not a goal, and it is recommended not to build libev
…		…
4398	I suggest using suppression lists.	5187	I suggest using suppression lists.
4399		5188
4400		5189
4401	=head1 PORTABILITY NOTES	5190	=head1 PORTABILITY NOTES
4402		5191
		5192	=head2 GNU/LINUX 32 BIT LIMITATIONS
		5193
		5194	GNU/Linux is the only common platform that supports 64 bit file/large file
		5195	interfaces but I<disables> them by default.
		5196
		5197	That means that libev compiled in the default environment doesn't support
		5198	files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
		5199
		5200	Unfortunately, many programs try to work around this GNU/Linux issue
		5201	by enabling the large file API, which makes them incompatible with the
		5202	standard libev compiled for their system.
		5203
		5204	Likewise, libev cannot enable the large file API itself as this would
		5205	suddenly make it incompatible to the default compile time environment,
		5206	i.e. all programs not using special compile switches.
		5207
		5208	=head2 OS/X AND DARWIN BUGS
		5209
		5210	The whole thing is a bug if you ask me - basically any system interface
		5211	you touch is broken, whether it is locales, poll, kqueue or even the
		5212	OpenGL drivers.
		5213
		5214	=head3 C<kqueue> is buggy
		5215
		5216	The kqueue syscall is broken in all known versions - most versions support
		5217	only sockets, many support pipes.
		5218
		5219	Libev tries to work around this by not using C<kqueue> by default on this
		5220	rotten platform, but of course you can still ask for it when creating a
		5221	loop - embedding a socket-only kqueue loop into a select-based one is
		5222	probably going to work well.
		5223
		5224	=head3 C<poll> is buggy
		5225
		5226	Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
		5227	implementation by something calling C<kqueue> internally around the 10.5.6
		5228	release, so now C<kqueue> I<and> C<poll> are broken.
		5229
		5230	Libev tries to work around this by not using C<poll> by default on
		5231	this rotten platform, but of course you can still ask for it when creating
		5232	a loop.
		5233
		5234	=head3 C<select> is buggy
		5235
		5236	All that's left is C<select>, and of course Apple found a way to fuck this
		5237	one up as well: On OS/X, C<select> actively limits the number of file
		5238	descriptors you can pass in to 1024 - your program suddenly crashes when
		5239	you use more.
		5240
		5241	There is an undocumented "workaround" for this - defining
		5242	C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
		5243	work on OS/X.
		5244
		5245	=head2 SOLARIS PROBLEMS AND WORKAROUNDS
		5246
		5247	=head3 C<errno> reentrancy
		5248
		5249	The default compile environment on Solaris is unfortunately so
		5250	thread-unsafe that you can't even use components/libraries compiled
		5251	without C<-D_REENTRANT> in a threaded program, which, of course, isn't
		5252	defined by default. A valid, if stupid, implementation choice.
		5253
		5254	If you want to use libev in threaded environments you have to make sure
		5255	it's compiled with C<_REENTRANT> defined.
		5256
		5257	=head3 Event port backend
		5258
		5259	The scalable event interface for Solaris is called "event
		5260	ports". Unfortunately, this mechanism is very buggy in all major
		5261	releases. If you run into high CPU usage, your program freezes or you get
		5262	a large number of spurious wakeups, make sure you have all the relevant
		5263	and latest kernel patches applied. No, I don't know which ones, but there
		5264	are multiple ones to apply, and afterwards, event ports actually work
		5265	great.
		5266
		5267	If you can't get it to work, you can try running the program by setting
		5268	the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
		5269	C<select> backends.
		5270
		5271	=head2 AIX POLL BUG
		5272
		5273	AIX unfortunately has a broken C<poll.h> header. Libev works around
		5274	this by trying to avoid the poll backend altogether (i.e. it's not even
		5275	compiled in), which normally isn't a big problem as C<select> works fine
		5276	with large bitsets on AIX, and AIX is dead anyway.
		5277
4403	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS	5278	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
		5279
		5280	=head3 General issues
4404		5281
4405	Win32 doesn't support any of the standards (e.g. POSIX) that libev	5282	Win32 doesn't support any of the standards (e.g. POSIX) that libev
4406	requires, and its I/O model is fundamentally incompatible with the POSIX	5283	requires, and its I/O model is fundamentally incompatible with the POSIX
4407	model. Libev still offers limited functionality on this platform in	5284	model. Libev still offers limited functionality on this platform in
4408	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	5285	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4409	descriptors. This only applies when using Win32 natively, not when using	5286	descriptors. This only applies when using Win32 natively, not when using
4410	e.g. cygwin.	5287	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
		5288	as every compiler comes with a slightly differently broken/incompatible
		5289	environment.
4411		5290
4412	Lifting these limitations would basically require the full	5291	Lifting these limitations would basically require the full
4413	re-implementation of the I/O system. If you are into these kinds of	5292	re-implementation of the I/O system. If you are into this kind of thing,
4414	things, then note that glib does exactly that for you in a very portable	5293	then note that glib does exactly that for you in a very portable way (note
4415	way (note also that glib is the slowest event library known to man).	5294	also that glib is the slowest event library known to man).
4416		5295
4417	There is no supported compilation method available on windows except	5296	There is no supported compilation method available on windows except
4418	embedding it into other applications.	5297	embedding it into other applications.
4419		5298
4420	Sensible signal handling is officially unsupported by Microsoft - libev	5299	Sensible signal handling is officially unsupported by Microsoft - libev
…		…
4448	you do I<not> compile the F<ev.c> or any other embedded source files!):	5327	you do I<not> compile the F<ev.c> or any other embedded source files!):
4449		5328
4450	#include "evwrap.h"	5329	#include "evwrap.h"
4451	#include "ev.c"	5330	#include "ev.c"
4452		5331
4453	=over 4
4454
4455	=item The winsocket select function	5332	=head3 The winsocket C<select> function
4456		5333
4457	The winsocket C<select> function doesn't follow POSIX in that it	5334	The winsocket C<select> function doesn't follow POSIX in that it
4458	requires socket I<handles> and not socket I<file descriptors> (it is	5335	requires socket I<handles> and not socket I<file descriptors> (it is
4459	also extremely buggy). This makes select very inefficient, and also	5336	also extremely buggy). This makes select very inefficient, and also
4460	requires a mapping from file descriptors to socket handles (the Microsoft	5337	requires a mapping from file descriptors to socket handles (the Microsoft
…		…
4469	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */	5346	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4470		5347
4471	Note that winsockets handling of fd sets is O(n), so you can easily get a	5348	Note that winsockets handling of fd sets is O(n), so you can easily get a
4472	complexity in the O(n²) range when using win32.	5349	complexity in the O(n²) range when using win32.
4473		5350
4474	=item Limited number of file descriptors	5351	=head3 Limited number of file descriptors
4475		5352
4476	Windows has numerous arbitrary (and low) limits on things.	5353	Windows has numerous arbitrary (and low) limits on things.
4477		5354
4478	Early versions of winsocket's select only supported waiting for a maximum	5355	Early versions of winsocket's select only supported waiting for a maximum
4479	of C<64> handles (probably owning to the fact that all windows kernels	5356	of C<64> handles (probably owning to the fact that all windows kernels
…		…
4494	runtime libraries. This might get you to about C<512> or C<2048> sockets	5371	runtime libraries. This might get you to about C<512> or C<2048> sockets
4495	(depending on windows version and/or the phase of the moon). To get more,	5372	(depending on windows version and/or the phase of the moon). To get more,
4496	you need to wrap all I/O functions and provide your own fd management, but	5373	you need to wrap all I/O functions and provide your own fd management, but
4497	the cost of calling select (O(n²)) will likely make this unworkable.	5374	the cost of calling select (O(n²)) will likely make this unworkable.
4498		5375
4499	=back
4500
4501	=head2 PORTABILITY REQUIREMENTS	5376	=head2 PORTABILITY REQUIREMENTS
4502		5377
4503	In addition to a working ISO-C implementation and of course the	5378	In addition to a working ISO-C implementation and of course the
4504	backend-specific APIs, libev relies on a few additional extensions:	5379	backend-specific APIs, libev relies on a few additional extensions:
4505		5380
…		…
4511	Libev assumes not only that all watcher pointers have the same internal	5386	Libev assumes not only that all watcher pointers have the same internal
4512	structure (guaranteed by POSIX but not by ISO C for example), but it also	5387	structure (guaranteed by POSIX but not by ISO C for example), but it also
4513	assumes that the same (machine) code can be used to call any watcher	5388	assumes that the same (machine) code can be used to call any watcher
4514	callback: The watcher callbacks have different type signatures, but libev	5389	callback: The watcher callbacks have different type signatures, but libev
4515	calls them using an C<ev_watcher *> internally.	5390	calls them using an C<ev_watcher *> internally.
		5391
		5392	=item null pointers and integer zero are represented by 0 bytes
		5393
		5394	Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and
		5395	relies on this setting pointers and integers to null.
		5396
		5397	=item pointer accesses must be thread-atomic
		5398
		5399	Accessing a pointer value must be atomic, it must both be readable and
		5400	writable in one piece - this is the case on all current architectures.
4516		5401
4517	=item C<sig_atomic_t volatile> must be thread-atomic as well	5402	=item C<sig_atomic_t volatile> must be thread-atomic as well
4518		5403
4519	The type C<sig_atomic_t volatile> (or whatever is defined as	5404	The type C<sig_atomic_t volatile> (or whatever is defined as
4520	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different	5405	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
…		…
4529	thread" or will block signals process-wide, both behaviours would	5414	thread" or will block signals process-wide, both behaviours would
4530	be compatible with libev. Interaction between C<sigprocmask> and	5415	be compatible with libev. Interaction between C<sigprocmask> and
4531	C<pthread_sigmask> could complicate things, however.	5416	C<pthread_sigmask> could complicate things, however.
4532		5417
4533	The most portable way to handle signals is to block signals in all threads	5418	The most portable way to handle signals is to block signals in all threads
4534	except the initial one, and run the default loop in the initial thread as	5419	except the initial one, and run the signal handling loop in the initial
4535	well.	5420	thread as well.
4536		5421
4537	=item C<long> must be large enough for common memory allocation sizes	5422	=item C<long> must be large enough for common memory allocation sizes
4538		5423
4539	To improve portability and simplify its API, libev uses C<long> internally	5424	To improve portability and simplify its API, libev uses C<long> internally
4540	instead of C<size_t> when allocating its data structures. On non-POSIX	5425	instead of C<size_t> when allocating its data structures. On non-POSIX
…		…
4543	watchers.	5428	watchers.
4544		5429
4545	=item C<double> must hold a time value in seconds with enough accuracy	5430	=item C<double> must hold a time value in seconds with enough accuracy
4546		5431
4547	The type C<double> is used to represent timestamps. It is required to	5432	The type C<double> is used to represent timestamps. It is required to
4548	have at least 51 bits of mantissa (and 9 bits of exponent), which is good	5433	have at least 51 bits of mantissa (and 9 bits of exponent), which is
4549	enough for at least into the year 4000. This requirement is fulfilled by	5434	good enough for at least into the year 4000 with millisecond accuracy
		5435	(the design goal for libev). This requirement is overfulfilled by
4550	implementations implementing IEEE 754, which is basically all existing	5436	implementations using IEEE 754, which is basically all existing ones.
		5437
4551	ones. With IEEE 754 doubles, you get microsecond accuracy until at least	5438	With IEEE 754 doubles, you get microsecond accuracy until at least the
4552	2200.	5439	year 2255 (and millisecond accuracy till the year 287396 - by then, libev
		5440	is either obsolete or somebody patched it to use C<long double> or
		5441	something like that, just kidding).
4553		5442
4554	=back	5443	=back
4555		5444
4556	If you know of other additional requirements drop me a note.	5445	If you know of other additional requirements drop me a note.
4557		5446
…		…
4619	=item Processing ev_async_send: O(number_of_async_watchers)	5508	=item Processing ev_async_send: O(number_of_async_watchers)
4620		5509
4621	=item Processing signals: O(max_signal_number)	5510	=item Processing signals: O(max_signal_number)
4622		5511
4623	Sending involves a system call I<iff> there were no other C<ev_async_send>	5512	Sending involves a system call I<iff> there were no other C<ev_async_send>
4624	calls in the current loop iteration. Checking for async and signal events	5513	calls in the current loop iteration and the loop is currently
		5514	blocked. Checking for async and signal events involves iterating over all
4625	involves iterating over all running async watchers or all signal numbers.	5515	running async watchers or all signal numbers.
4626		5516
4627	=back	5517	=back
4628		5518
4629		5519
4630	=head1 PORTING FROM LIBEV 3.X TO 4.X	5520	=head1 PORTING FROM LIBEV 3.X TO 4.X
4631		5521
4632	The major version 4 introduced some minor incompatible changes to the API.	5522	The major version 4 introduced some incompatible changes to the API.
4633		5523
4634	At the moment, the C<ev.h> header file tries to implement superficial	5524	At the moment, the C<ev.h> header file provides compatibility definitions
4635	compatibility, so most programs should still compile. Those might be	5525	for all changes, so most programs should still compile. The compatibility
4636	removed in later versions of libev, so better update early than late.	5526	layer might be removed in later versions of libev, so better update to the
		5527	new API early than late.
4637		5528
4638	=over 4	5529	=over 4
4639		5530
4640	=item C<ev_loop_count> renamed to C<ev_iteration>	5531	=item C<EV_COMPAT3> backwards compatibility mechanism
4641		5532
4642	=item C<ev_loop_depth> renamed to C<ev_depth>	5533	The backward compatibility mechanism can be controlled by
		5534	C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
		5535	section.
4643		5536
4644	=item C<ev_loop_verify> renamed to C<ev_verify>	5537	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
		5538
		5539	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
		5540
		5541	ev_loop_destroy (EV_DEFAULT_UC);
		5542	ev_loop_fork (EV_DEFAULT);
		5543
		5544	=item function/symbol renames
		5545
		5546	A number of functions and symbols have been renamed:
		5547
		5548	ev_loop => ev_run
		5549	EVLOOP_NONBLOCK => EVRUN_NOWAIT
		5550	EVLOOP_ONESHOT => EVRUN_ONCE
		5551
		5552	ev_unloop => ev_break
		5553	EVUNLOOP_CANCEL => EVBREAK_CANCEL
		5554	EVUNLOOP_ONE => EVBREAK_ONE
		5555	EVUNLOOP_ALL => EVBREAK_ALL
		5556
		5557	EV_TIMEOUT => EV_TIMER
		5558
		5559	ev_loop_count => ev_iteration
		5560	ev_loop_depth => ev_depth
		5561	ev_loop_verify => ev_verify
4645		5562
4646	Most functions working on C<struct ev_loop> objects don't have an	5563	Most functions working on C<struct ev_loop> objects don't have an
4647	C<ev_loop_> prefix, so it was removed. Note that C<ev_loop_fork> is	5564	C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
		5565	associated constants have been renamed to not collide with the C<struct
		5566	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
		5567	as all other watcher types. Note that C<ev_loop_fork> is still called
4648	still called C<ev_loop_fork> because it would otherwise clash with the	5568	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4649	C<ev_fork> typedef.	5569	typedef.
4650
4651	=item C<EV_TIMEOUT> renamed to C<EV_TIMER> in C<revents>
4652
4653	This is a simple rename - all other watcher types use their name
4654	as revents flag, and now C<ev_timer> does, too.
4655
4656	Both C<EV_TIMER> and C<EV_TIMEOUT> symbols were present in 3.x versions
4657	and continue to be present for the forseeable future, so this is mostly a
4658	documentation change.
4659		5570
4660	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>	5571	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4661		5572
4662	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different	5573	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4663	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile	5574	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
…		…
4670		5581
4671	=over 4	5582	=over 4
4672		5583
4673	=item active	5584	=item active
4674		5585
4675	A watcher is active as long as it has been started (has been attached to	5586	A watcher is active as long as it has been started and not yet stopped.
4676	an event loop) but not yet stopped (disassociated from the event loop).	5587	See L</WATCHER STATES> for details.
4677		5588
4678	=item application	5589	=item application
4679		5590
4680	In this document, an application is whatever is using libev.	5591	In this document, an application is whatever is using libev.
		5592
		5593	=item backend
		5594
		5595	The part of the code dealing with the operating system interfaces.
4681		5596
4682	=item callback	5597	=item callback
4683		5598
4684	The address of a function that is called when some event has been	5599	The address of a function that is called when some event has been
4685	detected. Callbacks are being passed the event loop, the watcher that	5600	detected. Callbacks are being passed the event loop, the watcher that
4686	received the event, and the actual event bitset.	5601	received the event, and the actual event bitset.
4687		5602
4688	=item callback invocation	5603	=item callback/watcher invocation
4689		5604
4690	The act of calling the callback associated with a watcher.	5605	The act of calling the callback associated with a watcher.
4691		5606
4692	=item event	5607	=item event
4693		5608
…		…
4712	The model used to describe how an event loop handles and processes	5627	The model used to describe how an event loop handles and processes
4713	watchers and events.	5628	watchers and events.
4714		5629
4715	=item pending	5630	=item pending
4716		5631
4717	A watcher is pending as soon as the corresponding event has been detected,	5632	A watcher is pending as soon as the corresponding event has been
4718	and stops being pending as soon as the watcher will be invoked or its	5633	detected. See L</WATCHER STATES> for details.
4719	pending status is explicitly cleared by the application.
4720
4721	A watcher can be pending, but not active. Stopping a watcher also clears
4722	its pending status.
4723		5634
4724	=item real time	5635	=item real time
4725		5636
4726	The physical time that is observed. It is apparently strictly monotonic :)	5637	The physical time that is observed. It is apparently strictly monotonic :)
4727		5638
4728	=item wall-clock time	5639	=item wall-clock time
4729		5640
4730	The time and date as shown on clocks. Unlike real time, it can actually	5641	The time and date as shown on clocks. Unlike real time, it can actually
4731	be wrong and jump forwards and backwards, e.g. when the you adjust your	5642	be wrong and jump forwards and backwards, e.g. when you adjust your
4732	clock.	5643	clock.
4733		5644
4734	=item watcher	5645	=item watcher
4735		5646
4736	A data structure that describes interest in certain events. Watchers need	5647	A data structure that describes interest in certain events. Watchers need
4737	to be started (attached to an event loop) before they can receive events.	5648	to be started (attached to an event loop) before they can receive events.
4738		5649
4739	=item watcher invocation
4740
4741	The act of calling the callback associated with a watcher.
4742
4743	=back	5650	=back
4744		5651
4745	=head1 AUTHOR	5652	=head1 AUTHOR
4746		5653
4747	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.	5654	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
		5655	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
4748		5656

Diff Legend

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