ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.297 by root, Tue Jun 29 11:49:02 2010 UTC vs.
Revision 1.436 by root, Sun Oct 11 15:46:42 2015 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
…		…
124	this argument.	134	this argument.
125		135
126	=head2 TIME REPRESENTATION	136	=head2 TIME REPRESENTATION
127		137
128	Libev represents time as a single floating point number, representing	138	Libev represents time as a single floating point number, representing
129	the (fractional) number of seconds since the (POSIX) epoch (in practise	139	the (fractional) number of seconds since the (POSIX) epoch (in practice
130	somewhere near the beginning of 1970, details are complicated, don't	140	somewhere near the beginning of 1970, details are complicated, don't
131	ask). This type is called C<ev_tstamp>, which is what you should use	141	ask). This type is called C<ev_tstamp>, which is what you should use
132	too. It usually aliases to the C<double> type in C. When you need to do	142	too. It usually aliases to the C<double> type in C. When you need to do
133	any calculations on it, you should treat it as some floating point value.	143	any calculations on it, you should treat it as some floating point value.
134		144
…		…
165		175
166	=item ev_tstamp ev_time ()	176	=item ev_tstamp ev_time ()
167		177
168	Returns the current time as libev would use it. Please note that the	178	Returns the current time as libev would use it. Please note that the
169	C<ev_now> function is usually faster and also often returns the timestamp	179	C<ev_now> function is usually faster and also often returns the timestamp
170	you actually want to know.	180	you actually want to know. Also interesting is the combination of
		181	C<ev_now_update> and C<ev_now>.
171		182
172	=item ev_sleep (ev_tstamp interval)	183	=item ev_sleep (ev_tstamp interval)
173		184
174	Sleep for the given interval: The current thread will be blocked until	185	Sleep for the given interval: The current thread will be blocked
175	either it is interrupted or the given time interval has passed. Basically	186	until either it is interrupted or the given time interval has
		187	passed (approximately - it might return a bit earlier even if not
		188	interrupted). Returns immediately if C<< interval <= 0 >>.
		189
176	this is a sub-second-resolution C<sleep ()>.	190	Basically this is a sub-second-resolution C<sleep ()>.
		191
		192	The range of the C<interval> is limited - libev only guarantees to work
		193	with sleep times of up to one day (C<< interval <= 86400 >>).
177		194
178	=item int ev_version_major ()	195	=item int ev_version_major ()
179		196
180	=item int ev_version_minor ()	197	=item int ev_version_minor ()
181		198
…		…
192	as this indicates an incompatible change. Minor versions are usually	209	as this indicates an incompatible change. Minor versions are usually
193	compatible to older versions, so a larger minor version alone is usually	210	compatible to older versions, so a larger minor version alone is usually
194	not a problem.	211	not a problem.
195		212
196	Example: Make sure we haven't accidentally been linked against the wrong	213	Example: Make sure we haven't accidentally been linked against the wrong
197	version (note, however, that this will not detect ABI mismatches :).	214	version (note, however, that this will not detect other ABI mismatches,
		215	such as LFS or reentrancy).
198		216
199	assert (("libev version mismatch",	217	assert (("libev version mismatch",
200	ev_version_major () == EV_VERSION_MAJOR	218	ev_version_major () == EV_VERSION_MAJOR
201	&& ev_version_minor () >= EV_VERSION_MINOR));	219	&& ev_version_minor () >= EV_VERSION_MINOR));
202		220
…		…
213	assert (("sorry, no epoll, no sex",	231	assert (("sorry, no epoll, no sex",
214	ev_supported_backends () & EVBACKEND_EPOLL));	232	ev_supported_backends () & EVBACKEND_EPOLL));
215		233
216	=item unsigned int ev_recommended_backends ()	234	=item unsigned int ev_recommended_backends ()
217		235
218	Return the set of all backends compiled into this binary of libev and also	236	Return the set of all backends compiled into this binary of libev and
219	recommended for this platform. This set is often smaller than the one	237	also recommended for this platform, meaning it will work for most file
		238	descriptor types. This set is often smaller than the one returned by
220	returned by C<ev_supported_backends>, as for example kqueue is broken on	239	C<ev_supported_backends>, as for example kqueue is broken on most BSDs
221	most BSDs and will not be auto-detected unless you explicitly request it	240	and will not be auto-detected unless you explicitly request it (assuming
222	(assuming you know what you are doing). This is the set of backends that	241	you know what you are doing). This is the set of backends that libev will
223	libev will probe for if you specify no backends explicitly.	242	probe for if you specify no backends explicitly.
224		243
225	=item unsigned int ev_embeddable_backends ()	244	=item unsigned int ev_embeddable_backends ()
226		245
227	Returns the set of backends that are embeddable in other event loops. This	246	Returns the set of backends that are embeddable in other event loops. This
228	is the theoretical, all-platform, value. To find which backends	247	value is platform-specific but can include backends not available on the
229	might be supported on the current system, you would need to look at	248	current system. To find which embeddable backends might be supported on
230	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	249	the current system, you would need to look at C<ev_embeddable_backends ()
231	recommended ones.	250	& ev_supported_backends ()>, likewise for recommended ones.
232		251
233	See the description of C<ev_embed> watchers for more info.	252	See the description of C<ev_embed> watchers for more info.
234		253
235	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]	254	=item ev_set_allocator (void *(*cb)(void *ptr, long size) throw ())
236		255
237	Sets the allocation function to use (the prototype is similar - the	256	Sets the allocation function to use (the prototype is similar - the
238	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is	257	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
239	used to allocate and free memory (no surprises here). If it returns zero	258	used to allocate and free memory (no surprises here). If it returns zero
240	when memory needs to be allocated (C<size != 0>), the library might abort	259	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
266	}	285	}
267		286
268	...	287	...
269	ev_set_allocator (persistent_realloc);	288	ev_set_allocator (persistent_realloc);
270		289
271	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]	290	=item ev_set_syserr_cb (void (*cb)(const char *msg) throw ())
272		291
273	Set the callback function to call on a retryable system call error (such	292	Set the callback function to call on a retryable system call error (such
274	as failed select, poll, epoll_wait). The message is a printable string	293	as failed select, poll, epoll_wait). The message is a printable string
275	indicating the system call or subsystem causing the problem. If this	294	indicating the system call or subsystem causing the problem. If this
276	callback is set, then libev will expect it to remedy the situation, no	295	callback is set, then libev will expect it to remedy the situation, no
…		…
288	}	307	}
289		308
290	...	309	...
291	ev_set_syserr_cb (fatal_error);	310	ev_set_syserr_cb (fatal_error);
292		311
		312	=item ev_feed_signal (int signum)
		313
		314	This function can be used to "simulate" a signal receive. It is completely
		315	safe to call this function at any time, from any context, including signal
		316	handlers or random threads.
		317
		318	Its main use is to customise signal handling in your process, especially
		319	in the presence of threads. For example, you could block signals
		320	by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
		321	creating any loops), and in one thread, use C<sigwait> or any other
		322	mechanism to wait for signals, then "deliver" them to libev by calling
		323	C<ev_feed_signal>.
		324
293	=back	325	=back
294		326
295	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	327	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
296		328
297	An event loop is described by a C<struct ev_loop *> (the C<struct>	329	An event loop is described by a C<struct ev_loop *> (the C<struct> is
298	is I<not> optional in this case, as there is also an C<ev_loop>	330	I<not> optional in this case unless libev 3 compatibility is disabled, as
299	I<function>).	331	libev 3 had an C<ev_loop> function colliding with the struct name).
300		332
301	The library knows two types of such loops, the I<default> loop, which	333	The library knows two types of such loops, the I<default> loop, which
302	supports signals and child events, and dynamically created loops which do	334	supports child process events, and dynamically created event loops which
303	not.	335	do not.
304		336
305	=over 4	337	=over 4
306		338
307	=item struct ev_loop *ev_default_loop (unsigned int flags)	339	=item struct ev_loop *ev_default_loop (unsigned int flags)
308		340
309	This will initialise the default event loop if it hasn't been initialised	341	This returns the "default" event loop object, which is what you should
310	yet and return it. If the default loop could not be initialised, returns	342	normally use when you just need "the event loop". Event loop objects and
311	false. If it already was initialised it simply returns it (and ignores the	343	the C<flags> parameter are described in more detail in the entry for
312	flags. If that is troubling you, check C<ev_backend ()> afterwards).	344	C<ev_loop_new>.
		345
		346	If the default loop is already initialised then this function simply
		347	returns it (and ignores the flags. If that is troubling you, check
		348	C<ev_backend ()> afterwards). Otherwise it will create it with the given
		349	flags, which should almost always be C<0>, unless the caller is also the
		350	one calling C<ev_run> or otherwise qualifies as "the main program".
313		351
314	If you don't know what event loop to use, use the one returned from this	352	If you don't know what event loop to use, use the one returned from this
315	function.	353	function (or via the C<EV_DEFAULT> macro).
316		354
317	Note that this function is I<not> thread-safe, so if you want to use it	355	Note that this function is I<not> thread-safe, so if you want to use it
318	from multiple threads, you have to lock (note also that this is unlikely,	356	from multiple threads, you have to employ some kind of mutex (note also
319	as loops cannot be shared easily between threads anyway).	357	that this case is unlikely, as loops cannot be shared easily between
		358	threads anyway).
320		359
321	The default loop is the only loop that can handle C<ev_signal> and	360	The default loop is the only loop that can handle C<ev_child> watchers,
322	C<ev_child> watchers, and to do this, it always registers a handler	361	and to do this, it always registers a handler for C<SIGCHLD>. If this is
323	for C<SIGCHLD>. If this is a problem for your application you can either	362	a problem for your application you can either create a dynamic loop with
324	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you	363	C<ev_loop_new> which doesn't do that, or you can simply overwrite the
325	can simply overwrite the C<SIGCHLD> signal handler I<after> calling	364	C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
326	C<ev_default_init>.	365
		366	Example: This is the most typical usage.
		367
		368	if (!ev_default_loop (0))
		369	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
		370
		371	Example: Restrict libev to the select and poll backends, and do not allow
		372	environment settings to be taken into account:
		373
		374	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
		375
		376	=item struct ev_loop *ev_loop_new (unsigned int flags)
		377
		378	This will create and initialise a new event loop object. If the loop
		379	could not be initialised, returns false.
		380
		381	This function is thread-safe, and one common way to use libev with
		382	threads is indeed to create one loop per thread, and using the default
		383	loop in the "main" or "initial" thread.
327		384
328	The flags argument can be used to specify special behaviour or specific	385	The flags argument can be used to specify special behaviour or specific
329	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	386	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
330		387
331	The following flags are supported:	388	The following flags are supported:
…		…
341		398
342	If this flag bit is or'ed into the flag value (or the program runs setuid	399	If this flag bit is or'ed into the flag value (or the program runs setuid
343	or setgid) then libev will I<not> look at the environment variable	400	or setgid) then libev will I<not> look at the environment variable
344	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will	401	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
345	override the flags completely if it is found in the environment. This is	402	override the flags completely if it is found in the environment. This is
346	useful to try out specific backends to test their performance, or to work	403	useful to try out specific backends to test their performance, to work
347	around bugs.	404	around bugs, or to make libev threadsafe (accessing environment variables
		405	cannot be done in a threadsafe way, but usually it works if no other
		406	thread modifies them).
348		407
349	=item C<EVFLAG_FORKCHECK>	408	=item C<EVFLAG_FORKCHECK>
350		409
351	Instead of calling C<ev_loop_fork> manually after a fork, you can also	410	Instead of calling C<ev_loop_fork> manually after a fork, you can also
352	make libev check for a fork in each iteration by enabling this flag.	411	make libev check for a fork in each iteration by enabling this flag.
…		…
357	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence	416	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
358	without a system call and thus I<very> fast, but my GNU/Linux system also has	417	without a system call and thus I<very> fast, but my GNU/Linux system also has
359	C<pthread_atfork> which is even faster).	418	C<pthread_atfork> which is even faster).
360		419
361	The big advantage of this flag is that you can forget about fork (and	420	The big advantage of this flag is that you can forget about fork (and
362	forget about forgetting to tell libev about forking) when you use this	421	forget about forgetting to tell libev about forking, although you still
363	flag.	422	have to ignore C<SIGPIPE>) when you use this flag.
364		423
365	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>	424	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
366	environment variable.	425	environment variable.
367		426
368	=item C<EVFLAG_NOINOTIFY>	427	=item C<EVFLAG_NOINOTIFY>
369		428
370	When this flag is specified, then libev will not attempt to use the	429	When this flag is specified, then libev will not attempt to use the
371	I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and	430	I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
372	testing, this flag can be useful to conserve inotify file descriptors, as	431	testing, this flag can be useful to conserve inotify file descriptors, as
373	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.	432	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374		433
375	=item C<EVFLAG_SIGNALFD>	434	=item C<EVFLAG_SIGNALFD>
376		435
377	When this flag is specified, then libev will attempt to use the	436	When this flag is specified, then libev will attempt to use the
378	I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API	437	I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API
379	delivers signals synchronously, which makes it both faster and might make	438	delivers signals synchronously, which makes it both faster and might make
380	it possible to get the queued signal data. It can also simplify signal	439	it possible to get the queued signal data. It can also simplify signal
381	handling with threads, as long as you properly block signals in your	440	handling with threads, as long as you properly block signals in your
382	threads that are not interested in handling them.	441	threads that are not interested in handling them.
383		442
384	Signalfd will not be used by default as this changes your signal mask, and	443	Signalfd will not be used by default as this changes your signal mask, and
385	there are a lot of shoddy libraries and programs (glib's threadpool for	444	there are a lot of shoddy libraries and programs (glib's threadpool for
386	example) that can't properly initialise their signal masks.	445	example) that can't properly initialise their signal masks.
		446
		447	=item C<EVFLAG_NOSIGMASK>
		448
		449	When this flag is specified, then libev will avoid to modify the signal
		450	mask. Specifically, this means you have to make sure signals are unblocked
		451	when you want to receive them.
		452
		453	This behaviour is useful when you want to do your own signal handling, or
		454	want to handle signals only in specific threads and want to avoid libev
		455	unblocking the signals.
		456
		457	It's also required by POSIX in a threaded program, as libev calls
		458	C<sigprocmask>, whose behaviour is officially unspecified.
		459
		460	This flag's behaviour will become the default in future versions of libev.
387		461
388	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	462	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
389		463
390	This is your standard select(2) backend. Not I<completely> standard, as	464	This is your standard select(2) backend. Not I<completely> standard, as
391	libev tries to roll its own fd_set with no limits on the number of fds,	465	libev tries to roll its own fd_set with no limits on the number of fds,
…		…
419	=item C<EVBACKEND_EPOLL> (value 4, Linux)	493	=item C<EVBACKEND_EPOLL> (value 4, Linux)
420		494
421	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9	495	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
422	kernels).	496	kernels).
423		497
424	For few fds, this backend is a bit little slower than poll and select,	498	For few fds, this backend is a bit little slower than poll and select, but
425	but it scales phenomenally better. While poll and select usually scale	499	it scales phenomenally better. While poll and select usually scale like
426	like O(total_fds) where n is the total number of fds (or the highest fd),	500	O(total_fds) where total_fds is the total number of fds (or the highest
427	epoll scales either O(1) or O(active_fds).	501	fd), epoll scales either O(1) or O(active_fds).
428		502
429	The epoll mechanism deserves honorable mention as the most misdesigned	503	The epoll mechanism deserves honorable mention as the most misdesigned
430	of the more advanced event mechanisms: mere annoyances include silently	504	of the more advanced event mechanisms: mere annoyances include silently
431	dropping file descriptors, requiring a system call per change per file	505	dropping file descriptors, requiring a system call per change per file
432	descriptor (and unnecessary guessing of parameters), problems with dup and	506	descriptor (and unnecessary guessing of parameters), problems with dup,
		507	returning before the timeout value, resulting in additional iterations
		508	(and only giving 5ms accuracy while select on the same platform gives
433	so on. The biggest issue is fork races, however - if a program forks then	509	0.1ms) and so on. The biggest issue is fork races, however - if a program
434	I<both> parent and child process have to recreate the epoll set, which can	510	forks then I<both> parent and child process have to recreate the epoll
435	take considerable time (one syscall per file descriptor) and is of course	511	set, which can take considerable time (one syscall per file descriptor)
436	hard to detect.	512	and is of course hard to detect.
437		513
438	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	514	Epoll is also notoriously buggy - embedding epoll fds I<should> work,
439	of course I<doesn't>, and epoll just loves to report events for totally	515	but of course I<doesn't>, and epoll just loves to report events for
440	I<different> file descriptors (even already closed ones, so one cannot	516	totally I<different> file descriptors (even already closed ones, so
441	even remove them from the set) than registered in the set (especially	517	one cannot even remove them from the set) than registered in the set
442	on SMP systems). Libev tries to counter these spurious notifications by	518	(especially on SMP systems). Libev tries to counter these spurious
443	employing an additional generation counter and comparing that against the	519	notifications by employing an additional generation counter and comparing
444	events to filter out spurious ones, recreating the set when required.	520	that against the events to filter out spurious ones, recreating the set
		521	when required. Epoll also erroneously rounds down timeouts, but gives you
		522	no way to know when and by how much, so sometimes you have to busy-wait
		523	because epoll returns immediately despite a nonzero timeout. And last
		524	not least, it also refuses to work with some file descriptors which work
		525	perfectly fine with C<select> (files, many character devices...).
		526
		527	Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
		528	cobbled together in a hurry, no thought to design or interaction with
		529	others. Oh, the pain, will it ever stop...
445		530
446	While stopping, setting and starting an I/O watcher in the same iteration	531	While stopping, setting and starting an I/O watcher in the same iteration
447	will result in some caching, there is still a system call per such	532	will result in some caching, there is still a system call per such
448	incident (because the same I<file descriptor> could point to a different	533	incident (because the same I<file descriptor> could point to a different
449	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	534	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
486		571
487	It scales in the same way as the epoll backend, but the interface to the	572	It scales in the same way as the epoll backend, but the interface to the
488	kernel is more efficient (which says nothing about its actual speed, of	573	kernel is more efficient (which says nothing about its actual speed, of
489	course). While stopping, setting and starting an I/O watcher does never	574	course). While stopping, setting and starting an I/O watcher does never
490	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to	575	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
491	two event changes per incident. Support for C<fork ()> is very bad (but	576	two event changes per incident. Support for C<fork ()> is very bad (you
492	sane, unlike epoll) and it drops fds silently in similarly hard-to-detect	577	might have to leak fd's on fork, but it's more sane than epoll) and it
493	cases	578	drops fds silently in similarly hard-to-detect cases.
494		579
495	This backend usually performs well under most conditions.	580	This backend usually performs well under most conditions.
496		581
497	While nominally embeddable in other event loops, this doesn't work	582	While nominally embeddable in other event loops, this doesn't work
498	everywhere, so you might need to test for this. And since it is broken	583	everywhere, so you might need to test for this. And since it is broken
…		…
515	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	600	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
516		601
517	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	602	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
518	it's really slow, but it still scales very well (O(active_fds)).	603	it's really slow, but it still scales very well (O(active_fds)).
519		604
520	Please note that Solaris event ports can deliver a lot of spurious
521	notifications, so you need to use non-blocking I/O or other means to avoid
522	blocking when no data (or space) is available.
523
524	While this backend scales well, it requires one system call per active	605	While this backend scales well, it requires one system call per active
525	file descriptor per loop iteration. For small and medium numbers of file	606	file descriptor per loop iteration. For small and medium numbers of file
526	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	607	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
527	might perform better.	608	might perform better.
528		609
529	On the positive side, with the exception of the spurious readiness	610	On the positive side, this backend actually performed fully to
530	notifications, this backend actually performed fully to specification
531	in all tests and is fully embeddable, which is a rare feat among the	611	specification in all tests and is fully embeddable, which is a rare feat
532	OS-specific backends (I vastly prefer correctness over speed hacks).	612	among the OS-specific backends (I vastly prefer correctness over speed
		613	hacks).
		614
		615	On the negative side, the interface is I<bizarre> - so bizarre that
		616	even sun itself gets it wrong in their code examples: The event polling
		617	function sometimes returns events to the caller even though an error
		618	occurred, but with no indication whether it has done so or not (yes, it's
		619	even documented that way) - deadly for edge-triggered interfaces where you
		620	absolutely have to know whether an event occurred or not because you have
		621	to re-arm the watcher.
		622
		623	Fortunately libev seems to be able to work around these idiocies.
533		624
534	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	625	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
535	C<EVBACKEND_POLL>.	626	C<EVBACKEND_POLL>.
536		627
537	=item C<EVBACKEND_ALL>	628	=item C<EVBACKEND_ALL>
538		629
539	Try all backends (even potentially broken ones that wouldn't be tried	630	Try all backends (even potentially broken ones that wouldn't be tried
540	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	631	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
541	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	632	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
542		633
543	It is definitely not recommended to use this flag.	634	It is definitely not recommended to use this flag, use whatever
		635	C<ev_recommended_backends ()> returns, or simply do not specify a backend
		636	at all.
		637
		638	=item C<EVBACKEND_MASK>
		639
		640	Not a backend at all, but a mask to select all backend bits from a
		641	C<flags> value, in case you want to mask out any backends from a flags
		642	value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
544		643
545	=back	644	=back
546		645
547	If one or more of the backend flags are or'ed into the flags value,	646	If one or more of the backend flags are or'ed into the flags value,
548	then only these backends will be tried (in the reverse order as listed	647	then only these backends will be tried (in the reverse order as listed
549	here). If none are specified, all backends in C<ev_recommended_backends	648	here). If none are specified, all backends in C<ev_recommended_backends
550	()> will be tried.	649	()> will be tried.
551		650
552	Example: This is the most typical usage.
553
554	if (!ev_default_loop (0))
555	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
556
557	Example: Restrict libev to the select and poll backends, and do not allow
558	environment settings to be taken into account:
559
560	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
561
562	Example: Use whatever libev has to offer, but make sure that kqueue is
563	used if available (warning, breaks stuff, best use only with your own
564	private event loop and only if you know the OS supports your types of
565	fds):
566
567	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
568
569	=item struct ev_loop *ev_loop_new (unsigned int flags)
570
571	Similar to C<ev_default_loop>, but always creates a new event loop that is
572	always distinct from the default loop.
573
574	Note that this function I<is> thread-safe, and one common way to use
575	libev with threads is indeed to create one loop per thread, and using the
576	default loop in the "main" or "initial" thread.
577
578	Example: Try to create a event loop that uses epoll and nothing else.	651	Example: Try to create a event loop that uses epoll and nothing else.
579		652
580	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	653	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
581	if (!epoller)	654	if (!epoller)
582	fatal ("no epoll found here, maybe it hides under your chair");	655	fatal ("no epoll found here, maybe it hides under your chair");
583		656
		657	Example: Use whatever libev has to offer, but make sure that kqueue is
		658	used if available.
		659
		660	struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
		661
584	=item ev_default_destroy ()	662	=item ev_loop_destroy (loop)
585		663
586	Destroys the default loop (frees all memory and kernel state etc.). None	664	Destroys an event loop object (frees all memory and kernel state
587	of the active event watchers will be stopped in the normal sense, so	665	etc.). None of the active event watchers will be stopped in the normal
588	e.g. C<ev_is_active> might still return true. It is your responsibility to	666	sense, so e.g. C<ev_is_active> might still return true. It is your
589	either stop all watchers cleanly yourself I<before> calling this function,	667	responsibility to either stop all watchers cleanly yourself I<before>
590	or cope with the fact afterwards (which is usually the easiest thing, you	668	calling this function, or cope with the fact afterwards (which is usually
591	can just ignore the watchers and/or C<free ()> them for example).	669	the easiest thing, you can just ignore the watchers and/or C<free ()> them
		670	for example).
592		671
593	Note that certain global state, such as signal state (and installed signal	672	Note that certain global state, such as signal state (and installed signal
594	handlers), will not be freed by this function, and related watchers (such	673	handlers), will not be freed by this function, and related watchers (such
595	as signal and child watchers) would need to be stopped manually.	674	as signal and child watchers) would need to be stopped manually.
596		675
597	In general it is not advisable to call this function except in the	676	This function is normally used on loop objects allocated by
598	rare occasion where you really need to free e.g. the signal handling	677	C<ev_loop_new>, but it can also be used on the default loop returned by
		678	C<ev_default_loop>, in which case it is not thread-safe.
		679
		680	Note that it is not advisable to call this function on the default loop
		681	except in the rare occasion where you really need to free its resources.
599	pipe fds. If you need dynamically allocated loops it is better to use	682	If you need dynamically allocated loops it is better to use C<ev_loop_new>
600	C<ev_loop_new> and C<ev_loop_destroy>.	683	and C<ev_loop_destroy>.
601		684
602	=item ev_loop_destroy (loop)	685	=item ev_loop_fork (loop)
603		686
604	Like C<ev_default_destroy>, but destroys an event loop created by an
605	earlier call to C<ev_loop_new>.
606
607	=item ev_default_fork ()
608
609	This function sets a flag that causes subsequent C<ev_loop> iterations	687	This function sets a flag that causes subsequent C<ev_run> iterations
610	to reinitialise the kernel state for backends that have one. Despite the	688	to reinitialise the kernel state for backends that have one. Despite
611	name, you can call it anytime, but it makes most sense after forking, in	689	the name, you can call it anytime you are allowed to start or stop
612	the child process (or both child and parent, but that again makes little	690	watchers (except inside an C<ev_prepare> callback), but it makes most
613	sense). You I<must> call it in the child before using any of the libev	691	sense after forking, in the child process. You I<must> call it (or use
614	functions, and it will only take effect at the next C<ev_loop> iteration.	692	C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
615		693
		694	In addition, if you want to reuse a loop (via this function of
		695	C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
		696
616	Again, you I<have> to call it on I<any> loop that you want to re-use after	697	Again, you I<have> to call it on I<any> loop that you want to re-use after
617	a fork, I<even if you do not plan to use the loop in the parent>. This is	698	a fork, I<even if you do not plan to use the loop in the parent>. This is
618	because some kernel interfaces *cough* I<kqueue> *cough* do funny things	699	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
619	during fork.	700	during fork.
620		701
621	On the other hand, you only need to call this function in the child	702	On the other hand, you only need to call this function in the child
622	process if and only if you want to use the event loop in the child. If you	703	process if and only if you want to use the event loop in the child. If
623	just fork+exec or create a new loop in the child, you don't have to call	704	you just fork+exec or create a new loop in the child, you don't have to
624	it at all.	705	call it at all (in fact, C<epoll> is so badly broken that it makes a
		706	difference, but libev will usually detect this case on its own and do a
		707	costly reset of the backend).
625		708
626	The function itself is quite fast and it's usually not a problem to call	709	The function itself is quite fast and it's usually not a problem to call
627	it just in case after a fork. To make this easy, the function will fit in	710	it just in case after a fork.
628	quite nicely into a call to C<pthread_atfork>:
629		711
		712	Example: Automate calling C<ev_loop_fork> on the default loop when
		713	using pthreads.
		714
		715	static void
		716	post_fork_child (void)
		717	{
		718	ev_loop_fork (EV_DEFAULT);
		719	}
		720
		721	...
630	pthread_atfork (0, 0, ev_default_fork);	722	pthread_atfork (0, 0, post_fork_child);
631
632	=item ev_loop_fork (loop)
633
634	Like C<ev_default_fork>, but acts on an event loop created by
635	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
636	after fork that you want to re-use in the child, and how you keep track of
637	them is entirely your own problem.
638		723
639	=item int ev_is_default_loop (loop)	724	=item int ev_is_default_loop (loop)
640		725
641	Returns true when the given loop is, in fact, the default loop, and false	726	Returns true when the given loop is, in fact, the default loop, and false
642	otherwise.	727	otherwise.
643		728
644	=item unsigned int ev_iteration (loop)	729	=item unsigned int ev_iteration (loop)
645		730
646	Returns the current iteration count for the loop, which is identical to	731	Returns the current iteration count for the event loop, which is identical
647	the number of times libev did poll for new events. It starts at C<0> and	732	to the number of times libev did poll for new events. It starts at C<0>
648	happily wraps around with enough iterations.	733	and happily wraps around with enough iterations.
649		734
650	This value can sometimes be useful as a generation counter of sorts (it	735	This value can sometimes be useful as a generation counter of sorts (it
651	"ticks" the number of loop iterations), as it roughly corresponds with	736	"ticks" the number of loop iterations), as it roughly corresponds with
652	C<ev_prepare> and C<ev_check> calls - and is incremented between the	737	C<ev_prepare> and C<ev_check> calls - and is incremented between the
653	prepare and check phases.	738	prepare and check phases.
654		739
655	=item unsigned int ev_depth (loop)	740	=item unsigned int ev_depth (loop)
656		741
657	Returns the number of times C<ev_loop> was entered minus the number of	742	Returns the number of times C<ev_run> was entered minus the number of
658	times C<ev_loop> was exited, in other words, the recursion depth.	743	times C<ev_run> was exited normally, in other words, the recursion depth.
659		744
660	Outside C<ev_loop>, this number is zero. In a callback, this number is	745	Outside C<ev_run>, this number is zero. In a callback, this number is
661	C<1>, unless C<ev_loop> was invoked recursively (or from another thread),	746	C<1>, unless C<ev_run> was invoked recursively (or from another thread),
662	in which case it is higher.	747	in which case it is higher.
663		748
664	Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread	749	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
665	etc.), doesn't count as "exit" - consider this as a hint to avoid such	750	throwing an exception etc.), doesn't count as "exit" - consider this
666	ungentleman behaviour unless it's really convenient.	751	as a hint to avoid such ungentleman-like behaviour unless it's really
		752	convenient, in which case it is fully supported.
667		753
668	=item unsigned int ev_backend (loop)	754	=item unsigned int ev_backend (loop)
669		755
670	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	756	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
671	use.	757	use.
…		…
680		766
681	=item ev_now_update (loop)	767	=item ev_now_update (loop)
682		768
683	Establishes the current time by querying the kernel, updating the time	769	Establishes the current time by querying the kernel, updating the time
684	returned by C<ev_now ()> in the progress. This is a costly operation and	770	returned by C<ev_now ()> in the progress. This is a costly operation and
685	is usually done automatically within C<ev_loop ()>.	771	is usually done automatically within C<ev_run ()>.
686		772
687	This function is rarely useful, but when some event callback runs for a	773	This function is rarely useful, but when some event callback runs for a
688	very long time without entering the event loop, updating libev's idea of	774	very long time without entering the event loop, updating libev's idea of
689	the current time is a good idea.	775	the current time is a good idea.
690		776
691	See also L<The special problem of time updates> in the C<ev_timer> section.	777	See also L</The special problem of time updates> in the C<ev_timer> section.
692		778
693	=item ev_suspend (loop)	779	=item ev_suspend (loop)
694		780
695	=item ev_resume (loop)	781	=item ev_resume (loop)
696		782
697	These two functions suspend and resume a loop, for use when the loop is	783	These two functions suspend and resume an event loop, for use when the
698	not used for a while and timeouts should not be processed.	784	loop is not used for a while and timeouts should not be processed.
699		785
700	A typical use case would be an interactive program such as a game: When	786	A typical use case would be an interactive program such as a game: When
701	the user presses C<^Z> to suspend the game and resumes it an hour later it	787	the user presses C<^Z> to suspend the game and resumes it an hour later it
702	would be best to handle timeouts as if no time had actually passed while	788	would be best to handle timeouts as if no time had actually passed while
703	the program was suspended. This can be achieved by calling C<ev_suspend>	789	the program was suspended. This can be achieved by calling C<ev_suspend>
…		…
705	C<ev_resume> directly afterwards to resume timer processing.	791	C<ev_resume> directly afterwards to resume timer processing.
706		792
707	Effectively, all C<ev_timer> watchers will be delayed by the time spend	793	Effectively, all C<ev_timer> watchers will be delayed by the time spend
708	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers	794	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
709	will be rescheduled (that is, they will lose any events that would have	795	will be rescheduled (that is, they will lose any events that would have
710	occured while suspended).	796	occurred while suspended).
711		797
712	After calling C<ev_suspend> you B<must not> call I<any> function on the	798	After calling C<ev_suspend> you B<must not> call I<any> function on the
713	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>	799	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
714	without a previous call to C<ev_suspend>.	800	without a previous call to C<ev_suspend>.
715		801
716	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	802	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
717	event loop time (see C<ev_now_update>).	803	event loop time (see C<ev_now_update>).
718		804
719	=item ev_loop (loop, int flags)	805	=item bool ev_run (loop, int flags)
720		806
721	Finally, this is it, the event handler. This function usually is called	807	Finally, this is it, the event handler. This function usually is called
722	after you have initialised all your watchers and you want to start	808	after you have initialised all your watchers and you want to start
723	handling events.	809	handling events. It will ask the operating system for any new events, call
		810	the watcher callbacks, and then repeat the whole process indefinitely: This
		811	is why event loops are called I<loops>.
724		812
725	If the flags argument is specified as C<0>, it will not return until	813	If the flags argument is specified as C<0>, it will keep handling events
726	either no event watchers are active anymore or C<ev_unloop> was called.	814	until either no event watchers are active anymore or C<ev_break> was
		815	called.
727		816
		817	The return value is false if there are no more active watchers (which
		818	usually means "all jobs done" or "deadlock"), and true in all other cases
		819	(which usually means " you should call C<ev_run> again").
		820
728	Please note that an explicit C<ev_unloop> is usually better than	821	Please note that an explicit C<ev_break> is usually better than
729	relying on all watchers to be stopped when deciding when a program has	822	relying on all watchers to be stopped when deciding when a program has
730	finished (especially in interactive programs), but having a program	823	finished (especially in interactive programs), but having a program
731	that automatically loops as long as it has to and no longer by virtue	824	that automatically loops as long as it has to and no longer by virtue
732	of relying on its watchers stopping correctly, that is truly a thing of	825	of relying on its watchers stopping correctly, that is truly a thing of
733	beauty.	826	beauty.
734		827
		828	This function is I<mostly> exception-safe - you can break out of a
		829	C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
		830	exception and so on. This does not decrement the C<ev_depth> value, nor
		831	will it clear any outstanding C<EVBREAK_ONE> breaks.
		832
735	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	833	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
736	those events and any already outstanding ones, but will not block your	834	those events and any already outstanding ones, but will not wait and
737	process in case there are no events and will return after one iteration of	835	block your process in case there are no events and will return after one
738	the loop.	836	iteration of the loop. This is sometimes useful to poll and handle new
		837	events while doing lengthy calculations, to keep the program responsive.
739		838
740	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	839	A flags value of C<EVRUN_ONCE> will look for new events (waiting if
741	necessary) and will handle those and any already outstanding ones. It	840	necessary) and will handle those and any already outstanding ones. It
742	will block your process until at least one new event arrives (which could	841	will block your process until at least one new event arrives (which could
743	be an event internal to libev itself, so there is no guarantee that a	842	be an event internal to libev itself, so there is no guarantee that a
744	user-registered callback will be called), and will return after one	843	user-registered callback will be called), and will return after one
745	iteration of the loop.	844	iteration of the loop.
746		845
747	This is useful if you are waiting for some external event in conjunction	846	This is useful if you are waiting for some external event in conjunction
748	with something not expressible using other libev watchers (i.e. "roll your	847	with something not expressible using other libev watchers (i.e. "roll your
749	own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	848	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
750	usually a better approach for this kind of thing.	849	usually a better approach for this kind of thing.
751		850
752	Here are the gory details of what C<ev_loop> does:	851	Here are the gory details of what C<ev_run> does (this is for your
		852	understanding, not a guarantee that things will work exactly like this in
		853	future versions):
753		854
		855	- Increment loop depth.
		856	- Reset the ev_break status.
754	- Before the first iteration, call any pending watchers.	857	- Before the first iteration, call any pending watchers.
		858	LOOP:
755	* If EVFLAG_FORKCHECK was used, check for a fork.	859	- If EVFLAG_FORKCHECK was used, check for a fork.
756	- If a fork was detected (by any means), queue and call all fork watchers.	860	- If a fork was detected (by any means), queue and call all fork watchers.
757	- Queue and call all prepare watchers.	861	- Queue and call all prepare watchers.
		862	- If ev_break was called, goto FINISH.
758	- If we have been forked, detach and recreate the kernel state	863	- If we have been forked, detach and recreate the kernel state
759	as to not disturb the other process.	864	as to not disturb the other process.
760	- Update the kernel state with all outstanding changes.	865	- Update the kernel state with all outstanding changes.
761	- Update the "event loop time" (ev_now ()).	866	- Update the "event loop time" (ev_now ()).
762	- Calculate for how long to sleep or block, if at all	867	- Calculate for how long to sleep or block, if at all
763	(active idle watchers, EVLOOP_NONBLOCK or not having	868	(active idle watchers, EVRUN_NOWAIT or not having
764	any active watchers at all will result in not sleeping).	869	any active watchers at all will result in not sleeping).
765	- Sleep if the I/O and timer collect interval say so.	870	- Sleep if the I/O and timer collect interval say so.
		871	- Increment loop iteration counter.
766	- Block the process, waiting for any events.	872	- Block the process, waiting for any events.
767	- Queue all outstanding I/O (fd) events.	873	- Queue all outstanding I/O (fd) events.
768	- Update the "event loop time" (ev_now ()), and do time jump adjustments.	874	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
769	- Queue all expired timers.	875	- Queue all expired timers.
770	- Queue all expired periodics.	876	- Queue all expired periodics.
771	- Unless any events are pending now, queue all idle watchers.	877	- Queue all idle watchers with priority higher than that of pending events.
772	- Queue all check watchers.	878	- Queue all check watchers.
773	- Call all queued watchers in reverse order (i.e. check watchers first).	879	- Call all queued watchers in reverse order (i.e. check watchers first).
774	Signals and child watchers are implemented as I/O watchers, and will	880	Signals and child watchers are implemented as I/O watchers, and will
775	be handled here by queueing them when their watcher gets executed.	881	be handled here by queueing them when their watcher gets executed.
776	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	882	- If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
777	were used, or there are no active watchers, return, otherwise	883	were used, or there are no active watchers, goto FINISH, otherwise
778	continue with step *.	884	continue with step LOOP.
		885	FINISH:
		886	- Reset the ev_break status iff it was EVBREAK_ONE.
		887	- Decrement the loop depth.
		888	- Return.
779		889
780	Example: Queue some jobs and then loop until no events are outstanding	890	Example: Queue some jobs and then loop until no events are outstanding
781	anymore.	891	anymore.
782		892
783	... queue jobs here, make sure they register event watchers as long	893	... queue jobs here, make sure they register event watchers as long
784	... as they still have work to do (even an idle watcher will do..)	894	... as they still have work to do (even an idle watcher will do..)
785	ev_loop (my_loop, 0);	895	ev_run (my_loop, 0);
786	... jobs done or somebody called unloop. yeah!	896	... jobs done or somebody called break. yeah!
787		897
788	=item ev_unloop (loop, how)	898	=item ev_break (loop, how)
789		899
790	Can be used to make a call to C<ev_loop> return early (but only after it	900	Can be used to make a call to C<ev_run> return early (but only after it
791	has processed all outstanding events). The C<how> argument must be either	901	has processed all outstanding events). The C<how> argument must be either
792	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	902	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
793	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	903	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
794		904
795	This "unloop state" will be cleared when entering C<ev_loop> again.	905	This "break state" will be cleared on the next call to C<ev_run>.
796		906
797	It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls.	907	It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
		908	which case it will have no effect.
798		909
799	=item ev_ref (loop)	910	=item ev_ref (loop)
800		911
801	=item ev_unref (loop)	912	=item ev_unref (loop)
802		913
803	Ref/unref can be used to add or remove a reference count on the event	914	Ref/unref can be used to add or remove a reference count on the event
804	loop: Every watcher keeps one reference, and as long as the reference	915	loop: Every watcher keeps one reference, and as long as the reference
805	count is nonzero, C<ev_loop> will not return on its own.	916	count is nonzero, C<ev_run> will not return on its own.
806		917
807	This is useful when you have a watcher that you never intend to	918	This is useful when you have a watcher that you never intend to
808	unregister, but that nevertheless should not keep C<ev_loop> from	919	unregister, but that nevertheless should not keep C<ev_run> from
809	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>	920	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
810	before stopping it.	921	before stopping it.
811		922
812	As an example, libev itself uses this for its internal signal pipe: It	923	As an example, libev itself uses this for its internal signal pipe: It
813	is not visible to the libev user and should not keep C<ev_loop> from	924	is not visible to the libev user and should not keep C<ev_run> from
814	exiting if no event watchers registered by it are active. It is also an	925	exiting if no event watchers registered by it are active. It is also an
815	excellent way to do this for generic recurring timers or from within	926	excellent way to do this for generic recurring timers or from within
816	third-party libraries. Just remember to I<unref after start> and I<ref	927	third-party libraries. Just remember to I<unref after start> and I<ref
817	before stop> (but only if the watcher wasn't active before, or was active	928	before stop> (but only if the watcher wasn't active before, or was active
818	before, respectively. Note also that libev might stop watchers itself	929	before, respectively. Note also that libev might stop watchers itself
819	(e.g. non-repeating timers) in which case you have to C<ev_ref>	930	(e.g. non-repeating timers) in which case you have to C<ev_ref>
820	in the callback).	931	in the callback).
821		932
822	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	933	Example: Create a signal watcher, but keep it from keeping C<ev_run>
823	running when nothing else is active.	934	running when nothing else is active.
824		935
825	ev_signal exitsig;	936	ev_signal exitsig;
826	ev_signal_init (&exitsig, sig_cb, SIGINT);	937	ev_signal_init (&exitsig, sig_cb, SIGINT);
827	ev_signal_start (loop, &exitsig);	938	ev_signal_start (loop, &exitsig);
828	evf_unref (loop);	939	ev_unref (loop);
829		940
830	Example: For some weird reason, unregister the above signal handler again.	941	Example: For some weird reason, unregister the above signal handler again.
831		942
832	ev_ref (loop);	943	ev_ref (loop);
833	ev_signal_stop (loop, &exitsig);	944	ev_signal_stop (loop, &exitsig);
…		…
853	overhead for the actual polling but can deliver many events at once.	964	overhead for the actual polling but can deliver many events at once.
854		965
855	By setting a higher I<io collect interval> you allow libev to spend more	966	By setting a higher I<io collect interval> you allow libev to spend more
856	time collecting I/O events, so you can handle more events per iteration,	967	time collecting I/O events, so you can handle more events per iteration,
857	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	968	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
858	C<ev_timer>) will be not affected. Setting this to a non-null value will	969	C<ev_timer>) will not be affected. Setting this to a non-null value will
859	introduce an additional C<ev_sleep ()> call into most loop iterations. The	970	introduce an additional C<ev_sleep ()> call into most loop iterations. The
860	sleep time ensures that libev will not poll for I/O events more often then	971	sleep time ensures that libev will not poll for I/O events more often then
861	once per this interval, on average.	972	once per this interval, on average (as long as the host time resolution is
		973	good enough).
862		974
863	Likewise, by setting a higher I<timeout collect interval> you allow libev	975	Likewise, by setting a higher I<timeout collect interval> you allow libev
864	to spend more time collecting timeouts, at the expense of increased	976	to spend more time collecting timeouts, at the expense of increased
865	latency/jitter/inexactness (the watcher callback will be called	977	latency/jitter/inexactness (the watcher callback will be called
866	later). C<ev_io> watchers will not be affected. Setting this to a non-null	978	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
872	usually doesn't make much sense to set it to a lower value than C<0.01>,	984	usually doesn't make much sense to set it to a lower value than C<0.01>,
873	as this approaches the timing granularity of most systems. Note that if	985	as this approaches the timing granularity of most systems. Note that if
874	you do transactions with the outside world and you can't increase the	986	you do transactions with the outside world and you can't increase the
875	parallelity, then this setting will limit your transaction rate (if you	987	parallelity, then this setting will limit your transaction rate (if you
876	need to poll once per transaction and the I/O collect interval is 0.01,	988	need to poll once per transaction and the I/O collect interval is 0.01,
877	then you can't do more than 100 transations per second).	989	then you can't do more than 100 transactions per second).
878		990
879	Setting the I<timeout collect interval> can improve the opportunity for	991	Setting the I<timeout collect interval> can improve the opportunity for
880	saving power, as the program will "bundle" timer callback invocations that	992	saving power, as the program will "bundle" timer callback invocations that
881	are "near" in time together, by delaying some, thus reducing the number of	993	are "near" in time together, by delaying some, thus reducing the number of
882	times the process sleeps and wakes up again. Another useful technique to	994	times the process sleeps and wakes up again. Another useful technique to
…		…
890	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);	1002	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
891		1003
892	=item ev_invoke_pending (loop)	1004	=item ev_invoke_pending (loop)
893		1005
894	This call will simply invoke all pending watchers while resetting their	1006	This call will simply invoke all pending watchers while resetting their
895	pending state. Normally, C<ev_loop> does this automatically when required,	1007	pending state. Normally, C<ev_run> does this automatically when required,
896	but when overriding the invoke callback this call comes handy.	1008	but when overriding the invoke callback this call comes handy. This
		1009	function can be invoked from a watcher - this can be useful for example
		1010	when you want to do some lengthy calculation and want to pass further
		1011	event handling to another thread (you still have to make sure only one
		1012	thread executes within C<ev_invoke_pending> or C<ev_run> of course).
897		1013
898	=item int ev_pending_count (loop)	1014	=item int ev_pending_count (loop)
899		1015
900	Returns the number of pending watchers - zero indicates that no watchers	1016	Returns the number of pending watchers - zero indicates that no watchers
901	are pending.	1017	are pending.
902		1018
903	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))	1019	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
904		1020
905	This overrides the invoke pending functionality of the loop: Instead of	1021	This overrides the invoke pending functionality of the loop: Instead of
906	invoking all pending watchers when there are any, C<ev_loop> will call	1022	invoking all pending watchers when there are any, C<ev_run> will call
907	this callback instead. This is useful, for example, when you want to	1023	this callback instead. This is useful, for example, when you want to
908	invoke the actual watchers inside another context (another thread etc.).	1024	invoke the actual watchers inside another context (another thread etc.).
909		1025
910	If you want to reset the callback, use C<ev_invoke_pending> as new	1026	If you want to reset the callback, use C<ev_invoke_pending> as new
911	callback.	1027	callback.
912		1028
913	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))	1029	=item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ())
914		1030
915	Sometimes you want to share the same loop between multiple threads. This	1031	Sometimes you want to share the same loop between multiple threads. This
916	can be done relatively simply by putting mutex_lock/unlock calls around	1032	can be done relatively simply by putting mutex_lock/unlock calls around
917	each call to a libev function.	1033	each call to a libev function.
918		1034
919	However, C<ev_loop> can run an indefinite time, so it is not feasible to	1035	However, C<ev_run> can run an indefinite time, so it is not feasible
920	wait for it to return. One way around this is to wake up the loop via	1036	to wait for it to return. One way around this is to wake up the event
921	C<ev_unloop> and C<av_async_send>, another way is to set these I<release>	1037	loop via C<ev_break> and C<ev_async_send>, another way is to set these
922	and I<acquire> callbacks on the loop.	1038	I<release> and I<acquire> callbacks on the loop.
923		1039
924	When set, then C<release> will be called just before the thread is	1040	When set, then C<release> will be called just before the thread is
925	suspended waiting for new events, and C<acquire> is called just	1041	suspended waiting for new events, and C<acquire> is called just
926	afterwards.	1042	afterwards.
927		1043
…		…
930		1046
931	While event loop modifications are allowed between invocations of	1047	While event loop modifications are allowed between invocations of
932	C<release> and C<acquire> (that's their only purpose after all), no	1048	C<release> and C<acquire> (that's their only purpose after all), no
933	modifications done will affect the event loop, i.e. adding watchers will	1049	modifications done will affect the event loop, i.e. adding watchers will
934	have no effect on the set of file descriptors being watched, or the time	1050	have no effect on the set of file descriptors being watched, or the time
935	waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it	1051	waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
936	to take note of any changes you made.	1052	to take note of any changes you made.
937		1053
938	In theory, threads executing C<ev_loop> will be async-cancel safe between	1054	In theory, threads executing C<ev_run> will be async-cancel safe between
939	invocations of C<release> and C<acquire>.	1055	invocations of C<release> and C<acquire>.
940		1056
941	See also the locking example in the C<THREADS> section later in this	1057	See also the locking example in the C<THREADS> section later in this
942	document.	1058	document.
943		1059
944	=item ev_set_userdata (loop, void *data)	1060	=item ev_set_userdata (loop, void *data)
945		1061
946	=item ev_userdata (loop)	1062	=item void *ev_userdata (loop)
947		1063
948	Set and retrieve a single C<void *> associated with a loop. When	1064	Set and retrieve a single C<void *> associated with a loop. When
949	C<ev_set_userdata> has never been called, then C<ev_userdata> returns	1065	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
950	C<0.>	1066	C<0>.
951		1067
952	These two functions can be used to associate arbitrary data with a loop,	1068	These two functions can be used to associate arbitrary data with a loop,
953	and are intended solely for the C<invoke_pending_cb>, C<release> and	1069	and are intended solely for the C<invoke_pending_cb>, C<release> and
954	C<acquire> callbacks described above, but of course can be (ab-)used for	1070	C<acquire> callbacks described above, but of course can be (ab-)used for
955	any other purpose as well.	1071	any other purpose as well.
956		1072
957	=item ev_loop_verify (loop)	1073	=item ev_verify (loop)
958		1074
959	This function only does something when C<EV_VERIFY> support has been	1075	This function only does something when C<EV_VERIFY> support has been
960	compiled in, which is the default for non-minimal builds. It tries to go	1076	compiled in, which is the default for non-minimal builds. It tries to go
961	through all internal structures and checks them for validity. If anything	1077	through all internal structures and checks them for validity. If anything
962	is found to be inconsistent, it will print an error message to standard	1078	is found to be inconsistent, it will print an error message to standard
…		…
973		1089
974	In the following description, uppercase C<TYPE> in names stands for the	1090	In the following description, uppercase C<TYPE> in names stands for the
975	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer	1091	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
976	watchers and C<ev_io_start> for I/O watchers.	1092	watchers and C<ev_io_start> for I/O watchers.
977		1093
978	A watcher is a structure that you create and register to record your	1094	A watcher is an opaque structure that you allocate and register to record
979	interest in some event. For instance, if you want to wait for STDIN to	1095	your interest in some event. To make a concrete example, imagine you want
980	become readable, you would create an C<ev_io> watcher for that:	1096	to wait for STDIN to become readable, you would create an C<ev_io> watcher
		1097	for that:
981		1098
982	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)	1099	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
983	{	1100	{
984	ev_io_stop (w);	1101	ev_io_stop (w);
985	ev_unloop (loop, EVUNLOOP_ALL);	1102	ev_break (loop, EVBREAK_ALL);
986	}	1103	}
987		1104
988	struct ev_loop *loop = ev_default_loop (0);	1105	struct ev_loop *loop = ev_default_loop (0);
989		1106
990	ev_io stdin_watcher;	1107	ev_io stdin_watcher;
991		1108
992	ev_init (&stdin_watcher, my_cb);	1109	ev_init (&stdin_watcher, my_cb);
993	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	1110	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
994	ev_io_start (loop, &stdin_watcher);	1111	ev_io_start (loop, &stdin_watcher);
995		1112
996	ev_loop (loop, 0);	1113	ev_run (loop, 0);
997		1114
998	As you can see, you are responsible for allocating the memory for your	1115	As you can see, you are responsible for allocating the memory for your
999	watcher structures (and it is I<usually> a bad idea to do this on the	1116	watcher structures (and it is I<usually> a bad idea to do this on the
1000	stack).	1117	stack).
1001		1118
1002	Each watcher has an associated watcher structure (called C<struct ev_TYPE>	1119	Each watcher has an associated watcher structure (called C<struct ev_TYPE>
1003	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).	1120	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
1004		1121
1005	Each watcher structure must be initialised by a call to C<ev_init	1122	Each watcher structure must be initialised by a call to C<ev_init (watcher
1006	(watcher *, callback)>, which expects a callback to be provided. This	1123	*, callback)>, which expects a callback to be provided. This callback is
1007	callback gets invoked each time the event occurs (or, in the case of I/O	1124	invoked each time the event occurs (or, in the case of I/O watchers, each
1008	watchers, each time the event loop detects that the file descriptor given	1125	time the event loop detects that the file descriptor given is readable
1009	is readable and/or writable).	1126	and/or writable).
1010		1127
1011	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>	1128	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
1012	macro to configure it, with arguments specific to the watcher type. There	1129	macro to configure it, with arguments specific to the watcher type. There
1013	is also a macro to combine initialisation and setting in one call: C<<	1130	is also a macro to combine initialisation and setting in one call: C<<
1014	ev_TYPE_init (watcher *, callback, ...) >>.	1131	ev_TYPE_init (watcher *, callback, ...) >>.
…		…
1065		1182
1066	=item C<EV_PREPARE>	1183	=item C<EV_PREPARE>
1067		1184
1068	=item C<EV_CHECK>	1185	=item C<EV_CHECK>
1069		1186
1070	All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts	1187	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to
1071	to gather new events, and all C<ev_check> watchers are invoked just after	1188	gather new events, and all C<ev_check> watchers are queued (not invoked)
1072	C<ev_loop> has gathered them, but before it invokes any callbacks for any	1189	just after C<ev_run> has gathered them, but before it queues any callbacks
		1190	for any received events. That means C<ev_prepare> watchers are the last
		1191	watchers invoked before the event loop sleeps or polls for new events, and
		1192	C<ev_check> watchers will be invoked before any other watchers of the same
		1193	or lower priority within an event loop iteration.
		1194
1073	received events. Callbacks of both watcher types can start and stop as	1195	Callbacks of both watcher types can start and stop as many watchers as
1074	many watchers as they want, and all of them will be taken into account	1196	they want, and all of them will be taken into account (for example, a
1075	(for example, a C<ev_prepare> watcher might start an idle watcher to keep	1197	C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1076	C<ev_loop> from blocking).	1198	blocking).
1077		1199
1078	=item C<EV_EMBED>	1200	=item C<EV_EMBED>
1079		1201
1080	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1202	The embedded event loop specified in the C<ev_embed> watcher needs attention.
1081		1203
1082	=item C<EV_FORK>	1204	=item C<EV_FORK>
1083		1205
1084	The event loop has been resumed in the child process after fork (see	1206	The event loop has been resumed in the child process after fork (see
1085	C<ev_fork>).	1207	C<ev_fork>).
		1208
		1209	=item C<EV_CLEANUP>
		1210
		1211	The event loop is about to be destroyed (see C<ev_cleanup>).
1086		1212
1087	=item C<EV_ASYNC>	1213	=item C<EV_ASYNC>
1088		1214
1089	The given async watcher has been asynchronously notified (see C<ev_async>).	1215	The given async watcher has been asynchronously notified (see C<ev_async>).
1090		1216
…		…
1200		1326
1201	=item callback ev_cb (ev_TYPE *watcher)	1327	=item callback ev_cb (ev_TYPE *watcher)
1202		1328
1203	Returns the callback currently set on the watcher.	1329	Returns the callback currently set on the watcher.
1204		1330
1205	=item ev_cb_set (ev_TYPE *watcher, callback)	1331	=item ev_set_cb (ev_TYPE *watcher, callback)
1206		1332
1207	Change the callback. You can change the callback at virtually any time	1333	Change the callback. You can change the callback at virtually any time
1208	(modulo threads).	1334	(modulo threads).
1209		1335
1210	=item ev_set_priority (ev_TYPE *watcher, int priority)	1336	=item ev_set_priority (ev_TYPE *watcher, int priority)
…		…
1228	or might not have been clamped to the valid range.	1354	or might not have been clamped to the valid range.
1229		1355
1230	The default priority used by watchers when no priority has been set is	1356	The default priority used by watchers when no priority has been set is
1231	always C<0>, which is supposed to not be too high and not be too low :).	1357	always C<0>, which is supposed to not be too high and not be too low :).
1232		1358
1233	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of	1359	See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1234	priorities.	1360	priorities.
1235		1361
1236	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1362	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1237		1363
1238	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1364	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
…		…
1263	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1389	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1264	functions that do not need a watcher.	1390	functions that do not need a watcher.
1265		1391
1266	=back	1392	=back
1267		1393
		1394	See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
		1395	OWN COMPOSITE WATCHERS> idioms.
1268		1396
1269	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1397	=head2 WATCHER STATES
1270		1398
1271	Each watcher has, by default, a member C<void *data> that you can change	1399	There are various watcher states mentioned throughout this manual -
1272	and read at any time: libev will completely ignore it. This can be used	1400	active, pending and so on. In this section these states and the rules to
1273	to associate arbitrary data with your watcher. If you need more data and	1401	transition between them will be described in more detail - and while these
1274	don't want to allocate memory and store a pointer to it in that data	1402	rules might look complicated, they usually do "the right thing".
1275	member, you can also "subclass" the watcher type and provide your own
1276	data:
1277		1403
1278	struct my_io	1404	=over 4
1279	{
1280	ev_io io;
1281	int otherfd;
1282	void *somedata;
1283	struct whatever *mostinteresting;
1284	};
1285		1405
1286	...	1406	=item initialised
1287	struct my_io w;
1288	ev_io_init (&w.io, my_cb, fd, EV_READ);
1289		1407
1290	And since your callback will be called with a pointer to the watcher, you	1408	Before a watcher can be registered with the event loop it has to be
1291	can cast it back to your own type:	1409	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
		1410	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1292		1411
1293	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)	1412	In this state it is simply some block of memory that is suitable for
1294	{	1413	use in an event loop. It can be moved around, freed, reused etc. at
1295	struct my_io *w = (struct my_io *)w_;	1414	will - as long as you either keep the memory contents intact, or call
1296	...	1415	C<ev_TYPE_init> again.
1297	}
1298		1416
1299	More interesting and less C-conformant ways of casting your callback type	1417	=item started/running/active
1300	instead have been omitted.
1301		1418
1302	Another common scenario is to use some data structure with multiple	1419	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1303	embedded watchers:	1420	property of the event loop, and is actively waiting for events. While in
		1421	this state it cannot be accessed (except in a few documented ways), moved,
		1422	freed or anything else - the only legal thing is to keep a pointer to it,
		1423	and call libev functions on it that are documented to work on active watchers.
1304		1424
1305	struct my_biggy	1425	=item pending
1306	{
1307	int some_data;
1308	ev_timer t1;
1309	ev_timer t2;
1310	}
1311		1426
1312	In this case getting the pointer to C<my_biggy> is a bit more	1427	If a watcher is active and libev determines that an event it is interested
1313	complicated: Either you store the address of your C<my_biggy> struct	1428	in has occurred (such as a timer expiring), it will become pending. It will
1314	in the C<data> member of the watcher (for woozies), or you need to use	1429	stay in this pending state until either it is stopped or its callback is
1315	some pointer arithmetic using C<offsetof> inside your watchers (for real	1430	about to be invoked, so it is not normally pending inside the watcher
1316	programmers):	1431	callback.
1317		1432
1318	#include <stddef.h>	1433	The watcher might or might not be active while it is pending (for example,
		1434	an expired non-repeating timer can be pending but no longer active). If it
		1435	is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
		1436	but it is still property of the event loop at this time, so cannot be
		1437	moved, freed or reused. And if it is active the rules described in the
		1438	previous item still apply.
1319		1439
1320	static void	1440	It is also possible to feed an event on a watcher that is not active (e.g.
1321	t1_cb (EV_P_ ev_timer *w, int revents)	1441	via C<ev_feed_event>), in which case it becomes pending without being
1322	{	1442	active.
1323	struct my_biggy big = (struct my_biggy *)
1324	(((char *)w) - offsetof (struct my_biggy, t1));
1325	}
1326		1443
1327	static void	1444	=item stopped
1328	t2_cb (EV_P_ ev_timer *w, int revents)	1445
1329	{	1446	A watcher can be stopped implicitly by libev (in which case it might still
1330	struct my_biggy big = (struct my_biggy *)	1447	be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1331	(((char *)w) - offsetof (struct my_biggy, t2));	1448	latter will clear any pending state the watcher might be in, regardless
1332	}	1449	of whether it was active or not, so stopping a watcher explicitly before
		1450	freeing it is often a good idea.
		1451
		1452	While stopped (and not pending) the watcher is essentially in the
		1453	initialised state, that is, it can be reused, moved, modified in any way
		1454	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1455	it again).
		1456
		1457	=back
1333		1458
1334	=head2 WATCHER PRIORITY MODELS	1459	=head2 WATCHER PRIORITY MODELS
1335		1460
1336	Many event loops support I<watcher priorities>, which are usually small	1461	Many event loops support I<watcher priorities>, which are usually small
1337	integers that influence the ordering of event callback invocation	1462	integers that influence the ordering of event callback invocation
…		…
1380		1505
1381	For example, to emulate how many other event libraries handle priorities,	1506	For example, to emulate how many other event libraries handle priorities,
1382	you can associate an C<ev_idle> watcher to each such watcher, and in	1507	you can associate an C<ev_idle> watcher to each such watcher, and in
1383	the normal watcher callback, you just start the idle watcher. The real	1508	the normal watcher callback, you just start the idle watcher. The real
1384	processing is done in the idle watcher callback. This causes libev to	1509	processing is done in the idle watcher callback. This causes libev to
1385	continously poll and process kernel event data for the watcher, but when	1510	continuously poll and process kernel event data for the watcher, but when
1386	the lock-out case is known to be rare (which in turn is rare :), this is	1511	the lock-out case is known to be rare (which in turn is rare :), this is
1387	workable.	1512	workable.
1388		1513
1389	Usually, however, the lock-out model implemented that way will perform	1514	Usually, however, the lock-out model implemented that way will perform
1390	miserably under the type of load it was designed to handle. In that case,	1515	miserably under the type of load it was designed to handle. In that case,
…		…
1464	In general you can register as many read and/or write event watchers per	1589	In general you can register as many read and/or write event watchers per
1465	fd as you want (as long as you don't confuse yourself). Setting all file	1590	fd as you want (as long as you don't confuse yourself). Setting all file
1466	descriptors to non-blocking mode is also usually a good idea (but not	1591	descriptors to non-blocking mode is also usually a good idea (but not
1467	required if you know what you are doing).	1592	required if you know what you are doing).
1468		1593
1469	If you cannot use non-blocking mode, then force the use of a
1470	known-to-be-good backend (at the time of this writing, this includes only
1471	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1472	descriptors for which non-blocking operation makes no sense (such as
1473	files) - libev doesn't guarentee any specific behaviour in that case.
1474
1475	Another thing you have to watch out for is that it is quite easy to	1594	Another thing you have to watch out for is that it is quite easy to
1476	receive "spurious" readiness notifications, that is your callback might	1595	receive "spurious" readiness notifications, that is, your callback might
1477	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1596	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1478	because there is no data. Not only are some backends known to create a	1597	because there is no data. It is very easy to get into this situation even
1479	lot of those (for example Solaris ports), it is very easy to get into	1598	with a relatively standard program structure. Thus it is best to always
1480	this situation even with a relatively standard program structure. Thus	1599	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1481	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1482	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1600	preferable to a program hanging until some data arrives.
1483		1601
1484	If you cannot run the fd in non-blocking mode (for example you should	1602	If you cannot run the fd in non-blocking mode (for example you should
1485	not play around with an Xlib connection), then you have to separately	1603	not play around with an Xlib connection), then you have to separately
1486	re-test whether a file descriptor is really ready with a known-to-be good	1604	re-test whether a file descriptor is really ready with a known-to-be good
1487	interface such as poll (fortunately in our Xlib example, Xlib already	1605	interface such as poll (fortunately in the case of Xlib, it already does
1488	does this on its own, so its quite safe to use). Some people additionally	1606	this on its own, so its quite safe to use). Some people additionally
1489	use C<SIGALRM> and an interval timer, just to be sure you won't block	1607	use C<SIGALRM> and an interval timer, just to be sure you won't block
1490	indefinitely.	1608	indefinitely.
1491		1609
1492	But really, best use non-blocking mode.	1610	But really, best use non-blocking mode.
1493		1611
…		…
1521		1639
1522	There is no workaround possible except not registering events	1640	There is no workaround possible except not registering events
1523	for potentially C<dup ()>'ed file descriptors, or to resort to	1641	for potentially C<dup ()>'ed file descriptors, or to resort to
1524	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1642	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1525		1643
		1644	=head3 The special problem of files
		1645
		1646	Many people try to use C<select> (or libev) on file descriptors
		1647	representing files, and expect it to become ready when their program
		1648	doesn't block on disk accesses (which can take a long time on their own).
		1649
		1650	However, this cannot ever work in the "expected" way - you get a readiness
		1651	notification as soon as the kernel knows whether and how much data is
		1652	there, and in the case of open files, that's always the case, so you
		1653	always get a readiness notification instantly, and your read (or possibly
		1654	write) will still block on the disk I/O.
		1655
		1656	Another way to view it is that in the case of sockets, pipes, character
		1657	devices and so on, there is another party (the sender) that delivers data
		1658	on its own, but in the case of files, there is no such thing: the disk
		1659	will not send data on its own, simply because it doesn't know what you
		1660	wish to read - you would first have to request some data.
		1661
		1662	Since files are typically not-so-well supported by advanced notification
		1663	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1664	to files, even though you should not use it. The reason for this is
		1665	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1666	usually a tty, often a pipe, but also sometimes files or special devices
		1667	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1668	F</dev/urandom>), and even though the file might better be served with
		1669	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1670	it "just works" instead of freezing.
		1671
		1672	So avoid file descriptors pointing to files when you know it (e.g. use
		1673	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1674	when you rarely read from a file instead of from a socket, and want to
		1675	reuse the same code path.
		1676
1526	=head3 The special problem of fork	1677	=head3 The special problem of fork
1527		1678
1528	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1679	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1529	useless behaviour. Libev fully supports fork, but needs to be told about	1680	useless behaviour. Libev fully supports fork, but needs to be told about
1530	it in the child.	1681	it in the child if you want to continue to use it in the child.
1531		1682
1532	To support fork in your programs, you either have to call	1683	To support fork in your child processes, you have to call C<ev_loop_fork
1533	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1684	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1534	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1685	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1535	C<EVBACKEND_POLL>.
1536		1686
1537	=head3 The special problem of SIGPIPE	1687	=head3 The special problem of SIGPIPE
1538		1688
1539	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1689	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1540	when writing to a pipe whose other end has been closed, your program gets	1690	when writing to a pipe whose other end has been closed, your program gets
…		…
1622	...	1772	...
1623	struct ev_loop *loop = ev_default_init (0);	1773	struct ev_loop *loop = ev_default_init (0);
1624	ev_io stdin_readable;	1774	ev_io stdin_readable;
1625	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1775	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1626	ev_io_start (loop, &stdin_readable);	1776	ev_io_start (loop, &stdin_readable);
1627	ev_loop (loop, 0);	1777	ev_run (loop, 0);
1628		1778
1629		1779
1630	=head2 C<ev_timer> - relative and optionally repeating timeouts	1780	=head2 C<ev_timer> - relative and optionally repeating timeouts
1631		1781
1632	Timer watchers are simple relative timers that generate an event after a	1782	Timer watchers are simple relative timers that generate an event after a
…		…
1638	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1788	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1639	monotonic clock option helps a lot here).	1789	monotonic clock option helps a lot here).
1640		1790
1641	The callback is guaranteed to be invoked only I<after> its timeout has	1791	The callback is guaranteed to be invoked only I<after> its timeout has
1642	passed (not I<at>, so on systems with very low-resolution clocks this	1792	passed (not I<at>, so on systems with very low-resolution clocks this
1643	might introduce a small delay). If multiple timers become ready during the	1793	might introduce a small delay, see "the special problem of being too
		1794	early", below). If multiple timers become ready during the same loop
1644	same loop iteration then the ones with earlier time-out values are invoked	1795	iteration then the ones with earlier time-out values are invoked before
1645	before ones of the same priority with later time-out values (but this is	1796	ones of the same priority with later time-out values (but this is no
1646	no longer true when a callback calls C<ev_loop> recursively).	1797	longer true when a callback calls C<ev_run> recursively).
1647		1798
1648	=head3 Be smart about timeouts	1799	=head3 Be smart about timeouts
1649		1800
1650	Many real-world problems involve some kind of timeout, usually for error	1801	Many real-world problems involve some kind of timeout, usually for error
1651	recovery. A typical example is an HTTP request - if the other side hangs,	1802	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1726		1877
1727	In this case, it would be more efficient to leave the C<ev_timer> alone,	1878	In this case, it would be more efficient to leave the C<ev_timer> alone,
1728	but remember the time of last activity, and check for a real timeout only	1879	but remember the time of last activity, and check for a real timeout only
1729	within the callback:	1880	within the callback:
1730		1881
		1882	ev_tstamp timeout = 60.;
1731	ev_tstamp last_activity; // time of last activity	1883	ev_tstamp last_activity; // time of last activity
		1884	ev_timer timer;
1732		1885
1733	static void	1886	static void
1734	callback (EV_P_ ev_timer *w, int revents)	1887	callback (EV_P_ ev_timer *w, int revents)
1735	{	1888	{
1736	ev_tstamp now = ev_now (EV_A);	1889	// calculate when the timeout would happen
1737	ev_tstamp timeout = last_activity + 60.;	1890	ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1738		1891
1739	// if last_activity + 60. is older than now, we did time out	1892	// if negative, it means we the timeout already occurred
1740	if (timeout < now)	1893	if (after < 0.)
1741	{	1894	{
1742	// timeout occured, take action	1895	// timeout occurred, take action
1743	}	1896	}
1744	else	1897	else
1745	{	1898	{
1746	// callback was invoked, but there was some activity, re-arm	1899	// callback was invoked, but there was some recent
1747	// the watcher to fire in last_activity + 60, which is	1900	// activity. simply restart the timer to time out
1748	// guaranteed to be in the future, so "again" is positive:	1901	// after "after" seconds, which is the earliest time
1749	w->repeat = timeout - now;	1902	// the timeout can occur.
		1903	ev_timer_set (w, after, 0.);
1750	ev_timer_again (EV_A_ w);	1904	ev_timer_start (EV_A_ w);
1751	}	1905	}
1752	}	1906	}
1753		1907
1754	To summarise the callback: first calculate the real timeout (defined	1908	To summarise the callback: first calculate in how many seconds the
1755	as "60 seconds after the last activity"), then check if that time has	1909	timeout will occur (by calculating the absolute time when it would occur,
1756	been reached, which means something I<did>, in fact, time out. Otherwise	1910	C<last_activity + timeout>, and subtracting the current time, C<ev_now
1757	the callback was invoked too early (C<timeout> is in the future), so	1911	(EV_A)> from that).
1758	re-schedule the timer to fire at that future time, to see if maybe we have
1759	a timeout then.
1760		1912
1761	Note how C<ev_timer_again> is used, taking advantage of the	1913	If this value is negative, then we are already past the timeout, i.e. we
1762	C<ev_timer_again> optimisation when the timer is already running.	1914	timed out, and need to do whatever is needed in this case.
		1915
		1916	Otherwise, we now the earliest time at which the timeout would trigger,
		1917	and simply start the timer with this timeout value.
		1918
		1919	In other words, each time the callback is invoked it will check whether
		1920	the timeout occurred. If not, it will simply reschedule itself to check
		1921	again at the earliest time it could time out. Rinse. Repeat.
1763		1922
1764	This scheme causes more callback invocations (about one every 60 seconds	1923	This scheme causes more callback invocations (about one every 60 seconds
1765	minus half the average time between activity), but virtually no calls to	1924	minus half the average time between activity), but virtually no calls to
1766	libev to change the timeout.	1925	libev to change the timeout.
1767		1926
1768	To start the timer, simply initialise the watcher and set C<last_activity>	1927	To start the machinery, simply initialise the watcher and set
1769	to the current time (meaning we just have some activity :), then call the	1928	C<last_activity> to the current time (meaning there was some activity just
1770	callback, which will "do the right thing" and start the timer:	1929	now), then call the callback, which will "do the right thing" and start
		1930	the timer:
1771		1931
		1932	last_activity = ev_now (EV_A);
1772	ev_init (timer, callback);	1933	ev_init (&timer, callback);
1773	last_activity = ev_now (loop);	1934	callback (EV_A_ &timer, 0);
1774	callback (loop, timer, EV_TIMER);
1775		1935
1776	And when there is some activity, simply store the current time in	1936	When there is some activity, simply store the current time in
1777	C<last_activity>, no libev calls at all:	1937	C<last_activity>, no libev calls at all:
1778		1938
		1939	if (activity detected)
1779	last_activity = ev_now (loop);	1940	last_activity = ev_now (EV_A);
		1941
		1942	When your timeout value changes, then the timeout can be changed by simply
		1943	providing a new value, stopping the timer and calling the callback, which
		1944	will again do the right thing (for example, time out immediately :).
		1945
		1946	timeout = new_value;
		1947	ev_timer_stop (EV_A_ &timer);
		1948	callback (EV_A_ &timer, 0);
1780		1949
1781	This technique is slightly more complex, but in most cases where the	1950	This technique is slightly more complex, but in most cases where the
1782	time-out is unlikely to be triggered, much more efficient.	1951	time-out is unlikely to be triggered, much more efficient.
1783
1784	Changing the timeout is trivial as well (if it isn't hard-coded in the
1785	callback :) - just change the timeout and invoke the callback, which will
1786	fix things for you.
1787		1952
1788	=item 4. Wee, just use a double-linked list for your timeouts.	1953	=item 4. Wee, just use a double-linked list for your timeouts.
1789		1954
1790	If there is not one request, but many thousands (millions...), all	1955	If there is not one request, but many thousands (millions...), all
1791	employing some kind of timeout with the same timeout value, then one can	1956	employing some kind of timeout with the same timeout value, then one can
…		…
1818	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is	1983	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
1819	rather complicated, but extremely efficient, something that really pays	1984	rather complicated, but extremely efficient, something that really pays
1820	off after the first million or so of active timers, i.e. it's usually	1985	off after the first million or so of active timers, i.e. it's usually
1821	overkill :)	1986	overkill :)
1822		1987
		1988	=head3 The special problem of being too early
		1989
		1990	If you ask a timer to call your callback after three seconds, then
		1991	you expect it to be invoked after three seconds - but of course, this
		1992	cannot be guaranteed to infinite precision. Less obviously, it cannot be
		1993	guaranteed to any precision by libev - imagine somebody suspending the
		1994	process with a STOP signal for a few hours for example.
		1995
		1996	So, libev tries to invoke your callback as soon as possible I<after> the
		1997	delay has occurred, but cannot guarantee this.
		1998
		1999	A less obvious failure mode is calling your callback too early: many event
		2000	loops compare timestamps with a "elapsed delay >= requested delay", but
		2001	this can cause your callback to be invoked much earlier than you would
		2002	expect.
		2003
		2004	To see why, imagine a system with a clock that only offers full second
		2005	resolution (think windows if you can't come up with a broken enough OS
		2006	yourself). If you schedule a one-second timer at the time 500.9, then the
		2007	event loop will schedule your timeout to elapse at a system time of 500
		2008	(500.9 truncated to the resolution) + 1, or 501.
		2009
		2010	If an event library looks at the timeout 0.1s later, it will see "501 >=
		2011	501" and invoke the callback 0.1s after it was started, even though a
		2012	one-second delay was requested - this is being "too early", despite best
		2013	intentions.
		2014
		2015	This is the reason why libev will never invoke the callback if the elapsed
		2016	delay equals the requested delay, but only when the elapsed delay is
		2017	larger than the requested delay. In the example above, libev would only invoke
		2018	the callback at system time 502, or 1.1s after the timer was started.
		2019
		2020	So, while libev cannot guarantee that your callback will be invoked
		2021	exactly when requested, it I<can> and I<does> guarantee that the requested
		2022	delay has actually elapsed, or in other words, it always errs on the "too
		2023	late" side of things.
		2024
1823	=head3 The special problem of time updates	2025	=head3 The special problem of time updates
1824		2026
1825	Establishing the current time is a costly operation (it usually takes at	2027	Establishing the current time is a costly operation (it usually takes
1826	least two system calls): EV therefore updates its idea of the current	2028	at least one system call): EV therefore updates its idea of the current
1827	time only before and after C<ev_loop> collects new events, which causes a	2029	time only before and after C<ev_run> collects new events, which causes a
1828	growing difference between C<ev_now ()> and C<ev_time ()> when handling	2030	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1829	lots of events in one iteration.	2031	lots of events in one iteration.
1830		2032
1831	The relative timeouts are calculated relative to the C<ev_now ()>	2033	The relative timeouts are calculated relative to the C<ev_now ()>
1832	time. This is usually the right thing as this timestamp refers to the time	2034	time. This is usually the right thing as this timestamp refers to the time
1833	of the event triggering whatever timeout you are modifying/starting. If	2035	of the event triggering whatever timeout you are modifying/starting. If
1834	you suspect event processing to be delayed and you I<need> to base the	2036	you suspect event processing to be delayed and you I<need> to base the
1835	timeout on the current time, use something like this to adjust for this:	2037	timeout on the current time, use something like the following to adjust
		2038	for it:
1836		2039
1837	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	2040	ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
1838		2041
1839	If the event loop is suspended for a long time, you can also force an	2042	If the event loop is suspended for a long time, you can also force an
1840	update of the time returned by C<ev_now ()> by calling C<ev_now_update	2043	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1841	()>.	2044	()>, although that will push the event time of all outstanding events
		2045	further into the future.
		2046
		2047	=head3 The special problem of unsynchronised clocks
		2048
		2049	Modern systems have a variety of clocks - libev itself uses the normal
		2050	"wall clock" clock and, if available, the monotonic clock (to avoid time
		2051	jumps).
		2052
		2053	Neither of these clocks is synchronised with each other or any other clock
		2054	on the system, so C<ev_time ()> might return a considerably different time
		2055	than C<gettimeofday ()> or C<time ()>. On a GNU/Linux system, for example,
		2056	a call to C<gettimeofday> might return a second count that is one higher
		2057	than a directly following call to C<time>.
		2058
		2059	The moral of this is to only compare libev-related timestamps with
		2060	C<ev_time ()> and C<ev_now ()>, at least if you want better precision than
		2061	a second or so.
		2062
		2063	One more problem arises due to this lack of synchronisation: if libev uses
		2064	the system monotonic clock and you compare timestamps from C<ev_time>
		2065	or C<ev_now> from when you started your timer and when your callback is
		2066	invoked, you will find that sometimes the callback is a bit "early".
		2067
		2068	This is because C<ev_timer>s work in real time, not wall clock time, so
		2069	libev makes sure your callback is not invoked before the delay happened,
		2070	I<measured according to the real time>, not the system clock.
		2071
		2072	If your timeouts are based on a physical timescale (e.g. "time out this
		2073	connection after 100 seconds") then this shouldn't bother you as it is
		2074	exactly the right behaviour.
		2075
		2076	If you want to compare wall clock/system timestamps to your timers, then
		2077	you need to use C<ev_periodic>s, as these are based on the wall clock
		2078	time, where your comparisons will always generate correct results.
1842		2079
1843	=head3 The special problems of suspended animation	2080	=head3 The special problems of suspended animation
1844		2081
1845	When you leave the server world it is quite customary to hit machines that	2082	When you leave the server world it is quite customary to hit machines that
1846	can suspend/hibernate - what happens to the clocks during such a suspend?	2083	can suspend/hibernate - what happens to the clocks during such a suspend?
…		…
1890	keep up with the timer (because it takes longer than those 10 seconds to	2127	keep up with the timer (because it takes longer than those 10 seconds to
1891	do stuff) the timer will not fire more than once per event loop iteration.	2128	do stuff) the timer will not fire more than once per event loop iteration.
1892		2129
1893	=item ev_timer_again (loop, ev_timer *)	2130	=item ev_timer_again (loop, ev_timer *)
1894		2131
1895	This will act as if the timer timed out and restart it again if it is	2132	This will act as if the timer timed out, and restarts it again if it is
1896	repeating. The exact semantics are:	2133	repeating. It basically works like calling C<ev_timer_stop>, updating the
		2134	timeout to the C<repeat> value and calling C<ev_timer_start>.
1897		2135
		2136	The exact semantics are as in the following rules, all of which will be
		2137	applied to the watcher:
		2138
		2139	=over 4
		2140
1898	If the timer is pending, its pending status is cleared.	2141	=item If the timer is pending, the pending status is always cleared.
1899		2142
1900	If the timer is started but non-repeating, stop it (as if it timed out).	2143	=item If the timer is started but non-repeating, stop it (as if it timed
		2144	out, without invoking it).
1901		2145
1902	If the timer is repeating, either start it if necessary (with the	2146	=item If the timer is repeating, make the C<repeat> value the new timeout
1903	C<repeat> value), or reset the running timer to the C<repeat> value.	2147	and start the timer, if necessary.
1904		2148
		2149	=back
		2150
1905	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a	2151	This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
1906	usage example.	2152	usage example.
1907		2153
1908	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)	2154	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1909		2155
1910	Returns the remaining time until a timer fires. If the timer is active,	2156	Returns the remaining time until a timer fires. If the timer is active,
…		…
1949	}	2195	}
1950		2196
1951	ev_timer mytimer;	2197	ev_timer mytimer;
1952	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	2198	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1953	ev_timer_again (&mytimer); /* start timer */	2199	ev_timer_again (&mytimer); /* start timer */
1954	ev_loop (loop, 0);	2200	ev_run (loop, 0);
1955		2201
1956	// and in some piece of code that gets executed on any "activity":	2202	// and in some piece of code that gets executed on any "activity":
1957	// reset the timeout to start ticking again at 10 seconds	2203	// reset the timeout to start ticking again at 10 seconds
1958	ev_timer_again (&mytimer);	2204	ev_timer_again (&mytimer);
1959		2205
…		…
1985		2231
1986	As with timers, the callback is guaranteed to be invoked only when the	2232	As with timers, the callback is guaranteed to be invoked only when the
1987	point in time where it is supposed to trigger has passed. If multiple	2233	point in time where it is supposed to trigger has passed. If multiple
1988	timers become ready during the same loop iteration then the ones with	2234	timers become ready during the same loop iteration then the ones with
1989	earlier time-out values are invoked before ones with later time-out values	2235	earlier time-out values are invoked before ones with later time-out values
1990	(but this is no longer true when a callback calls C<ev_loop> recursively).	2236	(but this is no longer true when a callback calls C<ev_run> recursively).
1991		2237
1992	=head3 Watcher-Specific Functions and Data Members	2238	=head3 Watcher-Specific Functions and Data Members
1993		2239
1994	=over 4	2240	=over 4
1995		2241
…		…
2030		2276
2031	Another way to think about it (for the mathematically inclined) is that	2277	Another way to think about it (for the mathematically inclined) is that
2032	C<ev_periodic> will try to run the callback in this mode at the next possible	2278	C<ev_periodic> will try to run the callback in this mode at the next possible
2033	time where C<time = offset (mod interval)>, regardless of any time jumps.	2279	time where C<time = offset (mod interval)>, regardless of any time jumps.
2034		2280
2035	For numerical stability it is preferable that the C<offset> value is near	2281	The C<interval> I<MUST> be positive, and for numerical stability, the
2036	C<ev_now ()> (the current time), but there is no range requirement for	2282	interval value should be higher than C<1/8192> (which is around 100
2037	this value, and in fact is often specified as zero.	2283	microseconds) and C<offset> should be higher than C<0> and should have
		2284	at most a similar magnitude as the current time (say, within a factor of
		2285	ten). Typical values for offset are, in fact, C<0> or something between
		2286	C<0> and C<interval>, which is also the recommended range.
2038		2287
2039	Note also that there is an upper limit to how often a timer can fire (CPU	2288	Note also that there is an upper limit to how often a timer can fire (CPU
2040	speed for example), so if C<interval> is very small then timing stability	2289	speed for example), so if C<interval> is very small then timing stability
2041	will of course deteriorate. Libev itself tries to be exact to be about one	2290	will of course deteriorate. Libev itself tries to be exact to be about one
2042	millisecond (if the OS supports it and the machine is fast enough).	2291	millisecond (if the OS supports it and the machine is fast enough).
…		…
2123	Example: Call a callback every hour, or, more precisely, whenever the	2372	Example: Call a callback every hour, or, more precisely, whenever the
2124	system time is divisible by 3600. The callback invocation times have	2373	system time is divisible by 3600. The callback invocation times have
2125	potentially a lot of jitter, but good long-term stability.	2374	potentially a lot of jitter, but good long-term stability.
2126		2375
2127	static void	2376	static void
2128	clock_cb (struct ev_loop *loop, ev_io *w, int revents)	2377	clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
2129	{	2378	{
2130	... its now a full hour (UTC, or TAI or whatever your clock follows)	2379	... its now a full hour (UTC, or TAI or whatever your clock follows)
2131	}	2380	}
2132		2381
2133	ev_periodic hourly_tick;	2382	ev_periodic hourly_tick;
…		…
2150		2399
2151	ev_periodic hourly_tick;	2400	ev_periodic hourly_tick;
2152	ev_periodic_init (&hourly_tick, clock_cb,	2401	ev_periodic_init (&hourly_tick, clock_cb,
2153	fmod (ev_now (loop), 3600.), 3600., 0);	2402	fmod (ev_now (loop), 3600.), 3600., 0);
2154	ev_periodic_start (loop, &hourly_tick);	2403	ev_periodic_start (loop, &hourly_tick);
2155		2404
2156		2405
2157	=head2 C<ev_signal> - signal me when a signal gets signalled!	2406	=head2 C<ev_signal> - signal me when a signal gets signalled!
2158		2407
2159	Signal watchers will trigger an event when the process receives a specific	2408	Signal watchers will trigger an event when the process receives a specific
2160	signal one or more times. Even though signals are very asynchronous, libev	2409	signal one or more times. Even though signals are very asynchronous, libev
2161	will try it's best to deliver signals synchronously, i.e. as part of the	2410	will try its best to deliver signals synchronously, i.e. as part of the
2162	normal event processing, like any other event.	2411	normal event processing, like any other event.
2163		2412
2164	If you want signals to be delivered truly asynchronously, just use	2413	If you want signals to be delivered truly asynchronously, just use
2165	C<sigaction> as you would do without libev and forget about sharing	2414	C<sigaction> as you would do without libev and forget about sharing
2166	the signal. You can even use C<ev_async> from a signal handler to	2415	the signal. You can even use C<ev_async> from a signal handler to
…		…
2170	only within the same loop, i.e. you can watch for C<SIGINT> in your	2419	only within the same loop, i.e. you can watch for C<SIGINT> in your
2171	default loop and for C<SIGIO> in another loop, but you cannot watch for	2420	default loop and for C<SIGIO> in another loop, but you cannot watch for
2172	C<SIGINT> in both the default loop and another loop at the same time. At	2421	C<SIGINT> in both the default loop and another loop at the same time. At
2173	the moment, C<SIGCHLD> is permanently tied to the default loop.	2422	the moment, C<SIGCHLD> is permanently tied to the default loop.
2174		2423
2175	When the first watcher gets started will libev actually register something	2424	Only after the first watcher for a signal is started will libev actually
2176	with the kernel (thus it coexists with your own signal handlers as long as	2425	register something with the kernel. It thus coexists with your own signal
2177	you don't register any with libev for the same signal).	2426	handlers as long as you don't register any with libev for the same signal.
2178		2427
2179	If possible and supported, libev will install its handlers with	2428	If possible and supported, libev will install its handlers with
2180	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should	2429	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2181	not be unduly interrupted. If you have a problem with system calls getting	2430	not be unduly interrupted. If you have a problem with system calls getting
2182	interrupted by signals you can block all signals in an C<ev_check> watcher	2431	interrupted by signals you can block all signals in an C<ev_check> watcher
…		…
2185	=head3 The special problem of inheritance over fork/execve/pthread_create	2434	=head3 The special problem of inheritance over fork/execve/pthread_create
2186		2435
2187	Both the signal mask (C<sigprocmask>) and the signal disposition	2436	Both the signal mask (C<sigprocmask>) and the signal disposition
2188	(C<sigaction>) are unspecified after starting a signal watcher (and after	2437	(C<sigaction>) are unspecified after starting a signal watcher (and after
2189	stopping it again), that is, libev might or might not block the signal,	2438	stopping it again), that is, libev might or might not block the signal,
2190	and might or might not set or restore the installed signal handler.	2439	and might or might not set or restore the installed signal handler (but
		2440	see C<EVFLAG_NOSIGMASK>).
2191		2441
2192	While this does not matter for the signal disposition (libev never	2442	While this does not matter for the signal disposition (libev never
2193	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2443	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2194	C<execve>), this matters for the signal mask: many programs do not expect	2444	C<execve>), this matters for the signal mask: many programs do not expect
2195	certain signals to be blocked.	2445	certain signals to be blocked.
…		…
2209		2459
2210	So I can't stress this enough: I<If you do not reset your signal mask when	2460	So I can't stress this enough: I<If you do not reset your signal mask when
2211	you expect it to be empty, you have a race condition in your code>. This	2461	you expect it to be empty, you have a race condition in your code>. This
2212	is not a libev-specific thing, this is true for most event libraries.	2462	is not a libev-specific thing, this is true for most event libraries.
2213		2463
		2464	=head3 The special problem of threads signal handling
		2465
		2466	POSIX threads has problematic signal handling semantics, specifically,
		2467	a lot of functionality (sigfd, sigwait etc.) only really works if all
		2468	threads in a process block signals, which is hard to achieve.
		2469
		2470	When you want to use sigwait (or mix libev signal handling with your own
		2471	for the same signals), you can tackle this problem by globally blocking
		2472	all signals before creating any threads (or creating them with a fully set
		2473	sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
		2474	loops. Then designate one thread as "signal receiver thread" which handles
		2475	these signals. You can pass on any signals that libev might be interested
		2476	in by calling C<ev_feed_signal>.
		2477
2214	=head3 Watcher-Specific Functions and Data Members	2478	=head3 Watcher-Specific Functions and Data Members
2215		2479
2216	=over 4	2480	=over 4
2217		2481
2218	=item ev_signal_init (ev_signal *, callback, int signum)	2482	=item ev_signal_init (ev_signal *, callback, int signum)
…		…
2233	Example: Try to exit cleanly on SIGINT.	2497	Example: Try to exit cleanly on SIGINT.
2234		2498
2235	static void	2499	static void
2236	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)	2500	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2237	{	2501	{
2238	ev_unloop (loop, EVUNLOOP_ALL);	2502	ev_break (loop, EVBREAK_ALL);
2239	}	2503	}
2240		2504
2241	ev_signal signal_watcher;	2505	ev_signal signal_watcher;
2242	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	2506	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2243	ev_signal_start (loop, &signal_watcher);	2507	ev_signal_start (loop, &signal_watcher);
…		…
2352		2616
2353	=head2 C<ev_stat> - did the file attributes just change?	2617	=head2 C<ev_stat> - did the file attributes just change?
2354		2618
2355	This watches a file system path for attribute changes. That is, it calls	2619	This watches a file system path for attribute changes. That is, it calls
2356	C<stat> on that path in regular intervals (or when the OS says it changed)	2620	C<stat> on that path in regular intervals (or when the OS says it changed)
2357	and sees if it changed compared to the last time, invoking the callback if	2621	and sees if it changed compared to the last time, invoking the callback
2358	it did.	2622	if it did. Starting the watcher C<stat>'s the file, so only changes that
		2623	happen after the watcher has been started will be reported.
2359		2624
2360	The path does not need to exist: changing from "path exists" to "path does	2625	The path does not need to exist: changing from "path exists" to "path does
2361	not exist" is a status change like any other. The condition "path does not	2626	not exist" is a status change like any other. The condition "path does not
2362	exist" (or more correctly "path cannot be stat'ed") is signified by the	2627	exist" (or more correctly "path cannot be stat'ed") is signified by the
2363	C<st_nlink> field being zero (which is otherwise always forced to be at	2628	C<st_nlink> field being zero (which is otherwise always forced to be at
…		…
2593	Apart from keeping your process non-blocking (which is a useful	2858	Apart from keeping your process non-blocking (which is a useful
2594	effect on its own sometimes), idle watchers are a good place to do	2859	effect on its own sometimes), idle watchers are a good place to do
2595	"pseudo-background processing", or delay processing stuff to after the	2860	"pseudo-background processing", or delay processing stuff to after the
2596	event loop has handled all outstanding events.	2861	event loop has handled all outstanding events.
2597		2862
		2863	=head3 Abusing an C<ev_idle> watcher for its side-effect
		2864
		2865	As long as there is at least one active idle watcher, libev will never
		2866	sleep unnecessarily. Or in other words, it will loop as fast as possible.
		2867	For this to work, the idle watcher doesn't need to be invoked at all - the
		2868	lowest priority will do.
		2869
		2870	This mode of operation can be useful together with an C<ev_check> watcher,
		2871	to do something on each event loop iteration - for example to balance load
		2872	between different connections.
		2873
		2874	See L</Abusing an ev_check watcher for its side-effect> for a longer
		2875	example.
		2876
2598	=head3 Watcher-Specific Functions and Data Members	2877	=head3 Watcher-Specific Functions and Data Members
2599		2878
2600	=over 4	2879	=over 4
2601		2880
2602	=item ev_idle_init (ev_idle *, callback)	2881	=item ev_idle_init (ev_idle *, callback)
…		…
2613	callback, free it. Also, use no error checking, as usual.	2892	callback, free it. Also, use no error checking, as usual.
2614		2893
2615	static void	2894	static void
2616	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)	2895	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2617	{	2896	{
		2897	// stop the watcher
		2898	ev_idle_stop (loop, w);
		2899
		2900	// now we can free it
2618	free (w);	2901	free (w);
		2902
2619	// now do something you wanted to do when the program has	2903	// now do something you wanted to do when the program has
2620	// no longer anything immediate to do.	2904	// no longer anything immediate to do.
2621	}	2905	}
2622		2906
2623	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2907	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
…		…
2625	ev_idle_start (loop, idle_watcher);	2909	ev_idle_start (loop, idle_watcher);
2626		2910
2627		2911
2628	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2912	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2629		2913
2630	Prepare and check watchers are usually (but not always) used in pairs:	2914	Prepare and check watchers are often (but not always) used in pairs:
2631	prepare watchers get invoked before the process blocks and check watchers	2915	prepare watchers get invoked before the process blocks and check watchers
2632	afterwards.	2916	afterwards.
2633		2917
2634	You I<must not> call C<ev_loop> or similar functions that enter	2918	You I<must not> call C<ev_run> (or similar functions that enter the
2635	the current event loop from either C<ev_prepare> or C<ev_check>	2919	current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2636	watchers. Other loops than the current one are fine, however. The	2920	C<ev_check> watchers. Other loops than the current one are fine,
2637	rationale behind this is that you do not need to check for recursion in	2921	however. The rationale behind this is that you do not need to check
2638	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2922	for recursion in those watchers, i.e. the sequence will always be
2639	C<ev_check> so if you have one watcher of each kind they will always be	2923	C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2640	called in pairs bracketing the blocking call.	2924	kind they will always be called in pairs bracketing the blocking call.
2641		2925
2642	Their main purpose is to integrate other event mechanisms into libev and	2926	Their main purpose is to integrate other event mechanisms into libev and
2643	their use is somewhat advanced. They could be used, for example, to track	2927	their use is somewhat advanced. They could be used, for example, to track
2644	variable changes, implement your own watchers, integrate net-snmp or a	2928	variable changes, implement your own watchers, integrate net-snmp or a
2645	coroutine library and lots more. They are also occasionally useful if	2929	coroutine library and lots more. They are also occasionally useful if
…		…
2663	with priority higher than or equal to the event loop and one coroutine	2947	with priority higher than or equal to the event loop and one coroutine
2664	of lower priority, but only once, using idle watchers to keep the event	2948	of lower priority, but only once, using idle watchers to keep the event
2665	loop from blocking if lower-priority coroutines are active, thus mapping	2949	loop from blocking if lower-priority coroutines are active, thus mapping
2666	low-priority coroutines to idle/background tasks).	2950	low-priority coroutines to idle/background tasks).
2667		2951
2668	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	2952	When used for this purpose, it is recommended to give C<ev_check> watchers
2669	priority, to ensure that they are being run before any other watchers	2953	highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2670	after the poll (this doesn't matter for C<ev_prepare> watchers).	2954	any other watchers after the poll (this doesn't matter for C<ev_prepare>
		2955	watchers).
2671		2956
2672	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not	2957	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2673	activate ("feed") events into libev. While libev fully supports this, they	2958	activate ("feed") events into libev. While libev fully supports this, they
2674	might get executed before other C<ev_check> watchers did their job. As	2959	might get executed before other C<ev_check> watchers did their job. As
2675	C<ev_check> watchers are often used to embed other (non-libev) event	2960	C<ev_check> watchers are often used to embed other (non-libev) event
2676	loops those other event loops might be in an unusable state until their	2961	loops those other event loops might be in an unusable state until their
2677	C<ev_check> watcher ran (always remind yourself to coexist peacefully with	2962	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2678	others).	2963	others).
		2964
		2965	=head3 Abusing an C<ev_check> watcher for its side-effect
		2966
		2967	C<ev_check> (and less often also C<ev_prepare>) watchers can also be
		2968	useful because they are called once per event loop iteration. For
		2969	example, if you want to handle a large number of connections fairly, you
		2970	normally only do a bit of work for each active connection, and if there
		2971	is more work to do, you wait for the next event loop iteration, so other
		2972	connections have a chance of making progress.
		2973
		2974	Using an C<ev_check> watcher is almost enough: it will be called on the
		2975	next event loop iteration. However, that isn't as soon as possible -
		2976	without external events, your C<ev_check> watcher will not be invoked.
		2977
		2978	This is where C<ev_idle> watchers come in handy - all you need is a
		2979	single global idle watcher that is active as long as you have one active
		2980	C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
		2981	will not sleep, and the C<ev_check> watcher makes sure a callback gets
		2982	invoked. Neither watcher alone can do that.
2679		2983
2680	=head3 Watcher-Specific Functions and Data Members	2984	=head3 Watcher-Specific Functions and Data Members
2681		2985
2682	=over 4	2986	=over 4
2683		2987
…		…
2807		3111
2808	if (timeout >= 0)	3112	if (timeout >= 0)
2809	// create/start timer	3113	// create/start timer
2810		3114
2811	// poll	3115	// poll
2812	ev_loop (EV_A_ 0);	3116	ev_run (EV_A_ 0);
2813		3117
2814	// stop timer again	3118	// stop timer again
2815	if (timeout >= 0)	3119	if (timeout >= 0)
2816	ev_timer_stop (EV_A_ &to);	3120	ev_timer_stop (EV_A_ &to);
2817		3121
…		…
2884		3188
2885	=over 4	3189	=over 4
2886		3190
2887	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)	3191	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
2888		3192
2889	=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)	3193	=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
2890		3194
2891	Configures the watcher to embed the given loop, which must be	3195	Configures the watcher to embed the given loop, which must be
2892	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be	3196	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
2893	invoked automatically, otherwise it is the responsibility of the callback	3197	invoked automatically, otherwise it is the responsibility of the callback
2894	to invoke it (it will continue to be called until the sweep has been done,	3198	to invoke it (it will continue to be called until the sweep has been done,
2895	if you do not want that, you need to temporarily stop the embed watcher).	3199	if you do not want that, you need to temporarily stop the embed watcher).
2896		3200
2897	=item ev_embed_sweep (loop, ev_embed *)	3201	=item ev_embed_sweep (loop, ev_embed *)
2898		3202
2899	Make a single, non-blocking sweep over the embedded loop. This works	3203	Make a single, non-blocking sweep over the embedded loop. This works
2900	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most	3204	similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2901	appropriate way for embedded loops.	3205	appropriate way for embedded loops.
2902		3206
2903	=item struct ev_loop *other [read-only]	3207	=item struct ev_loop *other [read-only]
2904		3208
2905	The embedded event loop.	3209	The embedded event loop.
…		…
2915	used).	3219	used).
2916		3220
2917	struct ev_loop *loop_hi = ev_default_init (0);	3221	struct ev_loop *loop_hi = ev_default_init (0);
2918	struct ev_loop *loop_lo = 0;	3222	struct ev_loop *loop_lo = 0;
2919	ev_embed embed;	3223	ev_embed embed;
2920		3224
2921	// see if there is a chance of getting one that works	3225	// see if there is a chance of getting one that works
2922	// (remember that a flags value of 0 means autodetection)	3226	// (remember that a flags value of 0 means autodetection)
2923	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	3227	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2924	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	3228	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
2925	: 0;	3229	: 0;
…		…
2939	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	3243	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2940		3244
2941	struct ev_loop *loop = ev_default_init (0);	3245	struct ev_loop *loop = ev_default_init (0);
2942	struct ev_loop *loop_socket = 0;	3246	struct ev_loop *loop_socket = 0;
2943	ev_embed embed;	3247	ev_embed embed;
2944		3248
2945	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	3249	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2946	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	3250	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2947	{	3251	{
2948	ev_embed_init (&embed, 0, loop_socket);	3252	ev_embed_init (&embed, 0, loop_socket);
2949	ev_embed_start (loop, &embed);	3253	ev_embed_start (loop, &embed);
…		…
2957		3261
2958	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	3262	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
2959		3263
2960	Fork watchers are called when a C<fork ()> was detected (usually because	3264	Fork watchers are called when a C<fork ()> was detected (usually because
2961	whoever is a good citizen cared to tell libev about it by calling	3265	whoever is a good citizen cared to tell libev about it by calling
2962	C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the	3266	C<ev_loop_fork>). The invocation is done before the event loop blocks next
2963	event loop blocks next and before C<ev_check> watchers are being called,	3267	and before C<ev_check> watchers are being called, and only in the child
2964	and only in the child after the fork. If whoever good citizen calling	3268	after the fork. If whoever good citizen calling C<ev_default_fork> cheats
2965	C<ev_default_fork> cheats and calls it in the wrong process, the fork	3269	and calls it in the wrong process, the fork handlers will be invoked, too,
2966	handlers will be invoked, too, of course.	3270	of course.
2967		3271
2968	=head3 The special problem of life after fork - how is it possible?	3272	=head3 The special problem of life after fork - how is it possible?
2969		3273
2970	Most uses of C<fork()> consist of forking, then some simple calls to ste	3274	Most uses of C<fork ()> consist of forking, then some simple calls to set
2971	up/change the process environment, followed by a call to C<exec()>. This	3275	up/change the process environment, followed by a call to C<exec()>. This
2972	sequence should be handled by libev without any problems.	3276	sequence should be handled by libev without any problems.
2973		3277
2974	This changes when the application actually wants to do event handling	3278	This changes when the application actually wants to do event handling
2975	in the child, or both parent in child, in effect "continuing" after the	3279	in the child, or both parent in child, in effect "continuing" after the
…		…
2991	disadvantage of having to use multiple event loops (which do not support	3295	disadvantage of having to use multiple event loops (which do not support
2992	signal watchers).	3296	signal watchers).
2993		3297
2994	When this is not possible, or you want to use the default loop for	3298	When this is not possible, or you want to use the default loop for
2995	other reasons, then in the process that wants to start "fresh", call	3299	other reasons, then in the process that wants to start "fresh", call
2996	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying	3300	C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
2997	the default loop will "orphan" (not stop) all registered watchers, so you	3301	Destroying the default loop will "orphan" (not stop) all registered
2998	have to be careful not to execute code that modifies those watchers. Note	3302	watchers, so you have to be careful not to execute code that modifies
2999	also that in that case, you have to re-register any signal watchers.	3303	those watchers. Note also that in that case, you have to re-register any
		3304	signal watchers.
3000		3305
3001	=head3 Watcher-Specific Functions and Data Members	3306	=head3 Watcher-Specific Functions and Data Members
3002		3307
3003	=over 4	3308	=over 4
3004		3309
3005	=item ev_fork_init (ev_signal *, callback)	3310	=item ev_fork_init (ev_fork *, callback)
3006		3311
3007	Initialises and configures the fork watcher - it has no parameters of any	3312	Initialises and configures the fork watcher - it has no parameters of any
3008	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,	3313	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3009	believe me.	3314	really.
3010		3315
3011	=back	3316	=back
3012		3317
3013		3318
		3319	=head2 C<ev_cleanup> - even the best things end
		3320
		3321	Cleanup watchers are called just before the event loop is being destroyed
		3322	by a call to C<ev_loop_destroy>.
		3323
		3324	While there is no guarantee that the event loop gets destroyed, cleanup
		3325	watchers provide a convenient method to install cleanup hooks for your
		3326	program, worker threads and so on - you just to make sure to destroy the
		3327	loop when you want them to be invoked.
		3328
		3329	Cleanup watchers are invoked in the same way as any other watcher. Unlike
		3330	all other watchers, they do not keep a reference to the event loop (which
		3331	makes a lot of sense if you think about it). Like all other watchers, you
		3332	can call libev functions in the callback, except C<ev_cleanup_start>.
		3333
		3334	=head3 Watcher-Specific Functions and Data Members
		3335
		3336	=over 4
		3337
		3338	=item ev_cleanup_init (ev_cleanup *, callback)
		3339
		3340	Initialises and configures the cleanup watcher - it has no parameters of
		3341	any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
		3342	pointless, I assure you.
		3343
		3344	=back
		3345
		3346	Example: Register an atexit handler to destroy the default loop, so any
		3347	cleanup functions are called.
		3348
		3349	static void
		3350	program_exits (void)
		3351	{
		3352	ev_loop_destroy (EV_DEFAULT_UC);
		3353	}
		3354
		3355	...
		3356	atexit (program_exits);
		3357
		3358
3014	=head2 C<ev_async> - how to wake up another event loop	3359	=head2 C<ev_async> - how to wake up an event loop
3015		3360
3016	In general, you cannot use an C<ev_loop> from multiple threads or other	3361	In general, you cannot use an C<ev_loop> from multiple threads or other
3017	asynchronous sources such as signal handlers (as opposed to multiple event	3362	asynchronous sources such as signal handlers (as opposed to multiple event
3018	loops - those are of course safe to use in different threads).	3363	loops - those are of course safe to use in different threads).
3019		3364
3020	Sometimes, however, you need to wake up another event loop you do not	3365	Sometimes, however, you need to wake up an event loop you do not control,
3021	control, for example because it belongs to another thread. This is what	3366	for example because it belongs to another thread. This is what C<ev_async>
3022	C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you	3367	watchers do: as long as the C<ev_async> watcher is active, you can signal
3023	can signal it by calling C<ev_async_send>, which is thread- and signal	3368	it by calling C<ev_async_send>, which is thread- and signal safe.
3024	safe.
3025		3369
3026	This functionality is very similar to C<ev_signal> watchers, as signals,	3370	This functionality is very similar to C<ev_signal> watchers, as signals,
3027	too, are asynchronous in nature, and signals, too, will be compressed	3371	too, are asynchronous in nature, and signals, too, will be compressed
3028	(i.e. the number of callback invocations may be less than the number of	3372	(i.e. the number of callback invocations may be less than the number of
3029	C<ev_async_sent> calls).	3373	C<ev_async_send> calls). In fact, you could use signal watchers as a kind
3030		3374	of "global async watchers" by using a watcher on an otherwise unused
3031	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not	3375	signal, and C<ev_feed_signal> to signal this watcher from another thread,
3032	just the default loop.	3376	even without knowing which loop owns the signal.
3033		3377
3034	=head3 Queueing	3378	=head3 Queueing
3035		3379
3036	C<ev_async> does not support queueing of data in any way. The reason	3380	C<ev_async> does not support queueing of data in any way. The reason
3037	is that the author does not know of a simple (or any) algorithm for a	3381	is that the author does not know of a simple (or any) algorithm for a
…		…
3129	trust me.	3473	trust me.
3130		3474
3131	=item ev_async_send (loop, ev_async *)	3475	=item ev_async_send (loop, ev_async *)
3132		3476
3133	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3477	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3134	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3478	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3479	returns.
		3480
3135	C<ev_feed_event>, this call is safe to do from other threads, signal or	3481	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3136	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3482	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3137	section below on what exactly this means).	3483	embedding section below on what exactly this means).
3138		3484
3139	Note that, as with other watchers in libev, multiple events might get	3485	Note that, as with other watchers in libev, multiple events might get
3140	compressed into a single callback invocation (another way to look at this	3486	compressed into a single callback invocation (another way to look at
3141	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3487	this is that C<ev_async> watchers are level-triggered: they are set on
3142	reset when the event loop detects that).	3488	C<ev_async_send>, reset when the event loop detects that).
3143		3489
3144	This call incurs the overhead of a system call only once per event loop	3490	This call incurs the overhead of at most one extra system call per event
3145	iteration, so while the overhead might be noticeable, it doesn't apply to	3491	loop iteration, if the event loop is blocked, and no syscall at all if
3146	repeated calls to C<ev_async_send> for the same event loop.	3492	the event loop (or your program) is processing events. That means that
		3493	repeated calls are basically free (there is no need to avoid calls for
		3494	performance reasons) and that the overhead becomes smaller (typically
		3495	zero) under load.
3147		3496
3148	=item bool = ev_async_pending (ev_async *)	3497	=item bool = ev_async_pending (ev_async *)
3149		3498
3150	Returns a non-zero value when C<ev_async_send> has been called on the	3499	Returns a non-zero value when C<ev_async_send> has been called on the
3151	watcher but the event has not yet been processed (or even noted) by the	3500	watcher but the event has not yet been processed (or even noted) by the
…		…
3206	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3555	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3207		3556
3208	=item ev_feed_fd_event (loop, int fd, int revents)	3557	=item ev_feed_fd_event (loop, int fd, int revents)
3209		3558
3210	Feed an event on the given fd, as if a file descriptor backend detected	3559	Feed an event on the given fd, as if a file descriptor backend detected
3211	the given events it.	3560	the given events.
3212		3561
3213	=item ev_feed_signal_event (loop, int signum)	3562	=item ev_feed_signal_event (loop, int signum)
3214		3563
3215	Feed an event as if the given signal occurred (C<loop> must be the default	3564	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3216	loop!).	3565	which is async-safe.
3217		3566
3218	=back	3567	=back
		3568
		3569
		3570	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
		3571
		3572	This section explains some common idioms that are not immediately
		3573	obvious. Note that examples are sprinkled over the whole manual, and this
		3574	section only contains stuff that wouldn't fit anywhere else.
		3575
		3576	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3577
		3578	Each watcher has, by default, a C<void *data> member that you can read
		3579	or modify at any time: libev will completely ignore it. This can be used
		3580	to associate arbitrary data with your watcher. If you need more data and
		3581	don't want to allocate memory separately and store a pointer to it in that
		3582	data member, you can also "subclass" the watcher type and provide your own
		3583	data:
		3584
		3585	struct my_io
		3586	{
		3587	ev_io io;
		3588	int otherfd;
		3589	void *somedata;
		3590	struct whatever *mostinteresting;
		3591	};
		3592
		3593	...
		3594	struct my_io w;
		3595	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3596
		3597	And since your callback will be called with a pointer to the watcher, you
		3598	can cast it back to your own type:
		3599
		3600	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
		3601	{
		3602	struct my_io *w = (struct my_io *)w_;
		3603	...
		3604	}
		3605
		3606	More interesting and less C-conformant ways of casting your callback
		3607	function type instead have been omitted.
		3608
		3609	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3610
		3611	Another common scenario is to use some data structure with multiple
		3612	embedded watchers, in effect creating your own watcher that combines
		3613	multiple libev event sources into one "super-watcher":
		3614
		3615	struct my_biggy
		3616	{
		3617	int some_data;
		3618	ev_timer t1;
		3619	ev_timer t2;
		3620	}
		3621
		3622	In this case getting the pointer to C<my_biggy> is a bit more
		3623	complicated: Either you store the address of your C<my_biggy> struct in
		3624	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3625	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3626	real programmers):
		3627
		3628	#include <stddef.h>
		3629
		3630	static void
		3631	t1_cb (EV_P_ ev_timer *w, int revents)
		3632	{
		3633	struct my_biggy big = (struct my_biggy *)
		3634	(((char *)w) - offsetof (struct my_biggy, t1));
		3635	}
		3636
		3637	static void
		3638	t2_cb (EV_P_ ev_timer *w, int revents)
		3639	{
		3640	struct my_biggy big = (struct my_biggy *)
		3641	(((char *)w) - offsetof (struct my_biggy, t2));
		3642	}
		3643
		3644	=head2 AVOIDING FINISHING BEFORE RETURNING
		3645
		3646	Often you have structures like this in event-based programs:
		3647
		3648	callback ()
		3649	{
		3650	free (request);
		3651	}
		3652
		3653	request = start_new_request (..., callback);
		3654
		3655	The intent is to start some "lengthy" operation. The C<request> could be
		3656	used to cancel the operation, or do other things with it.
		3657
		3658	It's not uncommon to have code paths in C<start_new_request> that
		3659	immediately invoke the callback, for example, to report errors. Or you add
		3660	some caching layer that finds that it can skip the lengthy aspects of the
		3661	operation and simply invoke the callback with the result.
		3662
		3663	The problem here is that this will happen I<before> C<start_new_request>
		3664	has returned, so C<request> is not set.
		3665
		3666	Even if you pass the request by some safer means to the callback, you
		3667	might want to do something to the request after starting it, such as
		3668	canceling it, which probably isn't working so well when the callback has
		3669	already been invoked.
		3670
		3671	A common way around all these issues is to make sure that
		3672	C<start_new_request> I<always> returns before the callback is invoked. If
		3673	C<start_new_request> immediately knows the result, it can artificially
		3674	delay invoking the callback by using a C<prepare> or C<idle> watcher for
		3675	example, or more sneakily, by reusing an existing (stopped) watcher and
		3676	pushing it into the pending queue:
		3677
		3678	ev_set_cb (watcher, callback);
		3679	ev_feed_event (EV_A_ watcher, 0);
		3680
		3681	This way, C<start_new_request> can safely return before the callback is
		3682	invoked, while not delaying callback invocation too much.
		3683
		3684	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
		3685
		3686	Often (especially in GUI toolkits) there are places where you have
		3687	I<modal> interaction, which is most easily implemented by recursively
		3688	invoking C<ev_run>.
		3689
		3690	This brings the problem of exiting - a callback might want to finish the
		3691	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
		3692	a modal "Are you sure?" dialog is still waiting), or just the nested one
		3693	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
		3694	other combination: In these cases, a simple C<ev_break> will not work.
		3695
		3696	The solution is to maintain "break this loop" variable for each C<ev_run>
		3697	invocation, and use a loop around C<ev_run> until the condition is
		3698	triggered, using C<EVRUN_ONCE>:
		3699
		3700	// main loop
		3701	int exit_main_loop = 0;
		3702
		3703	while (!exit_main_loop)
		3704	ev_run (EV_DEFAULT_ EVRUN_ONCE);
		3705
		3706	// in a modal watcher
		3707	int exit_nested_loop = 0;
		3708
		3709	while (!exit_nested_loop)
		3710	ev_run (EV_A_ EVRUN_ONCE);
		3711
		3712	To exit from any of these loops, just set the corresponding exit variable:
		3713
		3714	// exit modal loop
		3715	exit_nested_loop = 1;
		3716
		3717	// exit main program, after modal loop is finished
		3718	exit_main_loop = 1;
		3719
		3720	// exit both
		3721	exit_main_loop = exit_nested_loop = 1;
		3722
		3723	=head2 THREAD LOCKING EXAMPLE
		3724
		3725	Here is a fictitious example of how to run an event loop in a different
		3726	thread from where callbacks are being invoked and watchers are
		3727	created/added/removed.
		3728
		3729	For a real-world example, see the C<EV::Loop::Async> perl module,
		3730	which uses exactly this technique (which is suited for many high-level
		3731	languages).
		3732
		3733	The example uses a pthread mutex to protect the loop data, a condition
		3734	variable to wait for callback invocations, an async watcher to notify the
		3735	event loop thread and an unspecified mechanism to wake up the main thread.
		3736
		3737	First, you need to associate some data with the event loop:
		3738
		3739	typedef struct {
		3740	mutex_t lock; /* global loop lock */
		3741	ev_async async_w;
		3742	thread_t tid;
		3743	cond_t invoke_cv;
		3744	} userdata;
		3745
		3746	void prepare_loop (EV_P)
		3747	{
		3748	// for simplicity, we use a static userdata struct.
		3749	static userdata u;
		3750
		3751	ev_async_init (&u->async_w, async_cb);
		3752	ev_async_start (EV_A_ &u->async_w);
		3753
		3754	pthread_mutex_init (&u->lock, 0);
		3755	pthread_cond_init (&u->invoke_cv, 0);
		3756
		3757	// now associate this with the loop
		3758	ev_set_userdata (EV_A_ u);
		3759	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3760	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3761
		3762	// then create the thread running ev_run
		3763	pthread_create (&u->tid, 0, l_run, EV_A);
		3764	}
		3765
		3766	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3767	solely to wake up the event loop so it takes notice of any new watchers
		3768	that might have been added:
		3769
		3770	static void
		3771	async_cb (EV_P_ ev_async *w, int revents)
		3772	{
		3773	// just used for the side effects
		3774	}
		3775
		3776	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3777	protecting the loop data, respectively.
		3778
		3779	static void
		3780	l_release (EV_P)
		3781	{
		3782	userdata *u = ev_userdata (EV_A);
		3783	pthread_mutex_unlock (&u->lock);
		3784	}
		3785
		3786	static void
		3787	l_acquire (EV_P)
		3788	{
		3789	userdata *u = ev_userdata (EV_A);
		3790	pthread_mutex_lock (&u->lock);
		3791	}
		3792
		3793	The event loop thread first acquires the mutex, and then jumps straight
		3794	into C<ev_run>:
		3795
		3796	void *
		3797	l_run (void *thr_arg)
		3798	{
		3799	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		3800
		3801	l_acquire (EV_A);
		3802	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3803	ev_run (EV_A_ 0);
		3804	l_release (EV_A);
		3805
		3806	return 0;
		3807	}
		3808
		3809	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3810	signal the main thread via some unspecified mechanism (signals? pipe
		3811	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3812	have been called (in a while loop because a) spurious wakeups are possible
		3813	and b) skipping inter-thread-communication when there are no pending
		3814	watchers is very beneficial):
		3815
		3816	static void
		3817	l_invoke (EV_P)
		3818	{
		3819	userdata *u = ev_userdata (EV_A);
		3820
		3821	while (ev_pending_count (EV_A))
		3822	{
		3823	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3824	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3825	}
		3826	}
		3827
		3828	Now, whenever the main thread gets told to invoke pending watchers, it
		3829	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3830	thread to continue:
		3831
		3832	static void
		3833	real_invoke_pending (EV_P)
		3834	{
		3835	userdata *u = ev_userdata (EV_A);
		3836
		3837	pthread_mutex_lock (&u->lock);
		3838	ev_invoke_pending (EV_A);
		3839	pthread_cond_signal (&u->invoke_cv);
		3840	pthread_mutex_unlock (&u->lock);
		3841	}
		3842
		3843	Whenever you want to start/stop a watcher or do other modifications to an
		3844	event loop, you will now have to lock:
		3845
		3846	ev_timer timeout_watcher;
		3847	userdata *u = ev_userdata (EV_A);
		3848
		3849	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3850
		3851	pthread_mutex_lock (&u->lock);
		3852	ev_timer_start (EV_A_ &timeout_watcher);
		3853	ev_async_send (EV_A_ &u->async_w);
		3854	pthread_mutex_unlock (&u->lock);
		3855
		3856	Note that sending the C<ev_async> watcher is required because otherwise
		3857	an event loop currently blocking in the kernel will have no knowledge
		3858	about the newly added timer. By waking up the loop it will pick up any new
		3859	watchers in the next event loop iteration.
		3860
		3861	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3862
		3863	While the overhead of a callback that e.g. schedules a thread is small, it
		3864	is still an overhead. If you embed libev, and your main usage is with some
		3865	kind of threads or coroutines, you might want to customise libev so that
		3866	doesn't need callbacks anymore.
		3867
		3868	Imagine you have coroutines that you can switch to using a function
		3869	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3870	and that due to some magic, the currently active coroutine is stored in a
		3871	global called C<current_coro>. Then you can build your own "wait for libev
		3872	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3873	the differing C<;> conventions):
		3874
		3875	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3876	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3877
		3878	That means instead of having a C callback function, you store the
		3879	coroutine to switch to in each watcher, and instead of having libev call
		3880	your callback, you instead have it switch to that coroutine.
		3881
		3882	A coroutine might now wait for an event with a function called
		3883	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3884	matter when, or whether the watcher is active or not when this function is
		3885	called):
		3886
		3887	void
		3888	wait_for_event (ev_watcher *w)
		3889	{
		3890	ev_set_cb (w, current_coro);
		3891	switch_to (libev_coro);
		3892	}
		3893
		3894	That basically suspends the coroutine inside C<wait_for_event> and
		3895	continues the libev coroutine, which, when appropriate, switches back to
		3896	this or any other coroutine.
		3897
		3898	You can do similar tricks if you have, say, threads with an event queue -
		3899	instead of storing a coroutine, you store the queue object and instead of
		3900	switching to a coroutine, you push the watcher onto the queue and notify
		3901	any waiters.
		3902
		3903	To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
		3904	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3905
		3906	// my_ev.h
		3907	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3908	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3909	#include "../libev/ev.h"
		3910
		3911	// my_ev.c
		3912	#define EV_H "my_ev.h"
		3913	#include "../libev/ev.c"
		3914
		3915	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3916	F<my_ev.c> into your project. When properly specifying include paths, you
		3917	can even use F<ev.h> as header file name directly.
3219		3918
3220		3919
3221	=head1 LIBEVENT EMULATION	3920	=head1 LIBEVENT EMULATION
3222		3921
3223	Libev offers a compatibility emulation layer for libevent. It cannot	3922	Libev offers a compatibility emulation layer for libevent. It cannot
3224	emulate the internals of libevent, so here are some usage hints:	3923	emulate the internals of libevent, so here are some usage hints:
3225		3924
3226	=over 4	3925	=over 4
		3926
		3927	=item * Only the libevent-1.4.1-beta API is being emulated.
		3928
		3929	This was the newest libevent version available when libev was implemented,
		3930	and is still mostly unchanged in 2010.
3227		3931
3228	=item * Use it by including <event.h>, as usual.	3932	=item * Use it by including <event.h>, as usual.
3229		3933
3230	=item * The following members are fully supported: ev_base, ev_callback,	3934	=item * The following members are fully supported: ev_base, ev_callback,
3231	ev_arg, ev_fd, ev_res, ev_events.	3935	ev_arg, ev_fd, ev_res, ev_events.
…		…
3237	=item * Priorities are not currently supported. Initialising priorities	3941	=item * Priorities are not currently supported. Initialising priorities
3238	will fail and all watchers will have the same priority, even though there	3942	will fail and all watchers will have the same priority, even though there
3239	is an ev_pri field.	3943	is an ev_pri field.
3240		3944
3241	=item * In libevent, the last base created gets the signals, in libev, the	3945	=item * In libevent, the last base created gets the signals, in libev, the
3242	first base created (== the default loop) gets the signals.	3946	base that registered the signal gets the signals.
3243		3947
3244	=item * Other members are not supported.	3948	=item * Other members are not supported.
3245		3949
3246	=item * The libev emulation is I<not> ABI compatible to libevent, you need	3950	=item * The libev emulation is I<not> ABI compatible to libevent, you need
3247	to use the libev header file and library.	3951	to use the libev header file and library.
3248		3952
3249	=back	3953	=back
3250		3954
3251	=head1 C++ SUPPORT	3955	=head1 C++ SUPPORT
		3956
		3957	=head2 C API
		3958
		3959	The normal C API should work fine when used from C++: both ev.h and the
		3960	libev sources can be compiled as C++. Therefore, code that uses the C API
		3961	will work fine.
		3962
		3963	Proper exception specifications might have to be added to callbacks passed
		3964	to libev: exceptions may be thrown only from watcher callbacks, all
		3965	other callbacks (allocator, syserr, loop acquire/release and periodic
		3966	reschedule callbacks) must not throw exceptions, and might need a C<throw
		3967	()> specification. If you have code that needs to be compiled as both C
		3968	and C++ you can use the C<EV_THROW> macro for this:
		3969
		3970	static void
		3971	fatal_error (const char *msg) EV_THROW
		3972	{
		3973	perror (msg);
		3974	abort ();
		3975	}
		3976
		3977	...
		3978	ev_set_syserr_cb (fatal_error);
		3979
		3980	The only API functions that can currently throw exceptions are C<ev_run>,
		3981	C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
		3982	because it runs cleanup watchers).
		3983
		3984	Throwing exceptions in watcher callbacks is only supported if libev itself
		3985	is compiled with a C++ compiler or your C and C++ environments allow
		3986	throwing exceptions through C libraries (most do).
		3987
		3988	=head2 C++ API
3252		3989
3253	Libev comes with some simplistic wrapper classes for C++ that mainly allow	3990	Libev comes with some simplistic wrapper classes for C++ that mainly allow
3254	you to use some convenience methods to start/stop watchers and also change	3991	you to use some convenience methods to start/stop watchers and also change
3255	the callback model to a model using method callbacks on objects.	3992	the callback model to a model using method callbacks on objects.
3256		3993
3257	To use it,	3994	To use it,
3258		3995
3259	#include <ev++.h>	3996	#include <ev++.h>
3260		3997
3261	This automatically includes F<ev.h> and puts all of its definitions (many	3998	This automatically includes F<ev.h> and puts all of its definitions (many
3262	of them macros) into the global namespace. All C++ specific things are	3999	of them macros) into the global namespace. All C++ specific things are
3263	put into the C<ev> namespace. It should support all the same embedding	4000	put into the C<ev> namespace. It should support all the same embedding
…		…
3266	Care has been taken to keep the overhead low. The only data member the C++	4003	Care has been taken to keep the overhead low. The only data member the C++
3267	classes add (compared to plain C-style watchers) is the event loop pointer	4004	classes add (compared to plain C-style watchers) is the event loop pointer
3268	that the watcher is associated with (or no additional members at all if	4005	that the watcher is associated with (or no additional members at all if
3269	you disable C<EV_MULTIPLICITY> when embedding libev).	4006	you disable C<EV_MULTIPLICITY> when embedding libev).
3270		4007
3271	Currently, functions, and static and non-static member functions can be	4008	Currently, functions, static and non-static member functions and classes
3272	used as callbacks. Other types should be easy to add as long as they only	4009	with C<operator ()> can be used as callbacks. Other types should be easy
3273	need one additional pointer for context. If you need support for other	4010	to add as long as they only need one additional pointer for context. If
3274	types of functors please contact the author (preferably after implementing	4011	you need support for other types of functors please contact the author
3275	it).	4012	(preferably after implementing it).
		4013
		4014	For all this to work, your C++ compiler either has to use the same calling
		4015	conventions as your C compiler (for static member functions), or you have
		4016	to embed libev and compile libev itself as C++.
3276		4017
3277	Here is a list of things available in the C<ev> namespace:	4018	Here is a list of things available in the C<ev> namespace:
3278		4019
3279	=over 4	4020	=over 4
3280		4021
…		…
3290	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.	4031	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
3291		4032
3292	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of	4033	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
3293	the same name in the C<ev> namespace, with the exception of C<ev_signal>	4034	the same name in the C<ev> namespace, with the exception of C<ev_signal>
3294	which is called C<ev::sig> to avoid clashes with the C<signal> macro	4035	which is called C<ev::sig> to avoid clashes with the C<signal> macro
3295	defines by many implementations.	4036	defined by many implementations.
3296		4037
3297	All of those classes have these methods:	4038	All of those classes have these methods:
3298		4039
3299	=over 4	4040	=over 4
3300		4041
…		…
3362	void operator() (ev::io &w, int revents)	4103	void operator() (ev::io &w, int revents)
3363	{	4104	{
3364	...	4105	...
3365	}	4106	}
3366	}	4107	}
3367		4108
3368	myfunctor f;	4109	myfunctor f;
3369		4110
3370	ev::io w;	4111	ev::io w;
3371	w.set (&f);	4112	w.set (&f);
3372		4113
…		…
3390	Associates a different C<struct ev_loop> with this watcher. You can only	4131	Associates a different C<struct ev_loop> with this watcher. You can only
3391	do this when the watcher is inactive (and not pending either).	4132	do this when the watcher is inactive (and not pending either).
3392		4133
3393	=item w->set ([arguments])	4134	=item w->set ([arguments])
3394		4135
3395	Basically the same as C<ev_TYPE_set>, with the same arguments. Must be	4136	Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
		4137	with the same arguments. Either this method or a suitable start method
3396	called at least once. Unlike the C counterpart, an active watcher gets	4138	must be called at least once. Unlike the C counterpart, an active watcher
3397	automatically stopped and restarted when reconfiguring it with this	4139	gets automatically stopped and restarted when reconfiguring it with this
3398	method.	4140	method.
		4141
		4142	For C<ev::embed> watchers this method is called C<set_embed>, to avoid
		4143	clashing with the C<set (loop)> method.
3399		4144
3400	=item w->start ()	4145	=item w->start ()
3401		4146
3402	Starts the watcher. Note that there is no C<loop> argument, as the	4147	Starts the watcher. Note that there is no C<loop> argument, as the
3403	constructor already stores the event loop.	4148	constructor already stores the event loop.
3404		4149
		4150	=item w->start ([arguments])
		4151
		4152	Instead of calling C<set> and C<start> methods separately, it is often
		4153	convenient to wrap them in one call. Uses the same type of arguments as
		4154	the configure C<set> method of the watcher.
		4155
3405	=item w->stop ()	4156	=item w->stop ()
3406		4157
3407	Stops the watcher if it is active. Again, no C<loop> argument.	4158	Stops the watcher if it is active. Again, no C<loop> argument.
3408		4159
3409	=item w->again () (C<ev::timer>, C<ev::periodic> only)	4160	=item w->again () (C<ev::timer>, C<ev::periodic> only)
…		…
3421		4172
3422	=back	4173	=back
3423		4174
3424	=back	4175	=back
3425		4176
3426	Example: Define a class with an IO and idle watcher, start one of them in	4177	Example: Define a class with two I/O and idle watchers, start the I/O
3427	the constructor.	4178	watchers in the constructor.
3428		4179
3429	class myclass	4180	class myclass
3430	{	4181	{
3431	ev::io io ; void io_cb (ev::io &w, int revents);	4182	ev::io io ; void io_cb (ev::io &w, int revents);
		4183	ev::io io2 ; void io2_cb (ev::io &w, int revents);
3432	ev::idle idle; void idle_cb (ev::idle &w, int revents);	4184	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3433		4185
3434	myclass (int fd)	4186	myclass (int fd)
3435	{	4187	{
3436	io .set <myclass, &myclass::io_cb > (this);	4188	io .set <myclass, &myclass::io_cb > (this);
		4189	io2 .set <myclass, &myclass::io2_cb > (this);
3437	idle.set <myclass, &myclass::idle_cb> (this);	4190	idle.set <myclass, &myclass::idle_cb> (this);
3438		4191
3439	io.start (fd, ev::READ);	4192	io.set (fd, ev::WRITE); // configure the watcher
		4193	io.start (); // start it whenever convenient
		4194
		4195	io2.start (fd, ev::READ); // set + start in one call
3440	}	4196	}
3441	};	4197	};
3442		4198
3443		4199
3444	=head1 OTHER LANGUAGE BINDINGS	4200	=head1 OTHER LANGUAGE BINDINGS
…		…
3483	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.	4239	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
3484		4240
3485	=item D	4241	=item D
3486		4242
3487	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	4243	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
3488	be found at L<http://proj.llucax.com.ar/wiki/evd>.	4244	be found at L<http://www.llucax.com.ar/proj/ev.d/index.html>.
3489		4245
3490	=item Ocaml	4246	=item Ocaml
3491		4247
3492	Erkki Seppala has written Ocaml bindings for libev, to be found at	4248	Erkki Seppala has written Ocaml bindings for libev, to be found at
3493	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4249	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
…		…
3496		4252
3497	Brian Maher has written a partial interface to libev for lua (at the	4253	Brian Maher has written a partial interface to libev for lua (at the
3498	time of this writing, only C<ev_io> and C<ev_timer>), to be found at	4254	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3499	L<http://github.com/brimworks/lua-ev>.	4255	L<http://github.com/brimworks/lua-ev>.
3500		4256
		4257	=item Javascript
		4258
		4259	Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
		4260
		4261	=item Others
		4262
		4263	There are others, and I stopped counting.
		4264
3501	=back	4265	=back
3502		4266
3503		4267
3504	=head1 MACRO MAGIC	4268	=head1 MACRO MAGIC
3505		4269
…		…
3518	loop argument"). The C<EV_A> form is used when this is the sole argument,	4282	loop argument"). The C<EV_A> form is used when this is the sole argument,
3519	C<EV_A_> is used when other arguments are following. Example:	4283	C<EV_A_> is used when other arguments are following. Example:
3520		4284
3521	ev_unref (EV_A);	4285	ev_unref (EV_A);
3522	ev_timer_add (EV_A_ watcher);	4286	ev_timer_add (EV_A_ watcher);
3523	ev_loop (EV_A_ 0);	4287	ev_run (EV_A_ 0);
3524		4288
3525	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,	4289	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3526	which is often provided by the following macro.	4290	which is often provided by the following macro.
3527		4291
3528	=item C<EV_P>, C<EV_P_>	4292	=item C<EV_P>, C<EV_P_>
…		…
3541	suitable for use with C<EV_A>.	4305	suitable for use with C<EV_A>.
3542		4306
3543	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	4307	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
3544		4308
3545	Similar to the other two macros, this gives you the value of the default	4309	Similar to the other two macros, this gives you the value of the default
3546	loop, if multiple loops are supported ("ev loop default").	4310	loop, if multiple loops are supported ("ev loop default"). The default loop
		4311	will be initialised if it isn't already initialised.
		4312
		4313	For non-multiplicity builds, these macros do nothing, so you always have
		4314	to initialise the loop somewhere.
3547		4315
3548	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>	4316	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
3549		4317
3550	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the	4318	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
3551	default loop has been initialised (C<UC> == unchecked). Their behaviour	4319	default loop has been initialised (C<UC> == unchecked). Their behaviour
…		…
3568	}	4336	}
3569		4337
3570	ev_check check;	4338	ev_check check;
3571	ev_check_init (&check, check_cb);	4339	ev_check_init (&check, check_cb);
3572	ev_check_start (EV_DEFAULT_ &check);	4340	ev_check_start (EV_DEFAULT_ &check);
3573	ev_loop (EV_DEFAULT_ 0);	4341	ev_run (EV_DEFAULT_ 0);
3574		4342
3575	=head1 EMBEDDING	4343	=head1 EMBEDDING
3576		4344
3577	Libev can (and often is) directly embedded into host	4345	Libev can (and often is) directly embedded into host
3578	applications. Examples of applications that embed it include the Deliantra	4346	applications. Examples of applications that embed it include the Deliantra
…		…
3670	users of libev and the libev code itself must be compiled with compatible	4438	users of libev and the libev code itself must be compiled with compatible
3671	settings.	4439	settings.
3672		4440
3673	=over 4	4441	=over 4
3674		4442
		4443	=item EV_COMPAT3 (h)
		4444
		4445	Backwards compatibility is a major concern for libev. This is why this
		4446	release of libev comes with wrappers for the functions and symbols that
		4447	have been renamed between libev version 3 and 4.
		4448
		4449	You can disable these wrappers (to test compatibility with future
		4450	versions) by defining C<EV_COMPAT3> to C<0> when compiling your
		4451	sources. This has the additional advantage that you can drop the C<struct>
		4452	from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
		4453	typedef in that case.
		4454
		4455	In some future version, the default for C<EV_COMPAT3> will become C<0>,
		4456	and in some even more future version the compatibility code will be
		4457	removed completely.
		4458
3675	=item EV_STANDALONE (h)	4459	=item EV_STANDALONE (h)
3676		4460
3677	Must always be C<1> if you do not use autoconf configuration, which	4461	Must always be C<1> if you do not use autoconf configuration, which
3678	keeps libev from including F<config.h>, and it also defines dummy	4462	keeps libev from including F<config.h>, and it also defines dummy
3679	implementations for some libevent functions (such as logging, which is not	4463	implementations for some libevent functions (such as logging, which is not
3680	supported). It will also not define any of the structs usually found in	4464	supported). It will also not define any of the structs usually found in
3681	F<event.h> that are not directly supported by the libev core alone.	4465	F<event.h> that are not directly supported by the libev core alone.
3682		4466
3683	In standalone mode, libev will still try to automatically deduce the	4467	In standalone mode, libev will still try to automatically deduce the
3684	configuration, but has to be more conservative.	4468	configuration, but has to be more conservative.
		4469
		4470	=item EV_USE_FLOOR
		4471
		4472	If defined to be C<1>, libev will use the C<floor ()> function for its
		4473	periodic reschedule calculations, otherwise libev will fall back on a
		4474	portable (slower) implementation. If you enable this, you usually have to
		4475	link against libm or something equivalent. Enabling this when the C<floor>
		4476	function is not available will fail, so the safe default is to not enable
		4477	this.
3685		4478
3686	=item EV_USE_MONOTONIC	4479	=item EV_USE_MONOTONIC
3687		4480
3688	If defined to be C<1>, libev will try to detect the availability of the	4481	If defined to be C<1>, libev will try to detect the availability of the
3689	monotonic clock option at both compile time and runtime. Otherwise no	4482	monotonic clock option at both compile time and runtime. Otherwise no
…		…
3774		4567
3775	If programs implement their own fd to handle mapping on win32, then this	4568	If programs implement their own fd to handle mapping on win32, then this
3776	macro can be used to override the C<close> function, useful to unregister	4569	macro can be used to override the C<close> function, useful to unregister
3777	file descriptors again. Note that the replacement function has to close	4570	file descriptors again. Note that the replacement function has to close
3778	the underlying OS handle.	4571	the underlying OS handle.
		4572
		4573	=item EV_USE_WSASOCKET
		4574
		4575	If defined to be C<1>, libev will use C<WSASocket> to create its internal
		4576	communication socket, which works better in some environments. Otherwise,
		4577	the normal C<socket> function will be used, which works better in other
		4578	environments.
3779		4579
3780	=item EV_USE_POLL	4580	=item EV_USE_POLL
3781		4581
3782	If defined to be C<1>, libev will compile in support for the C<poll>(2)	4582	If defined to be C<1>, libev will compile in support for the C<poll>(2)
3783	backend. Otherwise it will be enabled on non-win32 platforms. It	4583	backend. Otherwise it will be enabled on non-win32 platforms. It
…		…
3819	If defined to be C<1>, libev will compile in support for the Linux inotify	4619	If defined to be C<1>, libev will compile in support for the Linux inotify
3820	interface to speed up C<ev_stat> watchers. Its actual availability will	4620	interface to speed up C<ev_stat> watchers. Its actual availability will
3821	be detected at runtime. If undefined, it will be enabled if the headers	4621	be detected at runtime. If undefined, it will be enabled if the headers
3822	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4622	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
3823		4623
		4624	=item EV_NO_SMP
		4625
		4626	If defined to be C<1>, libev will assume that memory is always coherent
		4627	between threads, that is, threads can be used, but threads never run on
		4628	different cpus (or different cpu cores). This reduces dependencies
		4629	and makes libev faster.
		4630
		4631	=item EV_NO_THREADS
		4632
		4633	If defined to be C<1>, libev will assume that it will never be called from
		4634	different threads (that includes signal handlers), which is a stronger
		4635	assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
		4636	libev faster.
		4637
3824	=item EV_ATOMIC_T	4638	=item EV_ATOMIC_T
3825		4639
3826	Libev requires an integer type (suitable for storing C<0> or C<1>) whose	4640	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
3827	access is atomic with respect to other threads or signal contexts. No such	4641	access is atomic with respect to other threads or signal contexts. No
3828	type is easily found in the C language, so you can provide your own type	4642	such type is easily found in the C language, so you can provide your own
3829	that you know is safe for your purposes. It is used both for signal handler "locking"	4643	type that you know is safe for your purposes. It is used both for signal
3830	as well as for signal and thread safety in C<ev_async> watchers.	4644	handler "locking" as well as for signal and thread safety in C<ev_async>
		4645	watchers.
3831		4646
3832	In the absence of this define, libev will use C<sig_atomic_t volatile>	4647	In the absence of this define, libev will use C<sig_atomic_t volatile>
3833	(from F<signal.h>), which is usually good enough on most platforms.	4648	(from F<signal.h>), which is usually good enough on most platforms.
3834		4649
3835	=item EV_H (h)	4650	=item EV_H (h)
…		…
3862	will have the C<struct ev_loop *> as first argument, and you can create	4677	will have the C<struct ev_loop *> as first argument, and you can create
3863	additional independent event loops. Otherwise there will be no support	4678	additional independent event loops. Otherwise there will be no support
3864	for multiple event loops and there is no first event loop pointer	4679	for multiple event loops and there is no first event loop pointer
3865	argument. Instead, all functions act on the single default loop.	4680	argument. Instead, all functions act on the single default loop.
3866		4681
		4682	Note that C<EV_DEFAULT> and C<EV_DEFAULT_> will no longer provide a
		4683	default loop when multiplicity is switched off - you always have to
		4684	initialise the loop manually in this case.
		4685
3867	=item EV_MINPRI	4686	=item EV_MINPRI
3868		4687
3869	=item EV_MAXPRI	4688	=item EV_MAXPRI
3870		4689
3871	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to	4690	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
…		…
3885	EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,	4704	EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3886	EV_ASYNC_ENABLE, EV_CHILD_ENABLE.	4705	EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3887		4706
3888	If undefined or defined to be C<1> (and the platform supports it), then	4707	If undefined or defined to be C<1> (and the platform supports it), then
3889	the respective watcher type is supported. If defined to be C<0>, then it	4708	the respective watcher type is supported. If defined to be C<0>, then it
3890	is not. Disabling watcher types mainly saves codesize.	4709	is not. Disabling watcher types mainly saves code size.
3891		4710
3892	=item EV_FEATURES	4711	=item EV_FEATURES
3893		4712
3894	If you need to shave off some kilobytes of code at the expense of some	4713	If you need to shave off some kilobytes of code at the expense of some
3895	speed (but with the full API), you can define this symbol to request	4714	speed (but with the full API), you can define this symbol to request
…		…
3907	#define EV_USE_POLL 1	4726	#define EV_USE_POLL 1
3908	#define EV_CHILD_ENABLE 1	4727	#define EV_CHILD_ENABLE 1
3909	#define EV_ASYNC_ENABLE 1	4728	#define EV_ASYNC_ENABLE 1
3910		4729
3911	The actual value is a bitset, it can be a combination of the following	4730	The actual value is a bitset, it can be a combination of the following
3912	values:	4731	values (by default, all of these are enabled):
3913		4732
3914	=over 4	4733	=over 4
3915		4734
3916	=item C<1> - faster/larger code	4735	=item C<1> - faster/larger code
3917		4736
3918	Use larger code to speed up some operations.	4737	Use larger code to speed up some operations.
3919		4738
3920	Currently this is used to override some inlining decisions (enlarging the roughly	4739	Currently this is used to override some inlining decisions (enlarging the
3921	30% code size on amd64.	4740	code size by roughly 30% on amd64).
3922		4741
3923	When optimising for size, use of compiler flags such as C<-Os> with	4742	When optimising for size, use of compiler flags such as C<-Os> with
3924	gcc recommended, as well as C<-DNDEBUG>, as libev contains a number of	4743	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
3925	assertions.	4744	assertions.
3926		4745
		4746	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4747	(e.g. gcc with C<-Os>).
		4748
3927	=item C<2> - faster/larger data structures	4749	=item C<2> - faster/larger data structures
3928		4750
3929	Replaces the small 2-heap for timer management by a faster 4-heap, larger	4751	Replaces the small 2-heap for timer management by a faster 4-heap, larger
3930	hash table sizes and so on. This will usually further increase codesize	4752	hash table sizes and so on. This will usually further increase code size
3931	and can additionally have an effect on the size of data structures at	4753	and can additionally have an effect on the size of data structures at
3932	runtime.	4754	runtime.
		4755
		4756	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4757	(e.g. gcc with C<-Os>).
3933		4758
3934	=item C<4> - full API configuration	4759	=item C<4> - full API configuration
3935		4760
3936	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and	4761	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
3937	enables multiplicity (C<EV_MULTIPLICITY>=1).	4762	enables multiplicity (C<EV_MULTIPLICITY>=1).
…		…
3969	With an intelligent-enough linker (gcc+binutils are intelligent enough	4794	With an intelligent-enough linker (gcc+binutils are intelligent enough
3970	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by	4795	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
3971	your program might be left out as well - a binary starting a timer and an	4796	your program might be left out as well - a binary starting a timer and an
3972	I/O watcher then might come out at only 5Kb.	4797	I/O watcher then might come out at only 5Kb.
3973		4798
		4799	=item EV_API_STATIC
		4800
		4801	If this symbol is defined (by default it is not), then all identifiers
		4802	will have static linkage. This means that libev will not export any
		4803	identifiers, and you cannot link against libev anymore. This can be useful
		4804	when you embed libev, only want to use libev functions in a single file,
		4805	and do not want its identifiers to be visible.
		4806
		4807	To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that
		4808	wants to use libev.
		4809
		4810	This option only works when libev is compiled with a C compiler, as C++
		4811	doesn't support the required declaration syntax.
		4812
3974	=item EV_AVOID_STDIO	4813	=item EV_AVOID_STDIO
3975		4814
3976	If this is set to C<1> at compiletime, then libev will avoid using stdio	4815	If this is set to C<1> at compiletime, then libev will avoid using stdio
3977	functions (printf, scanf, perror etc.). This will increase the codesize	4816	functions (printf, scanf, perror etc.). This will increase the code size
3978	somewhat, but if your program doesn't otherwise depend on stdio and your	4817	somewhat, but if your program doesn't otherwise depend on stdio and your
3979	libc allows it, this avoids linking in the stdio library which is quite	4818	libc allows it, this avoids linking in the stdio library which is quite
3980	big.	4819	big.
3981		4820
3982	Note that error messages might become less precise when this option is	4821	Note that error messages might become less precise when this option is
…		…
3986		4825
3987	The highest supported signal number, +1 (or, the number of	4826	The highest supported signal number, +1 (or, the number of
3988	signals): Normally, libev tries to deduce the maximum number of signals	4827	signals): Normally, libev tries to deduce the maximum number of signals
3989	automatically, but sometimes this fails, in which case it can be	4828	automatically, but sometimes this fails, in which case it can be
3990	specified. Also, using a lower number than detected (C<32> should be	4829	specified. Also, using a lower number than detected (C<32> should be
3991	good for about any system in existance) can save some memory, as libev	4830	good for about any system in existence) can save some memory, as libev
3992	statically allocates some 12-24 bytes per signal number.	4831	statically allocates some 12-24 bytes per signal number.
3993		4832
3994	=item EV_PID_HASHSIZE	4833	=item EV_PID_HASHSIZE
3995		4834
3996	C<ev_child> watchers use a small hash table to distribute workload by	4835	C<ev_child> watchers use a small hash table to distribute workload by
…		…
4028	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it	4867	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
4029	will be C<0>.	4868	will be C<0>.
4030		4869
4031	=item EV_VERIFY	4870	=item EV_VERIFY
4032		4871
4033	Controls how much internal verification (see C<ev_loop_verify ()>) will	4872	Controls how much internal verification (see C<ev_verify ()>) will
4034	be done: If set to C<0>, no internal verification code will be compiled	4873	be done: If set to C<0>, no internal verification code will be compiled
4035	in. If set to C<1>, then verification code will be compiled in, but not	4874	in. If set to C<1>, then verification code will be compiled in, but not
4036	called. If set to C<2>, then the internal verification code will be	4875	called. If set to C<2>, then the internal verification code will be
4037	called once per loop, which can slow down libev. If set to C<3>, then the	4876	called once per loop, which can slow down libev. If set to C<3>, then the
4038	verification code will be called very frequently, which will slow down	4877	verification code will be called very frequently, which will slow down
…		…
4042	will be C<0>.	4881	will be C<0>.
4043		4882
4044	=item EV_COMMON	4883	=item EV_COMMON
4045		4884
4046	By default, all watchers have a C<void *data> member. By redefining	4885	By default, all watchers have a C<void *data> member. By redefining
4047	this macro to a something else you can include more and other types of	4886	this macro to something else you can include more and other types of
4048	members. You have to define it each time you include one of the files,	4887	members. You have to define it each time you include one of the files,
4049	though, and it must be identical each time.	4888	though, and it must be identical each time.
4050		4889
4051	For example, the perl EV module uses something like this:	4890	For example, the perl EV module uses something like this:
4052		4891
…		…
4121	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4960	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4122		4961
4123	#include "ev_cpp.h"	4962	#include "ev_cpp.h"
4124	#include "ev.c"	4963	#include "ev.c"
4125		4964
4126	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4965	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4127		4966
4128	=head2 THREADS AND COROUTINES	4967	=head2 THREADS AND COROUTINES
4129		4968
4130	=head3 THREADS	4969	=head3 THREADS
4131		4970
…		…
4182	default loop and triggering an C<ev_async> watcher from the default loop	5021	default loop and triggering an C<ev_async> watcher from the default loop
4183	watcher callback into the event loop interested in the signal.	5022	watcher callback into the event loop interested in the signal.
4184		5023
4185	=back	5024	=back
4186		5025
4187	=head4 THREAD LOCKING EXAMPLE	5026	See also L</THREAD LOCKING EXAMPLE>.
4188
4189	Here is a fictitious example of how to run an event loop in a different
4190	thread than where callbacks are being invoked and watchers are
4191	created/added/removed.
4192
4193	For a real-world example, see the C<EV::Loop::Async> perl module,
4194	which uses exactly this technique (which is suited for many high-level
4195	languages).
4196
4197	The example uses a pthread mutex to protect the loop data, a condition
4198	variable to wait for callback invocations, an async watcher to notify the
4199	event loop thread and an unspecified mechanism to wake up the main thread.
4200
4201	First, you need to associate some data with the event loop:
4202
4203	typedef struct {
4204	mutex_t lock; /* global loop lock */
4205	ev_async async_w;
4206	thread_t tid;
4207	cond_t invoke_cv;
4208	} userdata;
4209
4210	void prepare_loop (EV_P)
4211	{
4212	// for simplicity, we use a static userdata struct.
4213	static userdata u;
4214
4215	ev_async_init (&u->async_w, async_cb);
4216	ev_async_start (EV_A_ &u->async_w);
4217
4218	pthread_mutex_init (&u->lock, 0);
4219	pthread_cond_init (&u->invoke_cv, 0);
4220
4221	// now associate this with the loop
4222	ev_set_userdata (EV_A_ u);
4223	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4224	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4225
4226	// then create the thread running ev_loop
4227	pthread_create (&u->tid, 0, l_run, EV_A);
4228	}
4229
4230	The callback for the C<ev_async> watcher does nothing: the watcher is used
4231	solely to wake up the event loop so it takes notice of any new watchers
4232	that might have been added:
4233
4234	static void
4235	async_cb (EV_P_ ev_async *w, int revents)
4236	{
4237	// just used for the side effects
4238	}
4239
4240	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4241	protecting the loop data, respectively.
4242
4243	static void
4244	l_release (EV_P)
4245	{
4246	userdata *u = ev_userdata (EV_A);
4247	pthread_mutex_unlock (&u->lock);
4248	}
4249
4250	static void
4251	l_acquire (EV_P)
4252	{
4253	userdata *u = ev_userdata (EV_A);
4254	pthread_mutex_lock (&u->lock);
4255	}
4256
4257	The event loop thread first acquires the mutex, and then jumps straight
4258	into C<ev_loop>:
4259
4260	void *
4261	l_run (void *thr_arg)
4262	{
4263	struct ev_loop *loop = (struct ev_loop *)thr_arg;
4264
4265	l_acquire (EV_A);
4266	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4267	ev_loop (EV_A_ 0);
4268	l_release (EV_A);
4269
4270	return 0;
4271	}
4272
4273	Instead of invoking all pending watchers, the C<l_invoke> callback will
4274	signal the main thread via some unspecified mechanism (signals? pipe
4275	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4276	have been called (in a while loop because a) spurious wakeups are possible
4277	and b) skipping inter-thread-communication when there are no pending
4278	watchers is very beneficial):
4279
4280	static void
4281	l_invoke (EV_P)
4282	{
4283	userdata *u = ev_userdata (EV_A);
4284
4285	while (ev_pending_count (EV_A))
4286	{
4287	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4288	pthread_cond_wait (&u->invoke_cv, &u->lock);
4289	}
4290	}
4291
4292	Now, whenever the main thread gets told to invoke pending watchers, it
4293	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4294	thread to continue:
4295
4296	static void
4297	real_invoke_pending (EV_P)
4298	{
4299	userdata *u = ev_userdata (EV_A);
4300
4301	pthread_mutex_lock (&u->lock);
4302	ev_invoke_pending (EV_A);
4303	pthread_cond_signal (&u->invoke_cv);
4304	pthread_mutex_unlock (&u->lock);
4305	}
4306
4307	Whenever you want to start/stop a watcher or do other modifications to an
4308	event loop, you will now have to lock:
4309
4310	ev_timer timeout_watcher;
4311	userdata *u = ev_userdata (EV_A);
4312
4313	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4314
4315	pthread_mutex_lock (&u->lock);
4316	ev_timer_start (EV_A_ &timeout_watcher);
4317	ev_async_send (EV_A_ &u->async_w);
4318	pthread_mutex_unlock (&u->lock);
4319
4320	Note that sending the C<ev_async> watcher is required because otherwise
4321	an event loop currently blocking in the kernel will have no knowledge
4322	about the newly added timer. By waking up the loop it will pick up any new
4323	watchers in the next event loop iteration.
4324		5027
4325	=head3 COROUTINES	5028	=head3 COROUTINES
4326		5029
4327	Libev is very accommodating to coroutines ("cooperative threads"):	5030	Libev is very accommodating to coroutines ("cooperative threads"):
4328	libev fully supports nesting calls to its functions from different	5031	libev fully supports nesting calls to its functions from different
4329	coroutines (e.g. you can call C<ev_loop> on the same loop from two	5032	coroutines (e.g. you can call C<ev_run> on the same loop from two
4330	different coroutines, and switch freely between both coroutines running	5033	different coroutines, and switch freely between both coroutines running
4331	the loop, as long as you don't confuse yourself). The only exception is	5034	the loop, as long as you don't confuse yourself). The only exception is
4332	that you must not do this from C<ev_periodic> reschedule callbacks.	5035	that you must not do this from C<ev_periodic> reschedule callbacks.
4333		5036
4334	Care has been taken to ensure that libev does not keep local state inside	5037	Care has been taken to ensure that libev does not keep local state inside
4335	C<ev_loop>, and other calls do not usually allow for coroutine switches as	5038	C<ev_run>, and other calls do not usually allow for coroutine switches as
4336	they do not call any callbacks.	5039	they do not call any callbacks.
4337		5040
4338	=head2 COMPILER WARNINGS	5041	=head2 COMPILER WARNINGS
4339		5042
4340	Depending on your compiler and compiler settings, you might get no or a	5043	Depending on your compiler and compiler settings, you might get no or a
…		…
4351	maintainable.	5054	maintainable.
4352		5055
4353	And of course, some compiler warnings are just plain stupid, or simply	5056	And of course, some compiler warnings are just plain stupid, or simply
4354	wrong (because they don't actually warn about the condition their message	5057	wrong (because they don't actually warn about the condition their message
4355	seems to warn about). For example, certain older gcc versions had some	5058	seems to warn about). For example, certain older gcc versions had some
4356	warnings that resulted an extreme number of false positives. These have	5059	warnings that resulted in an extreme number of false positives. These have
4357	been fixed, but some people still insist on making code warn-free with	5060	been fixed, but some people still insist on making code warn-free with
4358	such buggy versions.	5061	such buggy versions.
4359		5062
4360	While libev is written to generate as few warnings as possible,	5063	While libev is written to generate as few warnings as possible,
4361	"warn-free" code is not a goal, and it is recommended not to build libev	5064	"warn-free" code is not a goal, and it is recommended not to build libev
…		…
4397	I suggest using suppression lists.	5100	I suggest using suppression lists.
4398		5101
4399		5102
4400	=head1 PORTABILITY NOTES	5103	=head1 PORTABILITY NOTES
4401		5104
		5105	=head2 GNU/LINUX 32 BIT LIMITATIONS
		5106
		5107	GNU/Linux is the only common platform that supports 64 bit file/large file
		5108	interfaces but I<disables> them by default.
		5109
		5110	That means that libev compiled in the default environment doesn't support
		5111	files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
		5112
		5113	Unfortunately, many programs try to work around this GNU/Linux issue
		5114	by enabling the large file API, which makes them incompatible with the
		5115	standard libev compiled for their system.
		5116
		5117	Likewise, libev cannot enable the large file API itself as this would
		5118	suddenly make it incompatible to the default compile time environment,
		5119	i.e. all programs not using special compile switches.
		5120
		5121	=head2 OS/X AND DARWIN BUGS
		5122
		5123	The whole thing is a bug if you ask me - basically any system interface
		5124	you touch is broken, whether it is locales, poll, kqueue or even the
		5125	OpenGL drivers.
		5126
		5127	=head3 C<kqueue> is buggy
		5128
		5129	The kqueue syscall is broken in all known versions - most versions support
		5130	only sockets, many support pipes.
		5131
		5132	Libev tries to work around this by not using C<kqueue> by default on this
		5133	rotten platform, but of course you can still ask for it when creating a
		5134	loop - embedding a socket-only kqueue loop into a select-based one is
		5135	probably going to work well.
		5136
		5137	=head3 C<poll> is buggy
		5138
		5139	Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
		5140	implementation by something calling C<kqueue> internally around the 10.5.6
		5141	release, so now C<kqueue> I<and> C<poll> are broken.
		5142
		5143	Libev tries to work around this by not using C<poll> by default on
		5144	this rotten platform, but of course you can still ask for it when creating
		5145	a loop.
		5146
		5147	=head3 C<select> is buggy
		5148
		5149	All that's left is C<select>, and of course Apple found a way to fuck this
		5150	one up as well: On OS/X, C<select> actively limits the number of file
		5151	descriptors you can pass in to 1024 - your program suddenly crashes when
		5152	you use more.
		5153
		5154	There is an undocumented "workaround" for this - defining
		5155	C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
		5156	work on OS/X.
		5157
		5158	=head2 SOLARIS PROBLEMS AND WORKAROUNDS
		5159
		5160	=head3 C<errno> reentrancy
		5161
		5162	The default compile environment on Solaris is unfortunately so
		5163	thread-unsafe that you can't even use components/libraries compiled
		5164	without C<-D_REENTRANT> in a threaded program, which, of course, isn't
		5165	defined by default. A valid, if stupid, implementation choice.
		5166
		5167	If you want to use libev in threaded environments you have to make sure
		5168	it's compiled with C<_REENTRANT> defined.
		5169
		5170	=head3 Event port backend
		5171
		5172	The scalable event interface for Solaris is called "event
		5173	ports". Unfortunately, this mechanism is very buggy in all major
		5174	releases. If you run into high CPU usage, your program freezes or you get
		5175	a large number of spurious wakeups, make sure you have all the relevant
		5176	and latest kernel patches applied. No, I don't know which ones, but there
		5177	are multiple ones to apply, and afterwards, event ports actually work
		5178	great.
		5179
		5180	If you can't get it to work, you can try running the program by setting
		5181	the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
		5182	C<select> backends.
		5183
		5184	=head2 AIX POLL BUG
		5185
		5186	AIX unfortunately has a broken C<poll.h> header. Libev works around
		5187	this by trying to avoid the poll backend altogether (i.e. it's not even
		5188	compiled in), which normally isn't a big problem as C<select> works fine
		5189	with large bitsets on AIX, and AIX is dead anyway.
		5190
4402	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS	5191	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
		5192
		5193	=head3 General issues
4403		5194
4404	Win32 doesn't support any of the standards (e.g. POSIX) that libev	5195	Win32 doesn't support any of the standards (e.g. POSIX) that libev
4405	requires, and its I/O model is fundamentally incompatible with the POSIX	5196	requires, and its I/O model is fundamentally incompatible with the POSIX
4406	model. Libev still offers limited functionality on this platform in	5197	model. Libev still offers limited functionality on this platform in
4407	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	5198	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4408	descriptors. This only applies when using Win32 natively, not when using	5199	descriptors. This only applies when using Win32 natively, not when using
4409	e.g. cygwin.	5200	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
		5201	as every compiler comes with a slightly differently broken/incompatible
		5202	environment.
4410		5203
4411	Lifting these limitations would basically require the full	5204	Lifting these limitations would basically require the full
4412	re-implementation of the I/O system. If you are into these kinds of	5205	re-implementation of the I/O system. If you are into this kind of thing,
4413	things, then note that glib does exactly that for you in a very portable	5206	then note that glib does exactly that for you in a very portable way (note
4414	way (note also that glib is the slowest event library known to man).	5207	also that glib is the slowest event library known to man).
4415		5208
4416	There is no supported compilation method available on windows except	5209	There is no supported compilation method available on windows except
4417	embedding it into other applications.	5210	embedding it into other applications.
4418		5211
4419	Sensible signal handling is officially unsupported by Microsoft - libev	5212	Sensible signal handling is officially unsupported by Microsoft - libev
…		…
4447	you do I<not> compile the F<ev.c> or any other embedded source files!):	5240	you do I<not> compile the F<ev.c> or any other embedded source files!):
4448		5241
4449	#include "evwrap.h"	5242	#include "evwrap.h"
4450	#include "ev.c"	5243	#include "ev.c"
4451		5244
4452	=over 4
4453
4454	=item The winsocket select function	5245	=head3 The winsocket C<select> function
4455		5246
4456	The winsocket C<select> function doesn't follow POSIX in that it	5247	The winsocket C<select> function doesn't follow POSIX in that it
4457	requires socket I<handles> and not socket I<file descriptors> (it is	5248	requires socket I<handles> and not socket I<file descriptors> (it is
4458	also extremely buggy). This makes select very inefficient, and also	5249	also extremely buggy). This makes select very inefficient, and also
4459	requires a mapping from file descriptors to socket handles (the Microsoft	5250	requires a mapping from file descriptors to socket handles (the Microsoft
…		…
4468	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */	5259	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4469		5260
4470	Note that winsockets handling of fd sets is O(n), so you can easily get a	5261	Note that winsockets handling of fd sets is O(n), so you can easily get a
4471	complexity in the O(n²) range when using win32.	5262	complexity in the O(n²) range when using win32.
4472		5263
4473	=item Limited number of file descriptors	5264	=head3 Limited number of file descriptors
4474		5265
4475	Windows has numerous arbitrary (and low) limits on things.	5266	Windows has numerous arbitrary (and low) limits on things.
4476		5267
4477	Early versions of winsocket's select only supported waiting for a maximum	5268	Early versions of winsocket's select only supported waiting for a maximum
4478	of C<64> handles (probably owning to the fact that all windows kernels	5269	of C<64> handles (probably owning to the fact that all windows kernels
…		…
4493	runtime libraries. This might get you to about C<512> or C<2048> sockets	5284	runtime libraries. This might get you to about C<512> or C<2048> sockets
4494	(depending on windows version and/or the phase of the moon). To get more,	5285	(depending on windows version and/or the phase of the moon). To get more,
4495	you need to wrap all I/O functions and provide your own fd management, but	5286	you need to wrap all I/O functions and provide your own fd management, but
4496	the cost of calling select (O(n²)) will likely make this unworkable.	5287	the cost of calling select (O(n²)) will likely make this unworkable.
4497		5288
4498	=back
4499
4500	=head2 PORTABILITY REQUIREMENTS	5289	=head2 PORTABILITY REQUIREMENTS
4501		5290
4502	In addition to a working ISO-C implementation and of course the	5291	In addition to a working ISO-C implementation and of course the
4503	backend-specific APIs, libev relies on a few additional extensions:	5292	backend-specific APIs, libev relies on a few additional extensions:
4504		5293
…		…
4510	Libev assumes not only that all watcher pointers have the same internal	5299	Libev assumes not only that all watcher pointers have the same internal
4511	structure (guaranteed by POSIX but not by ISO C for example), but it also	5300	structure (guaranteed by POSIX but not by ISO C for example), but it also
4512	assumes that the same (machine) code can be used to call any watcher	5301	assumes that the same (machine) code can be used to call any watcher
4513	callback: The watcher callbacks have different type signatures, but libev	5302	callback: The watcher callbacks have different type signatures, but libev
4514	calls them using an C<ev_watcher *> internally.	5303	calls them using an C<ev_watcher *> internally.
		5304
		5305	=item pointer accesses must be thread-atomic
		5306
		5307	Accessing a pointer value must be atomic, it must both be readable and
		5308	writable in one piece - this is the case on all current architectures.
4515		5309
4516	=item C<sig_atomic_t volatile> must be thread-atomic as well	5310	=item C<sig_atomic_t volatile> must be thread-atomic as well
4517		5311
4518	The type C<sig_atomic_t volatile> (or whatever is defined as	5312	The type C<sig_atomic_t volatile> (or whatever is defined as
4519	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different	5313	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
…		…
4528	thread" or will block signals process-wide, both behaviours would	5322	thread" or will block signals process-wide, both behaviours would
4529	be compatible with libev. Interaction between C<sigprocmask> and	5323	be compatible with libev. Interaction between C<sigprocmask> and
4530	C<pthread_sigmask> could complicate things, however.	5324	C<pthread_sigmask> could complicate things, however.
4531		5325
4532	The most portable way to handle signals is to block signals in all threads	5326	The most portable way to handle signals is to block signals in all threads
4533	except the initial one, and run the default loop in the initial thread as	5327	except the initial one, and run the signal handling loop in the initial
4534	well.	5328	thread as well.
4535		5329
4536	=item C<long> must be large enough for common memory allocation sizes	5330	=item C<long> must be large enough for common memory allocation sizes
4537		5331
4538	To improve portability and simplify its API, libev uses C<long> internally	5332	To improve portability and simplify its API, libev uses C<long> internally
4539	instead of C<size_t> when allocating its data structures. On non-POSIX	5333	instead of C<size_t> when allocating its data structures. On non-POSIX
…		…
4542	watchers.	5336	watchers.
4543		5337
4544	=item C<double> must hold a time value in seconds with enough accuracy	5338	=item C<double> must hold a time value in seconds with enough accuracy
4545		5339
4546	The type C<double> is used to represent timestamps. It is required to	5340	The type C<double> is used to represent timestamps. It is required to
4547	have at least 51 bits of mantissa (and 9 bits of exponent), which is good	5341	have at least 51 bits of mantissa (and 9 bits of exponent), which is
4548	enough for at least into the year 4000. This requirement is fulfilled by	5342	good enough for at least into the year 4000 with millisecond accuracy
		5343	(the design goal for libev). This requirement is overfulfilled by
4549	implementations implementing IEEE 754, which is basically all existing	5344	implementations using IEEE 754, which is basically all existing ones.
		5345
4550	ones. With IEEE 754 doubles, you get microsecond accuracy until at least	5346	With IEEE 754 doubles, you get microsecond accuracy until at least the
4551	2200.	5347	year 2255 (and millisecond accuracy till the year 287396 - by then, libev
		5348	is either obsolete or somebody patched it to use C<long double> or
		5349	something like that, just kidding).
4552		5350
4553	=back	5351	=back
4554		5352
4555	If you know of other additional requirements drop me a note.	5353	If you know of other additional requirements drop me a note.
4556		5354
…		…
4618	=item Processing ev_async_send: O(number_of_async_watchers)	5416	=item Processing ev_async_send: O(number_of_async_watchers)
4619		5417
4620	=item Processing signals: O(max_signal_number)	5418	=item Processing signals: O(max_signal_number)
4621		5419
4622	Sending involves a system call I<iff> there were no other C<ev_async_send>	5420	Sending involves a system call I<iff> there were no other C<ev_async_send>
4623	calls in the current loop iteration. Checking for async and signal events	5421	calls in the current loop iteration and the loop is currently
		5422	blocked. Checking for async and signal events involves iterating over all
4624	involves iterating over all running async watchers or all signal numbers.	5423	running async watchers or all signal numbers.
4625		5424
4626	=back	5425	=back
4627		5426
4628		5427
4629	=head1 PORTING FROM LIBEV 3.X TO 4.X	5428	=head1 PORTING FROM LIBEV 3.X TO 4.X
4630		5429
4631	The major version 4 introduced some minor incompatible changes to the API.	5430	The major version 4 introduced some incompatible changes to the API.
4632		5431
4633	At the moment, the C<ev.h> header file tries to implement superficial	5432	At the moment, the C<ev.h> header file provides compatibility definitions
4634	compatibility, so most programs should still compile. Those might be	5433	for all changes, so most programs should still compile. The compatibility
4635	removed in later versions of libev, so better update early than late.	5434	layer might be removed in later versions of libev, so better update to the
		5435	new API early than late.
4636		5436
4637	=over 4	5437	=over 4
4638		5438
4639	=item C<ev_loop_count> renamed to C<ev_iteration>	5439	=item C<EV_COMPAT3> backwards compatibility mechanism
4640		5440
4641	=item C<ev_loop_depth> renamed to C<ev_depth>	5441	The backward compatibility mechanism can be controlled by
		5442	C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
		5443	section.
4642		5444
4643	=item C<ev_loop_verify> renamed to C<ev_verify>	5445	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
		5446
		5447	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
		5448
		5449	ev_loop_destroy (EV_DEFAULT_UC);
		5450	ev_loop_fork (EV_DEFAULT);
		5451
		5452	=item function/symbol renames
		5453
		5454	A number of functions and symbols have been renamed:
		5455
		5456	ev_loop => ev_run
		5457	EVLOOP_NONBLOCK => EVRUN_NOWAIT
		5458	EVLOOP_ONESHOT => EVRUN_ONCE
		5459
		5460	ev_unloop => ev_break
		5461	EVUNLOOP_CANCEL => EVBREAK_CANCEL
		5462	EVUNLOOP_ONE => EVBREAK_ONE
		5463	EVUNLOOP_ALL => EVBREAK_ALL
		5464
		5465	EV_TIMEOUT => EV_TIMER
		5466
		5467	ev_loop_count => ev_iteration
		5468	ev_loop_depth => ev_depth
		5469	ev_loop_verify => ev_verify
4644		5470
4645	Most functions working on C<struct ev_loop> objects don't have an	5471	Most functions working on C<struct ev_loop> objects don't have an
4646	C<ev_loop_> prefix, so it was removed. Note that C<ev_loop_fork> is	5472	C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
		5473	associated constants have been renamed to not collide with the C<struct
		5474	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
		5475	as all other watcher types. Note that C<ev_loop_fork> is still called
4647	still called C<ev_loop_fork> because it would otherwise clash with the	5476	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4648	C<ev_fork> typedef.	5477	typedef.
4649
4650	=item C<EV_TIMEOUT> renamed to C<EV_TIMER> in C<revents>
4651
4652	This is a simple rename - all other watcher types use their name
4653	as revents flag, and now C<ev_timer> does, too.
4654
4655	Both C<EV_TIMER> and C<EV_TIMEOUT> symbols were present in 3.x versions
4656	and continue to be present for the forseeable future, so this is mostly a
4657	documentation change.
4658		5478
4659	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>	5479	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4660		5480
4661	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different	5481	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4662	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile	5482	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
…		…
4669		5489
4670	=over 4	5490	=over 4
4671		5491
4672	=item active	5492	=item active
4673		5493
4674	A watcher is active as long as it has been started (has been attached to	5494	A watcher is active as long as it has been started and not yet stopped.
4675	an event loop) but not yet stopped (disassociated from the event loop).	5495	See L</WATCHER STATES> for details.
4676		5496
4677	=item application	5497	=item application
4678		5498
4679	In this document, an application is whatever is using libev.	5499	In this document, an application is whatever is using libev.
		5500
		5501	=item backend
		5502
		5503	The part of the code dealing with the operating system interfaces.
4680		5504
4681	=item callback	5505	=item callback
4682		5506
4683	The address of a function that is called when some event has been	5507	The address of a function that is called when some event has been
4684	detected. Callbacks are being passed the event loop, the watcher that	5508	detected. Callbacks are being passed the event loop, the watcher that
4685	received the event, and the actual event bitset.	5509	received the event, and the actual event bitset.
4686		5510
4687	=item callback invocation	5511	=item callback/watcher invocation
4688		5512
4689	The act of calling the callback associated with a watcher.	5513	The act of calling the callback associated with a watcher.
4690		5514
4691	=item event	5515	=item event
4692		5516
…		…
4711	The model used to describe how an event loop handles and processes	5535	The model used to describe how an event loop handles and processes
4712	watchers and events.	5536	watchers and events.
4713		5537
4714	=item pending	5538	=item pending
4715		5539
4716	A watcher is pending as soon as the corresponding event has been detected,	5540	A watcher is pending as soon as the corresponding event has been
4717	and stops being pending as soon as the watcher will be invoked or its	5541	detected. See L</WATCHER STATES> for details.
4718	pending status is explicitly cleared by the application.
4719
4720	A watcher can be pending, but not active. Stopping a watcher also clears
4721	its pending status.
4722		5542
4723	=item real time	5543	=item real time
4724		5544
4725	The physical time that is observed. It is apparently strictly monotonic :)	5545	The physical time that is observed. It is apparently strictly monotonic :)
4726		5546
4727	=item wall-clock time	5547	=item wall-clock time
4728		5548
4729	The time and date as shown on clocks. Unlike real time, it can actually	5549	The time and date as shown on clocks. Unlike real time, it can actually
4730	be wrong and jump forwards and backwards, e.g. when the you adjust your	5550	be wrong and jump forwards and backwards, e.g. when you adjust your
4731	clock.	5551	clock.
4732		5552
4733	=item watcher	5553	=item watcher
4734		5554
4735	A data structure that describes interest in certain events. Watchers need	5555	A data structure that describes interest in certain events. Watchers need
4736	to be started (attached to an event loop) before they can receive events.	5556	to be started (attached to an event loop) before they can receive events.
4737		5557
4738	=item watcher invocation
4739
4740	The act of calling the callback associated with a watcher.
4741
4742	=back	5558	=back
4743		5559
4744	=head1 AUTHOR	5560	=head1 AUTHOR
4745		5561
4746	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.	5562	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
		5563	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
4747		5564

Diff Legend

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