ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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