ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.231 by root, Wed Apr 15 19:35:53 2009 UTC vs.
Revision 1.368 by root, Thu Apr 14 23:02:33 2011 UTC

…		…
26	puts ("stdin ready");	26	puts ("stdin ready");
27	// for one-shot events, one must manually stop the watcher	27	// for one-shot events, one must manually stop the watcher
28	// with its corresponding stop function.	28	// with its corresponding stop function.
29	ev_io_stop (EV_A_ w);	29	ev_io_stop (EV_A_ w);
30		30
31	// this causes all nested ev_loop's to stop iterating	31	// this causes all nested ev_run's to stop iterating
32	ev_unloop (EV_A_ EVUNLOOP_ALL);	32	ev_break (EV_A_ EVBREAK_ALL);
33	}	33	}
34		34
35	// another callback, this time for a time-out	35	// another callback, this time for a time-out
36	static void	36	static void
37	timeout_cb (EV_P_ ev_timer *w, int revents)	37	timeout_cb (EV_P_ ev_timer *w, int revents)
38	{	38	{
39	puts ("timeout");	39	puts ("timeout");
40	// this causes the innermost ev_loop to stop iterating	40	// this causes the innermost ev_run to stop iterating
41	ev_unloop (EV_A_ EVUNLOOP_ONE);	41	ev_break (EV_A_ EVBREAK_ONE);
42	}	42	}
43		43
44	int	44	int
45	main (void)	45	main (void)
46	{	46	{
47	// use the default event loop unless you have special needs	47	// use the default event loop unless you have special needs
48	struct ev_loop *loop = ev_default_loop (0);	48	struct ev_loop *loop = EV_DEFAULT;
49		49
50	// initialise an io watcher, then start it	50	// initialise an io watcher, then start it
51	// this one will watch for stdin to become readable	51	// this one will watch for stdin to become readable
52	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);	52	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
53	ev_io_start (loop, &stdin_watcher);	53	ev_io_start (loop, &stdin_watcher);
…		…
56	// simple non-repeating 5.5 second timeout	56	// simple non-repeating 5.5 second timeout
57	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);	57	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
58	ev_timer_start (loop, &timeout_watcher);	58	ev_timer_start (loop, &timeout_watcher);
59		59
60	// now wait for events to arrive	60	// now wait for events to arrive
61	ev_loop (loop, 0);	61	ev_run (loop, 0);
62		62
63	// unloop was called, so exit	63	// break was called, so exit
64	return 0;	64	return 0;
65	}	65	}
66		66
67	=head1 DESCRIPTION	67	=head1 ABOUT THIS DOCUMENT
		68
		69	This document documents the libev software package.
68		70
69	The newest version of this document is also available as an html-formatted	71	The newest version of this document is also available as an html-formatted
70	web page you might find easier to navigate when reading it for the first	72	web page you might find easier to navigate when reading it for the first
71	time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.	73	time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
		74
		75	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
		77	on event-based programming, nor will it introduce event-based programming
		78	with libev.
		79
		80	Familiarity with event based programming techniques in general is assumed
		81	throughout this document.
		82
		83	=head1 WHAT TO READ WHEN IN A HURRY
		84
		85	This manual tries to be very detailed, but unfortunately, this also makes
		86	it very long. If you just want to know the basics of libev, I suggest
		87	reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and
		88	look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and
		89	C<ev_timer> sections in L<WATCHER TYPES>.
		90
		91	=head1 ABOUT LIBEV
72		92
73	Libev is an event loop: you register interest in certain events (such as a	93	Libev is an event loop: you register interest in certain events (such as a
74	file descriptor being readable or a timeout occurring), and it will manage	94	file descriptor being readable or a timeout occurring), and it will manage
75	these event sources and provide your program with events.	95	these event sources and provide your program with events.
76		96
…		…
86	=head2 FEATURES	106	=head2 FEATURES
87		107
88	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the	108	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
89	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms	109	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
90	for file descriptor events (C<ev_io>), the Linux C<inotify> interface	110	for file descriptor events (C<ev_io>), the Linux C<inotify> interface
91	(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers	111	(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
92	with customised rescheduling (C<ev_periodic>), synchronous signals	112	inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
93	(C<ev_signal>), process status change events (C<ev_child>), and event	113	timers (C<ev_timer>), absolute timers with customised rescheduling
94	watchers dealing with the event loop mechanism itself (C<ev_idle>,	114	(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
95	C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as	115	change events (C<ev_child>), and event watchers dealing with the event
96	file watchers (C<ev_stat>) and even limited support for fork events	116	loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
97	(C<ev_fork>).	117	C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
		118	limited support for fork events (C<ev_fork>).
98		119
99	It also is quite fast (see this	120	It also is quite fast (see this
100	L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent	121	L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
101	for example).	122	for example).
102		123
…		…
105	Libev is very configurable. In this manual the default (and most common)	126	Libev is very configurable. In this manual the default (and most common)
106	configuration will be described, which supports multiple event loops. For	127	configuration will be described, which supports multiple event loops. For
107	more info about various configuration options please have a look at	128	more info about various configuration options please have a look at
108	B<EMBED> section in this manual. If libev was configured without support	129	B<EMBED> section in this manual. If libev was configured without support
109	for multiple event loops, then all functions taking an initial argument of	130	for multiple event loops, then all functions taking an initial argument of
110	name C<loop> (which is always of type C<ev_loop *>) will not have	131	name C<loop> (which is always of type C<struct ev_loop *>) will not have
111	this argument.	132	this argument.
112		133
113	=head2 TIME REPRESENTATION	134	=head2 TIME REPRESENTATION
114		135
115	Libev represents time as a single floating point number, representing the	136	Libev represents time as a single floating point number, representing
116	(fractional) number of seconds since the (POSIX) epoch (somewhere near	137	the (fractional) number of seconds since the (POSIX) epoch (in practice
117	the beginning of 1970, details are complicated, don't ask). This type is	138	somewhere near the beginning of 1970, details are complicated, don't
118	called C<ev_tstamp>, which is what you should use too. It usually aliases	139	ask). This type is called C<ev_tstamp>, which is what you should use
119	to the C<double> type in C, and when you need to do any calculations on	140	too. It usually aliases to the C<double> type in C. When you need to do
120	it, you should treat it as some floating point value. Unlike the name	141	any calculations on it, you should treat it as some floating point value.
		142
121	component C<stamp> might indicate, it is also used for time differences	143	Unlike the name component C<stamp> might indicate, it is also used for
122	throughout libev.	144	time differences (e.g. delays) throughout libev.
123		145
124	=head1 ERROR HANDLING	146	=head1 ERROR HANDLING
125		147
126	Libev knows three classes of errors: operating system errors, usage errors	148	Libev knows three classes of errors: operating system errors, usage errors
127	and internal errors (bugs).	149	and internal errors (bugs).
…		…
151		173
152	=item ev_tstamp ev_time ()	174	=item ev_tstamp ev_time ()
153		175
154	Returns the current time as libev would use it. Please note that the	176	Returns the current time as libev would use it. Please note that the
155	C<ev_now> function is usually faster and also often returns the timestamp	177	C<ev_now> function is usually faster and also often returns the timestamp
156	you actually want to know.	178	you actually want to know. Also interesting is the combination of
		179	C<ev_update_now> and C<ev_now>.
157		180
158	=item ev_sleep (ev_tstamp interval)	181	=item ev_sleep (ev_tstamp interval)
159		182
160	Sleep for the given interval: The current thread will be blocked until	183	Sleep for the given interval: The current thread will be blocked until
161	either it is interrupted or the given time interval has passed. Basically	184	either it is interrupted or the given time interval has passed. Basically
…		…
178	as this indicates an incompatible change. Minor versions are usually	201	as this indicates an incompatible change. Minor versions are usually
179	compatible to older versions, so a larger minor version alone is usually	202	compatible to older versions, so a larger minor version alone is usually
180	not a problem.	203	not a problem.
181		204
182	Example: Make sure we haven't accidentally been linked against the wrong	205	Example: Make sure we haven't accidentally been linked against the wrong
183	version.	206	version (note, however, that this will not detect other ABI mismatches,
		207	such as LFS or reentrancy).
184		208
185	assert (("libev version mismatch",	209	assert (("libev version mismatch",
186	ev_version_major () == EV_VERSION_MAJOR	210	ev_version_major () == EV_VERSION_MAJOR
187	&& ev_version_minor () >= EV_VERSION_MINOR));	211	&& ev_version_minor () >= EV_VERSION_MINOR));
188		212
…		…
199	assert (("sorry, no epoll, no sex",	223	assert (("sorry, no epoll, no sex",
200	ev_supported_backends () & EVBACKEND_EPOLL));	224	ev_supported_backends () & EVBACKEND_EPOLL));
201		225
202	=item unsigned int ev_recommended_backends ()	226	=item unsigned int ev_recommended_backends ()
203		227
204	Return the set of all backends compiled into this binary of libev and also	228	Return the set of all backends compiled into this binary of libev and
205	recommended for this platform. This set is often smaller than the one	229	also recommended for this platform, meaning it will work for most file
		230	descriptor types. This set is often smaller than the one returned by
206	returned by C<ev_supported_backends>, as for example kqueue is broken on	231	C<ev_supported_backends>, as for example kqueue is broken on most BSDs
207	most BSDs and will not be auto-detected unless you explicitly request it	232	and will not be auto-detected unless you explicitly request it (assuming
208	(assuming you know what you are doing). This is the set of backends that	233	you know what you are doing). This is the set of backends that libev will
209	libev will probe for if you specify no backends explicitly.	234	probe for if you specify no backends explicitly.
210		235
211	=item unsigned int ev_embeddable_backends ()	236	=item unsigned int ev_embeddable_backends ()
212		237
213	Returns the set of backends that are embeddable in other event loops. This	238	Returns the set of backends that are embeddable in other event loops. This
214	is the theoretical, all-platform, value. To find which backends	239	value is platform-specific but can include backends not available on the
215	might be supported on the current system, you would need to look at	240	current system. To find which embeddable backends might be supported on
216	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	241	the current system, you would need to look at C<ev_embeddable_backends ()
217	recommended ones.	242	& ev_supported_backends ()>, likewise for recommended ones.
218		243
219	See the description of C<ev_embed> watchers for more info.	244	See the description of C<ev_embed> watchers for more info.
220		245
221	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]	246	=item ev_set_allocator (void *(*cb)(void *ptr, long size))
222		247
223	Sets the allocation function to use (the prototype is similar - the	248	Sets the allocation function to use (the prototype is similar - the
224	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is	249	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
225	used to allocate and free memory (no surprises here). If it returns zero	250	used to allocate and free memory (no surprises here). If it returns zero
226	when memory needs to be allocated (C<size != 0>), the library might abort	251	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
252	}	277	}
253		278
254	...	279	...
255	ev_set_allocator (persistent_realloc);	280	ev_set_allocator (persistent_realloc);
256		281
257	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]	282	=item ev_set_syserr_cb (void (*cb)(const char *msg))
258		283
259	Set the callback function to call on a retryable system call error (such	284	Set the callback function to call on a retryable system call error (such
260	as failed select, poll, epoll_wait). The message is a printable string	285	as failed select, poll, epoll_wait). The message is a printable string
261	indicating the system call or subsystem causing the problem. If this	286	indicating the system call or subsystem causing the problem. If this
262	callback is set, then libev will expect it to remedy the situation, no	287	callback is set, then libev will expect it to remedy the situation, no
…		…
274	}	299	}
275		300
276	...	301	...
277	ev_set_syserr_cb (fatal_error);	302	ev_set_syserr_cb (fatal_error);
278		303
		304	=item ev_feed_signal (int signum)
		305
		306	This function can be used to "simulate" a signal receive. It is completely
		307	safe to call this function at any time, from any context, including signal
		308	handlers or random threads.
		309
		310	Its main use is to customise signal handling in your process, especially
		311	in the presence of threads. For example, you could block signals
		312	by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
		313	creating any loops), and in one thread, use C<sigwait> or any other
		314	mechanism to wait for signals, then "deliver" them to libev by calling
		315	C<ev_feed_signal>.
		316
279	=back	317	=back
280		318
281	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	319	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
282		320
283	An event loop is described by a C<struct ev_loop *> (the C<struct>	321	An event loop is described by a C<struct ev_loop *> (the C<struct> is
284	is I<not> optional in this case, as there is also an C<ev_loop>	322	I<not> optional in this case unless libev 3 compatibility is disabled, as
285	I<function>).	323	libev 3 had an C<ev_loop> function colliding with the struct name).
286		324
287	The library knows two types of such loops, the I<default> loop, which	325	The library knows two types of such loops, the I<default> loop, which
288	supports signals and child events, and dynamically created loops which do	326	supports child process events, and dynamically created event loops which
289	not.	327	do not.
290		328
291	=over 4	329	=over 4
292		330
293	=item struct ev_loop *ev_default_loop (unsigned int flags)	331	=item struct ev_loop *ev_default_loop (unsigned int flags)
294		332
295	This will initialise the default event loop if it hasn't been initialised	333	This returns the "default" event loop object, which is what you should
296	yet and return it. If the default loop could not be initialised, returns	334	normally use when you just need "the event loop". Event loop objects and
297	false. If it already was initialised it simply returns it (and ignores the	335	the C<flags> parameter are described in more detail in the entry for
298	flags. If that is troubling you, check C<ev_backend ()> afterwards).	336	C<ev_loop_new>.
		337
		338	If the default loop is already initialised then this function simply
		339	returns it (and ignores the flags. If that is troubling you, check
		340	C<ev_backend ()> afterwards). Otherwise it will create it with the given
		341	flags, which should almost always be C<0>, unless the caller is also the
		342	one calling C<ev_run> or otherwise qualifies as "the main program".
299		343
300	If you don't know what event loop to use, use the one returned from this	344	If you don't know what event loop to use, use the one returned from this
301	function.	345	function (or via the C<EV_DEFAULT> macro).
302		346
303	Note that this function is I<not> thread-safe, so if you want to use it	347	Note that this function is I<not> thread-safe, so if you want to use it
304	from multiple threads, you have to lock (note also that this is unlikely,	348	from multiple threads, you have to employ some kind of mutex (note also
305	as loops cannot be shared easily between threads anyway).	349	that this case is unlikely, as loops cannot be shared easily between
		350	threads anyway).
306		351
307	The default loop is the only loop that can handle C<ev_signal> and	352	The default loop is the only loop that can handle C<ev_child> watchers,
308	C<ev_child> watchers, and to do this, it always registers a handler	353	and to do this, it always registers a handler for C<SIGCHLD>. If this is
309	for C<SIGCHLD>. If this is a problem for your application you can either	354	a problem for your application you can either create a dynamic loop with
310	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you	355	C<ev_loop_new> which doesn't do that, or you can simply overwrite the
311	can simply overwrite the C<SIGCHLD> signal handler I<after> calling	356	C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
312	C<ev_default_init>.	357
		358	Example: This is the most typical usage.
		359
		360	if (!ev_default_loop (0))
		361	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
		362
		363	Example: Restrict libev to the select and poll backends, and do not allow
		364	environment settings to be taken into account:
		365
		366	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
		367
		368	=item struct ev_loop *ev_loop_new (unsigned int flags)
		369
		370	This will create and initialise a new event loop object. If the loop
		371	could not be initialised, returns false.
		372
		373	This function is thread-safe, and one common way to use libev with
		374	threads is indeed to create one loop per thread, and using the default
		375	loop in the "main" or "initial" thread.
313		376
314	The flags argument can be used to specify special behaviour or specific	377	The flags argument can be used to specify special behaviour or specific
315	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	378	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
316		379
317	The following flags are supported:	380	The following flags are supported:
…		…
332	useful to try out specific backends to test their performance, or to work	395	useful to try out specific backends to test their performance, or to work
333	around bugs.	396	around bugs.
334		397
335	=item C<EVFLAG_FORKCHECK>	398	=item C<EVFLAG_FORKCHECK>
336		399
337	Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after	400	Instead of calling C<ev_loop_fork> manually after a fork, you can also
338	a fork, you can also make libev check for a fork in each iteration by	401	make libev check for a fork in each iteration by enabling this flag.
339	enabling this flag.
340		402
341	This works by calling C<getpid ()> on every iteration of the loop,	403	This works by calling C<getpid ()> on every iteration of the loop,
342	and thus this might slow down your event loop if you do a lot of loop	404	and thus this might slow down your event loop if you do a lot of loop
343	iterations and little real work, but is usually not noticeable (on my	405	iterations and little real work, but is usually not noticeable (on my
344	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence	406	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
…		…
350	flag.	412	flag.
351		413
352	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>	414	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
353	environment variable.	415	environment variable.
354		416
		417	=item C<EVFLAG_NOINOTIFY>
		418
		419	When this flag is specified, then libev will not attempt to use the
		420	I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
		421	testing, this flag can be useful to conserve inotify file descriptors, as
		422	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
		423
		424	=item C<EVFLAG_SIGNALFD>
		425
		426	When this flag is specified, then libev will attempt to use the
		427	I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API
		428	delivers signals synchronously, which makes it both faster and might make
		429	it possible to get the queued signal data. It can also simplify signal
		430	handling with threads, as long as you properly block signals in your
		431	threads that are not interested in handling them.
		432
		433	Signalfd will not be used by default as this changes your signal mask, and
		434	there are a lot of shoddy libraries and programs (glib's threadpool for
		435	example) that can't properly initialise their signal masks.
		436
		437	=item C<EVFLAG_NOSIGMASK>
		438
		439	When this flag is specified, then libev will avoid to modify the signal
		440	mask. Specifically, this means you ahve to make sure signals are unblocked
		441	when you want to receive them.
		442
		443	This behaviour is useful when you want to do your own signal handling, or
		444	want to handle signals only in specific threads and want to avoid libev
		445	unblocking the signals.
		446
		447	It's also required by POSIX in a threaded program, as libev calls
		448	C<sigprocmask>, whose behaviour is officially unspecified.
		449
		450	This flag's behaviour will become the default in future versions of libev.
		451
355	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	452	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
356		453
357	This is your standard select(2) backend. Not I<completely> standard, as	454	This is your standard select(2) backend. Not I<completely> standard, as
358	libev tries to roll its own fd_set with no limits on the number of fds,	455	libev tries to roll its own fd_set with no limits on the number of fds,
359	but if that fails, expect a fairly low limit on the number of fds when	456	but if that fails, expect a fairly low limit on the number of fds when
…		…
383	This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and	480	This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
384	C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.	481	C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
385		482
386	=item C<EVBACKEND_EPOLL> (value 4, Linux)	483	=item C<EVBACKEND_EPOLL> (value 4, Linux)
387		484
		485	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
		486	kernels).
		487
388	For few fds, this backend is a bit little slower than poll and select,	488	For few fds, this backend is a bit little slower than poll and select, but
389	but it scales phenomenally better. While poll and select usually scale	489	it scales phenomenally better. While poll and select usually scale like
390	like O(total_fds) where n is the total number of fds (or the highest fd),	490	O(total_fds) where total_fds is the total number of fds (or the highest
391	epoll scales either O(1) or O(active_fds).	491	fd), epoll scales either O(1) or O(active_fds).
392		492
393	The epoll mechanism deserves honorable mention as the most misdesigned	493	The epoll mechanism deserves honorable mention as the most misdesigned
394	of the more advanced event mechanisms: mere annoyances include silently	494	of the more advanced event mechanisms: mere annoyances include silently
395	dropping file descriptors, requiring a system call per change per file	495	dropping file descriptors, requiring a system call per change per file
396	descriptor (and unnecessary guessing of parameters), problems with dup and	496	descriptor (and unnecessary guessing of parameters), problems with dup,
		497	returning before the timeout value, resulting in additional iterations
		498	(and only giving 5ms accuracy while select on the same platform gives
397	so on. The biggest issue is fork races, however - if a program forks then	499	0.1ms) and so on. The biggest issue is fork races, however - if a program
398	I<both> parent and child process have to recreate the epoll set, which can	500	forks then I<both> parent and child process have to recreate the epoll
399	take considerable time (one syscall per file descriptor) and is of course	501	set, which can take considerable time (one syscall per file descriptor)
400	hard to detect.	502	and is of course hard to detect.
401		503
402	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	504	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
403	of course I<doesn't>, and epoll just loves to report events for totally	505	of course I<doesn't>, and epoll just loves to report events for totally
404	I<different> file descriptors (even already closed ones, so one cannot	506	I<different> file descriptors (even already closed ones, so one cannot
405	even remove them from the set) than registered in the set (especially	507	even remove them from the set) than registered in the set (especially
406	on SMP systems). Libev tries to counter these spurious notifications by	508	on SMP systems). Libev tries to counter these spurious notifications by
407	employing an additional generation counter and comparing that against the	509	employing an additional generation counter and comparing that against the
408	events to filter out spurious ones, recreating the set when required.	510	events to filter out spurious ones, recreating the set when required. Last
		511	not least, it also refuses to work with some file descriptors which work
		512	perfectly fine with C<select> (files, many character devices...).
		513
		514	Epoll is truly the train wreck analog among event poll mechanisms,
		515	a frankenpoll, cobbled together in a hurry, no thought to design or
		516	interaction with others.
409		517
410	While stopping, setting and starting an I/O watcher in the same iteration	518	While stopping, setting and starting an I/O watcher in the same iteration
411	will result in some caching, there is still a system call per such	519	will result in some caching, there is still a system call per such
412	incident (because the same I<file descriptor> could point to a different	520	incident (because the same I<file descriptor> could point to a different
413	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	521	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
479	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	587	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
480		588
481	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	589	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
482	it's really slow, but it still scales very well (O(active_fds)).	590	it's really slow, but it still scales very well (O(active_fds)).
483		591
484	Please note that Solaris event ports can deliver a lot of spurious
485	notifications, so you need to use non-blocking I/O or other means to avoid
486	blocking when no data (or space) is available.
487
488	While this backend scales well, it requires one system call per active	592	While this backend scales well, it requires one system call per active
489	file descriptor per loop iteration. For small and medium numbers of file	593	file descriptor per loop iteration. For small and medium numbers of file
490	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	594	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
491	might perform better.	595	might perform better.
492		596
493	On the positive side, with the exception of the spurious readiness	597	On the positive side, this backend actually performed fully to
494	notifications, this backend actually performed fully to specification
495	in all tests and is fully embeddable, which is a rare feat among the	598	specification in all tests and is fully embeddable, which is a rare feat
496	OS-specific backends (I vastly prefer correctness over speed hacks).	599	among the OS-specific backends (I vastly prefer correctness over speed
		600	hacks).
		601
		602	On the negative side, the interface is I<bizarre> - so bizarre that
		603	even sun itself gets it wrong in their code examples: The event polling
		604	function sometimes returning events to the caller even though an error
		605	occurred, but with no indication whether it has done so or not (yes, it's
		606	even documented that way) - deadly for edge-triggered interfaces where
		607	you absolutely have to know whether an event occurred or not because you
		608	have to re-arm the watcher.
		609
		610	Fortunately libev seems to be able to work around these idiocies.
497		611
498	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	612	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
499	C<EVBACKEND_POLL>.	613	C<EVBACKEND_POLL>.
500		614
501	=item C<EVBACKEND_ALL>	615	=item C<EVBACKEND_ALL>
502		616
503	Try all backends (even potentially broken ones that wouldn't be tried	617	Try all backends (even potentially broken ones that wouldn't be tried
504	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	618	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
505	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	619	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
506		620
507	It is definitely not recommended to use this flag.	621	It is definitely not recommended to use this flag, use whatever
		622	C<ev_recommended_backends ()> returns, or simply do not specify a backend
		623	at all.
		624
		625	=item C<EVBACKEND_MASK>
		626
		627	Not a backend at all, but a mask to select all backend bits from a
		628	C<flags> value, in case you want to mask out any backends from a flags
		629	value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
508		630
509	=back	631	=back
510		632
511	If one or more of these are or'ed into the flags value, then only these	633	If one or more of the backend flags are or'ed into the flags value,
512	backends will be tried (in the reverse order as listed here). If none are	634	then only these backends will be tried (in the reverse order as listed
513	specified, all backends in C<ev_recommended_backends ()> will be tried.	635	here). If none are specified, all backends in C<ev_recommended_backends
514		636	()> will be tried.
515	Example: This is the most typical usage.
516
517	if (!ev_default_loop (0))
518	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
519
520	Example: Restrict libev to the select and poll backends, and do not allow
521	environment settings to be taken into account:
522
523	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
524
525	Example: Use whatever libev has to offer, but make sure that kqueue is
526	used if available (warning, breaks stuff, best use only with your own
527	private event loop and only if you know the OS supports your types of
528	fds):
529
530	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
531
532	=item struct ev_loop *ev_loop_new (unsigned int flags)
533
534	Similar to C<ev_default_loop>, but always creates a new event loop that is
535	always distinct from the default loop. Unlike the default loop, it cannot
536	handle signal and child watchers, and attempts to do so will be greeted by
537	undefined behaviour (or a failed assertion if assertions are enabled).
538
539	Note that this function I<is> thread-safe, and the recommended way to use
540	libev with threads is indeed to create one loop per thread, and using the
541	default loop in the "main" or "initial" thread.
542		637
543	Example: Try to create a event loop that uses epoll and nothing else.	638	Example: Try to create a event loop that uses epoll and nothing else.
544		639
545	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	640	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
546	if (!epoller)	641	if (!epoller)
547	fatal ("no epoll found here, maybe it hides under your chair");	642	fatal ("no epoll found here, maybe it hides under your chair");
548		643
		644	Example: Use whatever libev has to offer, but make sure that kqueue is
		645	used if available.
		646
		647	struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
		648
549	=item ev_default_destroy ()	649	=item ev_loop_destroy (loop)
550		650
551	Destroys the default loop again (frees all memory and kernel state	651	Destroys an event loop object (frees all memory and kernel state
552	etc.). None of the active event watchers will be stopped in the normal	652	etc.). None of the active event watchers will be stopped in the normal
553	sense, so e.g. C<ev_is_active> might still return true. It is your	653	sense, so e.g. C<ev_is_active> might still return true. It is your
554	responsibility to either stop all watchers cleanly yourself I<before>	654	responsibility to either stop all watchers cleanly yourself I<before>
555	calling this function, or cope with the fact afterwards (which is usually	655	calling this function, or cope with the fact afterwards (which is usually
556	the easiest thing, you can just ignore the watchers and/or C<free ()> them	656	the easiest thing, you can just ignore the watchers and/or C<free ()> them
…		…
558		658
559	Note that certain global state, such as signal state (and installed signal	659	Note that certain global state, such as signal state (and installed signal
560	handlers), will not be freed by this function, and related watchers (such	660	handlers), will not be freed by this function, and related watchers (such
561	as signal and child watchers) would need to be stopped manually.	661	as signal and child watchers) would need to be stopped manually.
562		662
563	In general it is not advisable to call this function except in the	663	This function is normally used on loop objects allocated by
564	rare occasion where you really need to free e.g. the signal handling	664	C<ev_loop_new>, but it can also be used on the default loop returned by
		665	C<ev_default_loop>, in which case it is not thread-safe.
		666
		667	Note that it is not advisable to call this function on the default loop
		668	except in the rare occasion where you really need to free its resources.
565	pipe fds. If you need dynamically allocated loops it is better to use	669	If you need dynamically allocated loops it is better to use C<ev_loop_new>
566	C<ev_loop_new> and C<ev_loop_destroy>).	670	and C<ev_loop_destroy>.
567		671
568	=item ev_loop_destroy (loop)	672	=item ev_loop_fork (loop)
569		673
570	Like C<ev_default_destroy>, but destroys an event loop created by an
571	earlier call to C<ev_loop_new>.
572
573	=item ev_default_fork ()
574
575	This function sets a flag that causes subsequent C<ev_loop> iterations	674	This function sets a flag that causes subsequent C<ev_run> iterations to
576	to reinitialise the kernel state for backends that have one. Despite the	675	reinitialise the kernel state for backends that have one. Despite the
577	name, you can call it anytime, but it makes most sense after forking, in	676	name, you can call it anytime, but it makes most sense after forking, in
578	the child process (or both child and parent, but that again makes little	677	the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
579	sense). You I<must> call it in the child before using any of the libev	678	child before resuming or calling C<ev_run>.
580	functions, and it will only take effect at the next C<ev_loop> iteration.	679
		680	Again, you I<have> to call it on I<any> loop that you want to re-use after
		681	a fork, I<even if you do not plan to use the loop in the parent>. This is
		682	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
		683	during fork.
581		684
582	On the other hand, you only need to call this function in the child	685	On the other hand, you only need to call this function in the child
583	process if and only if you want to use the event library in the child. If	686	process if and only if you want to use the event loop in the child. If
584	you just fork+exec, you don't have to call it at all.	687	you just fork+exec or create a new loop in the child, you don't have to
		688	call it at all (in fact, C<epoll> is so badly broken that it makes a
		689	difference, but libev will usually detect this case on its own and do a
		690	costly reset of the backend).
585		691
586	The function itself is quite fast and it's usually not a problem to call	692	The function itself is quite fast and it's usually not a problem to call
587	it just in case after a fork. To make this easy, the function will fit in	693	it just in case after a fork.
588	quite nicely into a call to C<pthread_atfork>:
589		694
		695	Example: Automate calling C<ev_loop_fork> on the default loop when
		696	using pthreads.
		697
		698	static void
		699	post_fork_child (void)
		700	{
		701	ev_loop_fork (EV_DEFAULT);
		702	}
		703
		704	...
590	pthread_atfork (0, 0, ev_default_fork);	705	pthread_atfork (0, 0, post_fork_child);
591
592	=item ev_loop_fork (loop)
593
594	Like C<ev_default_fork>, but acts on an event loop created by
595	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
596	after fork that you want to re-use in the child, and how you do this is
597	entirely your own problem.
598		706
599	=item int ev_is_default_loop (loop)	707	=item int ev_is_default_loop (loop)
600		708
601	Returns true when the given loop is, in fact, the default loop, and false	709	Returns true when the given loop is, in fact, the default loop, and false
602	otherwise.	710	otherwise.
603		711
604	=item unsigned int ev_loop_count (loop)	712	=item unsigned int ev_iteration (loop)
605		713
606	Returns the count of loop iterations for the loop, which is identical to	714	Returns the current iteration count for the event loop, which is identical
607	the number of times libev did poll for new events. It starts at C<0> and	715	to the number of times libev did poll for new events. It starts at C<0>
608	happily wraps around with enough iterations.	716	and happily wraps around with enough iterations.
609		717
610	This value can sometimes be useful as a generation counter of sorts (it	718	This value can sometimes be useful as a generation counter of sorts (it
611	"ticks" the number of loop iterations), as it roughly corresponds with	719	"ticks" the number of loop iterations), as it roughly corresponds with
612	C<ev_prepare> and C<ev_check> calls.	720	C<ev_prepare> and C<ev_check> calls - and is incremented between the
		721	prepare and check phases.
		722
		723	=item unsigned int ev_depth (loop)
		724
		725	Returns the number of times C<ev_run> was entered minus the number of
		726	times C<ev_run> was exited normally, in other words, the recursion depth.
		727
		728	Outside C<ev_run>, this number is zero. In a callback, this number is
		729	C<1>, unless C<ev_run> was invoked recursively (or from another thread),
		730	in which case it is higher.
		731
		732	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
		733	throwing an exception etc.), doesn't count as "exit" - consider this
		734	as a hint to avoid such ungentleman-like behaviour unless it's really
		735	convenient, in which case it is fully supported.
613		736
614	=item unsigned int ev_backend (loop)	737	=item unsigned int ev_backend (loop)
615		738
616	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	739	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
617	use.	740	use.
…		…
626		749
627	=item ev_now_update (loop)	750	=item ev_now_update (loop)
628		751
629	Establishes the current time by querying the kernel, updating the time	752	Establishes the current time by querying the kernel, updating the time
630	returned by C<ev_now ()> in the progress. This is a costly operation and	753	returned by C<ev_now ()> in the progress. This is a costly operation and
631	is usually done automatically within C<ev_loop ()>.	754	is usually done automatically within C<ev_run ()>.
632		755
633	This function is rarely useful, but when some event callback runs for a	756	This function is rarely useful, but when some event callback runs for a
634	very long time without entering the event loop, updating libev's idea of	757	very long time without entering the event loop, updating libev's idea of
635	the current time is a good idea.	758	the current time is a good idea.
636		759
637	See also "The special problem of time updates" in the C<ev_timer> section.	760	See also L<The special problem of time updates> in the C<ev_timer> section.
638		761
639	=item ev_suspend (loop)	762	=item ev_suspend (loop)
640		763
641	=item ev_resume (loop)	764	=item ev_resume (loop)
642		765
643	These two functions suspend and resume a loop, for use when the loop is	766	These two functions suspend and resume an event loop, for use when the
644	not used for a while and timeouts should not be processed.	767	loop is not used for a while and timeouts should not be processed.
645		768
646	A typical use case would be an interactive program such as a game: When	769	A typical use case would be an interactive program such as a game: When
647	the user presses C<^Z> to suspend the game and resumes it an hour later it	770	the user presses C<^Z> to suspend the game and resumes it an hour later it
648	would be best to handle timeouts as if no time had actually passed while	771	would be best to handle timeouts as if no time had actually passed while
649	the program was suspended. This can be achieved by calling C<ev_suspend>	772	the program was suspended. This can be achieved by calling C<ev_suspend>
…		…
651	C<ev_resume> directly afterwards to resume timer processing.	774	C<ev_resume> directly afterwards to resume timer processing.
652		775
653	Effectively, all C<ev_timer> watchers will be delayed by the time spend	776	Effectively, all C<ev_timer> watchers will be delayed by the time spend
654	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers	777	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
655	will be rescheduled (that is, they will lose any events that would have	778	will be rescheduled (that is, they will lose any events that would have
656	occured while suspended).	779	occurred while suspended).
657		780
658	After calling C<ev_suspend> you B<must not> call I<any> function on the	781	After calling C<ev_suspend> you B<must not> call I<any> function on the
659	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>	782	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
660	without a previous call to C<ev_suspend>.	783	without a previous call to C<ev_suspend>.
661		784
662	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	785	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
663	event loop time (see C<ev_now_update>).	786	event loop time (see C<ev_now_update>).
664		787
665	=item ev_loop (loop, int flags)	788	=item ev_run (loop, int flags)
666		789
667	Finally, this is it, the event handler. This function usually is called	790	Finally, this is it, the event handler. This function usually is called
668	after you initialised all your watchers and you want to start handling	791	after you have initialised all your watchers and you want to start
669	events.	792	handling events. It will ask the operating system for any new events, call
		793	the watcher callbacks, an then repeat the whole process indefinitely: This
		794	is why event loops are called I<loops>.
670		795
671	If the flags argument is specified as C<0>, it will not return until	796	If the flags argument is specified as C<0>, it will keep handling events
672	either no event watchers are active anymore or C<ev_unloop> was called.	797	until either no event watchers are active anymore or C<ev_break> was
		798	called.
673		799
674	Please note that an explicit C<ev_unloop> is usually better than	800	Please note that an explicit C<ev_break> is usually better than
675	relying on all watchers to be stopped when deciding when a program has	801	relying on all watchers to be stopped when deciding when a program has
676	finished (especially in interactive programs), but having a program	802	finished (especially in interactive programs), but having a program
677	that automatically loops as long as it has to and no longer by virtue	803	that automatically loops as long as it has to and no longer by virtue
678	of relying on its watchers stopping correctly, that is truly a thing of	804	of relying on its watchers stopping correctly, that is truly a thing of
679	beauty.	805	beauty.
680		806
		807	This function is also I<mostly> exception-safe - you can break out of
		808	a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
		809	exception and so on. This does not decrement the C<ev_depth> value, nor
		810	will it clear any outstanding C<EVBREAK_ONE> breaks.
		811
681	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	812	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
682	those events and any already outstanding ones, but will not block your	813	those events and any already outstanding ones, but will not wait and
683	process in case there are no events and will return after one iteration of	814	block your process in case there are no events and will return after one
684	the loop.	815	iteration of the loop. This is sometimes useful to poll and handle new
		816	events while doing lengthy calculations, to keep the program responsive.
685		817
686	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	818	A flags value of C<EVRUN_ONCE> will look for new events (waiting if
687	necessary) and will handle those and any already outstanding ones. It	819	necessary) and will handle those and any already outstanding ones. It
688	will block your process until at least one new event arrives (which could	820	will block your process until at least one new event arrives (which could
689	be an event internal to libev itself, so there is no guarantee that a	821	be an event internal to libev itself, so there is no guarantee that a
690	user-registered callback will be called), and will return after one	822	user-registered callback will be called), and will return after one
691	iteration of the loop.	823	iteration of the loop.
692		824
693	This is useful if you are waiting for some external event in conjunction	825	This is useful if you are waiting for some external event in conjunction
694	with something not expressible using other libev watchers (i.e. "roll your	826	with something not expressible using other libev watchers (i.e. "roll your
695	own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	827	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
696	usually a better approach for this kind of thing.	828	usually a better approach for this kind of thing.
697		829
698	Here are the gory details of what C<ev_loop> does:	830	Here are the gory details of what C<ev_run> does:
699		831
		832	- Increment loop depth.
		833	- Reset the ev_break status.
700	- Before the first iteration, call any pending watchers.	834	- Before the first iteration, call any pending watchers.
		835	LOOP:
701	* If EVFLAG_FORKCHECK was used, check for a fork.	836	- If EVFLAG_FORKCHECK was used, check for a fork.
702	- If a fork was detected (by any means), queue and call all fork watchers.	837	- If a fork was detected (by any means), queue and call all fork watchers.
703	- Queue and call all prepare watchers.	838	- Queue and call all prepare watchers.
		839	- If ev_break was called, goto FINISH.
704	- If we have been forked, detach and recreate the kernel state	840	- If we have been forked, detach and recreate the kernel state
705	as to not disturb the other process.	841	as to not disturb the other process.
706	- Update the kernel state with all outstanding changes.	842	- Update the kernel state with all outstanding changes.
707	- Update the "event loop time" (ev_now ()).	843	- Update the "event loop time" (ev_now ()).
708	- Calculate for how long to sleep or block, if at all	844	- Calculate for how long to sleep or block, if at all
709	(active idle watchers, EVLOOP_NONBLOCK or not having	845	(active idle watchers, EVRUN_NOWAIT or not having
710	any active watchers at all will result in not sleeping).	846	any active watchers at all will result in not sleeping).
711	- Sleep if the I/O and timer collect interval say so.	847	- Sleep if the I/O and timer collect interval say so.
		848	- Increment loop iteration counter.
712	- Block the process, waiting for any events.	849	- Block the process, waiting for any events.
713	- Queue all outstanding I/O (fd) events.	850	- Queue all outstanding I/O (fd) events.
714	- Update the "event loop time" (ev_now ()), and do time jump adjustments.	851	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
715	- Queue all expired timers.	852	- Queue all expired timers.
716	- Queue all expired periodics.	853	- Queue all expired periodics.
717	- Unless any events are pending now, queue all idle watchers.	854	- Queue all idle watchers with priority higher than that of pending events.
718	- Queue all check watchers.	855	- Queue all check watchers.
719	- Call all queued watchers in reverse order (i.e. check watchers first).	856	- Call all queued watchers in reverse order (i.e. check watchers first).
720	Signals and child watchers are implemented as I/O watchers, and will	857	Signals and child watchers are implemented as I/O watchers, and will
721	be handled here by queueing them when their watcher gets executed.	858	be handled here by queueing them when their watcher gets executed.
722	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	859	- If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
723	were used, or there are no active watchers, return, otherwise	860	were used, or there are no active watchers, goto FINISH, otherwise
724	continue with step *.	861	continue with step LOOP.
		862	FINISH:
		863	- Reset the ev_break status iff it was EVBREAK_ONE.
		864	- Decrement the loop depth.
		865	- Return.
725		866
726	Example: Queue some jobs and then loop until no events are outstanding	867	Example: Queue some jobs and then loop until no events are outstanding
727	anymore.	868	anymore.
728		869
729	... queue jobs here, make sure they register event watchers as long	870	... queue jobs here, make sure they register event watchers as long
730	... as they still have work to do (even an idle watcher will do..)	871	... as they still have work to do (even an idle watcher will do..)
731	ev_loop (my_loop, 0);	872	ev_run (my_loop, 0);
732	... jobs done or somebody called unloop. yeah!	873	... jobs done or somebody called break. yeah!
733		874
734	=item ev_unloop (loop, how)	875	=item ev_break (loop, how)
735		876
736	Can be used to make a call to C<ev_loop> return early (but only after it	877	Can be used to make a call to C<ev_run> return early (but only after it
737	has processed all outstanding events). The C<how> argument must be either	878	has processed all outstanding events). The C<how> argument must be either
738	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	879	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
739	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	880	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
740		881
741	This "unloop state" will be cleared when entering C<ev_loop> again.	882	This "break state" will be cleared on the next call to C<ev_run>.
742		883
743	It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls.	884	It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
		885	which case it will have no effect.
744		886
745	=item ev_ref (loop)	887	=item ev_ref (loop)
746		888
747	=item ev_unref (loop)	889	=item ev_unref (loop)
748		890
749	Ref/unref can be used to add or remove a reference count on the event	891	Ref/unref can be used to add or remove a reference count on the event
750	loop: Every watcher keeps one reference, and as long as the reference	892	loop: Every watcher keeps one reference, and as long as the reference
751	count is nonzero, C<ev_loop> will not return on its own.	893	count is nonzero, C<ev_run> will not return on its own.
752		894
753	If you have a watcher you never unregister that should not keep C<ev_loop>	895	This is useful when you have a watcher that you never intend to
754	from returning, call ev_unref() after starting, and ev_ref() before	896	unregister, but that nevertheless should not keep C<ev_run> from
		897	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
755	stopping it.	898	before stopping it.
756		899
757	As an example, libev itself uses this for its internal signal pipe: It	900	As an example, libev itself uses this for its internal signal pipe: It
758	is not visible to the libev user and should not keep C<ev_loop> from	901	is not visible to the libev user and should not keep C<ev_run> from
759	exiting if no event watchers registered by it are active. It is also an	902	exiting if no event watchers registered by it are active. It is also an
760	excellent way to do this for generic recurring timers or from within	903	excellent way to do this for generic recurring timers or from within
761	third-party libraries. Just remember to I<unref after start> and I<ref	904	third-party libraries. Just remember to I<unref after start> and I<ref
762	before stop> (but only if the watcher wasn't active before, or was active	905	before stop> (but only if the watcher wasn't active before, or was active
763	before, respectively. Note also that libev might stop watchers itself	906	before, respectively. Note also that libev might stop watchers itself
764	(e.g. non-repeating timers) in which case you have to C<ev_ref>	907	(e.g. non-repeating timers) in which case you have to C<ev_ref>
765	in the callback).	908	in the callback).
766		909
767	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	910	Example: Create a signal watcher, but keep it from keeping C<ev_run>
768	running when nothing else is active.	911	running when nothing else is active.
769		912
770	ev_signal exitsig;	913	ev_signal exitsig;
771	ev_signal_init (&exitsig, sig_cb, SIGINT);	914	ev_signal_init (&exitsig, sig_cb, SIGINT);
772	ev_signal_start (loop, &exitsig);	915	ev_signal_start (loop, &exitsig);
773	evf_unref (loop);	916	ev_unref (loop);
774		917
775	Example: For some weird reason, unregister the above signal handler again.	918	Example: For some weird reason, unregister the above signal handler again.
776		919
777	ev_ref (loop);	920	ev_ref (loop);
778	ev_signal_stop (loop, &exitsig);	921	ev_signal_stop (loop, &exitsig);
…		…
799		942
800	By setting a higher I<io collect interval> you allow libev to spend more	943	By setting a higher I<io collect interval> you allow libev to spend more
801	time collecting I/O events, so you can handle more events per iteration,	944	time collecting I/O events, so you can handle more events per iteration,
802	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	945	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
803	C<ev_timer>) will be not affected. Setting this to a non-null value will	946	C<ev_timer>) will be not affected. Setting this to a non-null value will
804	introduce an additional C<ev_sleep ()> call into most loop iterations.	947	introduce an additional C<ev_sleep ()> call into most loop iterations. The
		948	sleep time ensures that libev will not poll for I/O events more often then
		949	once per this interval, on average.
805		950
806	Likewise, by setting a higher I<timeout collect interval> you allow libev	951	Likewise, by setting a higher I<timeout collect interval> you allow libev
807	to spend more time collecting timeouts, at the expense of increased	952	to spend more time collecting timeouts, at the expense of increased
808	latency/jitter/inexactness (the watcher callback will be called	953	latency/jitter/inexactness (the watcher callback will be called
809	later). C<ev_io> watchers will not be affected. Setting this to a non-null	954	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
811		956
812	Many (busy) programs can usually benefit by setting the I/O collect	957	Many (busy) programs can usually benefit by setting the I/O collect
813	interval to a value near C<0.1> or so, which is often enough for	958	interval to a value near C<0.1> or so, which is often enough for
814	interactive servers (of course not for games), likewise for timeouts. It	959	interactive servers (of course not for games), likewise for timeouts. It
815	usually doesn't make much sense to set it to a lower value than C<0.01>,	960	usually doesn't make much sense to set it to a lower value than C<0.01>,
816	as this approaches the timing granularity of most systems.	961	as this approaches the timing granularity of most systems. Note that if
		962	you do transactions with the outside world and you can't increase the
		963	parallelity, then this setting will limit your transaction rate (if you
		964	need to poll once per transaction and the I/O collect interval is 0.01,
		965	then you can't do more than 100 transactions per second).
817		966
818	Setting the I<timeout collect interval> can improve the opportunity for	967	Setting the I<timeout collect interval> can improve the opportunity for
819	saving power, as the program will "bundle" timer callback invocations that	968	saving power, as the program will "bundle" timer callback invocations that
820	are "near" in time together, by delaying some, thus reducing the number of	969	are "near" in time together, by delaying some, thus reducing the number of
821	times the process sleeps and wakes up again. Another useful technique to	970	times the process sleeps and wakes up again. Another useful technique to
822	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure	971	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
823	they fire on, say, one-second boundaries only.	972	they fire on, say, one-second boundaries only.
824		973
		974	Example: we only need 0.1s timeout granularity, and we wish not to poll
		975	more often than 100 times per second:
		976
		977	ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
		978	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
		979
		980	=item ev_invoke_pending (loop)
		981
		982	This call will simply invoke all pending watchers while resetting their
		983	pending state. Normally, C<ev_run> does this automatically when required,
		984	but when overriding the invoke callback this call comes handy. This
		985	function can be invoked from a watcher - this can be useful for example
		986	when you want to do some lengthy calculation and want to pass further
		987	event handling to another thread (you still have to make sure only one
		988	thread executes within C<ev_invoke_pending> or C<ev_run> of course).
		989
		990	=item int ev_pending_count (loop)
		991
		992	Returns the number of pending watchers - zero indicates that no watchers
		993	are pending.
		994
		995	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
		996
		997	This overrides the invoke pending functionality of the loop: Instead of
		998	invoking all pending watchers when there are any, C<ev_run> will call
		999	this callback instead. This is useful, for example, when you want to
		1000	invoke the actual watchers inside another context (another thread etc.).
		1001
		1002	If you want to reset the callback, use C<ev_invoke_pending> as new
		1003	callback.
		1004
		1005	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
		1006
		1007	Sometimes you want to share the same loop between multiple threads. This
		1008	can be done relatively simply by putting mutex_lock/unlock calls around
		1009	each call to a libev function.
		1010
		1011	However, C<ev_run> can run an indefinite time, so it is not feasible
		1012	to wait for it to return. One way around this is to wake up the event
		1013	loop via C<ev_break> and C<av_async_send>, another way is to set these
		1014	I<release> and I<acquire> callbacks on the loop.
		1015
		1016	When set, then C<release> will be called just before the thread is
		1017	suspended waiting for new events, and C<acquire> is called just
		1018	afterwards.
		1019
		1020	Ideally, C<release> will just call your mutex_unlock function, and
		1021	C<acquire> will just call the mutex_lock function again.
		1022
		1023	While event loop modifications are allowed between invocations of
		1024	C<release> and C<acquire> (that's their only purpose after all), no
		1025	modifications done will affect the event loop, i.e. adding watchers will
		1026	have no effect on the set of file descriptors being watched, or the time
		1027	waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
		1028	to take note of any changes you made.
		1029
		1030	In theory, threads executing C<ev_run> will be async-cancel safe between
		1031	invocations of C<release> and C<acquire>.
		1032
		1033	See also the locking example in the C<THREADS> section later in this
		1034	document.
		1035
		1036	=item ev_set_userdata (loop, void *data)
		1037
		1038	=item void *ev_userdata (loop)
		1039
		1040	Set and retrieve a single C<void *> associated with a loop. When
		1041	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
		1042	C<0>.
		1043
		1044	These two functions can be used to associate arbitrary data with a loop,
		1045	and are intended solely for the C<invoke_pending_cb>, C<release> and
		1046	C<acquire> callbacks described above, but of course can be (ab-)used for
		1047	any other purpose as well.
		1048
825	=item ev_loop_verify (loop)	1049	=item ev_verify (loop)
826		1050
827	This function only does something when C<EV_VERIFY> support has been	1051	This function only does something when C<EV_VERIFY> support has been
828	compiled in, which is the default for non-minimal builds. It tries to go	1052	compiled in, which is the default for non-minimal builds. It tries to go
829	through all internal structures and checks them for validity. If anything	1053	through all internal structures and checks them for validity. If anything
830	is found to be inconsistent, it will print an error message to standard	1054	is found to be inconsistent, it will print an error message to standard
…		…
841		1065
842	In the following description, uppercase C<TYPE> in names stands for the	1066	In the following description, uppercase C<TYPE> in names stands for the
843	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer	1067	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
844	watchers and C<ev_io_start> for I/O watchers.	1068	watchers and C<ev_io_start> for I/O watchers.
845		1069
846	A watcher is a structure that you create and register to record your	1070	A watcher is an opaque structure that you allocate and register to record
847	interest in some event. For instance, if you want to wait for STDIN to	1071	your interest in some event. To make a concrete example, imagine you want
848	become readable, you would create an C<ev_io> watcher for that:	1072	to wait for STDIN to become readable, you would create an C<ev_io> watcher
		1073	for that:
849		1074
850	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)	1075	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
851	{	1076	{
852	ev_io_stop (w);	1077	ev_io_stop (w);
853	ev_unloop (loop, EVUNLOOP_ALL);	1078	ev_break (loop, EVBREAK_ALL);
854	}	1079	}
855		1080
856	struct ev_loop *loop = ev_default_loop (0);	1081	struct ev_loop *loop = ev_default_loop (0);
857		1082
858	ev_io stdin_watcher;	1083	ev_io stdin_watcher;
859		1084
860	ev_init (&stdin_watcher, my_cb);	1085	ev_init (&stdin_watcher, my_cb);
861	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	1086	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
862	ev_io_start (loop, &stdin_watcher);	1087	ev_io_start (loop, &stdin_watcher);
863		1088
864	ev_loop (loop, 0);	1089	ev_run (loop, 0);
865		1090
866	As you can see, you are responsible for allocating the memory for your	1091	As you can see, you are responsible for allocating the memory for your
867	watcher structures (and it is I<usually> a bad idea to do this on the	1092	watcher structures (and it is I<usually> a bad idea to do this on the
868	stack).	1093	stack).
869		1094
870	Each watcher has an associated watcher structure (called C<struct ev_TYPE>	1095	Each watcher has an associated watcher structure (called C<struct ev_TYPE>
871	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).	1096	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
872		1097
873	Each watcher structure must be initialised by a call to C<ev_init	1098	Each watcher structure must be initialised by a call to C<ev_init (watcher
874	(watcher *, callback)>, which expects a callback to be provided. This	1099	*, callback)>, which expects a callback to be provided. This callback is
875	callback gets invoked each time the event occurs (or, in the case of I/O	1100	invoked each time the event occurs (or, in the case of I/O watchers, each
876	watchers, each time the event loop detects that the file descriptor given	1101	time the event loop detects that the file descriptor given is readable
877	is readable and/or writable).	1102	and/or writable).
878		1103
879	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>	1104	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
880	macro to configure it, with arguments specific to the watcher type. There	1105	macro to configure it, with arguments specific to the watcher type. There
881	is also a macro to combine initialisation and setting in one call: C<<	1106	is also a macro to combine initialisation and setting in one call: C<<
882	ev_TYPE_init (watcher *, callback, ...) >>.	1107	ev_TYPE_init (watcher *, callback, ...) >>.
…		…
905	=item C<EV_WRITE>	1130	=item C<EV_WRITE>
906		1131
907	The file descriptor in the C<ev_io> watcher has become readable and/or	1132	The file descriptor in the C<ev_io> watcher has become readable and/or
908	writable.	1133	writable.
909		1134
910	=item C<EV_TIMEOUT>	1135	=item C<EV_TIMER>
911		1136
912	The C<ev_timer> watcher has timed out.	1137	The C<ev_timer> watcher has timed out.
913		1138
914	=item C<EV_PERIODIC>	1139	=item C<EV_PERIODIC>
915		1140
…		…
933		1158
934	=item C<EV_PREPARE>	1159	=item C<EV_PREPARE>
935		1160
936	=item C<EV_CHECK>	1161	=item C<EV_CHECK>
937		1162
938	All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts	1163	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
939	to gather new events, and all C<ev_check> watchers are invoked just after	1164	to gather new events, and all C<ev_check> watchers are invoked just after
940	C<ev_loop> has gathered them, but before it invokes any callbacks for any	1165	C<ev_run> has gathered them, but before it invokes any callbacks for any
941	received events. Callbacks of both watcher types can start and stop as	1166	received events. Callbacks of both watcher types can start and stop as
942	many watchers as they want, and all of them will be taken into account	1167	many watchers as they want, and all of them will be taken into account
943	(for example, a C<ev_prepare> watcher might start an idle watcher to keep	1168	(for example, a C<ev_prepare> watcher might start an idle watcher to keep
944	C<ev_loop> from blocking).	1169	C<ev_run> from blocking).
945		1170
946	=item C<EV_EMBED>	1171	=item C<EV_EMBED>
947		1172
948	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1173	The embedded event loop specified in the C<ev_embed> watcher needs attention.
949		1174
950	=item C<EV_FORK>	1175	=item C<EV_FORK>
951		1176
952	The event loop has been resumed in the child process after fork (see	1177	The event loop has been resumed in the child process after fork (see
953	C<ev_fork>).	1178	C<ev_fork>).
		1179
		1180	=item C<EV_CLEANUP>
		1181
		1182	The event loop is about to be destroyed (see C<ev_cleanup>).
954		1183
955	=item C<EV_ASYNC>	1184	=item C<EV_ASYNC>
956		1185
957	The given async watcher has been asynchronously notified (see C<ev_async>).	1186	The given async watcher has been asynchronously notified (see C<ev_async>).
958		1187
…		…
1005		1234
1006	ev_io w;	1235	ev_io w;
1007	ev_init (&w, my_cb);	1236	ev_init (&w, my_cb);
1008	ev_io_set (&w, STDIN_FILENO, EV_READ);	1237	ev_io_set (&w, STDIN_FILENO, EV_READ);
1009		1238
1010	=item C<ev_TYPE_set> (ev_TYPE *, [args])	1239	=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1011		1240
1012	This macro initialises the type-specific parts of a watcher. You need to	1241	This macro initialises the type-specific parts of a watcher. You need to
1013	call C<ev_init> at least once before you call this macro, but you can	1242	call C<ev_init> at least once before you call this macro, but you can
1014	call C<ev_TYPE_set> any number of times. You must not, however, call this	1243	call C<ev_TYPE_set> any number of times. You must not, however, call this
1015	macro on a watcher that is active (it can be pending, however, which is a	1244	macro on a watcher that is active (it can be pending, however, which is a
…		…
1028		1257
1029	Example: Initialise and set an C<ev_io> watcher in one step.	1258	Example: Initialise and set an C<ev_io> watcher in one step.
1030		1259
1031	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);	1260	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1032		1261
1033	=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)	1262	=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1034		1263
1035	Starts (activates) the given watcher. Only active watchers will receive	1264	Starts (activates) the given watcher. Only active watchers will receive
1036	events. If the watcher is already active nothing will happen.	1265	events. If the watcher is already active nothing will happen.
1037		1266
1038	Example: Start the C<ev_io> watcher that is being abused as example in this	1267	Example: Start the C<ev_io> watcher that is being abused as example in this
1039	whole section.	1268	whole section.
1040		1269
1041	ev_io_start (EV_DEFAULT_UC, &w);	1270	ev_io_start (EV_DEFAULT_UC, &w);
1042		1271
1043	=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)	1272	=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1044		1273
1045	Stops the given watcher if active, and clears the pending status (whether	1274	Stops the given watcher if active, and clears the pending status (whether
1046	the watcher was active or not).	1275	the watcher was active or not).
1047		1276
1048	It is possible that stopped watchers are pending - for example,	1277	It is possible that stopped watchers are pending - for example,
…		…
1073	=item ev_cb_set (ev_TYPE *watcher, callback)	1302	=item ev_cb_set (ev_TYPE *watcher, callback)
1074		1303
1075	Change the callback. You can change the callback at virtually any time	1304	Change the callback. You can change the callback at virtually any time
1076	(modulo threads).	1305	(modulo threads).
1077		1306
1078	=item ev_set_priority (ev_TYPE *watcher, priority)	1307	=item ev_set_priority (ev_TYPE *watcher, int priority)
1079		1308
1080	=item int ev_priority (ev_TYPE *watcher)	1309	=item int ev_priority (ev_TYPE *watcher)
1081		1310
1082	Set and query the priority of the watcher. The priority is a small	1311	Set and query the priority of the watcher. The priority is a small
1083	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>	1312	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1084	(default: C<-2>). Pending watchers with higher priority will be invoked	1313	(default: C<-2>). Pending watchers with higher priority will be invoked
1085	before watchers with lower priority, but priority will not keep watchers	1314	before watchers with lower priority, but priority will not keep watchers
1086	from being executed (except for C<ev_idle> watchers).	1315	from being executed (except for C<ev_idle> watchers).
1087		1316
1088	This means that priorities are I<only> used for ordering callback
1089	invocation after new events have been received. This is useful, for
1090	example, to reduce latency after idling, or more often, to bind two
1091	watchers on the same event and make sure one is called first.
1092
1093	If you need to suppress invocation when higher priority events are pending	1317	If you need to suppress invocation when higher priority events are pending
1094	you need to look at C<ev_idle> watchers, which provide this functionality.	1318	you need to look at C<ev_idle> watchers, which provide this functionality.
1095		1319
1096	You I<must not> change the priority of a watcher as long as it is active or	1320	You I<must not> change the priority of a watcher as long as it is active or
1097	pending.	1321	pending.
1098
1099	The default priority used by watchers when no priority has been set is
1100	always C<0>, which is supposed to not be too high and not be too low :).
1101		1322
1102	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is	1323	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1103	fine, as long as you do not mind that the priority value you query might	1324	fine, as long as you do not mind that the priority value you query might
1104	or might not have been clamped to the valid range.	1325	or might not have been clamped to the valid range.
		1326
		1327	The default priority used by watchers when no priority has been set is
		1328	always C<0>, which is supposed to not be too high and not be too low :).
		1329
		1330	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
		1331	priorities.
1105		1332
1106	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1333	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1107		1334
1108	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1335	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1109	C<loop> nor C<revents> need to be valid as long as the watcher callback	1336	C<loop> nor C<revents> need to be valid as long as the watcher callback
…		…
1117	watcher isn't pending it does nothing and returns C<0>.	1344	watcher isn't pending it does nothing and returns C<0>.
1118		1345
1119	Sometimes it can be useful to "poll" a watcher instead of waiting for its	1346	Sometimes it can be useful to "poll" a watcher instead of waiting for its
1120	callback to be invoked, which can be accomplished with this function.	1347	callback to be invoked, which can be accomplished with this function.
1121		1348
		1349	=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
		1350
		1351	Feeds the given event set into the event loop, as if the specified event
		1352	had happened for the specified watcher (which must be a pointer to an
		1353	initialised but not necessarily started event watcher). Obviously you must
		1354	not free the watcher as long as it has pending events.
		1355
		1356	Stopping the watcher, letting libev invoke it, or calling
		1357	C<ev_clear_pending> will clear the pending event, even if the watcher was
		1358	not started in the first place.
		1359
		1360	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
		1361	functions that do not need a watcher.
		1362
1122	=back	1363	=back
1123		1364
		1365	See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
		1366	OWN COMPOSITE WATCHERS> idioms.
1124		1367
1125	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1368	=head2 WATCHER STATES
1126		1369
1127	Each watcher has, by default, a member C<void *data> that you can change	1370	There are various watcher states mentioned throughout this manual -
1128	and read at any time: libev will completely ignore it. This can be used	1371	active, pending and so on. In this section these states and the rules to
1129	to associate arbitrary data with your watcher. If you need more data and	1372	transition between them will be described in more detail - and while these
1130	don't want to allocate memory and store a pointer to it in that data	1373	rules might look complicated, they usually do "the right thing".
1131	member, you can also "subclass" the watcher type and provide your own
1132	data:
1133		1374
1134	struct my_io	1375	=over 4
		1376
		1377	=item initialiased
		1378
		1379	Before a watcher can be registered with the event looop it has to be
		1380	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
		1381	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
		1382
		1383	In this state it is simply some block of memory that is suitable for
		1384	use in an event loop. It can be moved around, freed, reused etc. at
		1385	will - as long as you either keep the memory contents intact, or call
		1386	C<ev_TYPE_init> again.
		1387
		1388	=item started/running/active
		1389
		1390	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
		1391	property of the event loop, and is actively waiting for events. While in
		1392	this state it cannot be accessed (except in a few documented ways), moved,
		1393	freed or anything else - the only legal thing is to keep a pointer to it,
		1394	and call libev functions on it that are documented to work on active watchers.
		1395
		1396	=item pending
		1397
		1398	If a watcher is active and libev determines that an event it is interested
		1399	in has occurred (such as a timer expiring), it will become pending. It will
		1400	stay in this pending state until either it is stopped or its callback is
		1401	about to be invoked, so it is not normally pending inside the watcher
		1402	callback.
		1403
		1404	The watcher might or might not be active while it is pending (for example,
		1405	an expired non-repeating timer can be pending but no longer active). If it
		1406	is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
		1407	but it is still property of the event loop at this time, so cannot be
		1408	moved, freed or reused. And if it is active the rules described in the
		1409	previous item still apply.
		1410
		1411	It is also possible to feed an event on a watcher that is not active (e.g.
		1412	via C<ev_feed_event>), in which case it becomes pending without being
		1413	active.
		1414
		1415	=item stopped
		1416
		1417	A watcher can be stopped implicitly by libev (in which case it might still
		1418	be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
		1419	latter will clear any pending state the watcher might be in, regardless
		1420	of whether it was active or not, so stopping a watcher explicitly before
		1421	freeing it is often a good idea.
		1422
		1423	While stopped (and not pending) the watcher is essentially in the
		1424	initialised state, that is, it can be reused, moved, modified in any way
		1425	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1426	it again).
		1427
		1428	=back
		1429
		1430	=head2 WATCHER PRIORITY MODELS
		1431
		1432	Many event loops support I<watcher priorities>, which are usually small
		1433	integers that influence the ordering of event callback invocation
		1434	between watchers in some way, all else being equal.
		1435
		1436	In libev, Watcher priorities can be set using C<ev_set_priority>. See its
		1437	description for the more technical details such as the actual priority
		1438	range.
		1439
		1440	There are two common ways how these these priorities are being interpreted
		1441	by event loops:
		1442
		1443	In the more common lock-out model, higher priorities "lock out" invocation
		1444	of lower priority watchers, which means as long as higher priority
		1445	watchers receive events, lower priority watchers are not being invoked.
		1446
		1447	The less common only-for-ordering model uses priorities solely to order
		1448	callback invocation within a single event loop iteration: Higher priority
		1449	watchers are invoked before lower priority ones, but they all get invoked
		1450	before polling for new events.
		1451
		1452	Libev uses the second (only-for-ordering) model for all its watchers
		1453	except for idle watchers (which use the lock-out model).
		1454
		1455	The rationale behind this is that implementing the lock-out model for
		1456	watchers is not well supported by most kernel interfaces, and most event
		1457	libraries will just poll for the same events again and again as long as
		1458	their callbacks have not been executed, which is very inefficient in the
		1459	common case of one high-priority watcher locking out a mass of lower
		1460	priority ones.
		1461
		1462	Static (ordering) priorities are most useful when you have two or more
		1463	watchers handling the same resource: a typical usage example is having an
		1464	C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle
		1465	timeouts. Under load, data might be received while the program handles
		1466	other jobs, but since timers normally get invoked first, the timeout
		1467	handler will be executed before checking for data. In that case, giving
		1468	the timer a lower priority than the I/O watcher ensures that I/O will be
		1469	handled first even under adverse conditions (which is usually, but not
		1470	always, what you want).
		1471
		1472	Since idle watchers use the "lock-out" model, meaning that idle watchers
		1473	will only be executed when no same or higher priority watchers have
		1474	received events, they can be used to implement the "lock-out" model when
		1475	required.
		1476
		1477	For example, to emulate how many other event libraries handle priorities,
		1478	you can associate an C<ev_idle> watcher to each such watcher, and in
		1479	the normal watcher callback, you just start the idle watcher. The real
		1480	processing is done in the idle watcher callback. This causes libev to
		1481	continuously poll and process kernel event data for the watcher, but when
		1482	the lock-out case is known to be rare (which in turn is rare :), this is
		1483	workable.
		1484
		1485	Usually, however, the lock-out model implemented that way will perform
		1486	miserably under the type of load it was designed to handle. In that case,
		1487	it might be preferable to stop the real watcher before starting the
		1488	idle watcher, so the kernel will not have to process the event in case
		1489	the actual processing will be delayed for considerable time.
		1490
		1491	Here is an example of an I/O watcher that should run at a strictly lower
		1492	priority than the default, and which should only process data when no
		1493	other events are pending:
		1494
		1495	ev_idle idle; // actual processing watcher
		1496	ev_io io; // actual event watcher
		1497
		1498	static void
		1499	io_cb (EV_P_ ev_io *w, int revents)
1135	{	1500	{
1136	ev_io io;	1501	// stop the I/O watcher, we received the event, but
1137	int otherfd;	1502	// are not yet ready to handle it.
1138	void *somedata;	1503	ev_io_stop (EV_A_ w);
1139	struct whatever *mostinteresting;	1504
		1505	// start the idle watcher to handle the actual event.
		1506	// it will not be executed as long as other watchers
		1507	// with the default priority are receiving events.
		1508	ev_idle_start (EV_A_ &idle);
1140	};	1509	}
1141		1510
1142	...	1511	static void
1143	struct my_io w;	1512	idle_cb (EV_P_ ev_idle *w, int revents)
1144	ev_io_init (&w.io, my_cb, fd, EV_READ);
1145
1146	And since your callback will be called with a pointer to the watcher, you
1147	can cast it back to your own type:
1148
1149	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1150	{	1513	{
1151	struct my_io *w = (struct my_io *)w_;	1514	// actual processing
1152	...	1515	read (STDIN_FILENO, ...);
		1516
		1517	// have to start the I/O watcher again, as
		1518	// we have handled the event
		1519	ev_io_start (EV_P_ &io);
1153	}	1520	}
1154		1521
1155	More interesting and less C-conformant ways of casting your callback type	1522	// initialisation
1156	instead have been omitted.	1523	ev_idle_init (&idle, idle_cb);
		1524	ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ);
		1525	ev_io_start (EV_DEFAULT_ &io);
1157		1526
1158	Another common scenario is to use some data structure with multiple	1527	In the "real" world, it might also be beneficial to start a timer, so that
1159	embedded watchers:	1528	low-priority connections can not be locked out forever under load. This
1160		1529	enables your program to keep a lower latency for important connections
1161	struct my_biggy	1530	during short periods of high load, while not completely locking out less
1162	{	1531	important ones.
1163	int some_data;
1164	ev_timer t1;
1165	ev_timer t2;
1166	}
1167
1168	In this case getting the pointer to C<my_biggy> is a bit more
1169	complicated: Either you store the address of your C<my_biggy> struct
1170	in the C<data> member of the watcher (for woozies), or you need to use
1171	some pointer arithmetic using C<offsetof> inside your watchers (for real
1172	programmers):
1173
1174	#include <stddef.h>
1175
1176	static void
1177	t1_cb (EV_P_ ev_timer *w, int revents)
1178	{
1179	struct my_biggy big = (struct my_biggy *
1180	(((char *)w) - offsetof (struct my_biggy, t1));
1181	}
1182
1183	static void
1184	t2_cb (EV_P_ ev_timer *w, int revents)
1185	{
1186	struct my_biggy big = (struct my_biggy *
1187	(((char *)w) - offsetof (struct my_biggy, t2));
1188	}
1189		1532
1190		1533
1191	=head1 WATCHER TYPES	1534	=head1 WATCHER TYPES
1192		1535
1193	This section describes each watcher in detail, but will not repeat	1536	This section describes each watcher in detail, but will not repeat
…		…
1217	In general you can register as many read and/or write event watchers per	1560	In general you can register as many read and/or write event watchers per
1218	fd as you want (as long as you don't confuse yourself). Setting all file	1561	fd as you want (as long as you don't confuse yourself). Setting all file
1219	descriptors to non-blocking mode is also usually a good idea (but not	1562	descriptors to non-blocking mode is also usually a good idea (but not
1220	required if you know what you are doing).	1563	required if you know what you are doing).
1221		1564
1222	If you cannot use non-blocking mode, then force the use of a
1223	known-to-be-good backend (at the time of this writing, this includes only
1224	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>).
1225
1226	Another thing you have to watch out for is that it is quite easy to	1565	Another thing you have to watch out for is that it is quite easy to
1227	receive "spurious" readiness notifications, that is your callback might	1566	receive "spurious" readiness notifications, that is, your callback might
1228	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1567	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1229	because there is no data. Not only are some backends known to create a	1568	because there is no data. It is very easy to get into this situation even
1230	lot of those (for example Solaris ports), it is very easy to get into	1569	with a relatively standard program structure. Thus it is best to always
1231	this situation even with a relatively standard program structure. Thus	1570	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1232	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1233	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1571	preferable to a program hanging until some data arrives.
1234		1572
1235	If you cannot run the fd in non-blocking mode (for example you should	1573	If you cannot run the fd in non-blocking mode (for example you should
1236	not play around with an Xlib connection), then you have to separately	1574	not play around with an Xlib connection), then you have to separately
1237	re-test whether a file descriptor is really ready with a known-to-be good	1575	re-test whether a file descriptor is really ready with a known-to-be good
1238	interface such as poll (fortunately in our Xlib example, Xlib already	1576	interface such as poll (fortunately in the case of Xlib, it already does
1239	does this on its own, so its quite safe to use). Some people additionally	1577	this on its own, so its quite safe to use). Some people additionally
1240	use C<SIGALRM> and an interval timer, just to be sure you won't block	1578	use C<SIGALRM> and an interval timer, just to be sure you won't block
1241	indefinitely.	1579	indefinitely.
1242		1580
1243	But really, best use non-blocking mode.	1581	But really, best use non-blocking mode.
1244		1582
…		…
1272		1610
1273	There is no workaround possible except not registering events	1611	There is no workaround possible except not registering events
1274	for potentially C<dup ()>'ed file descriptors, or to resort to	1612	for potentially C<dup ()>'ed file descriptors, or to resort to
1275	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1613	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1276		1614
		1615	=head3 The special problem of files
		1616
		1617	Many people try to use C<select> (or libev) on file descriptors
		1618	representing files, and expect it to become ready when their program
		1619	doesn't block on disk accesses (which can take a long time on their own).
		1620
		1621	However, this cannot ever work in the "expected" way - you get a readiness
		1622	notification as soon as the kernel knows whether and how much data is
		1623	there, and in the case of open files, that's always the case, so you
		1624	always get a readiness notification instantly, and your read (or possibly
		1625	write) will still block on the disk I/O.
		1626
		1627	Another way to view it is that in the case of sockets, pipes, character
		1628	devices and so on, there is another party (the sender) that delivers data
		1629	on its own, but in the case of files, there is no such thing: the disk
		1630	will not send data on its own, simply because it doesn't know what you
		1631	wish to read - you would first have to request some data.
		1632
		1633	Since files are typically not-so-well supported by advanced notification
		1634	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1635	to files, even though you should not use it. The reason for this is
		1636	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1637	usually a tty, often a pipe, but also sometimes files or special devices
		1638	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1639	F</dev/urandom>), and even though the file might better be served with
		1640	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1641	it "just works" instead of freezing.
		1642
		1643	So avoid file descriptors pointing to files when you know it (e.g. use
		1644	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1645	when you rarely read from a file instead of from a socket, and want to
		1646	reuse the same code path.
		1647
1277	=head3 The special problem of fork	1648	=head3 The special problem of fork
1278		1649
1279	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1650	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1280	useless behaviour. Libev fully supports fork, but needs to be told about	1651	useless behaviour. Libev fully supports fork, but needs to be told about
1281	it in the child.	1652	it in the child if you want to continue to use it in the child.
1282		1653
1283	To support fork in your programs, you either have to call	1654	To support fork in your child processes, you have to call C<ev_loop_fork
1284	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1655	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1285	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1656	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1286	C<EVBACKEND_POLL>.
1287		1657
1288	=head3 The special problem of SIGPIPE	1658	=head3 The special problem of SIGPIPE
1289		1659
1290	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1660	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1291	when writing to a pipe whose other end has been closed, your program gets	1661	when writing to a pipe whose other end has been closed, your program gets
…		…
1294		1664
1295	So when you encounter spurious, unexplained daemon exits, make sure you	1665	So when you encounter spurious, unexplained daemon exits, make sure you
1296	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon	1666	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1297	somewhere, as that would have given you a big clue).	1667	somewhere, as that would have given you a big clue).
1298		1668
		1669	=head3 The special problem of accept()ing when you can't
		1670
		1671	Many implementations of the POSIX C<accept> function (for example,
		1672	found in post-2004 Linux) have the peculiar behaviour of not removing a
		1673	connection from the pending queue in all error cases.
		1674
		1675	For example, larger servers often run out of file descriptors (because
		1676	of resource limits), causing C<accept> to fail with C<ENFILE> but not
		1677	rejecting the connection, leading to libev signalling readiness on
		1678	the next iteration again (the connection still exists after all), and
		1679	typically causing the program to loop at 100% CPU usage.
		1680
		1681	Unfortunately, the set of errors that cause this issue differs between
		1682	operating systems, there is usually little the app can do to remedy the
		1683	situation, and no known thread-safe method of removing the connection to
		1684	cope with overload is known (to me).
		1685
		1686	One of the easiest ways to handle this situation is to just ignore it
		1687	- when the program encounters an overload, it will just loop until the
		1688	situation is over. While this is a form of busy waiting, no OS offers an
		1689	event-based way to handle this situation, so it's the best one can do.
		1690
		1691	A better way to handle the situation is to log any errors other than
		1692	C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
		1693	messages, and continue as usual, which at least gives the user an idea of
		1694	what could be wrong ("raise the ulimit!"). For extra points one could stop
		1695	the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
		1696	usage.
		1697
		1698	If your program is single-threaded, then you could also keep a dummy file
		1699	descriptor for overload situations (e.g. by opening F</dev/null>), and
		1700	when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
		1701	close that fd, and create a new dummy fd. This will gracefully refuse
		1702	clients under typical overload conditions.
		1703
		1704	The last way to handle it is to simply log the error and C<exit>, as
		1705	is often done with C<malloc> failures, but this results in an easy
		1706	opportunity for a DoS attack.
1299		1707
1300	=head3 Watcher-Specific Functions	1708	=head3 Watcher-Specific Functions
1301		1709
1302	=over 4	1710	=over 4
1303		1711
…		…
1335	...	1743	...
1336	struct ev_loop *loop = ev_default_init (0);	1744	struct ev_loop *loop = ev_default_init (0);
1337	ev_io stdin_readable;	1745	ev_io stdin_readable;
1338	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1746	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1339	ev_io_start (loop, &stdin_readable);	1747	ev_io_start (loop, &stdin_readable);
1340	ev_loop (loop, 0);	1748	ev_run (loop, 0);
1341		1749
1342		1750
1343	=head2 C<ev_timer> - relative and optionally repeating timeouts	1751	=head2 C<ev_timer> - relative and optionally repeating timeouts
1344		1752
1345	Timer watchers are simple relative timers that generate an event after a	1753	Timer watchers are simple relative timers that generate an event after a
…		…
1350	year, it will still time out after (roughly) one hour. "Roughly" because	1758	year, it will still time out after (roughly) one hour. "Roughly" because
1351	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1759	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1352	monotonic clock option helps a lot here).	1760	monotonic clock option helps a lot here).
1353		1761
1354	The callback is guaranteed to be invoked only I<after> its timeout has	1762	The callback is guaranteed to be invoked only I<after> its timeout has
1355	passed. If multiple timers become ready during the same loop iteration	1763	passed (not I<at>, so on systems with very low-resolution clocks this
1356	then the ones with earlier time-out values are invoked before ones with	1764	might introduce a small delay). If multiple timers become ready during the
1357	later time-out values (but this is no longer true when a callback calls	1765	same loop iteration then the ones with earlier time-out values are invoked
1358	C<ev_loop> recursively).	1766	before ones of the same priority with later time-out values (but this is
		1767	no longer true when a callback calls C<ev_run> recursively).
1359		1768
1360	=head3 Be smart about timeouts	1769	=head3 Be smart about timeouts
1361		1770
1362	Many real-world problems involve some kind of timeout, usually for error	1771	Many real-world problems involve some kind of timeout, usually for error
1363	recovery. A typical example is an HTTP request - if the other side hangs,	1772	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1407	C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>	1816	C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1408	member and C<ev_timer_again>.	1817	member and C<ev_timer_again>.
1409		1818
1410	At start:	1819	At start:
1411		1820
1412	ev_timer_init (timer, callback);	1821	ev_init (timer, callback);
1413	timer->repeat = 60.;	1822	timer->repeat = 60.;
1414	ev_timer_again (loop, timer);	1823	ev_timer_again (loop, timer);
1415		1824
1416	Each time there is some activity:	1825	Each time there is some activity:
1417		1826
…		…
1449	ev_tstamp timeout = last_activity + 60.;	1858	ev_tstamp timeout = last_activity + 60.;
1450		1859
1451	// if last_activity + 60. is older than now, we did time out	1860	// if last_activity + 60. is older than now, we did time out
1452	if (timeout < now)	1861	if (timeout < now)
1453	{	1862	{
1454	// timeout occured, take action	1863	// timeout occurred, take action
1455	}	1864	}
1456	else	1865	else
1457	{	1866	{
1458	// callback was invoked, but there was some activity, re-arm	1867	// callback was invoked, but there was some activity, re-arm
1459	// the watcher to fire in last_activity + 60, which is	1868	// the watcher to fire in last_activity + 60, which is
…		…
1479		1888
1480	To start the timer, simply initialise the watcher and set C<last_activity>	1889	To start the timer, simply initialise the watcher and set C<last_activity>
1481	to the current time (meaning we just have some activity :), then call the	1890	to the current time (meaning we just have some activity :), then call the
1482	callback, which will "do the right thing" and start the timer:	1891	callback, which will "do the right thing" and start the timer:
1483		1892
1484	ev_timer_init (timer, callback);	1893	ev_init (timer, callback);
1485	last_activity = ev_now (loop);	1894	last_activity = ev_now (loop);
1486	callback (loop, timer, EV_TIMEOUT);	1895	callback (loop, timer, EV_TIMER);
1487		1896
1488	And when there is some activity, simply store the current time in	1897	And when there is some activity, simply store the current time in
1489	C<last_activity>, no libev calls at all:	1898	C<last_activity>, no libev calls at all:
1490		1899
1491	last_actiivty = ev_now (loop);	1900	last_activity = ev_now (loop);
1492		1901
1493	This technique is slightly more complex, but in most cases where the	1902	This technique is slightly more complex, but in most cases where the
1494	time-out is unlikely to be triggered, much more efficient.	1903	time-out is unlikely to be triggered, much more efficient.
1495		1904
1496	Changing the timeout is trivial as well (if it isn't hard-coded in the	1905	Changing the timeout is trivial as well (if it isn't hard-coded in the
…		…
1534		1943
1535	=head3 The special problem of time updates	1944	=head3 The special problem of time updates
1536		1945
1537	Establishing the current time is a costly operation (it usually takes at	1946	Establishing the current time is a costly operation (it usually takes at
1538	least two system calls): EV therefore updates its idea of the current	1947	least two system calls): EV therefore updates its idea of the current
1539	time only before and after C<ev_loop> collects new events, which causes a	1948	time only before and after C<ev_run> collects new events, which causes a
1540	growing difference between C<ev_now ()> and C<ev_time ()> when handling	1949	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1541	lots of events in one iteration.	1950	lots of events in one iteration.
1542		1951
1543	The relative timeouts are calculated relative to the C<ev_now ()>	1952	The relative timeouts are calculated relative to the C<ev_now ()>
1544	time. This is usually the right thing as this timestamp refers to the time	1953	time. This is usually the right thing as this timestamp refers to the time
…		…
1550		1959
1551	If the event loop is suspended for a long time, you can also force an	1960	If the event loop is suspended for a long time, you can also force an
1552	update of the time returned by C<ev_now ()> by calling C<ev_now_update	1961	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1553	()>.	1962	()>.
1554		1963
		1964	=head3 The special problems of suspended animation
		1965
		1966	When you leave the server world it is quite customary to hit machines that
		1967	can suspend/hibernate - what happens to the clocks during such a suspend?
		1968
		1969	Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
		1970	all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
		1971	to run until the system is suspended, but they will not advance while the
		1972	system is suspended. That means, on resume, it will be as if the program
		1973	was frozen for a few seconds, but the suspend time will not be counted
		1974	towards C<ev_timer> when a monotonic clock source is used. The real time
		1975	clock advanced as expected, but if it is used as sole clocksource, then a
		1976	long suspend would be detected as a time jump by libev, and timers would
		1977	be adjusted accordingly.
		1978
		1979	I would not be surprised to see different behaviour in different between
		1980	operating systems, OS versions or even different hardware.
		1981
		1982	The other form of suspend (job control, or sending a SIGSTOP) will see a
		1983	time jump in the monotonic clocks and the realtime clock. If the program
		1984	is suspended for a very long time, and monotonic clock sources are in use,
		1985	then you can expect C<ev_timer>s to expire as the full suspension time
		1986	will be counted towards the timers. When no monotonic clock source is in
		1987	use, then libev will again assume a timejump and adjust accordingly.
		1988
		1989	It might be beneficial for this latter case to call C<ev_suspend>
		1990	and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
		1991	deterministic behaviour in this case (you can do nothing against
		1992	C<SIGSTOP>).
		1993
1555	=head3 Watcher-Specific Functions and Data Members	1994	=head3 Watcher-Specific Functions and Data Members
1556		1995
1557	=over 4	1996	=over 4
1558		1997
1559	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	1998	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
…		…
1582	If the timer is started but non-repeating, stop it (as if it timed out).	2021	If the timer is started but non-repeating, stop it (as if it timed out).
1583		2022
1584	If the timer is repeating, either start it if necessary (with the	2023	If the timer is repeating, either start it if necessary (with the
1585	C<repeat> value), or reset the running timer to the C<repeat> value.	2024	C<repeat> value), or reset the running timer to the C<repeat> value.
1586		2025
1587	This sounds a bit complicated, see "Be smart about timeouts", above, for a	2026	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1588	usage example.	2027	usage example.
		2028
		2029	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
		2030
		2031	Returns the remaining time until a timer fires. If the timer is active,
		2032	then this time is relative to the current event loop time, otherwise it's
		2033	the timeout value currently configured.
		2034
		2035	That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
		2036	C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
		2037	will return C<4>. When the timer expires and is restarted, it will return
		2038	roughly C<7> (likely slightly less as callback invocation takes some time,
		2039	too), and so on.
1589		2040
1590	=item ev_tstamp repeat [read-write]	2041	=item ev_tstamp repeat [read-write]
1591		2042
1592	The current C<repeat> value. Will be used each time the watcher times out	2043	The current C<repeat> value. Will be used each time the watcher times out
1593	or C<ev_timer_again> is called, and determines the next timeout (if any),	2044	or C<ev_timer_again> is called, and determines the next timeout (if any),
…		…
1619	}	2070	}
1620		2071
1621	ev_timer mytimer;	2072	ev_timer mytimer;
1622	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	2073	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1623	ev_timer_again (&mytimer); /* start timer */	2074	ev_timer_again (&mytimer); /* start timer */
1624	ev_loop (loop, 0);	2075	ev_run (loop, 0);
1625		2076
1626	// and in some piece of code that gets executed on any "activity":	2077	// and in some piece of code that gets executed on any "activity":
1627	// reset the timeout to start ticking again at 10 seconds	2078	// reset the timeout to start ticking again at 10 seconds
1628	ev_timer_again (&mytimer);	2079	ev_timer_again (&mytimer);
1629		2080
…		…
1655		2106
1656	As with timers, the callback is guaranteed to be invoked only when the	2107	As with timers, the callback is guaranteed to be invoked only when the
1657	point in time where it is supposed to trigger has passed. If multiple	2108	point in time where it is supposed to trigger has passed. If multiple
1658	timers become ready during the same loop iteration then the ones with	2109	timers become ready during the same loop iteration then the ones with
1659	earlier time-out values are invoked before ones with later time-out values	2110	earlier time-out values are invoked before ones with later time-out values
1660	(but this is no longer true when a callback calls C<ev_loop> recursively).	2111	(but this is no longer true when a callback calls C<ev_run> recursively).
1661		2112
1662	=head3 Watcher-Specific Functions and Data Members	2113	=head3 Watcher-Specific Functions and Data Members
1663		2114
1664	=over 4	2115	=over 4
1665		2116
…		…
1700		2151
1701	Another way to think about it (for the mathematically inclined) is that	2152	Another way to think about it (for the mathematically inclined) is that
1702	C<ev_periodic> will try to run the callback in this mode at the next possible	2153	C<ev_periodic> will try to run the callback in this mode at the next possible
1703	time where C<time = offset (mod interval)>, regardless of any time jumps.	2154	time where C<time = offset (mod interval)>, regardless of any time jumps.
1704		2155
1705	For numerical stability it is preferable that the C<offset> value is near	2156	The C<interval> I<MUST> be positive, and for numerical stability, the
1706	C<ev_now ()> (the current time), but there is no range requirement for	2157	interval value should be higher than C<1/8192> (which is around 100
1707	this value, and in fact is often specified as zero.	2158	microseconds) and C<offset> should be higher than C<0> and should have
		2159	at most a similar magnitude as the current time (say, within a factor of
		2160	ten). Typical values for offset are, in fact, C<0> or something between
		2161	C<0> and C<interval>, which is also the recommended range.
1708		2162
1709	Note also that there is an upper limit to how often a timer can fire (CPU	2163	Note also that there is an upper limit to how often a timer can fire (CPU
1710	speed for example), so if C<interval> is very small then timing stability	2164	speed for example), so if C<interval> is very small then timing stability
1711	will of course deteriorate. Libev itself tries to be exact to be about one	2165	will of course deteriorate. Libev itself tries to be exact to be about one
1712	millisecond (if the OS supports it and the machine is fast enough).	2166	millisecond (if the OS supports it and the machine is fast enough).
…		…
1793	Example: Call a callback every hour, or, more precisely, whenever the	2247	Example: Call a callback every hour, or, more precisely, whenever the
1794	system time is divisible by 3600. The callback invocation times have	2248	system time is divisible by 3600. The callback invocation times have
1795	potentially a lot of jitter, but good long-term stability.	2249	potentially a lot of jitter, but good long-term stability.
1796		2250
1797	static void	2251	static void
1798	clock_cb (struct ev_loop *loop, ev_io *w, int revents)	2252	clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
1799	{	2253	{
1800	... its now a full hour (UTC, or TAI or whatever your clock follows)	2254	... its now a full hour (UTC, or TAI or whatever your clock follows)
1801	}	2255	}
1802		2256
1803	ev_periodic hourly_tick;	2257	ev_periodic hourly_tick;
…		…
1826		2280
1827	=head2 C<ev_signal> - signal me when a signal gets signalled!	2281	=head2 C<ev_signal> - signal me when a signal gets signalled!
1828		2282
1829	Signal watchers will trigger an event when the process receives a specific	2283	Signal watchers will trigger an event when the process receives a specific
1830	signal one or more times. Even though signals are very asynchronous, libev	2284	signal one or more times. Even though signals are very asynchronous, libev
1831	will try it's best to deliver signals synchronously, i.e. as part of the	2285	will try its best to deliver signals synchronously, i.e. as part of the
1832	normal event processing, like any other event.	2286	normal event processing, like any other event.
1833		2287
1834	If you want signals asynchronously, just use C<sigaction> as you would	2288	If you want signals to be delivered truly asynchronously, just use
1835	do without libev and forget about sharing the signal. You can even use	2289	C<sigaction> as you would do without libev and forget about sharing
1836	C<ev_async> from a signal handler to synchronously wake up an event loop.	2290	the signal. You can even use C<ev_async> from a signal handler to
		2291	synchronously wake up an event loop.
1837		2292
1838	You can configure as many watchers as you like per signal. Only when the	2293	You can configure as many watchers as you like for the same signal, but
		2294	only within the same loop, i.e. you can watch for C<SIGINT> in your
		2295	default loop and for C<SIGIO> in another loop, but you cannot watch for
		2296	C<SIGINT> in both the default loop and another loop at the same time. At
		2297	the moment, C<SIGCHLD> is permanently tied to the default loop.
		2298
1839	first watcher gets started will libev actually register a signal handler	2299	When the first watcher gets started will libev actually register something
1840	with the kernel (thus it coexists with your own signal handlers as long as	2300	with the kernel (thus it coexists with your own signal handlers as long as
1841	you don't register any with libev for the same signal). Similarly, when	2301	you don't register any with libev for the same signal).
1842	the last signal watcher for a signal is stopped, libev will reset the
1843	signal handler to SIG_DFL (regardless of what it was set to before).
1844		2302
1845	If possible and supported, libev will install its handlers with	2303	If possible and supported, libev will install its handlers with
1846	C<SA_RESTART> behaviour enabled, so system calls should not be unduly	2304	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1847	interrupted. If you have a problem with system calls getting interrupted by	2305	not be unduly interrupted. If you have a problem with system calls getting
1848	signals you can block all signals in an C<ev_check> watcher and unblock	2306	interrupted by signals you can block all signals in an C<ev_check> watcher
1849	them in an C<ev_prepare> watcher.	2307	and unblock them in an C<ev_prepare> watcher.
		2308
		2309	=head3 The special problem of inheritance over fork/execve/pthread_create
		2310
		2311	Both the signal mask (C<sigprocmask>) and the signal disposition
		2312	(C<sigaction>) are unspecified after starting a signal watcher (and after
		2313	stopping it again), that is, libev might or might not block the signal,
		2314	and might or might not set or restore the installed signal handler (but
		2315	see C<EVFLAG_NOSIGMASK>).
		2316
		2317	While this does not matter for the signal disposition (libev never
		2318	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
		2319	C<execve>), this matters for the signal mask: many programs do not expect
		2320	certain signals to be blocked.
		2321
		2322	This means that before calling C<exec> (from the child) you should reset
		2323	the signal mask to whatever "default" you expect (all clear is a good
		2324	choice usually).
		2325
		2326	The simplest way to ensure that the signal mask is reset in the child is
		2327	to install a fork handler with C<pthread_atfork> that resets it. That will
		2328	catch fork calls done by libraries (such as the libc) as well.
		2329
		2330	In current versions of libev, the signal will not be blocked indefinitely
		2331	unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
		2332	the window of opportunity for problems, it will not go away, as libev
		2333	I<has> to modify the signal mask, at least temporarily.
		2334
		2335	So I can't stress this enough: I<If you do not reset your signal mask when
		2336	you expect it to be empty, you have a race condition in your code>. This
		2337	is not a libev-specific thing, this is true for most event libraries.
		2338
		2339	=head3 The special problem of threads signal handling
		2340
		2341	POSIX threads has problematic signal handling semantics, specifically,
		2342	a lot of functionality (sigfd, sigwait etc.) only really works if all
		2343	threads in a process block signals, which is hard to achieve.
		2344
		2345	When you want to use sigwait (or mix libev signal handling with your own
		2346	for the same signals), you can tackle this problem by globally blocking
		2347	all signals before creating any threads (or creating them with a fully set
		2348	sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
		2349	loops. Then designate one thread as "signal receiver thread" which handles
		2350	these signals. You can pass on any signals that libev might be interested
		2351	in by calling C<ev_feed_signal>.
1850		2352
1851	=head3 Watcher-Specific Functions and Data Members	2353	=head3 Watcher-Specific Functions and Data Members
1852		2354
1853	=over 4	2355	=over 4
1854		2356
…		…
1870	Example: Try to exit cleanly on SIGINT.	2372	Example: Try to exit cleanly on SIGINT.
1871		2373
1872	static void	2374	static void
1873	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)	2375	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
1874	{	2376	{
1875	ev_unloop (loop, EVUNLOOP_ALL);	2377	ev_break (loop, EVBREAK_ALL);
1876	}	2378	}
1877		2379
1878	ev_signal signal_watcher;	2380	ev_signal signal_watcher;
1879	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	2381	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1880	ev_signal_start (loop, &signal_watcher);	2382	ev_signal_start (loop, &signal_watcher);
…		…
1886	some child status changes (most typically when a child of yours dies or	2388	some child status changes (most typically when a child of yours dies or
1887	exits). It is permissible to install a child watcher I<after> the child	2389	exits). It is permissible to install a child watcher I<after> the child
1888	has been forked (which implies it might have already exited), as long	2390	has been forked (which implies it might have already exited), as long
1889	as the event loop isn't entered (or is continued from a watcher), i.e.,	2391	as the event loop isn't entered (or is continued from a watcher), i.e.,
1890	forking and then immediately registering a watcher for the child is fine,	2392	forking and then immediately registering a watcher for the child is fine,
1891	but forking and registering a watcher a few event loop iterations later is	2393	but forking and registering a watcher a few event loop iterations later or
1892	not.	2394	in the next callback invocation is not.
1893		2395
1894	Only the default event loop is capable of handling signals, and therefore	2396	Only the default event loop is capable of handling signals, and therefore
1895	you can only register child watchers in the default event loop.	2397	you can only register child watchers in the default event loop.
1896		2398
		2399	Due to some design glitches inside libev, child watchers will always be
		2400	handled at maximum priority (their priority is set to C<EV_MAXPRI> by
		2401	libev)
		2402
1897	=head3 Process Interaction	2403	=head3 Process Interaction
1898		2404
1899	Libev grabs C<SIGCHLD> as soon as the default event loop is	2405	Libev grabs C<SIGCHLD> as soon as the default event loop is
1900	initialised. This is necessary to guarantee proper behaviour even if	2406	initialised. This is necessary to guarantee proper behaviour even if the
1901	the first child watcher is started after the child exits. The occurrence	2407	first child watcher is started after the child exits. The occurrence
1902	of C<SIGCHLD> is recorded asynchronously, but child reaping is done	2408	of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1903	synchronously as part of the event loop processing. Libev always reaps all	2409	synchronously as part of the event loop processing. Libev always reaps all
1904	children, even ones not watched.	2410	children, even ones not watched.
1905		2411
1906	=head3 Overriding the Built-In Processing	2412	=head3 Overriding the Built-In Processing
…		…
1916	=head3 Stopping the Child Watcher	2422	=head3 Stopping the Child Watcher
1917		2423
1918	Currently, the child watcher never gets stopped, even when the	2424	Currently, the child watcher never gets stopped, even when the
1919	child terminates, so normally one needs to stop the watcher in the	2425	child terminates, so normally one needs to stop the watcher in the
1920	callback. Future versions of libev might stop the watcher automatically	2426	callback. Future versions of libev might stop the watcher automatically
1921	when a child exit is detected.	2427	when a child exit is detected (calling C<ev_child_stop> twice is not a
		2428	problem).
1922		2429
1923	=head3 Watcher-Specific Functions and Data Members	2430	=head3 Watcher-Specific Functions and Data Members
1924		2431
1925	=over 4	2432	=over 4
1926		2433
…		…
2252	// no longer anything immediate to do.	2759	// no longer anything immediate to do.
2253	}	2760	}
2254		2761
2255	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2762	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2256	ev_idle_init (idle_watcher, idle_cb);	2763	ev_idle_init (idle_watcher, idle_cb);
2257	ev_idle_start (loop, idle_cb);	2764	ev_idle_start (loop, idle_watcher);
2258		2765
2259		2766
2260	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2767	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2261		2768
2262	Prepare and check watchers are usually (but not always) used in pairs:	2769	Prepare and check watchers are usually (but not always) used in pairs:
2263	prepare watchers get invoked before the process blocks and check watchers	2770	prepare watchers get invoked before the process blocks and check watchers
2264	afterwards.	2771	afterwards.
2265		2772
2266	You I<must not> call C<ev_loop> or similar functions that enter	2773	You I<must not> call C<ev_run> or similar functions that enter
2267	the current event loop from either C<ev_prepare> or C<ev_check>	2774	the current event loop from either C<ev_prepare> or C<ev_check>
2268	watchers. Other loops than the current one are fine, however. The	2775	watchers. Other loops than the current one are fine, however. The
2269	rationale behind this is that you do not need to check for recursion in	2776	rationale behind this is that you do not need to check for recursion in
2270	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2777	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2271	C<ev_check> so if you have one watcher of each kind they will always be	2778	C<ev_check> so if you have one watcher of each kind they will always be
…		…
2355	struct pollfd fds [nfd];	2862	struct pollfd fds [nfd];
2356	// actual code will need to loop here and realloc etc.	2863	// actual code will need to loop here and realloc etc.
2357	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	2864	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2358		2865
2359	/* the callback is illegal, but won't be called as we stop during check */	2866	/* the callback is illegal, but won't be called as we stop during check */
2360	ev_timer_init (&tw, 0, timeout * 1e-3);	2867	ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2361	ev_timer_start (loop, &tw);	2868	ev_timer_start (loop, &tw);
2362		2869
2363	// create one ev_io per pollfd	2870	// create one ev_io per pollfd
2364	for (int i = 0; i < nfd; ++i)	2871	for (int i = 0; i < nfd; ++i)
2365	{	2872	{
…		…
2439		2946
2440	if (timeout >= 0)	2947	if (timeout >= 0)
2441	// create/start timer	2948	// create/start timer
2442		2949
2443	// poll	2950	// poll
2444	ev_loop (EV_A_ 0);	2951	ev_run (EV_A_ 0);
2445		2952
2446	// stop timer again	2953	// stop timer again
2447	if (timeout >= 0)	2954	if (timeout >= 0)
2448	ev_timer_stop (EV_A_ &to);	2955	ev_timer_stop (EV_A_ &to);
2449		2956
…		…
2527	if you do not want that, you need to temporarily stop the embed watcher).	3034	if you do not want that, you need to temporarily stop the embed watcher).
2528		3035
2529	=item ev_embed_sweep (loop, ev_embed *)	3036	=item ev_embed_sweep (loop, ev_embed *)
2530		3037
2531	Make a single, non-blocking sweep over the embedded loop. This works	3038	Make a single, non-blocking sweep over the embedded loop. This works
2532	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most	3039	similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2533	appropriate way for embedded loops.	3040	appropriate way for embedded loops.
2534		3041
2535	=item struct ev_loop *other [read-only]	3042	=item struct ev_loop *other [read-only]
2536		3043
2537	The embedded event loop.	3044	The embedded event loop.
…		…
2595	event loop blocks next and before C<ev_check> watchers are being called,	3102	event loop blocks next and before C<ev_check> watchers are being called,
2596	and only in the child after the fork. If whoever good citizen calling	3103	and only in the child after the fork. If whoever good citizen calling
2597	C<ev_default_fork> cheats and calls it in the wrong process, the fork	3104	C<ev_default_fork> cheats and calls it in the wrong process, the fork
2598	handlers will be invoked, too, of course.	3105	handlers will be invoked, too, of course.
2599		3106
		3107	=head3 The special problem of life after fork - how is it possible?
		3108
		3109	Most uses of C<fork()> consist of forking, then some simple calls to set
		3110	up/change the process environment, followed by a call to C<exec()>. This
		3111	sequence should be handled by libev without any problems.
		3112
		3113	This changes when the application actually wants to do event handling
		3114	in the child, or both parent in child, in effect "continuing" after the
		3115	fork.
		3116
		3117	The default mode of operation (for libev, with application help to detect
		3118	forks) is to duplicate all the state in the child, as would be expected
		3119	when I<either> the parent I<or> the child process continues.
		3120
		3121	When both processes want to continue using libev, then this is usually the
		3122	wrong result. In that case, usually one process (typically the parent) is
		3123	supposed to continue with all watchers in place as before, while the other
		3124	process typically wants to start fresh, i.e. without any active watchers.
		3125
		3126	The cleanest and most efficient way to achieve that with libev is to
		3127	simply create a new event loop, which of course will be "empty", and
		3128	use that for new watchers. This has the advantage of not touching more
		3129	memory than necessary, and thus avoiding the copy-on-write, and the
		3130	disadvantage of having to use multiple event loops (which do not support
		3131	signal watchers).
		3132
		3133	When this is not possible, or you want to use the default loop for
		3134	other reasons, then in the process that wants to start "fresh", call
		3135	C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
		3136	Destroying the default loop will "orphan" (not stop) all registered
		3137	watchers, so you have to be careful not to execute code that modifies
		3138	those watchers. Note also that in that case, you have to re-register any
		3139	signal watchers.
		3140
2600	=head3 Watcher-Specific Functions and Data Members	3141	=head3 Watcher-Specific Functions and Data Members
2601		3142
2602	=over 4	3143	=over 4
2603		3144
2604	=item ev_fork_init (ev_signal *, callback)	3145	=item ev_fork_init (ev_fork *, callback)
2605		3146
2606	Initialises and configures the fork watcher - it has no parameters of any	3147	Initialises and configures the fork watcher - it has no parameters of any
2607	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,	3148	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
2608	believe me.	3149	really.
2609		3150
2610	=back	3151	=back
2611		3152
2612		3153
		3154	=head2 C<ev_cleanup> - even the best things end
		3155
		3156	Cleanup watchers are called just before the event loop is being destroyed
		3157	by a call to C<ev_loop_destroy>.
		3158
		3159	While there is no guarantee that the event loop gets destroyed, cleanup
		3160	watchers provide a convenient method to install cleanup hooks for your
		3161	program, worker threads and so on - you just to make sure to destroy the
		3162	loop when you want them to be invoked.
		3163
		3164	Cleanup watchers are invoked in the same way as any other watcher. Unlike
		3165	all other watchers, they do not keep a reference to the event loop (which
		3166	makes a lot of sense if you think about it). Like all other watchers, you
		3167	can call libev functions in the callback, except C<ev_cleanup_start>.
		3168
		3169	=head3 Watcher-Specific Functions and Data Members
		3170
		3171	=over 4
		3172
		3173	=item ev_cleanup_init (ev_cleanup *, callback)
		3174
		3175	Initialises and configures the cleanup watcher - it has no parameters of
		3176	any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
		3177	pointless, I assure you.
		3178
		3179	=back
		3180
		3181	Example: Register an atexit handler to destroy the default loop, so any
		3182	cleanup functions are called.
		3183
		3184	static void
		3185	program_exits (void)
		3186	{
		3187	ev_loop_destroy (EV_DEFAULT_UC);
		3188	}
		3189
		3190	...
		3191	atexit (program_exits);
		3192
		3193
2613	=head2 C<ev_async> - how to wake up another event loop	3194	=head2 C<ev_async> - how to wake up an event loop
2614		3195
2615	In general, you cannot use an C<ev_loop> from multiple threads or other	3196	In general, you cannot use an C<ev_loop> from multiple threads or other
2616	asynchronous sources such as signal handlers (as opposed to multiple event	3197	asynchronous sources such as signal handlers (as opposed to multiple event
2617	loops - those are of course safe to use in different threads).	3198	loops - those are of course safe to use in different threads).
2618		3199
2619	Sometimes, however, you need to wake up another event loop you do not	3200	Sometimes, however, you need to wake up an event loop you do not control,
2620	control, for example because it belongs to another thread. This is what	3201	for example because it belongs to another thread. This is what C<ev_async>
2621	C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you	3202	watchers do: as long as the C<ev_async> watcher is active, you can signal
2622	can signal it by calling C<ev_async_send>, which is thread- and signal	3203	it by calling C<ev_async_send>, which is thread- and signal safe.
2623	safe.
2624		3204
2625	This functionality is very similar to C<ev_signal> watchers, as signals,	3205	This functionality is very similar to C<ev_signal> watchers, as signals,
2626	too, are asynchronous in nature, and signals, too, will be compressed	3206	too, are asynchronous in nature, and signals, too, will be compressed
2627	(i.e. the number of callback invocations may be less than the number of	3207	(i.e. the number of callback invocations may be less than the number of
2628	C<ev_async_sent> calls).	3208	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
		3209	of "global async watchers" by using a watcher on an otherwise unused
		3210	signal, and C<ev_feed_signal> to signal this watcher from another thread,
		3211	even without knowing which loop owns the signal.
2629		3212
2630	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not	3213	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
2631	just the default loop.	3214	just the default loop.
2632		3215
2633	=head3 Queueing	3216	=head3 Queueing
2634		3217
2635	C<ev_async> does not support queueing of data in any way. The reason	3218	C<ev_async> does not support queueing of data in any way. The reason
2636	is that the author does not know of a simple (or any) algorithm for a	3219	is that the author does not know of a simple (or any) algorithm for a
2637	multiple-writer-single-reader queue that works in all cases and doesn't	3220	multiple-writer-single-reader queue that works in all cases and doesn't
2638	need elaborate support such as pthreads.	3221	need elaborate support such as pthreads or unportable memory access
		3222	semantics.
2639		3223
2640	That means that if you want to queue data, you have to provide your own	3224	That means that if you want to queue data, you have to provide your own
2641	queue. But at least I can tell you how to implement locking around your	3225	queue. But at least I can tell you how to implement locking around your
2642	queue:	3226	queue:
2643		3227
…		…
2727	trust me.	3311	trust me.
2728		3312
2729	=item ev_async_send (loop, ev_async *)	3313	=item ev_async_send (loop, ev_async *)
2730		3314
2731	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3315	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2732	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3316	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3317	returns.
		3318
2733	C<ev_feed_event>, this call is safe to do from other threads, signal or	3319	Unlike C<ev_feed_event>, this call is safe to do from other threads,
2734	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3320	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
2735	section below on what exactly this means).	3321	embedding section below on what exactly this means).
2736		3322
2737	Note that, as with other watchers in libev, multiple events might get	3323	Note that, as with other watchers in libev, multiple events might get
2738	compressed into a single callback invocation (another way to look at this	3324	compressed into a single callback invocation (another way to look at this
2739	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3325	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
2740	reset when the event loop detects that).	3326	reset when the event loop detects that).
…		…
2782		3368
2783	If C<timeout> is less than 0, then no timeout watcher will be	3369	If C<timeout> is less than 0, then no timeout watcher will be
2784	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and	3370	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2785	repeat = 0) will be started. C<0> is a valid timeout.	3371	repeat = 0) will be started. C<0> is a valid timeout.
2786		3372
2787	The callback has the type C<void (*cb)(int revents, void *arg)> and gets	3373	The callback has the type C<void (*cb)(int revents, void *arg)> and is
2788	passed an C<revents> set like normal event callbacks (a combination of	3374	passed an C<revents> set like normal event callbacks (a combination of
2789	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>	3375	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
2790	value passed to C<ev_once>. Note that it is possible to receive I<both>	3376	value passed to C<ev_once>. Note that it is possible to receive I<both>
2791	a timeout and an io event at the same time - you probably should give io	3377	a timeout and an io event at the same time - you probably should give io
2792	events precedence.	3378	events precedence.
2793		3379
2794	Example: wait up to ten seconds for data to appear on STDIN_FILENO.	3380	Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2795		3381
2796	static void stdin_ready (int revents, void *arg)	3382	static void stdin_ready (int revents, void *arg)
2797	{	3383	{
2798	if (revents & EV_READ)	3384	if (revents & EV_READ)
2799	/* stdin might have data for us, joy! */;	3385	/* stdin might have data for us, joy! */;
2800	else if (revents & EV_TIMEOUT)	3386	else if (revents & EV_TIMER)
2801	/* doh, nothing entered */;	3387	/* doh, nothing entered */;
2802	}	3388	}
2803		3389
2804	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3390	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2805		3391
2806	=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2807
2808	Feeds the given event set into the event loop, as if the specified event
2809	had happened for the specified watcher (which must be a pointer to an
2810	initialised but not necessarily started event watcher).
2811
2812	=item ev_feed_fd_event (struct ev_loop *, int fd, int revents)	3392	=item ev_feed_fd_event (loop, int fd, int revents)
2813		3393
2814	Feed an event on the given fd, as if a file descriptor backend detected	3394	Feed an event on the given fd, as if a file descriptor backend detected
2815	the given events it.	3395	the given events it.
2816		3396
2817	=item ev_feed_signal_event (struct ev_loop *loop, int signum)	3397	=item ev_feed_signal_event (loop, int signum)
2818		3398
2819	Feed an event as if the given signal occurred (C<loop> must be the default	3399	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
2820	loop!).	3400	which is async-safe.
2821		3401
2822	=back	3402	=back
		3403
		3404
		3405	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
		3406
		3407	This section explains some common idioms that are not immediately
		3408	obvious. Note that examples are sprinkled over the whole manual, and this
		3409	section only contains stuff that wouldn't fit anywhere else.
		3410
		3411	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3412
		3413	Each watcher has, by default, a C<void *data> member that you can read
		3414	or modify at any time: libev will completely ignore it. This can be used
		3415	to associate arbitrary data with your watcher. If you need more data and
		3416	don't want to allocate memory separately and store a pointer to it in that
		3417	data member, you can also "subclass" the watcher type and provide your own
		3418	data:
		3419
		3420	struct my_io
		3421	{
		3422	ev_io io;
		3423	int otherfd;
		3424	void *somedata;
		3425	struct whatever *mostinteresting;
		3426	};
		3427
		3428	...
		3429	struct my_io w;
		3430	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3431
		3432	And since your callback will be called with a pointer to the watcher, you
		3433	can cast it back to your own type:
		3434
		3435	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
		3436	{
		3437	struct my_io *w = (struct my_io *)w_;
		3438	...
		3439	}
		3440
		3441	More interesting and less C-conformant ways of casting your callback
		3442	function type instead have been omitted.
		3443
		3444	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3445
		3446	Another common scenario is to use some data structure with multiple
		3447	embedded watchers, in effect creating your own watcher that combines
		3448	multiple libev event sources into one "super-watcher":
		3449
		3450	struct my_biggy
		3451	{
		3452	int some_data;
		3453	ev_timer t1;
		3454	ev_timer t2;
		3455	}
		3456
		3457	In this case getting the pointer to C<my_biggy> is a bit more
		3458	complicated: Either you store the address of your C<my_biggy> struct in
		3459	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3460	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3461	real programmers):
		3462
		3463	#include <stddef.h>
		3464
		3465	static void
		3466	t1_cb (EV_P_ ev_timer *w, int revents)
		3467	{
		3468	struct my_biggy big = (struct my_biggy *)
		3469	(((char *)w) - offsetof (struct my_biggy, t1));
		3470	}
		3471
		3472	static void
		3473	t2_cb (EV_P_ ev_timer *w, int revents)
		3474	{
		3475	struct my_biggy big = (struct my_biggy *)
		3476	(((char *)w) - offsetof (struct my_biggy, t2));
		3477	}
		3478
		3479	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
		3480
		3481	Often (especially in GUI toolkits) there are places where you have
		3482	I<modal> interaction, which is most easily implemented by recursively
		3483	invoking C<ev_run>.
		3484
		3485	This brings the problem of exiting - a callback might want to finish the
		3486	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
		3487	a modal "Are you sure?" dialog is still waiting), or just the nested one
		3488	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
		3489	other combination: In these cases, C<ev_break> will not work alone.
		3490
		3491	The solution is to maintain "break this loop" variable for each C<ev_run>
		3492	invocation, and use a loop around C<ev_run> until the condition is
		3493	triggered, using C<EVRUN_ONCE>:
		3494
		3495	// main loop
		3496	int exit_main_loop = 0;
		3497
		3498	while (!exit_main_loop)
		3499	ev_run (EV_DEFAULT_ EVRUN_ONCE);
		3500
		3501	// in a model watcher
		3502	int exit_nested_loop = 0;
		3503
		3504	while (!exit_nested_loop)
		3505	ev_run (EV_A_ EVRUN_ONCE);
		3506
		3507	To exit from any of these loops, just set the corresponding exit variable:
		3508
		3509	// exit modal loop
		3510	exit_nested_loop = 1;
		3511
		3512	// exit main program, after modal loop is finished
		3513	exit_main_loop = 1;
		3514
		3515	// exit both
		3516	exit_main_loop = exit_nested_loop = 1;
		3517
		3518	=head2 THREAD LOCKING EXAMPLE
		3519
		3520	Here is a fictitious example of how to run an event loop in a different
		3521	thread from where callbacks are being invoked and watchers are
		3522	created/added/removed.
		3523
		3524	For a real-world example, see the C<EV::Loop::Async> perl module,
		3525	which uses exactly this technique (which is suited for many high-level
		3526	languages).
		3527
		3528	The example uses a pthread mutex to protect the loop data, a condition
		3529	variable to wait for callback invocations, an async watcher to notify the
		3530	event loop thread and an unspecified mechanism to wake up the main thread.
		3531
		3532	First, you need to associate some data with the event loop:
		3533
		3534	typedef struct {
		3535	mutex_t lock; /* global loop lock */
		3536	ev_async async_w;
		3537	thread_t tid;
		3538	cond_t invoke_cv;
		3539	} userdata;
		3540
		3541	void prepare_loop (EV_P)
		3542	{
		3543	// for simplicity, we use a static userdata struct.
		3544	static userdata u;
		3545
		3546	ev_async_init (&u->async_w, async_cb);
		3547	ev_async_start (EV_A_ &u->async_w);
		3548
		3549	pthread_mutex_init (&u->lock, 0);
		3550	pthread_cond_init (&u->invoke_cv, 0);
		3551
		3552	// now associate this with the loop
		3553	ev_set_userdata (EV_A_ u);
		3554	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3555	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3556
		3557	// then create the thread running ev_run
		3558	pthread_create (&u->tid, 0, l_run, EV_A);
		3559	}
		3560
		3561	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3562	solely to wake up the event loop so it takes notice of any new watchers
		3563	that might have been added:
		3564
		3565	static void
		3566	async_cb (EV_P_ ev_async *w, int revents)
		3567	{
		3568	// just used for the side effects
		3569	}
		3570
		3571	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3572	protecting the loop data, respectively.
		3573
		3574	static void
		3575	l_release (EV_P)
		3576	{
		3577	userdata *u = ev_userdata (EV_A);
		3578	pthread_mutex_unlock (&u->lock);
		3579	}
		3580
		3581	static void
		3582	l_acquire (EV_P)
		3583	{
		3584	userdata *u = ev_userdata (EV_A);
		3585	pthread_mutex_lock (&u->lock);
		3586	}
		3587
		3588	The event loop thread first acquires the mutex, and then jumps straight
		3589	into C<ev_run>:
		3590
		3591	void *
		3592	l_run (void *thr_arg)
		3593	{
		3594	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		3595
		3596	l_acquire (EV_A);
		3597	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3598	ev_run (EV_A_ 0);
		3599	l_release (EV_A);
		3600
		3601	return 0;
		3602	}
		3603
		3604	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3605	signal the main thread via some unspecified mechanism (signals? pipe
		3606	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3607	have been called (in a while loop because a) spurious wakeups are possible
		3608	and b) skipping inter-thread-communication when there are no pending
		3609	watchers is very beneficial):
		3610
		3611	static void
		3612	l_invoke (EV_P)
		3613	{
		3614	userdata *u = ev_userdata (EV_A);
		3615
		3616	while (ev_pending_count (EV_A))
		3617	{
		3618	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3619	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3620	}
		3621	}
		3622
		3623	Now, whenever the main thread gets told to invoke pending watchers, it
		3624	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3625	thread to continue:
		3626
		3627	static void
		3628	real_invoke_pending (EV_P)
		3629	{
		3630	userdata *u = ev_userdata (EV_A);
		3631
		3632	pthread_mutex_lock (&u->lock);
		3633	ev_invoke_pending (EV_A);
		3634	pthread_cond_signal (&u->invoke_cv);
		3635	pthread_mutex_unlock (&u->lock);
		3636	}
		3637
		3638	Whenever you want to start/stop a watcher or do other modifications to an
		3639	event loop, you will now have to lock:
		3640
		3641	ev_timer timeout_watcher;
		3642	userdata *u = ev_userdata (EV_A);
		3643
		3644	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3645
		3646	pthread_mutex_lock (&u->lock);
		3647	ev_timer_start (EV_A_ &timeout_watcher);
		3648	ev_async_send (EV_A_ &u->async_w);
		3649	pthread_mutex_unlock (&u->lock);
		3650
		3651	Note that sending the C<ev_async> watcher is required because otherwise
		3652	an event loop currently blocking in the kernel will have no knowledge
		3653	about the newly added timer. By waking up the loop it will pick up any new
		3654	watchers in the next event loop iteration.
		3655
		3656	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3657
		3658	While the overhead of a callback that e.g. schedules a thread is small, it
		3659	is still an overhead. If you embed libev, and your main usage is with some
		3660	kind of threads or coroutines, you might want to customise libev so that
		3661	doesn't need callbacks anymore.
		3662
		3663	Imagine you have coroutines that you can switch to using a function
		3664	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3665	and that due to some magic, the currently active coroutine is stored in a
		3666	global called C<current_coro>. Then you can build your own "wait for libev
		3667	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3668	the differing C<;> conventions):
		3669
		3670	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3671	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3672
		3673	That means instead of having a C callback function, you store the
		3674	coroutine to switch to in each watcher, and instead of having libev call
		3675	your callback, you instead have it switch to that coroutine.
		3676
		3677	A coroutine might now wait for an event with a function called
		3678	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3679	matter when, or whether the watcher is active or not when this function is
		3680	called):
		3681
		3682	void
		3683	wait_for_event (ev_watcher *w)
		3684	{
		3685	ev_cb_set (w) = current_coro;
		3686	switch_to (libev_coro);
		3687	}
		3688
		3689	That basically suspends the coroutine inside C<wait_for_event> and
		3690	continues the libev coroutine, which, when appropriate, switches back to
		3691	this or any other coroutine. I am sure if you sue this your own :)
		3692
		3693	You can do similar tricks if you have, say, threads with an event queue -
		3694	instead of storing a coroutine, you store the queue object and instead of
		3695	switching to a coroutine, you push the watcher onto the queue and notify
		3696	any waiters.
		3697
		3698	To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
		3699	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3700
		3701	// my_ev.h
		3702	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3703	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
		3704	#include "../libev/ev.h"
		3705
		3706	// my_ev.c
		3707	#define EV_H "my_ev.h"
		3708	#include "../libev/ev.c"
		3709
		3710	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3711	F<my_ev.c> into your project. When properly specifying include paths, you
		3712	can even use F<ev.h> as header file name directly.
2823		3713
2824		3714
2825	=head1 LIBEVENT EMULATION	3715	=head1 LIBEVENT EMULATION
2826		3716
2827	Libev offers a compatibility emulation layer for libevent. It cannot	3717	Libev offers a compatibility emulation layer for libevent. It cannot
2828	emulate the internals of libevent, so here are some usage hints:	3718	emulate the internals of libevent, so here are some usage hints:
2829		3719
2830	=over 4	3720	=over 4
		3721
		3722	=item * Only the libevent-1.4.1-beta API is being emulated.
		3723
		3724	This was the newest libevent version available when libev was implemented,
		3725	and is still mostly unchanged in 2010.
2831		3726
2832	=item * Use it by including <event.h>, as usual.	3727	=item * Use it by including <event.h>, as usual.
2833		3728
2834	=item * The following members are fully supported: ev_base, ev_callback,	3729	=item * The following members are fully supported: ev_base, ev_callback,
2835	ev_arg, ev_fd, ev_res, ev_events.	3730	ev_arg, ev_fd, ev_res, ev_events.
…		…
2841	=item * Priorities are not currently supported. Initialising priorities	3736	=item * Priorities are not currently supported. Initialising priorities
2842	will fail and all watchers will have the same priority, even though there	3737	will fail and all watchers will have the same priority, even though there
2843	is an ev_pri field.	3738	is an ev_pri field.
2844		3739
2845	=item * In libevent, the last base created gets the signals, in libev, the	3740	=item * In libevent, the last base created gets the signals, in libev, the
2846	first base created (== the default loop) gets the signals.	3741	base that registered the signal gets the signals.
2847		3742
2848	=item * Other members are not supported.	3743	=item * Other members are not supported.
2849		3744
2850	=item * The libev emulation is I<not> ABI compatible to libevent, you need	3745	=item * The libev emulation is I<not> ABI compatible to libevent, you need
2851	to use the libev header file and library.	3746	to use the libev header file and library.
…		…
2870	Care has been taken to keep the overhead low. The only data member the C++	3765	Care has been taken to keep the overhead low. The only data member the C++
2871	classes add (compared to plain C-style watchers) is the event loop pointer	3766	classes add (compared to plain C-style watchers) is the event loop pointer
2872	that the watcher is associated with (or no additional members at all if	3767	that the watcher is associated with (or no additional members at all if
2873	you disable C<EV_MULTIPLICITY> when embedding libev).	3768	you disable C<EV_MULTIPLICITY> when embedding libev).
2874		3769
2875	Currently, functions, and static and non-static member functions can be	3770	Currently, functions, static and non-static member functions and classes
2876	used as callbacks. Other types should be easy to add as long as they only	3771	with C<operator ()> can be used as callbacks. Other types should be easy
2877	need one additional pointer for context. If you need support for other	3772	to add as long as they only need one additional pointer for context. If
2878	types of functors please contact the author (preferably after implementing	3773	you need support for other types of functors please contact the author
2879	it).	3774	(preferably after implementing it).
2880		3775
2881	Here is a list of things available in the C<ev> namespace:	3776	Here is a list of things available in the C<ev> namespace:
2882		3777
2883	=over 4	3778	=over 4
2884		3779
…		…
2902		3797
2903	=over 4	3798	=over 4
2904		3799
2905	=item ev::TYPE::TYPE ()	3800	=item ev::TYPE::TYPE ()
2906		3801
2907	=item ev::TYPE::TYPE (struct ev_loop *)	3802	=item ev::TYPE::TYPE (loop)
2908		3803
2909	=item ev::TYPE::~TYPE	3804	=item ev::TYPE::~TYPE
2910		3805
2911	The constructor (optionally) takes an event loop to associate the watcher	3806	The constructor (optionally) takes an event loop to associate the watcher
2912	with. If it is omitted, it will use C<EV_DEFAULT>.	3807	with. If it is omitted, it will use C<EV_DEFAULT>.
…		…
2945	myclass obj;	3840	myclass obj;
2946	ev::io iow;	3841	ev::io iow;
2947	iow.set <myclass, &myclass::io_cb> (&obj);	3842	iow.set <myclass, &myclass::io_cb> (&obj);
2948		3843
2949	=item w->set (object *)	3844	=item w->set (object *)
2950
2951	This is an B<experimental> feature that might go away in a future version.
2952		3845
2953	This is a variation of a method callback - leaving out the method to call	3846	This is a variation of a method callback - leaving out the method to call
2954	will default the method to C<operator ()>, which makes it possible to use	3847	will default the method to C<operator ()>, which makes it possible to use
2955	functor objects without having to manually specify the C<operator ()> all	3848	functor objects without having to manually specify the C<operator ()> all
2956	the time. Incidentally, you can then also leave out the template argument	3849	the time. Incidentally, you can then also leave out the template argument
…		…
2989	Example: Use a plain function as callback.	3882	Example: Use a plain function as callback.
2990		3883
2991	static void io_cb (ev::io &w, int revents) { }	3884	static void io_cb (ev::io &w, int revents) { }
2992	iow.set <io_cb> ();	3885	iow.set <io_cb> ();
2993		3886
2994	=item w->set (struct ev_loop *)	3887	=item w->set (loop)
2995		3888
2996	Associates a different C<struct ev_loop> with this watcher. You can only	3889	Associates a different C<struct ev_loop> with this watcher. You can only
2997	do this when the watcher is inactive (and not pending either).	3890	do this when the watcher is inactive (and not pending either).
2998		3891
2999	=item w->set ([arguments])	3892	=item w->set ([arguments])
3000		3893
3001	Basically the same as C<ev_TYPE_set>, with the same arguments. Must be	3894	Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3002	called at least once. Unlike the C counterpart, an active watcher gets	3895	method or a suitable start method must be called at least once. Unlike the
3003	automatically stopped and restarted when reconfiguring it with this	3896	C counterpart, an active watcher gets automatically stopped and restarted
3004	method.	3897	when reconfiguring it with this method.
3005		3898
3006	=item w->start ()	3899	=item w->start ()
3007		3900
3008	Starts the watcher. Note that there is no C<loop> argument, as the	3901	Starts the watcher. Note that there is no C<loop> argument, as the
3009	constructor already stores the event loop.	3902	constructor already stores the event loop.
3010		3903
		3904	=item w->start ([arguments])
		3905
		3906	Instead of calling C<set> and C<start> methods separately, it is often
		3907	convenient to wrap them in one call. Uses the same type of arguments as
		3908	the configure C<set> method of the watcher.
		3909
3011	=item w->stop ()	3910	=item w->stop ()
3012		3911
3013	Stops the watcher if it is active. Again, no C<loop> argument.	3912	Stops the watcher if it is active. Again, no C<loop> argument.
3014		3913
3015	=item w->again () (C<ev::timer>, C<ev::periodic> only)	3914	=item w->again () (C<ev::timer>, C<ev::periodic> only)
…		…
3027		3926
3028	=back	3927	=back
3029		3928
3030	=back	3929	=back
3031		3930
3032	Example: Define a class with an IO and idle watcher, start one of them in	3931	Example: Define a class with two I/O and idle watchers, start the I/O
3033	the constructor.	3932	watchers in the constructor.
3034		3933
3035	class myclass	3934	class myclass
3036	{	3935	{
3037	ev::io io ; void io_cb (ev::io &w, int revents);	3936	ev::io io ; void io_cb (ev::io &w, int revents);
		3937	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3038	ev::idle idle; void idle_cb (ev::idle &w, int revents);	3938	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3039		3939
3040	myclass (int fd)	3940	myclass (int fd)
3041	{	3941	{
3042	io .set <myclass, &myclass::io_cb > (this);	3942	io .set <myclass, &myclass::io_cb > (this);
		3943	io2 .set <myclass, &myclass::io2_cb > (this);
3043	idle.set <myclass, &myclass::idle_cb> (this);	3944	idle.set <myclass, &myclass::idle_cb> (this);
3044		3945
3045	io.start (fd, ev::READ);	3946	io.set (fd, ev::WRITE); // configure the watcher
		3947	io.start (); // start it whenever convenient
		3948
		3949	io2.start (fd, ev::READ); // set + start in one call
3046	}	3950	}
3047	};	3951	};
3048		3952
3049		3953
3050	=head1 OTHER LANGUAGE BINDINGS	3954	=head1 OTHER LANGUAGE BINDINGS
…		…
3096	=item Ocaml	4000	=item Ocaml
3097		4001
3098	Erkki Seppala has written Ocaml bindings for libev, to be found at	4002	Erkki Seppala has written Ocaml bindings for libev, to be found at
3099	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4003	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3100		4004
		4005	=item Lua
		4006
		4007	Brian Maher has written a partial interface to libev for lua (at the
		4008	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
		4009	L<http://github.com/brimworks/lua-ev>.
		4010
3101	=back	4011	=back
3102		4012
3103		4013
3104	=head1 MACRO MAGIC	4014	=head1 MACRO MAGIC
3105		4015
…		…
3118	loop argument"). The C<EV_A> form is used when this is the sole argument,	4028	loop argument"). The C<EV_A> form is used when this is the sole argument,
3119	C<EV_A_> is used when other arguments are following. Example:	4029	C<EV_A_> is used when other arguments are following. Example:
3120		4030
3121	ev_unref (EV_A);	4031	ev_unref (EV_A);
3122	ev_timer_add (EV_A_ watcher);	4032	ev_timer_add (EV_A_ watcher);
3123	ev_loop (EV_A_ 0);	4033	ev_run (EV_A_ 0);
3124		4034
3125	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,	4035	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3126	which is often provided by the following macro.	4036	which is often provided by the following macro.
3127		4037
3128	=item C<EV_P>, C<EV_P_>	4038	=item C<EV_P>, C<EV_P_>
…		…
3168	}	4078	}
3169		4079
3170	ev_check check;	4080	ev_check check;
3171	ev_check_init (&check, check_cb);	4081	ev_check_init (&check, check_cb);
3172	ev_check_start (EV_DEFAULT_ &check);	4082	ev_check_start (EV_DEFAULT_ &check);
3173	ev_loop (EV_DEFAULT_ 0);	4083	ev_run (EV_DEFAULT_ 0);
3174		4084
3175	=head1 EMBEDDING	4085	=head1 EMBEDDING
3176		4086
3177	Libev can (and often is) directly embedded into host	4087	Libev can (and often is) directly embedded into host
3178	applications. Examples of applications that embed it include the Deliantra	4088	applications. Examples of applications that embed it include the Deliantra
…		…
3258	libev.m4	4168	libev.m4
3259		4169
3260	=head2 PREPROCESSOR SYMBOLS/MACROS	4170	=head2 PREPROCESSOR SYMBOLS/MACROS
3261		4171
3262	Libev can be configured via a variety of preprocessor symbols you have to	4172	Libev can be configured via a variety of preprocessor symbols you have to
3263	define before including any of its files. The default in the absence of	4173	define before including (or compiling) any of its files. The default in
3264	autoconf is documented for every option.	4174	the absence of autoconf is documented for every option.
		4175
		4176	Symbols marked with "(h)" do not change the ABI, and can have different
		4177	values when compiling libev vs. including F<ev.h>, so it is permissible
		4178	to redefine them before including F<ev.h> without breaking compatibility
		4179	to a compiled library. All other symbols change the ABI, which means all
		4180	users of libev and the libev code itself must be compiled with compatible
		4181	settings.
3265		4182
3266	=over 4	4183	=over 4
3267		4184
		4185	=item EV_COMPAT3 (h)
		4186
		4187	Backwards compatibility is a major concern for libev. This is why this
		4188	release of libev comes with wrappers for the functions and symbols that
		4189	have been renamed between libev version 3 and 4.
		4190
		4191	You can disable these wrappers (to test compatibility with future
		4192	versions) by defining C<EV_COMPAT3> to C<0> when compiling your
		4193	sources. This has the additional advantage that you can drop the C<struct>
		4194	from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
		4195	typedef in that case.
		4196
		4197	In some future version, the default for C<EV_COMPAT3> will become C<0>,
		4198	and in some even more future version the compatibility code will be
		4199	removed completely.
		4200
3268	=item EV_STANDALONE	4201	=item EV_STANDALONE (h)
3269		4202
3270	Must always be C<1> if you do not use autoconf configuration, which	4203	Must always be C<1> if you do not use autoconf configuration, which
3271	keeps libev from including F<config.h>, and it also defines dummy	4204	keeps libev from including F<config.h>, and it also defines dummy
3272	implementations for some libevent functions (such as logging, which is not	4205	implementations for some libevent functions (such as logging, which is not
3273	supported). It will also not define any of the structs usually found in	4206	supported). It will also not define any of the structs usually found in
3274	F<event.h> that are not directly supported by the libev core alone.	4207	F<event.h> that are not directly supported by the libev core alone.
3275		4208
3276	In stanbdalone mode, libev will still try to automatically deduce the	4209	In standalone mode, libev will still try to automatically deduce the
3277	configuration, but has to be more conservative.	4210	configuration, but has to be more conservative.
		4211
		4212	=item EV_USE_FLOOR
		4213
		4214	If defined to be C<1>, libev will use the C<floor ()> function for its
		4215	periodic reschedule calculations, otherwise libev will fall back on a
		4216	portable (slower) implementation. If you enable this, you usually have to
		4217	link against libm or something equivalent. Enabling this when the C<floor>
		4218	function is not available will fail, so the safe default is to not enable
		4219	this.
3278		4220
3279	=item EV_USE_MONOTONIC	4221	=item EV_USE_MONOTONIC
3280		4222
3281	If defined to be C<1>, libev will try to detect the availability of the	4223	If defined to be C<1>, libev will try to detect the availability of the
3282	monotonic clock option at both compile time and runtime. Otherwise no	4224	monotonic clock option at both compile time and runtime. Otherwise no
…		…
3346	be used is the winsock select). This means that it will call	4288	be used is the winsock select). This means that it will call
3347	C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,	4289	C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3348	it is assumed that all these functions actually work on fds, even	4290	it is assumed that all these functions actually work on fds, even
3349	on win32. Should not be defined on non-win32 platforms.	4291	on win32. Should not be defined on non-win32 platforms.
3350		4292
3351	=item EV_FD_TO_WIN32_HANDLE	4293	=item EV_FD_TO_WIN32_HANDLE(fd)
3352		4294
3353	If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map	4295	If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3354	file descriptors to socket handles. When not defining this symbol (the	4296	file descriptors to socket handles. When not defining this symbol (the
3355	default), then libev will call C<_get_osfhandle>, which is usually	4297	default), then libev will call C<_get_osfhandle>, which is usually
3356	correct. In some cases, programs use their own file descriptor management,	4298	correct. In some cases, programs use their own file descriptor management,
3357	in which case they can provide this function to map fds to socket handles.	4299	in which case they can provide this function to map fds to socket handles.
		4300
		4301	=item EV_WIN32_HANDLE_TO_FD(handle)
		4302
		4303	If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
		4304	using the standard C<_open_osfhandle> function. For programs implementing
		4305	their own fd to handle mapping, overwriting this function makes it easier
		4306	to do so. This can be done by defining this macro to an appropriate value.
		4307
		4308	=item EV_WIN32_CLOSE_FD(fd)
		4309
		4310	If programs implement their own fd to handle mapping on win32, then this
		4311	macro can be used to override the C<close> function, useful to unregister
		4312	file descriptors again. Note that the replacement function has to close
		4313	the underlying OS handle.
3358		4314
3359	=item EV_USE_POLL	4315	=item EV_USE_POLL
3360		4316
3361	If defined to be C<1>, libev will compile in support for the C<poll>(2)	4317	If defined to be C<1>, libev will compile in support for the C<poll>(2)
3362	backend. Otherwise it will be enabled on non-win32 platforms. It	4318	backend. Otherwise it will be enabled on non-win32 platforms. It
…		…
3409	as well as for signal and thread safety in C<ev_async> watchers.	4365	as well as for signal and thread safety in C<ev_async> watchers.
3410		4366
3411	In the absence of this define, libev will use C<sig_atomic_t volatile>	4367	In the absence of this define, libev will use C<sig_atomic_t volatile>
3412	(from F<signal.h>), which is usually good enough on most platforms.	4368	(from F<signal.h>), which is usually good enough on most platforms.
3413		4369
3414	=item EV_H	4370	=item EV_H (h)
3415		4371
3416	The name of the F<ev.h> header file used to include it. The default if	4372	The name of the F<ev.h> header file used to include it. The default if
3417	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be	4373	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3418	used to virtually rename the F<ev.h> header file in case of conflicts.	4374	used to virtually rename the F<ev.h> header file in case of conflicts.
3419		4375
3420	=item EV_CONFIG_H	4376	=item EV_CONFIG_H (h)
3421		4377
3422	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override	4378	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3423	F<ev.c>'s idea of where to find the F<config.h> file, similarly to	4379	F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3424	C<EV_H>, above.	4380	C<EV_H>, above.
3425		4381
3426	=item EV_EVENT_H	4382	=item EV_EVENT_H (h)
3427		4383
3428	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea	4384	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3429	of how the F<event.h> header can be found, the default is C<"event.h">.	4385	of how the F<event.h> header can be found, the default is C<"event.h">.
3430		4386
3431	=item EV_PROTOTYPES	4387	=item EV_PROTOTYPES (h)
3432		4388
3433	If defined to be C<0>, then F<ev.h> will not define any function	4389	If defined to be C<0>, then F<ev.h> will not define any function
3434	prototypes, but still define all the structs and other symbols. This is	4390	prototypes, but still define all the structs and other symbols. This is
3435	occasionally useful if you want to provide your own wrapper functions	4391	occasionally useful if you want to provide your own wrapper functions
3436	around libev functions.	4392	around libev functions.
…		…
3458	fine.	4414	fine.
3459		4415
3460	If your embedding application does not need any priorities, defining these	4416	If your embedding application does not need any priorities, defining these
3461	both to C<0> will save some memory and CPU.	4417	both to C<0> will save some memory and CPU.
3462		4418
3463	=item EV_PERIODIC_ENABLE	4419	=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
		4420	EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
		4421	EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3464		4422
3465	If undefined or defined to be C<1>, then periodic timers are supported. If	4423	If undefined or defined to be C<1> (and the platform supports it), then
3466	defined to be C<0>, then they are not. Disabling them saves a few kB of	4424	the respective watcher type is supported. If defined to be C<0>, then it
3467	code.	4425	is not. Disabling watcher types mainly saves code size.
3468		4426
3469	=item EV_IDLE_ENABLE	4427	=item EV_FEATURES
3470
3471	If undefined or defined to be C<1>, then idle watchers are supported. If
3472	defined to be C<0>, then they are not. Disabling them saves a few kB of
3473	code.
3474
3475	=item EV_EMBED_ENABLE
3476
3477	If undefined or defined to be C<1>, then embed watchers are supported. If
3478	defined to be C<0>, then they are not. Embed watchers rely on most other
3479	watcher types, which therefore must not be disabled.
3480
3481	=item EV_STAT_ENABLE
3482
3483	If undefined or defined to be C<1>, then stat watchers are supported. If
3484	defined to be C<0>, then they are not.
3485
3486	=item EV_FORK_ENABLE
3487
3488	If undefined or defined to be C<1>, then fork watchers are supported. If
3489	defined to be C<0>, then they are not.
3490
3491	=item EV_ASYNC_ENABLE
3492
3493	If undefined or defined to be C<1>, then async watchers are supported. If
3494	defined to be C<0>, then they are not.
3495
3496	=item EV_MINIMAL
3497		4428
3498	If you need to shave off some kilobytes of code at the expense of some	4429	If you need to shave off some kilobytes of code at the expense of some
3499	speed, define this symbol to C<1>. Currently this is used to override some	4430	speed (but with the full API), you can define this symbol to request
3500	inlining decisions, saves roughly 30% code size on amd64. It also selects a	4431	certain subsets of functionality. The default is to enable all features
3501	much smaller 2-heap for timer management over the default 4-heap.	4432	that can be enabled on the platform.
		4433
		4434	A typical way to use this symbol is to define it to C<0> (or to a bitset
		4435	with some broad features you want) and then selectively re-enable
		4436	additional parts you want, for example if you want everything minimal,
		4437	but multiple event loop support, async and child watchers and the poll
		4438	backend, use this:
		4439
		4440	#define EV_FEATURES 0
		4441	#define EV_MULTIPLICITY 1
		4442	#define EV_USE_POLL 1
		4443	#define EV_CHILD_ENABLE 1
		4444	#define EV_ASYNC_ENABLE 1
		4445
		4446	The actual value is a bitset, it can be a combination of the following
		4447	values:
		4448
		4449	=over 4
		4450
		4451	=item C<1> - faster/larger code
		4452
		4453	Use larger code to speed up some operations.
		4454
		4455	Currently this is used to override some inlining decisions (enlarging the
		4456	code size by roughly 30% on amd64).
		4457
		4458	When optimising for size, use of compiler flags such as C<-Os> with
		4459	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
		4460	assertions.
		4461
		4462	=item C<2> - faster/larger data structures
		4463
		4464	Replaces the small 2-heap for timer management by a faster 4-heap, larger
		4465	hash table sizes and so on. This will usually further increase code size
		4466	and can additionally have an effect on the size of data structures at
		4467	runtime.
		4468
		4469	=item C<4> - full API configuration
		4470
		4471	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
		4472	enables multiplicity (C<EV_MULTIPLICITY>=1).
		4473
		4474	=item C<8> - full API
		4475
		4476	This enables a lot of the "lesser used" API functions. See C<ev.h> for
		4477	details on which parts of the API are still available without this
		4478	feature, and do not complain if this subset changes over time.
		4479
		4480	=item C<16> - enable all optional watcher types
		4481
		4482	Enables all optional watcher types. If you want to selectively enable
		4483	only some watcher types other than I/O and timers (e.g. prepare,
		4484	embed, async, child...) you can enable them manually by defining
		4485	C<EV_watchertype_ENABLE> to C<1> instead.
		4486
		4487	=item C<32> - enable all backends
		4488
		4489	This enables all backends - without this feature, you need to enable at
		4490	least one backend manually (C<EV_USE_SELECT> is a good choice).
		4491
		4492	=item C<64> - enable OS-specific "helper" APIs
		4493
		4494	Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
		4495	default.
		4496
		4497	=back
		4498
		4499	Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
		4500	reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
		4501	code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
		4502	watchers, timers and monotonic clock support.
		4503
		4504	With an intelligent-enough linker (gcc+binutils are intelligent enough
		4505	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
		4506	your program might be left out as well - a binary starting a timer and an
		4507	I/O watcher then might come out at only 5Kb.
		4508
		4509	=item EV_AVOID_STDIO
		4510
		4511	If this is set to C<1> at compiletime, then libev will avoid using stdio
		4512	functions (printf, scanf, perror etc.). This will increase the code size
		4513	somewhat, but if your program doesn't otherwise depend on stdio and your
		4514	libc allows it, this avoids linking in the stdio library which is quite
		4515	big.
		4516
		4517	Note that error messages might become less precise when this option is
		4518	enabled.
		4519
		4520	=item EV_NSIG
		4521
		4522	The highest supported signal number, +1 (or, the number of
		4523	signals): Normally, libev tries to deduce the maximum number of signals
		4524	automatically, but sometimes this fails, in which case it can be
		4525	specified. Also, using a lower number than detected (C<32> should be
		4526	good for about any system in existence) can save some memory, as libev
		4527	statically allocates some 12-24 bytes per signal number.
3502		4528
3503	=item EV_PID_HASHSIZE	4529	=item EV_PID_HASHSIZE
3504		4530
3505	C<ev_child> watchers use a small hash table to distribute workload by	4531	C<ev_child> watchers use a small hash table to distribute workload by
3506	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more	4532	pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3507	than enough. If you need to manage thousands of children you might want to	4533	usually more than enough. If you need to manage thousands of children you
3508	increase this value (I<must> be a power of two).	4534	might want to increase this value (I<must> be a power of two).
3509		4535
3510	=item EV_INOTIFY_HASHSIZE	4536	=item EV_INOTIFY_HASHSIZE
3511		4537
3512	C<ev_stat> watchers use a small hash table to distribute workload by	4538	C<ev_stat> watchers use a small hash table to distribute workload by
3513	inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),	4539	inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3514	usually more than enough. If you need to manage thousands of C<ev_stat>	4540	disabled), usually more than enough. If you need to manage thousands of
3515	watchers you might want to increase this value (I<must> be a power of	4541	C<ev_stat> watchers you might want to increase this value (I<must> be a
3516	two).	4542	power of two).
3517		4543
3518	=item EV_USE_4HEAP	4544	=item EV_USE_4HEAP
3519		4545
3520	Heaps are not very cache-efficient. To improve the cache-efficiency of the	4546	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3521	timer and periodics heaps, libev uses a 4-heap when this symbol is defined	4547	timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3522	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably	4548	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3523	faster performance with many (thousands) of watchers.	4549	faster performance with many (thousands) of watchers.
3524		4550
3525	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	4551	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3526	(disabled).	4552	will be C<0>.
3527		4553
3528	=item EV_HEAP_CACHE_AT	4554	=item EV_HEAP_CACHE_AT
3529		4555
3530	Heaps are not very cache-efficient. To improve the cache-efficiency of the	4556	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3531	timer and periodics heaps, libev can cache the timestamp (I<at>) within	4557	timer and periodics heaps, libev can cache the timestamp (I<at>) within
3532	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),	4558	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3533	which uses 8-12 bytes more per watcher and a few hundred bytes more code,	4559	which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3534	but avoids random read accesses on heap changes. This improves performance	4560	but avoids random read accesses on heap changes. This improves performance
3535	noticeably with many (hundreds) of watchers.	4561	noticeably with many (hundreds) of watchers.
3536		4562
3537	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	4563	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3538	(disabled).	4564	will be C<0>.
3539		4565
3540	=item EV_VERIFY	4566	=item EV_VERIFY
3541		4567
3542	Controls how much internal verification (see C<ev_loop_verify ()>) will	4568	Controls how much internal verification (see C<ev_verify ()>) will
3543	be done: If set to C<0>, no internal verification code will be compiled	4569	be done: If set to C<0>, no internal verification code will be compiled
3544	in. If set to C<1>, then verification code will be compiled in, but not	4570	in. If set to C<1>, then verification code will be compiled in, but not
3545	called. If set to C<2>, then the internal verification code will be	4571	called. If set to C<2>, then the internal verification code will be
3546	called once per loop, which can slow down libev. If set to C<3>, then the	4572	called once per loop, which can slow down libev. If set to C<3>, then the
3547	verification code will be called very frequently, which will slow down	4573	verification code will be called very frequently, which will slow down
3548	libev considerably.	4574	libev considerably.
3549		4575
3550	The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be	4576	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3551	C<0>.	4577	will be C<0>.
3552		4578
3553	=item EV_COMMON	4579	=item EV_COMMON
3554		4580
3555	By default, all watchers have a C<void *data> member. By redefining	4581	By default, all watchers have a C<void *data> member. By redefining
3556	this macro to a something else you can include more and other types of	4582	this macro to something else you can include more and other types of
3557	members. You have to define it each time you include one of the files,	4583	members. You have to define it each time you include one of the files,
3558	though, and it must be identical each time.	4584	though, and it must be identical each time.
3559		4585
3560	For example, the perl EV module uses something like this:	4586	For example, the perl EV module uses something like this:
3561		4587
…		…
3614	file.	4640	file.
3615		4641
3616	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file	4642	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3617	that everybody includes and which overrides some configure choices:	4643	that everybody includes and which overrides some configure choices:
3618		4644
3619	#define EV_MINIMAL 1	4645	#define EV_FEATURES 8
3620	#define EV_USE_POLL 0	4646	#define EV_USE_SELECT 1
3621	#define EV_MULTIPLICITY 0
3622	#define EV_PERIODIC_ENABLE 0	4647	#define EV_PREPARE_ENABLE 1
		4648	#define EV_IDLE_ENABLE 1
3623	#define EV_STAT_ENABLE 0	4649	#define EV_SIGNAL_ENABLE 1
3624	#define EV_FORK_ENABLE 0	4650	#define EV_CHILD_ENABLE 1
		4651	#define EV_USE_STDEXCEPT 0
3625	#define EV_CONFIG_H <config.h>	4652	#define EV_CONFIG_H <config.h>
3626	#define EV_MINPRI 0
3627	#define EV_MAXPRI 0
3628		4653
3629	#include "ev++.h"	4654	#include "ev++.h"
3630		4655
3631	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4656	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3632		4657
3633	#include "ev_cpp.h"	4658	#include "ev_cpp.h"
3634	#include "ev.c"	4659	#include "ev.c"
3635		4660
3636	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4661	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
3637		4662
3638	=head2 THREADS AND COROUTINES	4663	=head2 THREADS AND COROUTINES
3639		4664
3640	=head3 THREADS	4665	=head3 THREADS
3641		4666
…		…
3692	default loop and triggering an C<ev_async> watcher from the default loop	4717	default loop and triggering an C<ev_async> watcher from the default loop
3693	watcher callback into the event loop interested in the signal.	4718	watcher callback into the event loop interested in the signal.
3694		4719
3695	=back	4720	=back
3696		4721
		4722	See also L<THREAD LOCKING EXAMPLE>.
		4723
3697	=head3 COROUTINES	4724	=head3 COROUTINES
3698		4725
3699	Libev is very accommodating to coroutines ("cooperative threads"):	4726	Libev is very accommodating to coroutines ("cooperative threads"):
3700	libev fully supports nesting calls to its functions from different	4727	libev fully supports nesting calls to its functions from different
3701	coroutines (e.g. you can call C<ev_loop> on the same loop from two	4728	coroutines (e.g. you can call C<ev_run> on the same loop from two
3702	different coroutines, and switch freely between both coroutines running the	4729	different coroutines, and switch freely between both coroutines running
3703	loop, as long as you don't confuse yourself). The only exception is that	4730	the loop, as long as you don't confuse yourself). The only exception is
3704	you must not do this from C<ev_periodic> reschedule callbacks.	4731	that you must not do this from C<ev_periodic> reschedule callbacks.
3705		4732
3706	Care has been taken to ensure that libev does not keep local state inside	4733	Care has been taken to ensure that libev does not keep local state inside
3707	C<ev_loop>, and other calls do not usually allow for coroutine switches as	4734	C<ev_run>, and other calls do not usually allow for coroutine switches as
3708	they do not call any callbacks.	4735	they do not call any callbacks.
3709		4736
3710	=head2 COMPILER WARNINGS	4737	=head2 COMPILER WARNINGS
3711		4738
3712	Depending on your compiler and compiler settings, you might get no or a	4739	Depending on your compiler and compiler settings, you might get no or a
…		…
3723	maintainable.	4750	maintainable.
3724		4751
3725	And of course, some compiler warnings are just plain stupid, or simply	4752	And of course, some compiler warnings are just plain stupid, or simply
3726	wrong (because they don't actually warn about the condition their message	4753	wrong (because they don't actually warn about the condition their message
3727	seems to warn about). For example, certain older gcc versions had some	4754	seems to warn about). For example, certain older gcc versions had some
3728	warnings that resulted an extreme number of false positives. These have	4755	warnings that resulted in an extreme number of false positives. These have
3729	been fixed, but some people still insist on making code warn-free with	4756	been fixed, but some people still insist on making code warn-free with
3730	such buggy versions.	4757	such buggy versions.
3731		4758
3732	While libev is written to generate as few warnings as possible,	4759	While libev is written to generate as few warnings as possible,
3733	"warn-free" code is not a goal, and it is recommended not to build libev	4760	"warn-free" code is not a goal, and it is recommended not to build libev
…		…
3769	I suggest using suppression lists.	4796	I suggest using suppression lists.
3770		4797
3771		4798
3772	=head1 PORTABILITY NOTES	4799	=head1 PORTABILITY NOTES
3773		4800
		4801	=head2 GNU/LINUX 32 BIT LIMITATIONS
		4802
		4803	GNU/Linux is the only common platform that supports 64 bit file/large file
		4804	interfaces but I<disables> them by default.
		4805
		4806	That means that libev compiled in the default environment doesn't support
		4807	files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
		4808
		4809	Unfortunately, many programs try to work around this GNU/Linux issue
		4810	by enabling the large file API, which makes them incompatible with the
		4811	standard libev compiled for their system.
		4812
		4813	Likewise, libev cannot enable the large file API itself as this would
		4814	suddenly make it incompatible to the default compile time environment,
		4815	i.e. all programs not using special compile switches.
		4816
		4817	=head2 OS/X AND DARWIN BUGS
		4818
		4819	The whole thing is a bug if you ask me - basically any system interface
		4820	you touch is broken, whether it is locales, poll, kqueue or even the
		4821	OpenGL drivers.
		4822
		4823	=head3 C<kqueue> is buggy
		4824
		4825	The kqueue syscall is broken in all known versions - most versions support
		4826	only sockets, many support pipes.
		4827
		4828	Libev tries to work around this by not using C<kqueue> by default on this
		4829	rotten platform, but of course you can still ask for it when creating a
		4830	loop - embedding a socket-only kqueue loop into a select-based one is
		4831	probably going to work well.
		4832
		4833	=head3 C<poll> is buggy
		4834
		4835	Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
		4836	implementation by something calling C<kqueue> internally around the 10.5.6
		4837	release, so now C<kqueue> I<and> C<poll> are broken.
		4838
		4839	Libev tries to work around this by not using C<poll> by default on
		4840	this rotten platform, but of course you can still ask for it when creating
		4841	a loop.
		4842
		4843	=head3 C<select> is buggy
		4844
		4845	All that's left is C<select>, and of course Apple found a way to fuck this
		4846	one up as well: On OS/X, C<select> actively limits the number of file
		4847	descriptors you can pass in to 1024 - your program suddenly crashes when
		4848	you use more.
		4849
		4850	There is an undocumented "workaround" for this - defining
		4851	C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
		4852	work on OS/X.
		4853
		4854	=head2 SOLARIS PROBLEMS AND WORKAROUNDS
		4855
		4856	=head3 C<errno> reentrancy
		4857
		4858	The default compile environment on Solaris is unfortunately so
		4859	thread-unsafe that you can't even use components/libraries compiled
		4860	without C<-D_REENTRANT> in a threaded program, which, of course, isn't
		4861	defined by default. A valid, if stupid, implementation choice.
		4862
		4863	If you want to use libev in threaded environments you have to make sure
		4864	it's compiled with C<_REENTRANT> defined.
		4865
		4866	=head3 Event port backend
		4867
		4868	The scalable event interface for Solaris is called "event
		4869	ports". Unfortunately, this mechanism is very buggy in all major
		4870	releases. If you run into high CPU usage, your program freezes or you get
		4871	a large number of spurious wakeups, make sure you have all the relevant
		4872	and latest kernel patches applied. No, I don't know which ones, but there
		4873	are multiple ones to apply, and afterwards, event ports actually work
		4874	great.
		4875
		4876	If you can't get it to work, you can try running the program by setting
		4877	the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
		4878	C<select> backends.
		4879
		4880	=head2 AIX POLL BUG
		4881
		4882	AIX unfortunately has a broken C<poll.h> header. Libev works around
		4883	this by trying to avoid the poll backend altogether (i.e. it's not even
		4884	compiled in), which normally isn't a big problem as C<select> works fine
		4885	with large bitsets on AIX, and AIX is dead anyway.
		4886
3774	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS	4887	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
		4888
		4889	=head3 General issues
3775		4890
3776	Win32 doesn't support any of the standards (e.g. POSIX) that libev	4891	Win32 doesn't support any of the standards (e.g. POSIX) that libev
3777	requires, and its I/O model is fundamentally incompatible with the POSIX	4892	requires, and its I/O model is fundamentally incompatible with the POSIX
3778	model. Libev still offers limited functionality on this platform in	4893	model. Libev still offers limited functionality on this platform in
3779	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	4894	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3780	descriptors. This only applies when using Win32 natively, not when using	4895	descriptors. This only applies when using Win32 natively, not when using
3781	e.g. cygwin.	4896	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
		4897	as every compielr comes with a slightly differently broken/incompatible
		4898	environment.
3782		4899
3783	Lifting these limitations would basically require the full	4900	Lifting these limitations would basically require the full
3784	re-implementation of the I/O system. If you are into these kinds of	4901	re-implementation of the I/O system. If you are into this kind of thing,
3785	things, then note that glib does exactly that for you in a very portable	4902	then note that glib does exactly that for you in a very portable way (note
3786	way (note also that glib is the slowest event library known to man).	4903	also that glib is the slowest event library known to man).
3787		4904
3788	There is no supported compilation method available on windows except	4905	There is no supported compilation method available on windows except
3789	embedding it into other applications.	4906	embedding it into other applications.
		4907
		4908	Sensible signal handling is officially unsupported by Microsoft - libev
		4909	tries its best, but under most conditions, signals will simply not work.
3790		4910
3791	Not a libev limitation but worth mentioning: windows apparently doesn't	4911	Not a libev limitation but worth mentioning: windows apparently doesn't
3792	accept large writes: instead of resulting in a partial write, windows will	4912	accept large writes: instead of resulting in a partial write, windows will
3793	either accept everything or return C<ENOBUFS> if the buffer is too large,	4913	either accept everything or return C<ENOBUFS> if the buffer is too large,
3794	so make sure you only write small amounts into your sockets (less than a	4914	so make sure you only write small amounts into your sockets (less than a
…		…
3799	the abysmal performance of winsockets, using a large number of sockets	4919	the abysmal performance of winsockets, using a large number of sockets
3800	is not recommended (and not reasonable). If your program needs to use	4920	is not recommended (and not reasonable). If your program needs to use
3801	more than a hundred or so sockets, then likely it needs to use a totally	4921	more than a hundred or so sockets, then likely it needs to use a totally
3802	different implementation for windows, as libev offers the POSIX readiness	4922	different implementation for windows, as libev offers the POSIX readiness
3803	notification model, which cannot be implemented efficiently on windows	4923	notification model, which cannot be implemented efficiently on windows
3804	(Microsoft monopoly games).	4924	(due to Microsoft monopoly games).
3805		4925
3806	A typical way to use libev under windows is to embed it (see the embedding	4926	A typical way to use libev under windows is to embed it (see the embedding
3807	section for details) and use the following F<evwrap.h> header file instead	4927	section for details) and use the following F<evwrap.h> header file instead
3808	of F<ev.h>:	4928	of F<ev.h>:
3809		4929
…		…
3816	you do I<not> compile the F<ev.c> or any other embedded source files!):	4936	you do I<not> compile the F<ev.c> or any other embedded source files!):
3817		4937
3818	#include "evwrap.h"	4938	#include "evwrap.h"
3819	#include "ev.c"	4939	#include "ev.c"
3820		4940
3821	=over 4
3822
3823	=item The winsocket select function	4941	=head3 The winsocket C<select> function
3824		4942
3825	The winsocket C<select> function doesn't follow POSIX in that it	4943	The winsocket C<select> function doesn't follow POSIX in that it
3826	requires socket I<handles> and not socket I<file descriptors> (it is	4944	requires socket I<handles> and not socket I<file descriptors> (it is
3827	also extremely buggy). This makes select very inefficient, and also	4945	also extremely buggy). This makes select very inefficient, and also
3828	requires a mapping from file descriptors to socket handles (the Microsoft	4946	requires a mapping from file descriptors to socket handles (the Microsoft
…		…
3837	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */	4955	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3838		4956
3839	Note that winsockets handling of fd sets is O(n), so you can easily get a	4957	Note that winsockets handling of fd sets is O(n), so you can easily get a
3840	complexity in the O(n²) range when using win32.	4958	complexity in the O(n²) range when using win32.
3841		4959
3842	=item Limited number of file descriptors	4960	=head3 Limited number of file descriptors
3843		4961
3844	Windows has numerous arbitrary (and low) limits on things.	4962	Windows has numerous arbitrary (and low) limits on things.
3845		4963
3846	Early versions of winsocket's select only supported waiting for a maximum	4964	Early versions of winsocket's select only supported waiting for a maximum
3847	of C<64> handles (probably owning to the fact that all windows kernels	4965	of C<64> handles (probably owning to the fact that all windows kernels
3848	can only wait for C<64> things at the same time internally; Microsoft	4966	can only wait for C<64> things at the same time internally; Microsoft
3849	recommends spawning a chain of threads and wait for 63 handles and the	4967	recommends spawning a chain of threads and wait for 63 handles and the
3850	previous thread in each. Great).	4968	previous thread in each. Sounds great!).
3851		4969
3852	Newer versions support more handles, but you need to define C<FD_SETSIZE>	4970	Newer versions support more handles, but you need to define C<FD_SETSIZE>
3853	to some high number (e.g. C<2048>) before compiling the winsocket select	4971	to some high number (e.g. C<2048>) before compiling the winsocket select
3854	call (which might be in libev or elsewhere, for example, perl does its own	4972	call (which might be in libev or elsewhere, for example, perl and many
3855	select emulation on windows).	4973	other interpreters do their own select emulation on windows).
3856		4974
3857	Another limit is the number of file descriptors in the Microsoft runtime	4975	Another limit is the number of file descriptors in the Microsoft runtime
3858	libraries, which by default is C<64> (there must be a hidden I<64> fetish	4976	libraries, which by default is C<64> (there must be a hidden I<64>
3859	or something like this inside Microsoft). You can increase this by calling	4977	fetish or something like this inside Microsoft). You can increase this
3860	C<_setmaxstdio>, which can increase this limit to C<2048> (another	4978	by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3861	arbitrary limit), but is broken in many versions of the Microsoft runtime	4979	(another arbitrary limit), but is broken in many versions of the Microsoft
3862	libraries.
3863
3864	This might get you to about C<512> or C<2048> sockets (depending on	4980	runtime libraries. This might get you to about C<512> or C<2048> sockets
3865	windows version and/or the phase of the moon). To get more, you need to	4981	(depending on windows version and/or the phase of the moon). To get more,
3866	wrap all I/O functions and provide your own fd management, but the cost of	4982	you need to wrap all I/O functions and provide your own fd management, but
3867	calling select (O(n²)) will likely make this unworkable.	4983	the cost of calling select (O(n²)) will likely make this unworkable.
3868
3869	=back
3870		4984
3871	=head2 PORTABILITY REQUIREMENTS	4985	=head2 PORTABILITY REQUIREMENTS
3872		4986
3873	In addition to a working ISO-C implementation and of course the	4987	In addition to a working ISO-C implementation and of course the
3874	backend-specific APIs, libev relies on a few additional extensions:	4988	backend-specific APIs, libev relies on a few additional extensions:
…		…
3881	Libev assumes not only that all watcher pointers have the same internal	4995	Libev assumes not only that all watcher pointers have the same internal
3882	structure (guaranteed by POSIX but not by ISO C for example), but it also	4996	structure (guaranteed by POSIX but not by ISO C for example), but it also
3883	assumes that the same (machine) code can be used to call any watcher	4997	assumes that the same (machine) code can be used to call any watcher
3884	callback: The watcher callbacks have different type signatures, but libev	4998	callback: The watcher callbacks have different type signatures, but libev
3885	calls them using an C<ev_watcher *> internally.	4999	calls them using an C<ev_watcher *> internally.
		5000
		5001	=item pointer accesses must be thread-atomic
		5002
		5003	Accessing a pointer value must be atomic, it must both be readable and
		5004	writable in one piece - this is the case on all current architectures.
3886		5005
3887	=item C<sig_atomic_t volatile> must be thread-atomic as well	5006	=item C<sig_atomic_t volatile> must be thread-atomic as well
3888		5007
3889	The type C<sig_atomic_t volatile> (or whatever is defined as	5008	The type C<sig_atomic_t volatile> (or whatever is defined as
3890	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different	5009	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
…		…
3913	watchers.	5032	watchers.
3914		5033
3915	=item C<double> must hold a time value in seconds with enough accuracy	5034	=item C<double> must hold a time value in seconds with enough accuracy
3916		5035
3917	The type C<double> is used to represent timestamps. It is required to	5036	The type C<double> is used to represent timestamps. It is required to
3918	have at least 51 bits of mantissa (and 9 bits of exponent), which is good	5037	have at least 51 bits of mantissa (and 9 bits of exponent), which is
3919	enough for at least into the year 4000. This requirement is fulfilled by	5038	good enough for at least into the year 4000 with millisecond accuracy
		5039	(the design goal for libev). This requirement is overfulfilled by
3920	implementations implementing IEEE 754 (basically all existing ones).	5040	implementations using IEEE 754, which is basically all existing ones. With
		5041	IEEE 754 doubles, you get microsecond accuracy until at least 2200.
3921		5042
3922	=back	5043	=back
3923		5044
3924	If you know of other additional requirements drop me a note.	5045	If you know of other additional requirements drop me a note.
3925		5046
…		…
3993	involves iterating over all running async watchers or all signal numbers.	5114	involves iterating over all running async watchers or all signal numbers.
3994		5115
3995	=back	5116	=back
3996		5117
3997		5118
		5119	=head1 PORTING FROM LIBEV 3.X TO 4.X
		5120
		5121	The major version 4 introduced some incompatible changes to the API.
		5122
		5123	At the moment, the C<ev.h> header file provides compatibility definitions
		5124	for all changes, so most programs should still compile. The compatibility
		5125	layer might be removed in later versions of libev, so better update to the
		5126	new API early than late.
		5127
		5128	=over 4
		5129
		5130	=item C<EV_COMPAT3> backwards compatibility mechanism
		5131
		5132	The backward compatibility mechanism can be controlled by
		5133	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
		5134	section.
		5135
		5136	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
		5137
		5138	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
		5139
		5140	ev_loop_destroy (EV_DEFAULT_UC);
		5141	ev_loop_fork (EV_DEFAULT);
		5142
		5143	=item function/symbol renames
		5144
		5145	A number of functions and symbols have been renamed:
		5146
		5147	ev_loop => ev_run
		5148	EVLOOP_NONBLOCK => EVRUN_NOWAIT
		5149	EVLOOP_ONESHOT => EVRUN_ONCE
		5150
		5151	ev_unloop => ev_break
		5152	EVUNLOOP_CANCEL => EVBREAK_CANCEL
		5153	EVUNLOOP_ONE => EVBREAK_ONE
		5154	EVUNLOOP_ALL => EVBREAK_ALL
		5155
		5156	EV_TIMEOUT => EV_TIMER
		5157
		5158	ev_loop_count => ev_iteration
		5159	ev_loop_depth => ev_depth
		5160	ev_loop_verify => ev_verify
		5161
		5162	Most functions working on C<struct ev_loop> objects don't have an
		5163	C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
		5164	associated constants have been renamed to not collide with the C<struct
		5165	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
		5166	as all other watcher types. Note that C<ev_loop_fork> is still called
		5167	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
		5168	typedef.
		5169
		5170	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
		5171
		5172	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
		5173	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
		5174	and work, but the library code will of course be larger.
		5175
		5176	=back
		5177
		5178
		5179	=head1 GLOSSARY
		5180
		5181	=over 4
		5182
		5183	=item active
		5184
		5185	A watcher is active as long as it has been started and not yet stopped.
		5186	See L<WATCHER STATES> for details.
		5187
		5188	=item application
		5189
		5190	In this document, an application is whatever is using libev.
		5191
		5192	=item backend
		5193
		5194	The part of the code dealing with the operating system interfaces.
		5195
		5196	=item callback
		5197
		5198	The address of a function that is called when some event has been
		5199	detected. Callbacks are being passed the event loop, the watcher that
		5200	received the event, and the actual event bitset.
		5201
		5202	=item callback/watcher invocation
		5203
		5204	The act of calling the callback associated with a watcher.
		5205
		5206	=item event
		5207
		5208	A change of state of some external event, such as data now being available
		5209	for reading on a file descriptor, time having passed or simply not having
		5210	any other events happening anymore.
		5211
		5212	In libev, events are represented as single bits (such as C<EV_READ> or
		5213	C<EV_TIMER>).
		5214
		5215	=item event library
		5216
		5217	A software package implementing an event model and loop.
		5218
		5219	=item event loop
		5220
		5221	An entity that handles and processes external events and converts them
		5222	into callback invocations.
		5223
		5224	=item event model
		5225
		5226	The model used to describe how an event loop handles and processes
		5227	watchers and events.
		5228
		5229	=item pending
		5230
		5231	A watcher is pending as soon as the corresponding event has been
		5232	detected. See L<WATCHER STATES> for details.
		5233
		5234	=item real time
		5235
		5236	The physical time that is observed. It is apparently strictly monotonic :)
		5237
		5238	=item wall-clock time
		5239
		5240	The time and date as shown on clocks. Unlike real time, it can actually
		5241	be wrong and jump forwards and backwards, e.g. when you adjust your
		5242	clock.
		5243
		5244	=item watcher
		5245
		5246	A data structure that describes interest in certain events. Watchers need
		5247	to be started (attached to an event loop) before they can receive events.
		5248
		5249	=back
		5250
3998	=head1 AUTHOR	5251	=head1 AUTHOR
3999		5252
4000	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.	5253	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
		5254	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
4001		5255

Diff Legend

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