ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.309 by root, Thu Oct 21 09:23:21 2010 UTC vs.
Revision 1.366 by sf-exg, Thu Feb 3 16:21:08 2011 UTC

…		…
26	puts ("stdin ready");	26	puts ("stdin ready");
27	// for one-shot events, one must manually stop the watcher	27	// for one-shot events, one must manually stop the watcher
28	// with its corresponding stop function.	28	// with its corresponding stop function.
29	ev_io_stop (EV_A_ w);	29	ev_io_stop (EV_A_ w);
30		30
31	// this causes all nested ev_loop's to stop iterating	31	// this causes all nested ev_run's to stop iterating
32	ev_unloop (EV_A_ EVUNLOOP_ALL);	32	ev_break (EV_A_ EVBREAK_ALL);
33	}	33	}
34		34
35	// another callback, this time for a time-out	35	// another callback, this time for a time-out
36	static void	36	static void
37	timeout_cb (EV_P_ ev_timer *w, int revents)	37	timeout_cb (EV_P_ ev_timer *w, int revents)
38	{	38	{
39	puts ("timeout");	39	puts ("timeout");
40	// this causes the innermost ev_loop to stop iterating	40	// this causes the innermost ev_run to stop iterating
41	ev_unloop (EV_A_ EVUNLOOP_ONE);	41	ev_break (EV_A_ EVBREAK_ONE);
42	}	42	}
43		43
44	int	44	int
45	main (void)	45	main (void)
46	{	46	{
47	// use the default event loop unless you have special needs	47	// use the default event loop unless you have special needs
48	struct ev_loop *loop = ev_default_loop (0);	48	struct ev_loop *loop = EV_DEFAULT;
49		49
50	// initialise an io watcher, then start it	50	// initialise an io watcher, then start it
51	// this one will watch for stdin to become readable	51	// this one will watch for stdin to become readable
52	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);	52	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
53	ev_io_start (loop, &stdin_watcher);	53	ev_io_start (loop, &stdin_watcher);
…		…
56	// simple non-repeating 5.5 second timeout	56	// simple non-repeating 5.5 second timeout
57	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);	57	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
58	ev_timer_start (loop, &timeout_watcher);	58	ev_timer_start (loop, &timeout_watcher);
59		59
60	// now wait for events to arrive	60	// now wait for events to arrive
61	ev_loop (loop, 0);	61	ev_run (loop, 0);
62		62
63	// unloop was called, so exit	63	// break was called, so exit
64	return 0;	64	return 0;
65	}	65	}
66		66
67	=head1 ABOUT THIS DOCUMENT	67	=head1 ABOUT THIS DOCUMENT
68		68
…		…
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	Familiarity 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 (in practise	137	the (fractional) number of seconds since the (POSIX) epoch (in practice
130	somewhere near the beginning of 1970, details are complicated, don't	138	somewhere near the beginning of 1970, details are complicated, don't
131	ask). This type is called C<ev_tstamp>, which is what you should use	139	ask). This type is called C<ev_tstamp>, which is what you should use
132	too. It usually aliases to the C<double> type in C. When you need to do	140	too. It usually aliases to the C<double> type in C. When you need to do
133	any calculations on it, you should treat it as some floating point value.	141	any calculations on it, you should treat it as some floating point value.
134		142
…		…
165		173
166	=item ev_tstamp ev_time ()	174	=item ev_tstamp ev_time ()
167		175
168	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
169	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
170	you actually want to know.	178	you actually want to know. Also interesting is the combination of
		179	C<ev_update_now> and C<ev_now>.
171		180
172	=item ev_sleep (ev_tstamp interval)	181	=item ev_sleep (ev_tstamp interval)
173		182
174	Sleep for the given interval: The current thread will be blocked until	183	Sleep for the given interval: The current thread will be blocked until
175	either it is interrupted or the given time interval has passed. Basically	184	either it is interrupted or the given time interval has passed. Basically
…		…
192	as this indicates an incompatible change. Minor versions are usually	201	as this indicates an incompatible change. Minor versions are usually
193	compatible to older versions, so a larger minor version alone is usually	202	compatible to older versions, so a larger minor version alone is usually
194	not a problem.	203	not a problem.
195		204
196	Example: Make sure we haven't accidentally been linked against the wrong	205	Example: Make sure we haven't accidentally been linked against the wrong
197	version (note, however, that this will not detect ABI mismatches :).	206	version (note, however, that this will not detect other ABI mismatches,
		207	such as LFS or reentrancy).
198		208
199	assert (("libev version mismatch",	209	assert (("libev version mismatch",
200	ev_version_major () == EV_VERSION_MAJOR	210	ev_version_major () == EV_VERSION_MAJOR
201	&& ev_version_minor () >= EV_VERSION_MINOR));	211	&& ev_version_minor () >= EV_VERSION_MINOR));
202		212
…		…
213	assert (("sorry, no epoll, no sex",	223	assert (("sorry, no epoll, no sex",
214	ev_supported_backends () & EVBACKEND_EPOLL));	224	ev_supported_backends () & EVBACKEND_EPOLL));
215		225
216	=item unsigned int ev_recommended_backends ()	226	=item unsigned int ev_recommended_backends ()
217		227
218	Return the set of all backends compiled into this binary of libev and also	228	Return the set of all backends compiled into this binary of libev and
219	recommended for this platform. This set is often smaller than the one	229	also recommended for this platform, meaning it will work for most file
		230	descriptor types. This set is often smaller than the one returned by
220	returned by C<ev_supported_backends>, as for example kqueue is broken on	231	C<ev_supported_backends>, as for example kqueue is broken on most BSDs
221	most BSDs and will not be auto-detected unless you explicitly request it	232	and will not be auto-detected unless you explicitly request it (assuming
222	(assuming you know what you are doing). This is the set of backends that	233	you know what you are doing). This is the set of backends that libev will
223	libev will probe for if you specify no backends explicitly.	234	probe for if you specify no backends explicitly.
224		235
225	=item unsigned int ev_embeddable_backends ()	236	=item unsigned int ev_embeddable_backends ()
226		237
227	Returns the set of backends that are embeddable in other event loops. This	238	Returns the set of backends that are embeddable in other event loops. This
228	is the theoretical, all-platform, value. To find which backends	239	value is platform-specific but can include backends not available on the
229	might be supported on the current system, you would need to look at	240	current system. To find which embeddable backends might be supported on
230	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	241	the current system, you would need to look at C<ev_embeddable_backends ()
231	recommended ones.	242	& ev_supported_backends ()>, likewise for recommended ones.
232		243
233	See the description of C<ev_embed> watchers for more info.	244	See the description of C<ev_embed> watchers for more info.
234		245
235	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]	246	=item ev_set_allocator (void *(*cb)(void *ptr, long size))
236		247
237	Sets the allocation function to use (the prototype is similar - the	248	Sets the allocation function to use (the prototype is similar - the
238	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is	249	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
239	used to allocate and free memory (no surprises here). If it returns zero	250	used to allocate and free memory (no surprises here). If it returns zero
240	when memory needs to be allocated (C<size != 0>), the library might abort	251	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
266	}	277	}
267		278
268	...	279	...
269	ev_set_allocator (persistent_realloc);	280	ev_set_allocator (persistent_realloc);
270		281
271	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]	282	=item ev_set_syserr_cb (void (*cb)(const char *msg))
272		283
273	Set the callback function to call on a retryable system call error (such	284	Set the callback function to call on a retryable system call error (such
274	as failed select, poll, epoll_wait). The message is a printable string	285	as failed select, poll, epoll_wait). The message is a printable string
275	indicating the system call or subsystem causing the problem. If this	286	indicating the system call or subsystem causing the problem. If this
276	callback is set, then libev will expect it to remedy the situation, no	287	callback is set, then libev will expect it to remedy the situation, no
…		…
288	}	299	}
289		300
290	...	301	...
291	ev_set_syserr_cb (fatal_error);	302	ev_set_syserr_cb (fatal_error);
292		303
		304	=item ev_feed_signal (int signum)
		305
		306	This function can be used to "simulate" a signal receive. It is completely
		307	safe to call this function at any time, from any context, including signal
		308	handlers or random threads.
		309
		310	Its main use is to customise signal handling in your process, especially
		311	in the presence of threads. For example, you could block signals
		312	by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
		313	creating any loops), and in one thread, use C<sigwait> or any other
		314	mechanism to wait for signals, then "deliver" them to libev by calling
		315	C<ev_feed_signal>.
		316
293	=back	317	=back
294		318
295	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	319	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
296		320
297	An event loop is described by a C<struct ev_loop *> (the C<struct>	321	An event loop is described by a C<struct ev_loop *> (the C<struct> is
298	is I<not> optional in this case, as there is also an C<ev_loop>	322	I<not> optional in this case unless libev 3 compatibility is disabled, as
299	I<function>).	323	libev 3 had an C<ev_loop> function colliding with the struct name).
300		324
301	The library knows two types of such loops, the I<default> loop, which	325	The library knows two types of such loops, the I<default> loop, which
302	supports signals and child events, and dynamically created loops which do	326	supports child process events, and dynamically created event loops which
303	not.	327	do not.
304		328
305	=over 4	329	=over 4
306		330
307	=item struct ev_loop *ev_default_loop (unsigned int flags)	331	=item struct ev_loop *ev_default_loop (unsigned int flags)
308		332
309	This will initialise the default event loop if it hasn't been initialised	333	This returns the "default" event loop object, which is what you should
310	yet and return it. If the default loop could not be initialised, returns	334	normally use when you just need "the event loop". Event loop objects and
311	false. If it already was initialised it simply returns it (and ignores the	335	the C<flags> parameter are described in more detail in the entry for
312	flags. If that is troubling you, check C<ev_backend ()> afterwards).	336	C<ev_loop_new>.
		337
		338	If the default loop is already initialised then this function simply
		339	returns it (and ignores the flags. If that is troubling you, check
		340	C<ev_backend ()> afterwards). Otherwise it will create it with the given
		341	flags, which should almost always be C<0>, unless the caller is also the
		342	one calling C<ev_run> or otherwise qualifies as "the main program".
313		343
314	If you don't know what event loop to use, use the one returned from this	344	If you don't know what event loop to use, use the one returned from this
315	function.	345	function (or via the C<EV_DEFAULT> macro).
316		346
317	Note that this function is I<not> thread-safe, so if you want to use it	347	Note that this function is I<not> thread-safe, so if you want to use it
318	from multiple threads, you have to lock (note also that this is unlikely,	348	from multiple threads, you have to employ some kind of mutex (note also
319	as loops cannot be shared easily between threads anyway).	349	that this case is unlikely, as loops cannot be shared easily between
		350	threads anyway).
320		351
321	The default loop is the only loop that can handle C<ev_signal> and	352	The default loop is the only loop that can handle C<ev_child> watchers,
322	C<ev_child> watchers, and to do this, it always registers a handler	353	and to do this, it always registers a handler for C<SIGCHLD>. If this is
323	for C<SIGCHLD>. If this is a problem for your application you can either	354	a problem for your application you can either create a dynamic loop with
324	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you	355	C<ev_loop_new> which doesn't do that, or you can simply overwrite the
325	can simply overwrite the C<SIGCHLD> signal handler I<after> calling	356	C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
326	C<ev_default_init>.	357
		358	Example: This is the most typical usage.
		359
		360	if (!ev_default_loop (0))
		361	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
		362
		363	Example: Restrict libev to the select and poll backends, and do not allow
		364	environment settings to be taken into account:
		365
		366	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
		367
		368	=item struct ev_loop *ev_loop_new (unsigned int flags)
		369
		370	This will create and initialise a new event loop object. If the loop
		371	could not be initialised, returns false.
		372
		373	This function is thread-safe, and one common way to use libev with
		374	threads is indeed to create one loop per thread, and using the default
		375	loop in the "main" or "initial" thread.
327		376
328	The flags argument can be used to specify special behaviour or specific	377	The flags argument can be used to specify special behaviour or specific
329	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	378	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
330		379
331	The following flags are supported:	380	The following flags are supported:
…		…
366	environment variable.	415	environment variable.
367		416
368	=item C<EVFLAG_NOINOTIFY>	417	=item C<EVFLAG_NOINOTIFY>
369		418
370	When this flag is specified, then libev will not attempt to use the	419	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	420	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	421	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.	422	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374		423
375	=item C<EVFLAG_SIGNALFD>	424	=item C<EVFLAG_SIGNALFD>
376		425
377	When this flag is specified, then libev will attempt to use the	426	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	427	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	428	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	429	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	430	handling with threads, as long as you properly block signals in your
382	threads that are not interested in handling them.	431	threads that are not interested in handling them.
383		432
384	Signalfd will not be used by default as this changes your signal mask, and	433	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	434	there are a lot of shoddy libraries and programs (glib's threadpool for
386	example) that can't properly initialise their signal masks.	435	example) that can't properly initialise their signal masks.
		436
		437	=item C<EVFLAG_NOSIGMASK>
		438
		439	When this flag is specified, then libev will avoid to modify the signal
		440	mask. Specifically, this means you ahve to make sure signals are unblocked
		441	when you want to receive them.
		442
		443	This behaviour is useful when you want to do your own signal handling, or
		444	want to handle signals only in specific threads and want to avoid libev
		445	unblocking the signals.
		446
		447	It's also required by POSIX in a threaded program, as libev calls
		448	C<sigprocmask>, whose behaviour is officially unspecified.
		449
		450	This flag's behaviour will become the default in future versions of libev.
387		451
388	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	452	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
389		453
390	This is your standard select(2) backend. Not I<completely> standard, as	454	This is your standard select(2) backend. Not I<completely> standard, as
391	libev tries to roll its own fd_set with no limits on the number of fds,	455	libev tries to roll its own fd_set with no limits on the number of fds,
…		…
427	epoll scales either O(1) or O(active_fds).	491	epoll scales either O(1) or O(active_fds).
428		492
429	The epoll mechanism deserves honorable mention as the most misdesigned	493	The epoll mechanism deserves honorable mention as the most misdesigned
430	of the more advanced event mechanisms: mere annoyances include silently	494	of the more advanced event mechanisms: mere annoyances include silently
431	dropping file descriptors, requiring a system call per change per file	495	dropping file descriptors, requiring a system call per change per file
432	descriptor (and unnecessary guessing of parameters), problems with dup and	496	descriptor (and unnecessary guessing of parameters), problems with dup,
		497	returning before the timeout value, resulting in additional iterations
		498	(and only giving 5ms accuracy while select on the same platform gives
433	so on. The biggest issue is fork races, however - if a program forks then	499	0.1ms) and so on. The biggest issue is fork races, however - if a program
434	I<both> parent and child process have to recreate the epoll set, which can	500	forks then I<both> parent and child process have to recreate the epoll
435	take considerable time (one syscall per file descriptor) and is of course	501	set, which can take considerable time (one syscall per file descriptor)
436	hard to detect.	502	and is of course hard to detect.
437		503
438	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	504	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
439	of course I<doesn't>, and epoll just loves to report events for totally	505	of course I<doesn't>, and epoll just loves to report events for totally
440	I<different> file descriptors (even already closed ones, so one cannot	506	I<different> file descriptors (even already closed ones, so one cannot
441	even remove them from the set) than registered in the set (especially	507	even remove them from the set) than registered in the set (especially
…		…
443	employing an additional generation counter and comparing that against the	509	employing an additional generation counter and comparing that against the
444	events to filter out spurious ones, recreating the set when required. Last	510	events to filter out spurious ones, recreating the set when required. Last
445	not least, it also refuses to work with some file descriptors which work	511	not least, it also refuses to work with some file descriptors which work
446	perfectly fine with C<select> (files, many character devices...).	512	perfectly fine with C<select> (files, many character devices...).
447		513
		514	Epoll is truly the train wreck analog among event poll mechanisms,
		515	a frankenpoll, cobbled together in a hurry, no thought to design or
		516	interaction with others.
		517
448	While stopping, setting and starting an I/O watcher in the same iteration	518	While stopping, setting and starting an I/O watcher in the same iteration
449	will result in some caching, there is still a system call per such	519	will result in some caching, there is still a system call per such
450	incident (because the same I<file descriptor> could point to a different	520	incident (because the same I<file descriptor> could point to a different
451	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	521	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
452	file descriptors might not work very well if you register events for both	522	file descriptors might not work very well if you register events for both
…		…
517	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	587	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
518		588
519	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	589	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
520	it's really slow, but it still scales very well (O(active_fds)).	590	it's really slow, but it still scales very well (O(active_fds)).
521		591
522	Please note that Solaris event ports can deliver a lot of spurious
523	notifications, so you need to use non-blocking I/O or other means to avoid
524	blocking when no data (or space) is available.
525
526	While this backend scales well, it requires one system call per active	592	While this backend scales well, it requires one system call per active
527	file descriptor per loop iteration. For small and medium numbers of file	593	file descriptor per loop iteration. For small and medium numbers of file
528	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	594	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
529	might perform better.	595	might perform better.
530		596
531	On the positive side, with the exception of the spurious readiness	597	On the positive side, this backend actually performed fully to
532	notifications, this backend actually performed fully to specification
533	in all tests and is fully embeddable, which is a rare feat among the	598	specification in all tests and is fully embeddable, which is a rare feat
534	OS-specific backends (I vastly prefer correctness over speed hacks).	599	among the OS-specific backends (I vastly prefer correctness over speed
		600	hacks).
		601
		602	On the negative side, the interface is I<bizarre> - so bizarre that
		603	even sun itself gets it wrong in their code examples: The event polling
		604	function sometimes returning events to the caller even though an error
		605	occurred, but with no indication whether it has done so or not (yes, it's
		606	even documented that way) - deadly for edge-triggered interfaces where
		607	you absolutely have to know whether an event occurred or not because you
		608	have to re-arm the watcher.
		609
		610	Fortunately libev seems to be able to work around these idiocies.
535		611
536	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	612	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
537	C<EVBACKEND_POLL>.	613	C<EVBACKEND_POLL>.
538		614
539	=item C<EVBACKEND_ALL>	615	=item C<EVBACKEND_ALL>
540		616
541	Try all backends (even potentially broken ones that wouldn't be tried	617	Try all backends (even potentially broken ones that wouldn't be tried
542	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	618	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
543	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	619	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
544		620
545	It is definitely not recommended to use this flag.	621	It is definitely not recommended to use this flag, use whatever
		622	C<ev_recommended_backends ()> returns, or simply do not specify a backend
		623	at all.
		624
		625	=item C<EVBACKEND_MASK>
		626
		627	Not a backend at all, but a mask to select all backend bits from a
		628	C<flags> value, in case you want to mask out any backends from a flags
		629	value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
546		630
547	=back	631	=back
548		632
549	If one or more of the backend flags are or'ed into the flags value,	633	If one or more of the backend flags are or'ed into the flags value,
550	then only these backends will be tried (in the reverse order as listed	634	then only these backends will be tried (in the reverse order as listed
551	here). If none are specified, all backends in C<ev_recommended_backends	635	here). If none are specified, all backends in C<ev_recommended_backends
552	()> will be tried.	636	()> will be tried.
553		637
554	Example: This is the most typical usage.
555
556	if (!ev_default_loop (0))
557	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
558
559	Example: Restrict libev to the select and poll backends, and do not allow
560	environment settings to be taken into account:
561
562	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
563
564	Example: Use whatever libev has to offer, but make sure that kqueue is
565	used if available (warning, breaks stuff, best use only with your own
566	private event loop and only if you know the OS supports your types of
567	fds):
568
569	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
570
571	=item struct ev_loop *ev_loop_new (unsigned int flags)
572
573	Similar to C<ev_default_loop>, but always creates a new event loop that is
574	always distinct from the default loop.
575
576	Note that this function I<is> thread-safe, and one common way to use
577	libev with threads is indeed to create one loop per thread, and using the
578	default loop in the "main" or "initial" thread.
579
580	Example: Try to create a event loop that uses epoll and nothing else.	638	Example: Try to create a event loop that uses epoll and nothing else.
581		639
582	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	640	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
583	if (!epoller)	641	if (!epoller)
584	fatal ("no epoll found here, maybe it hides under your chair");	642	fatal ("no epoll found here, maybe it hides under your chair");
585		643
		644	Example: Use whatever libev has to offer, but make sure that kqueue is
		645	used if available.
		646
		647	struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
		648
586	=item ev_default_destroy ()	649	=item ev_loop_destroy (loop)
587		650
588	Destroys the default loop (frees all memory and kernel state etc.). None	651	Destroys an event loop object (frees all memory and kernel state
589	of the active event watchers will be stopped in the normal sense, so	652	etc.). None of the active event watchers will be stopped in the normal
590	e.g. C<ev_is_active> might still return true. It is your responsibility to	653	sense, so e.g. C<ev_is_active> might still return true. It is your
591	either stop all watchers cleanly yourself I<before> calling this function,	654	responsibility to either stop all watchers cleanly yourself I<before>
592	or cope with the fact afterwards (which is usually the easiest thing, you	655	calling this function, or cope with the fact afterwards (which is usually
593	can just ignore the watchers and/or C<free ()> them for example).	656	the easiest thing, you can just ignore the watchers and/or C<free ()> them
		657	for example).
594		658
595	Note that certain global state, such as signal state (and installed signal	659	Note that certain global state, such as signal state (and installed signal
596	handlers), will not be freed by this function, and related watchers (such	660	handlers), will not be freed by this function, and related watchers (such
597	as signal and child watchers) would need to be stopped manually.	661	as signal and child watchers) would need to be stopped manually.
598		662
599	In general it is not advisable to call this function except in the	663	This function is normally used on loop objects allocated by
600	rare occasion where you really need to free e.g. the signal handling	664	C<ev_loop_new>, but it can also be used on the default loop returned by
		665	C<ev_default_loop>, in which case it is not thread-safe.
		666
		667	Note that it is not advisable to call this function on the default loop
		668	except in the rare occasion where you really need to free its resources.
601	pipe fds. If you need dynamically allocated loops it is better to use	669	If you need dynamically allocated loops it is better to use C<ev_loop_new>
602	C<ev_loop_new> and C<ev_loop_destroy>.	670	and C<ev_loop_destroy>.
603		671
604	=item ev_loop_destroy (loop)	672	=item ev_loop_fork (loop)
605		673
606	Like C<ev_default_destroy>, but destroys an event loop created by an
607	earlier call to C<ev_loop_new>.
608
609	=item ev_default_fork ()
610
611	This function sets a flag that causes subsequent C<ev_loop> iterations	674	This function sets a flag that causes subsequent C<ev_run> iterations to
612	to reinitialise the kernel state for backends that have one. Despite the	675	reinitialise the kernel state for backends that have one. Despite the
613	name, you can call it anytime, but it makes most sense after forking, in	676	name, you can call it anytime, but it makes most sense after forking, in
614	the child process (or both child and parent, but that again makes little	677	the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
615	sense). You I<must> call it in the child before using any of the libev	678	child before resuming or calling C<ev_run>.
616	functions, and it will only take effect at the next C<ev_loop> iteration.
617		679
618	Again, you I<have> to call it on I<any> loop that you want to re-use after	680	Again, you I<have> to call it on I<any> loop that you want to re-use after
619	a fork, I<even if you do not plan to use the loop in the parent>. This is	681	a fork, I<even if you do not plan to use the loop in the parent>. This is
620	because some kernel interfaces *cough* I<kqueue> *cough* do funny things	682	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
621	during fork.	683	during fork.
622		684
623	On the other hand, you only need to call this function in the child	685	On the other hand, you only need to call this function in the child
624	process if and only if you want to use the event loop in the child. If you	686	process if and only if you want to use the event loop in the child. If
625	just fork+exec or create a new loop in the child, you don't have to call	687	you just fork+exec or create a new loop in the child, you don't have to
626	it at all.	688	call it at all (in fact, C<epoll> is so badly broken that it makes a
		689	difference, but libev will usually detect this case on its own and do a
		690	costly reset of the backend).
627		691
628	The function itself is quite fast and it's usually not a problem to call	692	The function itself is quite fast and it's usually not a problem to call
629	it just in case after a fork. To make this easy, the function will fit in	693	it just in case after a fork.
630	quite nicely into a call to C<pthread_atfork>:
631		694
		695	Example: Automate calling C<ev_loop_fork> on the default loop when
		696	using pthreads.
		697
		698	static void
		699	post_fork_child (void)
		700	{
		701	ev_loop_fork (EV_DEFAULT);
		702	}
		703
		704	...
632	pthread_atfork (0, 0, ev_default_fork);	705	pthread_atfork (0, 0, post_fork_child);
633
634	=item ev_loop_fork (loop)
635
636	Like C<ev_default_fork>, but acts on an event loop created by
637	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
638	after fork that you want to re-use in the child, and how you keep track of
639	them is entirely your own problem.
640		706
641	=item int ev_is_default_loop (loop)	707	=item int ev_is_default_loop (loop)
642		708
643	Returns true when the given loop is, in fact, the default loop, and false	709	Returns true when the given loop is, in fact, the default loop, and false
644	otherwise.	710	otherwise.
645		711
646	=item unsigned int ev_iteration (loop)	712	=item unsigned int ev_iteration (loop)
647		713
648	Returns the current iteration count for the loop, which is identical to	714	Returns the current iteration count for the event loop, which is identical
649	the number of times libev did poll for new events. It starts at C<0> and	715	to the number of times libev did poll for new events. It starts at C<0>
650	happily wraps around with enough iterations.	716	and happily wraps around with enough iterations.
651		717
652	This value can sometimes be useful as a generation counter of sorts (it	718	This value can sometimes be useful as a generation counter of sorts (it
653	"ticks" the number of loop iterations), as it roughly corresponds with	719	"ticks" the number of loop iterations), as it roughly corresponds with
654	C<ev_prepare> and C<ev_check> calls - and is incremented between the	720	C<ev_prepare> and C<ev_check> calls - and is incremented between the
655	prepare and check phases.	721	prepare and check phases.
656		722
657	=item unsigned int ev_depth (loop)	723	=item unsigned int ev_depth (loop)
658		724
659	Returns the number of times C<ev_loop> was entered minus the number of	725	Returns the number of times C<ev_run> was entered minus the number of
660	times C<ev_loop> was exited, in other words, the recursion depth.	726	times C<ev_run> was exited normally, in other words, the recursion depth.
661		727
662	Outside C<ev_loop>, this number is zero. In a callback, this number is	728	Outside C<ev_run>, this number is zero. In a callback, this number is
663	C<1>, unless C<ev_loop> was invoked recursively (or from another thread),	729	C<1>, unless C<ev_run> was invoked recursively (or from another thread),
664	in which case it is higher.	730	in which case it is higher.
665		731
666	Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread	732	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
667	etc.), doesn't count as "exit" - consider this as a hint to avoid such	733	throwing an exception etc.), doesn't count as "exit" - consider this
668	ungentleman behaviour unless it's really convenient.	734	as a hint to avoid such ungentleman-like behaviour unless it's really
		735	convenient, in which case it is fully supported.
669		736
670	=item unsigned int ev_backend (loop)	737	=item unsigned int ev_backend (loop)
671		738
672	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	739	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
673	use.	740	use.
…		…
682		749
683	=item ev_now_update (loop)	750	=item ev_now_update (loop)
684		751
685	Establishes the current time by querying the kernel, updating the time	752	Establishes the current time by querying the kernel, updating the time
686	returned by C<ev_now ()> in the progress. This is a costly operation and	753	returned by C<ev_now ()> in the progress. This is a costly operation and
687	is usually done automatically within C<ev_loop ()>.	754	is usually done automatically within C<ev_run ()>.
688		755
689	This function is rarely useful, but when some event callback runs for a	756	This function is rarely useful, but when some event callback runs for a
690	very long time without entering the event loop, updating libev's idea of	757	very long time without entering the event loop, updating libev's idea of
691	the current time is a good idea.	758	the current time is a good idea.
692		759
…		…
694		761
695	=item ev_suspend (loop)	762	=item ev_suspend (loop)
696		763
697	=item ev_resume (loop)	764	=item ev_resume (loop)
698		765
699	These two functions suspend and resume a loop, for use when the loop is	766	These two functions suspend and resume an event loop, for use when the
700	not used for a while and timeouts should not be processed.	767	loop is not used for a while and timeouts should not be processed.
701		768
702	A typical use case would be an interactive program such as a game: When	769	A typical use case would be an interactive program such as a game: When
703	the user presses C<^Z> to suspend the game and resumes it an hour later it	770	the user presses C<^Z> to suspend the game and resumes it an hour later it
704	would be best to handle timeouts as if no time had actually passed while	771	would be best to handle timeouts as if no time had actually passed while
705	the program was suspended. This can be achieved by calling C<ev_suspend>	772	the program was suspended. This can be achieved by calling C<ev_suspend>
…		…
716	without a previous call to C<ev_suspend>.	783	without a previous call to C<ev_suspend>.
717		784
718	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	785	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
719	event loop time (see C<ev_now_update>).	786	event loop time (see C<ev_now_update>).
720		787
721	=item ev_loop (loop, int flags)	788	=item ev_run (loop, int flags)
722		789
723	Finally, this is it, the event handler. This function usually is called	790	Finally, this is it, the event handler. This function usually is called
724	after you have initialised all your watchers and you want to start	791	after you have initialised all your watchers and you want to start
725	handling events.	792	handling events. It will ask the operating system for any new events, call
		793	the watcher callbacks, an then repeat the whole process indefinitely: This
		794	is why event loops are called I<loops>.
726		795
727	If the flags argument is specified as C<0>, it will not return until	796	If the flags argument is specified as C<0>, it will keep handling events
728	either no event watchers are active anymore or C<ev_unloop> was called.	797	until either no event watchers are active anymore or C<ev_break> was
		798	called.
729		799
730	Please note that an explicit C<ev_unloop> is usually better than	800	Please note that an explicit C<ev_break> is usually better than
731	relying on all watchers to be stopped when deciding when a program has	801	relying on all watchers to be stopped when deciding when a program has
732	finished (especially in interactive programs), but having a program	802	finished (especially in interactive programs), but having a program
733	that automatically loops as long as it has to and no longer by virtue	803	that automatically loops as long as it has to and no longer by virtue
734	of relying on its watchers stopping correctly, that is truly a thing of	804	of relying on its watchers stopping correctly, that is truly a thing of
735	beauty.	805	beauty.
736		806
		807	This function is also I<mostly> exception-safe - you can break out of
		808	a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
		809	exception and so on. This does not decrement the C<ev_depth> value, nor
		810	will it clear any outstanding C<EVBREAK_ONE> breaks.
		811
737	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	812	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
738	those events and any already outstanding ones, but will not block your	813	those events and any already outstanding ones, but will not wait and
739	process in case there are no events and will return after one iteration of	814	block your process in case there are no events and will return after one
740	the loop.	815	iteration of the loop. This is sometimes useful to poll and handle new
		816	events while doing lengthy calculations, to keep the program responsive.
741		817
742	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	818	A flags value of C<EVRUN_ONCE> will look for new events (waiting if
743	necessary) and will handle those and any already outstanding ones. It	819	necessary) and will handle those and any already outstanding ones. It
744	will block your process until at least one new event arrives (which could	820	will block your process until at least one new event arrives (which could
745	be an event internal to libev itself, so there is no guarantee that a	821	be an event internal to libev itself, so there is no guarantee that a
746	user-registered callback will be called), and will return after one	822	user-registered callback will be called), and will return after one
747	iteration of the loop.	823	iteration of the loop.
748		824
749	This is useful if you are waiting for some external event in conjunction	825	This is useful if you are waiting for some external event in conjunction
750	with something not expressible using other libev watchers (i.e. "roll your	826	with something not expressible using other libev watchers (i.e. "roll your
751	own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	827	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
752	usually a better approach for this kind of thing.	828	usually a better approach for this kind of thing.
753		829
754	Here are the gory details of what C<ev_loop> does:	830	Here are the gory details of what C<ev_run> does:
755		831
		832	- Increment loop depth.
		833	- Reset the ev_break status.
756	- Before the first iteration, call any pending watchers.	834	- Before the first iteration, call any pending watchers.
		835	LOOP:
757	* If EVFLAG_FORKCHECK was used, check for a fork.	836	- If EVFLAG_FORKCHECK was used, check for a fork.
758	- If a fork was detected (by any means), queue and call all fork watchers.	837	- If a fork was detected (by any means), queue and call all fork watchers.
759	- Queue and call all prepare watchers.	838	- Queue and call all prepare watchers.
		839	- If ev_break was called, goto FINISH.
760	- If we have been forked, detach and recreate the kernel state	840	- If we have been forked, detach and recreate the kernel state
761	as to not disturb the other process.	841	as to not disturb the other process.
762	- Update the kernel state with all outstanding changes.	842	- Update the kernel state with all outstanding changes.
763	- Update the "event loop time" (ev_now ()).	843	- Update the "event loop time" (ev_now ()).
764	- Calculate for how long to sleep or block, if at all	844	- Calculate for how long to sleep or block, if at all
765	(active idle watchers, EVLOOP_NONBLOCK or not having	845	(active idle watchers, EVRUN_NOWAIT or not having
766	any active watchers at all will result in not sleeping).	846	any active watchers at all will result in not sleeping).
767	- Sleep if the I/O and timer collect interval say so.	847	- Sleep if the I/O and timer collect interval say so.
		848	- Increment loop iteration counter.
768	- Block the process, waiting for any events.	849	- Block the process, waiting for any events.
769	- Queue all outstanding I/O (fd) events.	850	- Queue all outstanding I/O (fd) events.
770	- Update the "event loop time" (ev_now ()), and do time jump adjustments.	851	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
771	- Queue all expired timers.	852	- Queue all expired timers.
772	- Queue all expired periodics.	853	- Queue all expired periodics.
773	- Unless any events are pending now, queue all idle watchers.	854	- Queue all idle watchers with priority higher than that of pending events.
774	- Queue all check watchers.	855	- Queue all check watchers.
775	- Call all queued watchers in reverse order (i.e. check watchers first).	856	- Call all queued watchers in reverse order (i.e. check watchers first).
776	Signals and child watchers are implemented as I/O watchers, and will	857	Signals and child watchers are implemented as I/O watchers, and will
777	be handled here by queueing them when their watcher gets executed.	858	be handled here by queueing them when their watcher gets executed.
778	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	859	- If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
779	were used, or there are no active watchers, return, otherwise	860	were used, or there are no active watchers, goto FINISH, otherwise
780	continue with step *.	861	continue with step LOOP.
		862	FINISH:
		863	- Reset the ev_break status iff it was EVBREAK_ONE.
		864	- Decrement the loop depth.
		865	- Return.
781		866
782	Example: Queue some jobs and then loop until no events are outstanding	867	Example: Queue some jobs and then loop until no events are outstanding
783	anymore.	868	anymore.
784		869
785	... queue jobs here, make sure they register event watchers as long	870	... queue jobs here, make sure they register event watchers as long
786	... as they still have work to do (even an idle watcher will do..)	871	... as they still have work to do (even an idle watcher will do..)
787	ev_loop (my_loop, 0);	872	ev_run (my_loop, 0);
788	... jobs done or somebody called unloop. yeah!	873	... jobs done or somebody called break. yeah!
789		874
790	=item ev_unloop (loop, how)	875	=item ev_break (loop, how)
791		876
792	Can be used to make a call to C<ev_loop> return early (but only after it	877	Can be used to make a call to C<ev_run> return early (but only after it
793	has processed all outstanding events). The C<how> argument must be either	878	has processed all outstanding events). The C<how> argument must be either
794	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	879	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
795	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	880	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
796		881
797	This "unloop state" will be cleared when entering C<ev_loop> again.	882	This "break state" will be cleared on the next call to C<ev_run>.
798		883
799	It is safe to call C<ev_unloop> from outside any C<ev_loop> calls.	884	It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
		885	which case it will have no effect.
800		886
801	=item ev_ref (loop)	887	=item ev_ref (loop)
802		888
803	=item ev_unref (loop)	889	=item ev_unref (loop)
804		890
805	Ref/unref can be used to add or remove a reference count on the event	891	Ref/unref can be used to add or remove a reference count on the event
806	loop: Every watcher keeps one reference, and as long as the reference	892	loop: Every watcher keeps one reference, and as long as the reference
807	count is nonzero, C<ev_loop> will not return on its own.	893	count is nonzero, C<ev_run> will not return on its own.
808		894
809	This is useful when you have a watcher that you never intend to	895	This is useful when you have a watcher that you never intend to
810	unregister, but that nevertheless should not keep C<ev_loop> from	896	unregister, but that nevertheless should not keep C<ev_run> from
811	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>	897	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
812	before stopping it.	898	before stopping it.
813		899
814	As an example, libev itself uses this for its internal signal pipe: It	900	As an example, libev itself uses this for its internal signal pipe: It
815	is not visible to the libev user and should not keep C<ev_loop> from	901	is not visible to the libev user and should not keep C<ev_run> from
816	exiting if no event watchers registered by it are active. It is also an	902	exiting if no event watchers registered by it are active. It is also an
817	excellent way to do this for generic recurring timers or from within	903	excellent way to do this for generic recurring timers or from within
818	third-party libraries. Just remember to I<unref after start> and I<ref	904	third-party libraries. Just remember to I<unref after start> and I<ref
819	before stop> (but only if the watcher wasn't active before, or was active	905	before stop> (but only if the watcher wasn't active before, or was active
820	before, respectively. Note also that libev might stop watchers itself	906	before, respectively. Note also that libev might stop watchers itself
821	(e.g. non-repeating timers) in which case you have to C<ev_ref>	907	(e.g. non-repeating timers) in which case you have to C<ev_ref>
822	in the callback).	908	in the callback).
823		909
824	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	910	Example: Create a signal watcher, but keep it from keeping C<ev_run>
825	running when nothing else is active.	911	running when nothing else is active.
826		912
827	ev_signal exitsig;	913	ev_signal exitsig;
828	ev_signal_init (&exitsig, sig_cb, SIGINT);	914	ev_signal_init (&exitsig, sig_cb, SIGINT);
829	ev_signal_start (loop, &exitsig);	915	ev_signal_start (loop, &exitsig);
830	evf_unref (loop);	916	ev_unref (loop);
831		917
832	Example: For some weird reason, unregister the above signal handler again.	918	Example: For some weird reason, unregister the above signal handler again.
833		919
834	ev_ref (loop);	920	ev_ref (loop);
835	ev_signal_stop (loop, &exitsig);	921	ev_signal_stop (loop, &exitsig);
…		…
892	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);	978	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
893		979
894	=item ev_invoke_pending (loop)	980	=item ev_invoke_pending (loop)
895		981
896	This call will simply invoke all pending watchers while resetting their	982	This call will simply invoke all pending watchers while resetting their
897	pending state. Normally, C<ev_loop> does this automatically when required,	983	pending state. Normally, C<ev_run> does this automatically when required,
898	but when overriding the invoke callback this call comes handy.	984	but when overriding the invoke callback this call comes handy. This
		985	function can be invoked from a watcher - this can be useful for example
		986	when you want to do some lengthy calculation and want to pass further
		987	event handling to another thread (you still have to make sure only one
		988	thread executes within C<ev_invoke_pending> or C<ev_run> of course).
899		989
900	=item int ev_pending_count (loop)	990	=item int ev_pending_count (loop)
901		991
902	Returns the number of pending watchers - zero indicates that no watchers	992	Returns the number of pending watchers - zero indicates that no watchers
903	are pending.	993	are pending.
904		994
905	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))	995	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
906		996
907	This overrides the invoke pending functionality of the loop: Instead of	997	This overrides the invoke pending functionality of the loop: Instead of
908	invoking all pending watchers when there are any, C<ev_loop> will call	998	invoking all pending watchers when there are any, C<ev_run> will call
909	this callback instead. This is useful, for example, when you want to	999	this callback instead. This is useful, for example, when you want to
910	invoke the actual watchers inside another context (another thread etc.).	1000	invoke the actual watchers inside another context (another thread etc.).
911		1001
912	If you want to reset the callback, use C<ev_invoke_pending> as new	1002	If you want to reset the callback, use C<ev_invoke_pending> as new
913	callback.	1003	callback.
…		…
916		1006
917	Sometimes you want to share the same loop between multiple threads. This	1007	Sometimes you want to share the same loop between multiple threads. This
918	can be done relatively simply by putting mutex_lock/unlock calls around	1008	can be done relatively simply by putting mutex_lock/unlock calls around
919	each call to a libev function.	1009	each call to a libev function.
920		1010
921	However, C<ev_loop> can run an indefinite time, so it is not feasible to	1011	However, C<ev_run> can run an indefinite time, so it is not feasible
922	wait for it to return. One way around this is to wake up the loop via	1012	to wait for it to return. One way around this is to wake up the event
923	C<ev_unloop> and C<av_async_send>, another way is to set these I<release>	1013	loop via C<ev_break> and C<av_async_send>, another way is to set these
924	and I<acquire> callbacks on the loop.	1014	I<release> and I<acquire> callbacks on the loop.
925		1015
926	When set, then C<release> will be called just before the thread is	1016	When set, then C<release> will be called just before the thread is
927	suspended waiting for new events, and C<acquire> is called just	1017	suspended waiting for new events, and C<acquire> is called just
928	afterwards.	1018	afterwards.
929		1019
…		…
932		1022
933	While event loop modifications are allowed between invocations of	1023	While event loop modifications are allowed between invocations of
934	C<release> and C<acquire> (that's their only purpose after all), no	1024	C<release> and C<acquire> (that's their only purpose after all), no
935	modifications done will affect the event loop, i.e. adding watchers will	1025	modifications done will affect the event loop, i.e. adding watchers will
936	have no effect on the set of file descriptors being watched, or the time	1026	have no effect on the set of file descriptors being watched, or the time
937	waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it	1027	waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
938	to take note of any changes you made.	1028	to take note of any changes you made.
939		1029
940	In theory, threads executing C<ev_loop> will be async-cancel safe between	1030	In theory, threads executing C<ev_run> will be async-cancel safe between
941	invocations of C<release> and C<acquire>.	1031	invocations of C<release> and C<acquire>.
942		1032
943	See also the locking example in the C<THREADS> section later in this	1033	See also the locking example in the C<THREADS> section later in this
944	document.	1034	document.
945		1035
946	=item ev_set_userdata (loop, void *data)	1036	=item ev_set_userdata (loop, void *data)
947		1037
948	=item ev_userdata (loop)	1038	=item void *ev_userdata (loop)
949		1039
950	Set and retrieve a single C<void *> associated with a loop. When	1040	Set and retrieve a single C<void *> associated with a loop. When
951	C<ev_set_userdata> has never been called, then C<ev_userdata> returns	1041	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
952	C<0.>	1042	C<0>.
953		1043
954	These two functions can be used to associate arbitrary data with a loop,	1044	These two functions can be used to associate arbitrary data with a loop,
955	and are intended solely for the C<invoke_pending_cb>, C<release> and	1045	and are intended solely for the C<invoke_pending_cb>, C<release> and
956	C<acquire> callbacks described above, but of course can be (ab-)used for	1046	C<acquire> callbacks described above, but of course can be (ab-)used for
957	any other purpose as well.	1047	any other purpose as well.
…		…
975		1065
976	In the following description, uppercase C<TYPE> in names stands for the	1066	In the following description, uppercase C<TYPE> in names stands for the
977	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer	1067	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
978	watchers and C<ev_io_start> for I/O watchers.	1068	watchers and C<ev_io_start> for I/O watchers.
979		1069
980	A watcher is a structure that you create and register to record your	1070	A watcher is an opaque structure that you allocate and register to record
981	interest in some event. For instance, if you want to wait for STDIN to	1071	your interest in some event. To make a concrete example, imagine you want
982	become readable, you would create an C<ev_io> watcher for that:	1072	to wait for STDIN to become readable, you would create an C<ev_io> watcher
		1073	for that:
983		1074
984	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)	1075	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
985	{	1076	{
986	ev_io_stop (w);	1077	ev_io_stop (w);
987	ev_unloop (loop, EVUNLOOP_ALL);	1078	ev_break (loop, EVBREAK_ALL);
988	}	1079	}
989		1080
990	struct ev_loop *loop = ev_default_loop (0);	1081	struct ev_loop *loop = ev_default_loop (0);
991		1082
992	ev_io stdin_watcher;	1083	ev_io stdin_watcher;
993		1084
994	ev_init (&stdin_watcher, my_cb);	1085	ev_init (&stdin_watcher, my_cb);
995	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	1086	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
996	ev_io_start (loop, &stdin_watcher);	1087	ev_io_start (loop, &stdin_watcher);
997		1088
998	ev_loop (loop, 0);	1089	ev_run (loop, 0);
999		1090
1000	As you can see, you are responsible for allocating the memory for your	1091	As you can see, you are responsible for allocating the memory for your
1001	watcher structures (and it is I<usually> a bad idea to do this on the	1092	watcher structures (and it is I<usually> a bad idea to do this on the
1002	stack).	1093	stack).
1003		1094
1004	Each watcher has an associated watcher structure (called C<struct ev_TYPE>	1095	Each watcher has an associated watcher structure (called C<struct ev_TYPE>
1005	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).	1096	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
1006		1097
1007	Each watcher structure must be initialised by a call to C<ev_init	1098	Each watcher structure must be initialised by a call to C<ev_init (watcher
1008	(watcher *, callback)>, which expects a callback to be provided. This	1099	*, callback)>, which expects a callback to be provided. This callback is
1009	callback gets invoked each time the event occurs (or, in the case of I/O	1100	invoked each time the event occurs (or, in the case of I/O watchers, each
1010	watchers, each time the event loop detects that the file descriptor given	1101	time the event loop detects that the file descriptor given is readable
1011	is readable and/or writable).	1102	and/or writable).
1012		1103
1013	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>	1104	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
1014	macro to configure it, with arguments specific to the watcher type. There	1105	macro to configure it, with arguments specific to the watcher type. There
1015	is also a macro to combine initialisation and setting in one call: C<<	1106	is also a macro to combine initialisation and setting in one call: C<<
1016	ev_TYPE_init (watcher *, callback, ...) >>.	1107	ev_TYPE_init (watcher *, callback, ...) >>.
…		…
1067		1158
1068	=item C<EV_PREPARE>	1159	=item C<EV_PREPARE>
1069		1160
1070	=item C<EV_CHECK>	1161	=item C<EV_CHECK>
1071		1162
1072	All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts	1163	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
1073	to gather new events, and all C<ev_check> watchers are invoked just after	1164	to gather new events, and all C<ev_check> watchers are invoked just after
1074	C<ev_loop> has gathered them, but before it invokes any callbacks for any	1165	C<ev_run> has gathered them, but before it invokes any callbacks for any
1075	received events. Callbacks of both watcher types can start and stop as	1166	received events. Callbacks of both watcher types can start and stop as
1076	many watchers as they want, and all of them will be taken into account	1167	many watchers as they want, and all of them will be taken into account
1077	(for example, a C<ev_prepare> watcher might start an idle watcher to keep	1168	(for example, a C<ev_prepare> watcher might start an idle watcher to keep
1078	C<ev_loop> from blocking).	1169	C<ev_run> from blocking).
1079		1170
1080	=item C<EV_EMBED>	1171	=item C<EV_EMBED>
1081		1172
1082	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1173	The embedded event loop specified in the C<ev_embed> watcher needs attention.
1083		1174
1084	=item C<EV_FORK>	1175	=item C<EV_FORK>
1085		1176
1086	The event loop has been resumed in the child process after fork (see	1177	The event loop has been resumed in the child process after fork (see
1087	C<ev_fork>).	1178	C<ev_fork>).
		1179
		1180	=item C<EV_CLEANUP>
		1181
		1182	The event loop is about to be destroyed (see C<ev_cleanup>).
1088		1183
1089	=item C<EV_ASYNC>	1184	=item C<EV_ASYNC>
1090		1185
1091	The given async watcher has been asynchronously notified (see C<ev_async>).	1186	The given async watcher has been asynchronously notified (see C<ev_async>).
1092		1187
…		…
1265	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1360	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1266	functions that do not need a watcher.	1361	functions that do not need a watcher.
1267		1362
1268	=back	1363	=back
1269		1364
		1365	See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
		1366	OWN COMPOSITE WATCHERS> idioms.
1270		1367
1271	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1368	=head2 WATCHER STATES
1272		1369
1273	Each watcher has, by default, a member C<void *data> that you can change	1370	There are various watcher states mentioned throughout this manual -
1274	and read at any time: libev will completely ignore it. This can be used	1371	active, pending and so on. In this section these states and the rules to
1275	to associate arbitrary data with your watcher. If you need more data and	1372	transition between them will be described in more detail - and while these
1276	don't want to allocate memory and store a pointer to it in that data	1373	rules might look complicated, they usually do "the right thing".
1277	member, you can also "subclass" the watcher type and provide your own
1278	data:
1279		1374
1280	struct my_io	1375	=over 4
1281	{
1282	ev_io io;
1283	int otherfd;
1284	void *somedata;
1285	struct whatever *mostinteresting;
1286	};
1287		1376
1288	...	1377	=item initialiased
1289	struct my_io w;
1290	ev_io_init (&w.io, my_cb, fd, EV_READ);
1291		1378
1292	And since your callback will be called with a pointer to the watcher, you	1379	Before a watcher can be registered with the event looop it has to be
1293	can cast it back to your own type:	1380	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
		1381	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1294		1382
1295	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)	1383	In this state it is simply some block of memory that is suitable for
1296	{	1384	use in an event loop. It can be moved around, freed, reused etc. at
1297	struct my_io *w = (struct my_io *)w_;	1385	will - as long as you either keep the memory contents intact, or call
1298	...	1386	C<ev_TYPE_init> again.
1299	}
1300		1387
1301	More interesting and less C-conformant ways of casting your callback type	1388	=item started/running/active
1302	instead have been omitted.
1303		1389
1304	Another common scenario is to use some data structure with multiple	1390	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1305	embedded watchers:	1391	property of the event loop, and is actively waiting for events. While in
		1392	this state it cannot be accessed (except in a few documented ways), moved,
		1393	freed or anything else - the only legal thing is to keep a pointer to it,
		1394	and call libev functions on it that are documented to work on active watchers.
1306		1395
1307	struct my_biggy	1396	=item pending
1308	{
1309	int some_data;
1310	ev_timer t1;
1311	ev_timer t2;
1312	}
1313		1397
1314	In this case getting the pointer to C<my_biggy> is a bit more	1398	If a watcher is active and libev determines that an event it is interested
1315	complicated: Either you store the address of your C<my_biggy> struct	1399	in has occurred (such as a timer expiring), it will become pending. It will
1316	in the C<data> member of the watcher (for woozies), or you need to use	1400	stay in this pending state until either it is stopped or its callback is
1317	some pointer arithmetic using C<offsetof> inside your watchers (for real	1401	about to be invoked, so it is not normally pending inside the watcher
1318	programmers):	1402	callback.
1319		1403
1320	#include <stddef.h>	1404	The watcher might or might not be active while it is pending (for example,
		1405	an expired non-repeating timer can be pending but no longer active). If it
		1406	is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
		1407	but it is still property of the event loop at this time, so cannot be
		1408	moved, freed or reused. And if it is active the rules described in the
		1409	previous item still apply.
1321		1410
1322	static void	1411	It is also possible to feed an event on a watcher that is not active (e.g.
1323	t1_cb (EV_P_ ev_timer *w, int revents)	1412	via C<ev_feed_event>), in which case it becomes pending without being
1324	{	1413	active.
1325	struct my_biggy big = (struct my_biggy *)
1326	(((char *)w) - offsetof (struct my_biggy, t1));
1327	}
1328		1414
1329	static void	1415	=item stopped
1330	t2_cb (EV_P_ ev_timer *w, int revents)	1416
1331	{	1417	A watcher can be stopped implicitly by libev (in which case it might still
1332	struct my_biggy big = (struct my_biggy *)	1418	be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1333	(((char *)w) - offsetof (struct my_biggy, t2));	1419	latter will clear any pending state the watcher might be in, regardless
1334	}	1420	of whether it was active or not, so stopping a watcher explicitly before
		1421	freeing it is often a good idea.
		1422
		1423	While stopped (and not pending) the watcher is essentially in the
		1424	initialised state, that is, it can be reused, moved, modified in any way
		1425	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1426	it again).
		1427
		1428	=back
1335		1429
1336	=head2 WATCHER PRIORITY MODELS	1430	=head2 WATCHER PRIORITY MODELS
1337		1431
1338	Many event loops support I<watcher priorities>, which are usually small	1432	Many event loops support I<watcher priorities>, which are usually small
1339	integers that influence the ordering of event callback invocation	1433	integers that influence the ordering of event callback invocation
…		…
1466	In general you can register as many read and/or write event watchers per	1560	In general you can register as many read and/or write event watchers per
1467	fd as you want (as long as you don't confuse yourself). Setting all file	1561	fd as you want (as long as you don't confuse yourself). Setting all file
1468	descriptors to non-blocking mode is also usually a good idea (but not	1562	descriptors to non-blocking mode is also usually a good idea (but not
1469	required if you know what you are doing).	1563	required if you know what you are doing).
1470		1564
1471	If you cannot use non-blocking mode, then force the use of a
1472	known-to-be-good backend (at the time of this writing, this includes only
1473	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1474	descriptors for which non-blocking operation makes no sense (such as
1475	files) - libev doesn't guarantee any specific behaviour in that case.
1476
1477	Another thing you have to watch out for is that it is quite easy to	1565	Another thing you have to watch out for is that it is quite easy to
1478	receive "spurious" readiness notifications, that is your callback might	1566	receive "spurious" readiness notifications, that is, your callback might
1479	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1567	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1480	because there is no data. Not only are some backends known to create a	1568	because there is no data. It is very easy to get into this situation even
1481	lot of those (for example Solaris ports), it is very easy to get into	1569	with a relatively standard program structure. Thus it is best to always
1482	this situation even with a relatively standard program structure. Thus	1570	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1483	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1484	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1571	preferable to a program hanging until some data arrives.
1485		1572
1486	If you cannot run the fd in non-blocking mode (for example you should	1573	If you cannot run the fd in non-blocking mode (for example you should
1487	not play around with an Xlib connection), then you have to separately	1574	not play around with an Xlib connection), then you have to separately
1488	re-test whether a file descriptor is really ready with a known-to-be good	1575	re-test whether a file descriptor is really ready with a known-to-be good
1489	interface such as poll (fortunately in our Xlib example, Xlib already	1576	interface such as poll (fortunately in the case of Xlib, it already does
1490	does this on its own, so its quite safe to use). Some people additionally	1577	this on its own, so its quite safe to use). Some people additionally
1491	use C<SIGALRM> and an interval timer, just to be sure you won't block	1578	use C<SIGALRM> and an interval timer, just to be sure you won't block
1492	indefinitely.	1579	indefinitely.
1493		1580
1494	But really, best use non-blocking mode.	1581	But really, best use non-blocking mode.
1495		1582
…		…
1523		1610
1524	There is no workaround possible except not registering events	1611	There is no workaround possible except not registering events
1525	for potentially C<dup ()>'ed file descriptors, or to resort to	1612	for potentially C<dup ()>'ed file descriptors, or to resort to
1526	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1613	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1527		1614
		1615	=head3 The special problem of files
		1616
		1617	Many people try to use C<select> (or libev) on file descriptors
		1618	representing files, and expect it to become ready when their program
		1619	doesn't block on disk accesses (which can take a long time on their own).
		1620
		1621	However, this cannot ever work in the "expected" way - you get a readiness
		1622	notification as soon as the kernel knows whether and how much data is
		1623	there, and in the case of open files, that's always the case, so you
		1624	always get a readiness notification instantly, and your read (or possibly
		1625	write) will still block on the disk I/O.
		1626
		1627	Another way to view it is that in the case of sockets, pipes, character
		1628	devices and so on, there is another party (the sender) that delivers data
		1629	on its own, but in the case of files, there is no such thing: the disk
		1630	will not send data on its own, simply because it doesn't know what you
		1631	wish to read - you would first have to request some data.
		1632
		1633	Since files are typically not-so-well supported by advanced notification
		1634	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1635	to files, even though you should not use it. The reason for this is
		1636	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1637	usually a tty, often a pipe, but also sometimes files or special devices
		1638	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1639	F</dev/urandom>), and even though the file might better be served with
		1640	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1641	it "just works" instead of freezing.
		1642
		1643	So avoid file descriptors pointing to files when you know it (e.g. use
		1644	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1645	when you rarely read from a file instead of from a socket, and want to
		1646	reuse the same code path.
		1647
1528	=head3 The special problem of fork	1648	=head3 The special problem of fork
1529		1649
1530	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1650	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1531	useless behaviour. Libev fully supports fork, but needs to be told about	1651	useless behaviour. Libev fully supports fork, but needs to be told about
1532	it in the child.	1652	it in the child if you want to continue to use it in the child.
1533		1653
1534	To support fork in your programs, you either have to call	1654	To support fork in your child processes, you have to call C<ev_loop_fork
1535	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1655	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1536	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1656	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1537	C<EVBACKEND_POLL>.
1538		1657
1539	=head3 The special problem of SIGPIPE	1658	=head3 The special problem of SIGPIPE
1540		1659
1541	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1660	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1542	when writing to a pipe whose other end has been closed, your program gets	1661	when writing to a pipe whose other end has been closed, your program gets
…		…
1624	...	1743	...
1625	struct ev_loop *loop = ev_default_init (0);	1744	struct ev_loop *loop = ev_default_init (0);
1626	ev_io stdin_readable;	1745	ev_io stdin_readable;
1627	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1746	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1628	ev_io_start (loop, &stdin_readable);	1747	ev_io_start (loop, &stdin_readable);
1629	ev_loop (loop, 0);	1748	ev_run (loop, 0);
1630		1749
1631		1750
1632	=head2 C<ev_timer> - relative and optionally repeating timeouts	1751	=head2 C<ev_timer> - relative and optionally repeating timeouts
1633		1752
1634	Timer watchers are simple relative timers that generate an event after a	1753	Timer watchers are simple relative timers that generate an event after a
…		…
1643	The callback is guaranteed to be invoked only I<after> its timeout has	1762	The callback is guaranteed to be invoked only I<after> its timeout has
1644	passed (not I<at>, so on systems with very low-resolution clocks this	1763	passed (not I<at>, so on systems with very low-resolution clocks this
1645	might introduce a small delay). If multiple timers become ready during the	1764	might introduce a small delay). If multiple timers become ready during the
1646	same loop iteration then the ones with earlier time-out values are invoked	1765	same loop iteration then the ones with earlier time-out values are invoked
1647	before ones of the same priority with later time-out values (but this is	1766	before ones of the same priority with later time-out values (but this is
1648	no longer true when a callback calls C<ev_loop> recursively).	1767	no longer true when a callback calls C<ev_run> recursively).
1649		1768
1650	=head3 Be smart about timeouts	1769	=head3 Be smart about timeouts
1651		1770
1652	Many real-world problems involve some kind of timeout, usually for error	1771	Many real-world problems involve some kind of timeout, usually for error
1653	recovery. A typical example is an HTTP request - if the other side hangs,	1772	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1824		1943
1825	=head3 The special problem of time updates	1944	=head3 The special problem of time updates
1826		1945
1827	Establishing the current time is a costly operation (it usually takes at	1946	Establishing the current time is a costly operation (it usually takes at
1828	least two system calls): EV therefore updates its idea of the current	1947	least two system calls): EV therefore updates its idea of the current
1829	time only before and after C<ev_loop> collects new events, which causes a	1948	time only before and after C<ev_run> collects new events, which causes a
1830	growing difference between C<ev_now ()> and C<ev_time ()> when handling	1949	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1831	lots of events in one iteration.	1950	lots of events in one iteration.
1832		1951
1833	The relative timeouts are calculated relative to the C<ev_now ()>	1952	The relative timeouts are calculated relative to the C<ev_now ()>
1834	time. This is usually the right thing as this timestamp refers to the time	1953	time. This is usually the right thing as this timestamp refers to the time
…		…
1951	}	2070	}
1952		2071
1953	ev_timer mytimer;	2072	ev_timer mytimer;
1954	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	2073	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1955	ev_timer_again (&mytimer); /* start timer */	2074	ev_timer_again (&mytimer); /* start timer */
1956	ev_loop (loop, 0);	2075	ev_run (loop, 0);
1957		2076
1958	// and in some piece of code that gets executed on any "activity":	2077	// and in some piece of code that gets executed on any "activity":
1959	// reset the timeout to start ticking again at 10 seconds	2078	// reset the timeout to start ticking again at 10 seconds
1960	ev_timer_again (&mytimer);	2079	ev_timer_again (&mytimer);
1961		2080
…		…
1987		2106
1988	As with timers, the callback is guaranteed to be invoked only when the	2107	As with timers, the callback is guaranteed to be invoked only when the
1989	point in time where it is supposed to trigger has passed. If multiple	2108	point in time where it is supposed to trigger has passed. If multiple
1990	timers become ready during the same loop iteration then the ones with	2109	timers become ready during the same loop iteration then the ones with
1991	earlier time-out values are invoked before ones with later time-out values	2110	earlier time-out values are invoked before ones with later time-out values
1992	(but this is no longer true when a callback calls C<ev_loop> recursively).	2111	(but this is no longer true when a callback calls C<ev_run> recursively).
1993		2112
1994	=head3 Watcher-Specific Functions and Data Members	2113	=head3 Watcher-Specific Functions and Data Members
1995		2114
1996	=over 4	2115	=over 4
1997		2116
…		…
2158		2277
2159	=head2 C<ev_signal> - signal me when a signal gets signalled!	2278	=head2 C<ev_signal> - signal me when a signal gets signalled!
2160		2279
2161	Signal watchers will trigger an event when the process receives a specific	2280	Signal watchers will trigger an event when the process receives a specific
2162	signal one or more times. Even though signals are very asynchronous, libev	2281	signal one or more times. Even though signals are very asynchronous, libev
2163	will try it's best to deliver signals synchronously, i.e. as part of the	2282	will try its best to deliver signals synchronously, i.e. as part of the
2164	normal event processing, like any other event.	2283	normal event processing, like any other event.
2165		2284
2166	If you want signals to be delivered truly asynchronously, just use	2285	If you want signals to be delivered truly asynchronously, just use
2167	C<sigaction> as you would do without libev and forget about sharing	2286	C<sigaction> as you would do without libev and forget about sharing
2168	the signal. You can even use C<ev_async> from a signal handler to	2287	the signal. You can even use C<ev_async> from a signal handler to
…		…
2187	=head3 The special problem of inheritance over fork/execve/pthread_create	2306	=head3 The special problem of inheritance over fork/execve/pthread_create
2188		2307
2189	Both the signal mask (C<sigprocmask>) and the signal disposition	2308	Both the signal mask (C<sigprocmask>) and the signal disposition
2190	(C<sigaction>) are unspecified after starting a signal watcher (and after	2309	(C<sigaction>) are unspecified after starting a signal watcher (and after
2191	stopping it again), that is, libev might or might not block the signal,	2310	stopping it again), that is, libev might or might not block the signal,
2192	and might or might not set or restore the installed signal handler.	2311	and might or might not set or restore the installed signal handler (but
		2312	see C<EVFLAG_NOSIGMASK>).
2193		2313
2194	While this does not matter for the signal disposition (libev never	2314	While this does not matter for the signal disposition (libev never
2195	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2315	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2196	C<execve>), this matters for the signal mask: many programs do not expect	2316	C<execve>), this matters for the signal mask: many programs do not expect
2197	certain signals to be blocked.	2317	certain signals to be blocked.
…		…
2211		2331
2212	So I can't stress this enough: I<If you do not reset your signal mask when	2332	So I can't stress this enough: I<If you do not reset your signal mask when
2213	you expect it to be empty, you have a race condition in your code>. This	2333	you expect it to be empty, you have a race condition in your code>. This
2214	is not a libev-specific thing, this is true for most event libraries.	2334	is not a libev-specific thing, this is true for most event libraries.
2215		2335
		2336	=head3 The special problem of threads signal handling
		2337
		2338	POSIX threads has problematic signal handling semantics, specifically,
		2339	a lot of functionality (sigfd, sigwait etc.) only really works if all
		2340	threads in a process block signals, which is hard to achieve.
		2341
		2342	When you want to use sigwait (or mix libev signal handling with your own
		2343	for the same signals), you can tackle this problem by globally blocking
		2344	all signals before creating any threads (or creating them with a fully set
		2345	sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
		2346	loops. Then designate one thread as "signal receiver thread" which handles
		2347	these signals. You can pass on any signals that libev might be interested
		2348	in by calling C<ev_feed_signal>.
		2349
2216	=head3 Watcher-Specific Functions and Data Members	2350	=head3 Watcher-Specific Functions and Data Members
2217		2351
2218	=over 4	2352	=over 4
2219		2353
2220	=item ev_signal_init (ev_signal *, callback, int signum)	2354	=item ev_signal_init (ev_signal *, callback, int signum)
…		…
2235	Example: Try to exit cleanly on SIGINT.	2369	Example: Try to exit cleanly on SIGINT.
2236		2370
2237	static void	2371	static void
2238	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)	2372	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2239	{	2373	{
2240	ev_unloop (loop, EVUNLOOP_ALL);	2374	ev_break (loop, EVBREAK_ALL);
2241	}	2375	}
2242		2376
2243	ev_signal signal_watcher;	2377	ev_signal signal_watcher;
2244	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	2378	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2245	ev_signal_start (loop, &signal_watcher);	2379	ev_signal_start (loop, &signal_watcher);
…		…
2631		2765
2632	Prepare and check watchers are usually (but not always) used in pairs:	2766	Prepare and check watchers are usually (but not always) used in pairs:
2633	prepare watchers get invoked before the process blocks and check watchers	2767	prepare watchers get invoked before the process blocks and check watchers
2634	afterwards.	2768	afterwards.
2635		2769
2636	You I<must not> call C<ev_loop> or similar functions that enter	2770	You I<must not> call C<ev_run> or similar functions that enter
2637	the current event loop from either C<ev_prepare> or C<ev_check>	2771	the current event loop from either C<ev_prepare> or C<ev_check>
2638	watchers. Other loops than the current one are fine, however. The	2772	watchers. Other loops than the current one are fine, however. The
2639	rationale behind this is that you do not need to check for recursion in	2773	rationale behind this is that you do not need to check for recursion in
2640	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2774	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2641	C<ev_check> so if you have one watcher of each kind they will always be	2775	C<ev_check> so if you have one watcher of each kind they will always be
…		…
2809		2943
2810	if (timeout >= 0)	2944	if (timeout >= 0)
2811	// create/start timer	2945	// create/start timer
2812		2946
2813	// poll	2947	// poll
2814	ev_loop (EV_A_ 0);	2948	ev_run (EV_A_ 0);
2815		2949
2816	// stop timer again	2950	// stop timer again
2817	if (timeout >= 0)	2951	if (timeout >= 0)
2818	ev_timer_stop (EV_A_ &to);	2952	ev_timer_stop (EV_A_ &to);
2819		2953
…		…
2897	if you do not want that, you need to temporarily stop the embed watcher).	3031	if you do not want that, you need to temporarily stop the embed watcher).
2898		3032
2899	=item ev_embed_sweep (loop, ev_embed *)	3033	=item ev_embed_sweep (loop, ev_embed *)
2900		3034
2901	Make a single, non-blocking sweep over the embedded loop. This works	3035	Make a single, non-blocking sweep over the embedded loop. This works
2902	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most	3036	similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2903	appropriate way for embedded loops.	3037	appropriate way for embedded loops.
2904		3038
2905	=item struct ev_loop *other [read-only]	3039	=item struct ev_loop *other [read-only]
2906		3040
2907	The embedded event loop.	3041	The embedded event loop.
…		…
2993	disadvantage of having to use multiple event loops (which do not support	3127	disadvantage of having to use multiple event loops (which do not support
2994	signal watchers).	3128	signal watchers).
2995		3129
2996	When this is not possible, or you want to use the default loop for	3130	When this is not possible, or you want to use the default loop for
2997	other reasons, then in the process that wants to start "fresh", call	3131	other reasons, then in the process that wants to start "fresh", call
2998	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying	3132	C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
2999	the default loop will "orphan" (not stop) all registered watchers, so you	3133	Destroying the default loop will "orphan" (not stop) all registered
3000	have to be careful not to execute code that modifies those watchers. Note	3134	watchers, so you have to be careful not to execute code that modifies
3001	also that in that case, you have to re-register any signal watchers.	3135	those watchers. Note also that in that case, you have to re-register any
		3136	signal watchers.
3002		3137
3003	=head3 Watcher-Specific Functions and Data Members	3138	=head3 Watcher-Specific Functions and Data Members
3004		3139
3005	=over 4	3140	=over 4
3006		3141
3007	=item ev_fork_init (ev_signal *, callback)	3142	=item ev_fork_init (ev_fork *, callback)
3008		3143
3009	Initialises and configures the fork watcher - it has no parameters of any	3144	Initialises and configures the fork watcher - it has no parameters of any
3010	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,	3145	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3011	believe me.	3146	really.
3012		3147
3013	=back	3148	=back
		3149
		3150
		3151	=head2 C<ev_cleanup> - even the best things end
		3152
		3153	Cleanup watchers are called just before the event loop is being destroyed
		3154	by a call to C<ev_loop_destroy>.
		3155
		3156	While there is no guarantee that the event loop gets destroyed, cleanup
		3157	watchers provide a convenient method to install cleanup hooks for your
		3158	program, worker threads and so on - you just to make sure to destroy the
		3159	loop when you want them to be invoked.
		3160
		3161	Cleanup watchers are invoked in the same way as any other watcher. Unlike
		3162	all other watchers, they do not keep a reference to the event loop (which
		3163	makes a lot of sense if you think about it). Like all other watchers, you
		3164	can call libev functions in the callback, except C<ev_cleanup_start>.
		3165
		3166	=head3 Watcher-Specific Functions and Data Members
		3167
		3168	=over 4
		3169
		3170	=item ev_cleanup_init (ev_cleanup *, callback)
		3171
		3172	Initialises and configures the cleanup watcher - it has no parameters of
		3173	any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
		3174	pointless, I assure you.
		3175
		3176	=back
		3177
		3178	Example: Register an atexit handler to destroy the default loop, so any
		3179	cleanup functions are called.
		3180
		3181	static void
		3182	program_exits (void)
		3183	{
		3184	ev_loop_destroy (EV_DEFAULT_UC);
		3185	}
		3186
		3187	...
		3188	atexit (program_exits);
3014		3189
3015		3190
3016	=head2 C<ev_async> - how to wake up an event loop	3191	=head2 C<ev_async> - how to wake up an event loop
3017		3192
3018	In general, you cannot use an C<ev_loop> from multiple threads or other	3193	In general, you cannot use an C<ev_loop> from multiple threads or other
…		…
3025	it by calling C<ev_async_send>, which is thread- and signal safe.	3200	it by calling C<ev_async_send>, which is thread- and signal safe.
3026		3201
3027	This functionality is very similar to C<ev_signal> watchers, as signals,	3202	This functionality is very similar to C<ev_signal> watchers, as signals,
3028	too, are asynchronous in nature, and signals, too, will be compressed	3203	too, are asynchronous in nature, and signals, too, will be compressed
3029	(i.e. the number of callback invocations may be less than the number of	3204	(i.e. the number of callback invocations may be less than the number of
3030	C<ev_async_sent> calls).	3205	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
		3206	of "global async watchers" by using a watcher on an otherwise unused
		3207	signal, and C<ev_feed_signal> to signal this watcher from another thread,
		3208	even without knowing which loop owns the signal.
3031		3209
3032	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not	3210	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3033	just the default loop.	3211	just the default loop.
3034		3212
3035	=head3 Queueing	3213	=head3 Queueing
…		…
3130	trust me.	3308	trust me.
3131		3309
3132	=item ev_async_send (loop, ev_async *)	3310	=item ev_async_send (loop, ev_async *)
3133		3311
3134	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3312	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3135	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3313	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3314	returns.
		3315
3136	C<ev_feed_event>, this call is safe to do from other threads, signal or	3316	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3137	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3317	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3138	section below on what exactly this means).	3318	embedding section below on what exactly this means).
3139		3319
3140	Note that, as with other watchers in libev, multiple events might get	3320	Note that, as with other watchers in libev, multiple events might get
3141	compressed into a single callback invocation (another way to look at this	3321	compressed into a single callback invocation (another way to look at this
3142	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3322	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
3143	reset when the event loop detects that).	3323	reset when the event loop detects that).
…		…
3211	Feed an event on the given fd, as if a file descriptor backend detected	3391	Feed an event on the given fd, as if a file descriptor backend detected
3212	the given events it.	3392	the given events it.
3213		3393
3214	=item ev_feed_signal_event (loop, int signum)	3394	=item ev_feed_signal_event (loop, int signum)
3215		3395
3216	Feed an event as if the given signal occurred (C<loop> must be the default	3396	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3217	loop!).	3397	which is async-safe.
3218		3398
3219	=back	3399	=back
		3400
		3401
		3402	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
		3403
		3404	This section explains some common idioms that are not immediately
		3405	obvious. Note that examples are sprinkled over the whole manual, and this
		3406	section only contains stuff that wouldn't fit anywhere else.
		3407
		3408	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3409
		3410	Each watcher has, by default, a C<void *data> member that you can read
		3411	or modify at any time: libev will completely ignore it. This can be used
		3412	to associate arbitrary data with your watcher. If you need more data and
		3413	don't want to allocate memory separately and store a pointer to it in that
		3414	data member, you can also "subclass" the watcher type and provide your own
		3415	data:
		3416
		3417	struct my_io
		3418	{
		3419	ev_io io;
		3420	int otherfd;
		3421	void *somedata;
		3422	struct whatever *mostinteresting;
		3423	};
		3424
		3425	...
		3426	struct my_io w;
		3427	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3428
		3429	And since your callback will be called with a pointer to the watcher, you
		3430	can cast it back to your own type:
		3431
		3432	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
		3433	{
		3434	struct my_io *w = (struct my_io *)w_;
		3435	...
		3436	}
		3437
		3438	More interesting and less C-conformant ways of casting your callback
		3439	function type instead have been omitted.
		3440
		3441	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3442
		3443	Another common scenario is to use some data structure with multiple
		3444	embedded watchers, in effect creating your own watcher that combines
		3445	multiple libev event sources into one "super-watcher":
		3446
		3447	struct my_biggy
		3448	{
		3449	int some_data;
		3450	ev_timer t1;
		3451	ev_timer t2;
		3452	}
		3453
		3454	In this case getting the pointer to C<my_biggy> is a bit more
		3455	complicated: Either you store the address of your C<my_biggy> struct in
		3456	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3457	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3458	real programmers):
		3459
		3460	#include <stddef.h>
		3461
		3462	static void
		3463	t1_cb (EV_P_ ev_timer *w, int revents)
		3464	{
		3465	struct my_biggy big = (struct my_biggy *)
		3466	(((char *)w) - offsetof (struct my_biggy, t1));
		3467	}
		3468
		3469	static void
		3470	t2_cb (EV_P_ ev_timer *w, int revents)
		3471	{
		3472	struct my_biggy big = (struct my_biggy *)
		3473	(((char *)w) - offsetof (struct my_biggy, t2));
		3474	}
		3475
		3476	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
		3477
		3478	Often (especially in GUI toolkits) there are places where you have
		3479	I<modal> interaction, which is most easily implemented by recursively
		3480	invoking C<ev_run>.
		3481
		3482	This brings the problem of exiting - a callback might want to finish the
		3483	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
		3484	a modal "Are you sure?" dialog is still waiting), or just the nested one
		3485	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
		3486	other combination: In these cases, C<ev_break> will not work alone.
		3487
		3488	The solution is to maintain "break this loop" variable for each C<ev_run>
		3489	invocation, and use a loop around C<ev_run> until the condition is
		3490	triggered, using C<EVRUN_ONCE>:
		3491
		3492	// main loop
		3493	int exit_main_loop = 0;
		3494
		3495	while (!exit_main_loop)
		3496	ev_run (EV_DEFAULT_ EVRUN_ONCE);
		3497
		3498	// in a model watcher
		3499	int exit_nested_loop = 0;
		3500
		3501	while (!exit_nested_loop)
		3502	ev_run (EV_A_ EVRUN_ONCE);
		3503
		3504	To exit from any of these loops, just set the corresponding exit variable:
		3505
		3506	// exit modal loop
		3507	exit_nested_loop = 1;
		3508
		3509	// exit main program, after modal loop is finished
		3510	exit_main_loop = 1;
		3511
		3512	// exit both
		3513	exit_main_loop = exit_nested_loop = 1;
		3514
		3515	=head2 THREAD LOCKING EXAMPLE
		3516
		3517	Here is a fictitious example of how to run an event loop in a different
		3518	thread from where callbacks are being invoked and watchers are
		3519	created/added/removed.
		3520
		3521	For a real-world example, see the C<EV::Loop::Async> perl module,
		3522	which uses exactly this technique (which is suited for many high-level
		3523	languages).
		3524
		3525	The example uses a pthread mutex to protect the loop data, a condition
		3526	variable to wait for callback invocations, an async watcher to notify the
		3527	event loop thread and an unspecified mechanism to wake up the main thread.
		3528
		3529	First, you need to associate some data with the event loop:
		3530
		3531	typedef struct {
		3532	mutex_t lock; /* global loop lock */
		3533	ev_async async_w;
		3534	thread_t tid;
		3535	cond_t invoke_cv;
		3536	} userdata;
		3537
		3538	void prepare_loop (EV_P)
		3539	{
		3540	// for simplicity, we use a static userdata struct.
		3541	static userdata u;
		3542
		3543	ev_async_init (&u->async_w, async_cb);
		3544	ev_async_start (EV_A_ &u->async_w);
		3545
		3546	pthread_mutex_init (&u->lock, 0);
		3547	pthread_cond_init (&u->invoke_cv, 0);
		3548
		3549	// now associate this with the loop
		3550	ev_set_userdata (EV_A_ u);
		3551	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3552	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3553
		3554	// then create the thread running ev_run
		3555	pthread_create (&u->tid, 0, l_run, EV_A);
		3556	}
		3557
		3558	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3559	solely to wake up the event loop so it takes notice of any new watchers
		3560	that might have been added:
		3561
		3562	static void
		3563	async_cb (EV_P_ ev_async *w, int revents)
		3564	{
		3565	// just used for the side effects
		3566	}
		3567
		3568	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3569	protecting the loop data, respectively.
		3570
		3571	static void
		3572	l_release (EV_P)
		3573	{
		3574	userdata *u = ev_userdata (EV_A);
		3575	pthread_mutex_unlock (&u->lock);
		3576	}
		3577
		3578	static void
		3579	l_acquire (EV_P)
		3580	{
		3581	userdata *u = ev_userdata (EV_A);
		3582	pthread_mutex_lock (&u->lock);
		3583	}
		3584
		3585	The event loop thread first acquires the mutex, and then jumps straight
		3586	into C<ev_run>:
		3587
		3588	void *
		3589	l_run (void *thr_arg)
		3590	{
		3591	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		3592
		3593	l_acquire (EV_A);
		3594	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3595	ev_run (EV_A_ 0);
		3596	l_release (EV_A);
		3597
		3598	return 0;
		3599	}
		3600
		3601	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3602	signal the main thread via some unspecified mechanism (signals? pipe
		3603	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3604	have been called (in a while loop because a) spurious wakeups are possible
		3605	and b) skipping inter-thread-communication when there are no pending
		3606	watchers is very beneficial):
		3607
		3608	static void
		3609	l_invoke (EV_P)
		3610	{
		3611	userdata *u = ev_userdata (EV_A);
		3612
		3613	while (ev_pending_count (EV_A))
		3614	{
		3615	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3616	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3617	}
		3618	}
		3619
		3620	Now, whenever the main thread gets told to invoke pending watchers, it
		3621	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3622	thread to continue:
		3623
		3624	static void
		3625	real_invoke_pending (EV_P)
		3626	{
		3627	userdata *u = ev_userdata (EV_A);
		3628
		3629	pthread_mutex_lock (&u->lock);
		3630	ev_invoke_pending (EV_A);
		3631	pthread_cond_signal (&u->invoke_cv);
		3632	pthread_mutex_unlock (&u->lock);
		3633	}
		3634
		3635	Whenever you want to start/stop a watcher or do other modifications to an
		3636	event loop, you will now have to lock:
		3637
		3638	ev_timer timeout_watcher;
		3639	userdata *u = ev_userdata (EV_A);
		3640
		3641	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3642
		3643	pthread_mutex_lock (&u->lock);
		3644	ev_timer_start (EV_A_ &timeout_watcher);
		3645	ev_async_send (EV_A_ &u->async_w);
		3646	pthread_mutex_unlock (&u->lock);
		3647
		3648	Note that sending the C<ev_async> watcher is required because otherwise
		3649	an event loop currently blocking in the kernel will have no knowledge
		3650	about the newly added timer. By waking up the loop it will pick up any new
		3651	watchers in the next event loop iteration.
		3652
		3653	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3654
		3655	While the overhead of a callback that e.g. schedules a thread is small, it
		3656	is still an overhead. If you embed libev, and your main usage is with some
		3657	kind of threads or coroutines, you might want to customise libev so that
		3658	doesn't need callbacks anymore.
		3659
		3660	Imagine you have coroutines that you can switch to using a function
		3661	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3662	and that due to some magic, the currently active coroutine is stored in a
		3663	global called C<current_coro>. Then you can build your own "wait for libev
		3664	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3665	the differing C<;> conventions):
		3666
		3667	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3668	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3669
		3670	That means instead of having a C callback function, you store the
		3671	coroutine to switch to in each watcher, and instead of having libev call
		3672	your callback, you instead have it switch to that coroutine.
		3673
		3674	A coroutine might now wait for an event with a function called
		3675	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3676	matter when, or whether the watcher is active or not when this function is
		3677	called):
		3678
		3679	void
		3680	wait_for_event (ev_watcher *w)
		3681	{
		3682	ev_cb_set (w) = current_coro;
		3683	switch_to (libev_coro);
		3684	}
		3685
		3686	That basically suspends the coroutine inside C<wait_for_event> and
		3687	continues the libev coroutine, which, when appropriate, switches back to
		3688	this or any other coroutine. I am sure if you sue this your own :)
		3689
		3690	You can do similar tricks if you have, say, threads with an event queue -
		3691	instead of storing a coroutine, you store the queue object and instead of
		3692	switching to a coroutine, you push the watcher onto the queue and notify
		3693	any waiters.
		3694
		3695	To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
		3696	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3697
		3698	// my_ev.h
		3699	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3700	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
		3701	#include "../libev/ev.h"
		3702
		3703	// my_ev.c
		3704	#define EV_H "my_ev.h"
		3705	#include "../libev/ev.c"
		3706
		3707	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3708	F<my_ev.c> into your project. When properly specifying include paths, you
		3709	can even use F<ev.h> as header file name directly.
3220		3710
3221		3711
3222	=head1 LIBEVENT EMULATION	3712	=head1 LIBEVENT EMULATION
3223		3713
3224	Libev offers a compatibility emulation layer for libevent. It cannot	3714	Libev offers a compatibility emulation layer for libevent. It cannot
3225	emulate the internals of libevent, so here are some usage hints:	3715	emulate the internals of libevent, so here are some usage hints:
3226		3716
3227	=over 4	3717	=over 4
		3718
		3719	=item * Only the libevent-1.4.1-beta API is being emulated.
		3720
		3721	This was the newest libevent version available when libev was implemented,
		3722	and is still mostly unchanged in 2010.
3228		3723
3229	=item * Use it by including <event.h>, as usual.	3724	=item * Use it by including <event.h>, as usual.
3230		3725
3231	=item * The following members are fully supported: ev_base, ev_callback,	3726	=item * The following members are fully supported: ev_base, ev_callback,
3232	ev_arg, ev_fd, ev_res, ev_events.	3727	ev_arg, ev_fd, ev_res, ev_events.
…		…
3238	=item * Priorities are not currently supported. Initialising priorities	3733	=item * Priorities are not currently supported. Initialising priorities
3239	will fail and all watchers will have the same priority, even though there	3734	will fail and all watchers will have the same priority, even though there
3240	is an ev_pri field.	3735	is an ev_pri field.
3241		3736
3242	=item * In libevent, the last base created gets the signals, in libev, the	3737	=item * In libevent, the last base created gets the signals, in libev, the
3243	first base created (== the default loop) gets the signals.	3738	base that registered the signal gets the signals.
3244		3739
3245	=item * Other members are not supported.	3740	=item * Other members are not supported.
3246		3741
3247	=item * The libev emulation is I<not> ABI compatible to libevent, you need	3742	=item * The libev emulation is I<not> ABI compatible to libevent, you need
3248	to use the libev header file and library.	3743	to use the libev header file and library.
…		…
3267	Care has been taken to keep the overhead low. The only data member the C++	3762	Care has been taken to keep the overhead low. The only data member the C++
3268	classes add (compared to plain C-style watchers) is the event loop pointer	3763	classes add (compared to plain C-style watchers) is the event loop pointer
3269	that the watcher is associated with (or no additional members at all if	3764	that the watcher is associated with (or no additional members at all if
3270	you disable C<EV_MULTIPLICITY> when embedding libev).	3765	you disable C<EV_MULTIPLICITY> when embedding libev).
3271		3766
3272	Currently, functions, and static and non-static member functions can be	3767	Currently, functions, static and non-static member functions and classes
3273	used as callbacks. Other types should be easy to add as long as they only	3768	with C<operator ()> can be used as callbacks. Other types should be easy
3274	need one additional pointer for context. If you need support for other	3769	to add as long as they only need one additional pointer for context. If
3275	types of functors please contact the author (preferably after implementing	3770	you need support for other types of functors please contact the author
3276	it).	3771	(preferably after implementing it).
3277		3772
3278	Here is a list of things available in the C<ev> namespace:	3773	Here is a list of things available in the C<ev> namespace:
3279		3774
3280	=over 4	3775	=over 4
3281		3776
…		…
3530	loop argument"). The C<EV_A> form is used when this is the sole argument,	4025	loop argument"). The C<EV_A> form is used when this is the sole argument,
3531	C<EV_A_> is used when other arguments are following. Example:	4026	C<EV_A_> is used when other arguments are following. Example:
3532		4027
3533	ev_unref (EV_A);	4028	ev_unref (EV_A);
3534	ev_timer_add (EV_A_ watcher);	4029	ev_timer_add (EV_A_ watcher);
3535	ev_loop (EV_A_ 0);	4030	ev_run (EV_A_ 0);
3536		4031
3537	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,	4032	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3538	which is often provided by the following macro.	4033	which is often provided by the following macro.
3539		4034
3540	=item C<EV_P>, C<EV_P_>	4035	=item C<EV_P>, C<EV_P_>
…		…
3580	}	4075	}
3581		4076
3582	ev_check check;	4077	ev_check check;
3583	ev_check_init (&check, check_cb);	4078	ev_check_init (&check, check_cb);
3584	ev_check_start (EV_DEFAULT_ &check);	4079	ev_check_start (EV_DEFAULT_ &check);
3585	ev_loop (EV_DEFAULT_ 0);	4080	ev_run (EV_DEFAULT_ 0);
3586		4081
3587	=head1 EMBEDDING	4082	=head1 EMBEDDING
3588		4083
3589	Libev can (and often is) directly embedded into host	4084	Libev can (and often is) directly embedded into host
3590	applications. Examples of applications that embed it include the Deliantra	4085	applications. Examples of applications that embed it include the Deliantra
…		…
3681	to a compiled library. All other symbols change the ABI, which means all	4176	to a compiled library. All other symbols change the ABI, which means all
3682	users of libev and the libev code itself must be compiled with compatible	4177	users of libev and the libev code itself must be compiled with compatible
3683	settings.	4178	settings.
3684		4179
3685	=over 4	4180	=over 4
		4181
		4182	=item EV_COMPAT3 (h)
		4183
		4184	Backwards compatibility is a major concern for libev. This is why this
		4185	release of libev comes with wrappers for the functions and symbols that
		4186	have been renamed between libev version 3 and 4.
		4187
		4188	You can disable these wrappers (to test compatibility with future
		4189	versions) by defining C<EV_COMPAT3> to C<0> when compiling your
		4190	sources. This has the additional advantage that you can drop the C<struct>
		4191	from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
		4192	typedef in that case.
		4193
		4194	In some future version, the default for C<EV_COMPAT3> will become C<0>,
		4195	and in some even more future version the compatibility code will be
		4196	removed completely.
3686		4197
3687	=item EV_STANDALONE (h)	4198	=item EV_STANDALONE (h)
3688		4199
3689	Must always be C<1> if you do not use autoconf configuration, which	4200	Must always be C<1> if you do not use autoconf configuration, which
3690	keeps libev from including F<config.h>, and it also defines dummy	4201	keeps libev from including F<config.h>, and it also defines dummy
…		…
4133	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4644	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4134		4645
4135	#include "ev_cpp.h"	4646	#include "ev_cpp.h"
4136	#include "ev.c"	4647	#include "ev.c"
4137		4648
4138	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4649	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4139		4650
4140	=head2 THREADS AND COROUTINES	4651	=head2 THREADS AND COROUTINES
4141		4652
4142	=head3 THREADS	4653	=head3 THREADS
4143		4654
…		…
4194	default loop and triggering an C<ev_async> watcher from the default loop	4705	default loop and triggering an C<ev_async> watcher from the default loop
4195	watcher callback into the event loop interested in the signal.	4706	watcher callback into the event loop interested in the signal.
4196		4707
4197	=back	4708	=back
4198		4709
4199	=head4 THREAD LOCKING EXAMPLE	4710	See also L<THREAD LOCKING EXAMPLE>.
4200
4201	Here is a fictitious example of how to run an event loop in a different
4202	thread than where callbacks are being invoked and watchers are
4203	created/added/removed.
4204
4205	For a real-world example, see the C<EV::Loop::Async> perl module,
4206	which uses exactly this technique (which is suited for many high-level
4207	languages).
4208
4209	The example uses a pthread mutex to protect the loop data, a condition
4210	variable to wait for callback invocations, an async watcher to notify the
4211	event loop thread and an unspecified mechanism to wake up the main thread.
4212
4213	First, you need to associate some data with the event loop:
4214
4215	typedef struct {
4216	mutex_t lock; /* global loop lock */
4217	ev_async async_w;
4218	thread_t tid;
4219	cond_t invoke_cv;
4220	} userdata;
4221
4222	void prepare_loop (EV_P)
4223	{
4224	// for simplicity, we use a static userdata struct.
4225	static userdata u;
4226
4227	ev_async_init (&u->async_w, async_cb);
4228	ev_async_start (EV_A_ &u->async_w);
4229
4230	pthread_mutex_init (&u->lock, 0);
4231	pthread_cond_init (&u->invoke_cv, 0);
4232
4233	// now associate this with the loop
4234	ev_set_userdata (EV_A_ u);
4235	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4236	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4237
4238	// then create the thread running ev_loop
4239	pthread_create (&u->tid, 0, l_run, EV_A);
4240	}
4241
4242	The callback for the C<ev_async> watcher does nothing: the watcher is used
4243	solely to wake up the event loop so it takes notice of any new watchers
4244	that might have been added:
4245
4246	static void
4247	async_cb (EV_P_ ev_async *w, int revents)
4248	{
4249	// just used for the side effects
4250	}
4251
4252	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4253	protecting the loop data, respectively.
4254
4255	static void
4256	l_release (EV_P)
4257	{
4258	userdata *u = ev_userdata (EV_A);
4259	pthread_mutex_unlock (&u->lock);
4260	}
4261
4262	static void
4263	l_acquire (EV_P)
4264	{
4265	userdata *u = ev_userdata (EV_A);
4266	pthread_mutex_lock (&u->lock);
4267	}
4268
4269	The event loop thread first acquires the mutex, and then jumps straight
4270	into C<ev_loop>:
4271
4272	void *
4273	l_run (void *thr_arg)
4274	{
4275	struct ev_loop *loop = (struct ev_loop *)thr_arg;
4276
4277	l_acquire (EV_A);
4278	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4279	ev_loop (EV_A_ 0);
4280	l_release (EV_A);
4281
4282	return 0;
4283	}
4284
4285	Instead of invoking all pending watchers, the C<l_invoke> callback will
4286	signal the main thread via some unspecified mechanism (signals? pipe
4287	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4288	have been called (in a while loop because a) spurious wakeups are possible
4289	and b) skipping inter-thread-communication when there are no pending
4290	watchers is very beneficial):
4291
4292	static void
4293	l_invoke (EV_P)
4294	{
4295	userdata *u = ev_userdata (EV_A);
4296
4297	while (ev_pending_count (EV_A))
4298	{
4299	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4300	pthread_cond_wait (&u->invoke_cv, &u->lock);
4301	}
4302	}
4303
4304	Now, whenever the main thread gets told to invoke pending watchers, it
4305	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4306	thread to continue:
4307
4308	static void
4309	real_invoke_pending (EV_P)
4310	{
4311	userdata *u = ev_userdata (EV_A);
4312
4313	pthread_mutex_lock (&u->lock);
4314	ev_invoke_pending (EV_A);
4315	pthread_cond_signal (&u->invoke_cv);
4316	pthread_mutex_unlock (&u->lock);
4317	}
4318
4319	Whenever you want to start/stop a watcher or do other modifications to an
4320	event loop, you will now have to lock:
4321
4322	ev_timer timeout_watcher;
4323	userdata *u = ev_userdata (EV_A);
4324
4325	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4326
4327	pthread_mutex_lock (&u->lock);
4328	ev_timer_start (EV_A_ &timeout_watcher);
4329	ev_async_send (EV_A_ &u->async_w);
4330	pthread_mutex_unlock (&u->lock);
4331
4332	Note that sending the C<ev_async> watcher is required because otherwise
4333	an event loop currently blocking in the kernel will have no knowledge
4334	about the newly added timer. By waking up the loop it will pick up any new
4335	watchers in the next event loop iteration.
4336		4711
4337	=head3 COROUTINES	4712	=head3 COROUTINES
4338		4713
4339	Libev is very accommodating to coroutines ("cooperative threads"):	4714	Libev is very accommodating to coroutines ("cooperative threads"):
4340	libev fully supports nesting calls to its functions from different	4715	libev fully supports nesting calls to its functions from different
4341	coroutines (e.g. you can call C<ev_loop> on the same loop from two	4716	coroutines (e.g. you can call C<ev_run> on the same loop from two
4342	different coroutines, and switch freely between both coroutines running	4717	different coroutines, and switch freely between both coroutines running
4343	the loop, as long as you don't confuse yourself). The only exception is	4718	the loop, as long as you don't confuse yourself). The only exception is
4344	that you must not do this from C<ev_periodic> reschedule callbacks.	4719	that you must not do this from C<ev_periodic> reschedule callbacks.
4345		4720
4346	Care has been taken to ensure that libev does not keep local state inside	4721	Care has been taken to ensure that libev does not keep local state inside
4347	C<ev_loop>, and other calls do not usually allow for coroutine switches as	4722	C<ev_run>, and other calls do not usually allow for coroutine switches as
4348	they do not call any callbacks.	4723	they do not call any callbacks.
4349		4724
4350	=head2 COMPILER WARNINGS	4725	=head2 COMPILER WARNINGS
4351		4726
4352	Depending on your compiler and compiler settings, you might get no or a	4727	Depending on your compiler and compiler settings, you might get no or a
…		…
4436	=head3 C<kqueue> is buggy	4811	=head3 C<kqueue> is buggy
4437		4812
4438	The kqueue syscall is broken in all known versions - most versions support	4813	The kqueue syscall is broken in all known versions - most versions support
4439	only sockets, many support pipes.	4814	only sockets, many support pipes.
4440		4815
4441	Libev tries to work around this by not using C<kqueue> by default on	4816	Libev tries to work around this by not using C<kqueue> by default on this
4442	this rotten platform, but of course you can still ask for it when creating	4817	rotten platform, but of course you can still ask for it when creating a
4443	a loop.	4818	loop - embedding a socket-only kqueue loop into a select-based one is
		4819	probably going to work well.
4444		4820
4445	=head3 C<poll> is buggy	4821	=head3 C<poll> is buggy
4446		4822
4447	Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>	4823	Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4448	implementation by something calling C<kqueue> internally around the 10.5.6	4824	implementation by something calling C<kqueue> internally around the 10.5.6
…		…
4467		4843
4468	=head3 C<errno> reentrancy	4844	=head3 C<errno> reentrancy
4469		4845
4470	The default compile environment on Solaris is unfortunately so	4846	The default compile environment on Solaris is unfortunately so
4471	thread-unsafe that you can't even use components/libraries compiled	4847	thread-unsafe that you can't even use components/libraries compiled
4472	without C<-D_REENTRANT> (as long as they use C<errno>), which, of course,	4848	without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4473	isn't defined by default.	4849	defined by default. A valid, if stupid, implementation choice.
4474		4850
4475	If you want to use libev in threaded environments you have to make sure	4851	If you want to use libev in threaded environments you have to make sure
4476	it's compiled with C<_REENTRANT> defined.	4852	it's compiled with C<_REENTRANT> defined.
4477		4853
4478	=head3 Event port backend	4854	=head3 Event port backend
4479		4855
4480	The scalable event interface for Solaris is called "event ports". Unfortunately,	4856	The scalable event interface for Solaris is called "event
4481	this mechanism is very buggy. If you run into high CPU usage, your program	4857	ports". Unfortunately, this mechanism is very buggy in all major
		4858	releases. If you run into high CPU usage, your program freezes or you get
4482	freezes or you get a large number of spurious wakeups, make sure you have	4859	a large number of spurious wakeups, make sure you have all the relevant
4483	all the relevant and latest kernel patches applied. No, I don't know which	4860	and latest kernel patches applied. No, I don't know which ones, but there
4484	ones, but there are multiple ones.	4861	are multiple ones to apply, and afterwards, event ports actually work
		4862	great.
4485		4863
4486	If you can't get it to work, you can try running the program by setting	4864	If you can't get it to work, you can try running the program by setting
4487	the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and	4865	the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4488	C<select> backends.	4866	C<select> backends.
4489		4867
4490	=head2 AIX POLL BUG	4868	=head2 AIX POLL BUG
4491		4869
4492	AIX unfortunately has a broken C<poll.h> header. Libev works around	4870	AIX unfortunately has a broken C<poll.h> header. Libev works around
4493	this by trying to avoid the poll backend altogether (i.e. it's not even	4871	this by trying to avoid the poll backend altogether (i.e. it's not even
4494	compiled in), which normally isn't a big problem as C<select> works fine	4872	compiled in), which normally isn't a big problem as C<select> works fine
4495	with large bitsets, and AIX is dead anyway.	4873	with large bitsets on AIX, and AIX is dead anyway.
4496		4874
4497	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS	4875	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4498		4876
4499	=head3 General issues	4877	=head3 General issues
4500		4878
…		…
4606	structure (guaranteed by POSIX but not by ISO C for example), but it also	4984	structure (guaranteed by POSIX but not by ISO C for example), but it also
4607	assumes that the same (machine) code can be used to call any watcher	4985	assumes that the same (machine) code can be used to call any watcher
4608	callback: The watcher callbacks have different type signatures, but libev	4986	callback: The watcher callbacks have different type signatures, but libev
4609	calls them using an C<ev_watcher *> internally.	4987	calls them using an C<ev_watcher *> internally.
4610		4988
		4989	=item pointer accesses must be thread-atomic
		4990
		4991	Accessing a pointer value must be atomic, it must both be readable and
		4992	writable in one piece - this is the case on all current architectures.
		4993
4611	=item C<sig_atomic_t volatile> must be thread-atomic as well	4994	=item C<sig_atomic_t volatile> must be thread-atomic as well
4612		4995
4613	The type C<sig_atomic_t volatile> (or whatever is defined as	4996	The type C<sig_atomic_t volatile> (or whatever is defined as
4614	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different	4997	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4615	threads. This is not part of the specification for C<sig_atomic_t>, but is	4998	threads. This is not part of the specification for C<sig_atomic_t>, but is
…		…
4721	=back	5104	=back
4722		5105
4723		5106
4724	=head1 PORTING FROM LIBEV 3.X TO 4.X	5107	=head1 PORTING FROM LIBEV 3.X TO 4.X
4725		5108
4726	The major version 4 introduced some minor incompatible changes to the API.	5109	The major version 4 introduced some incompatible changes to the API.
4727		5110
4728	At the moment, the C<ev.h> header file tries to implement superficial	5111	At the moment, the C<ev.h> header file provides compatibility definitions
4729	compatibility, so most programs should still compile. Those might be	5112	for all changes, so most programs should still compile. The compatibility
4730	removed in later versions of libev, so better update early than late.	5113	layer might be removed in later versions of libev, so better update to the
		5114	new API early than late.
4731		5115
4732	=over 4	5116	=over 4
4733		5117
4734	=item C<ev_loop_count> renamed to C<ev_iteration>	5118	=item C<EV_COMPAT3> backwards compatibility mechanism
4735		5119
4736	=item C<ev_loop_depth> renamed to C<ev_depth>	5120	The backward compatibility mechanism can be controlled by
		5121	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
		5122	section.
4737		5123
4738	=item C<ev_loop_verify> renamed to C<ev_verify>	5124	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
		5125
		5126	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
		5127
		5128	ev_loop_destroy (EV_DEFAULT_UC);
		5129	ev_loop_fork (EV_DEFAULT);
		5130
		5131	=item function/symbol renames
		5132
		5133	A number of functions and symbols have been renamed:
		5134
		5135	ev_loop => ev_run
		5136	EVLOOP_NONBLOCK => EVRUN_NOWAIT
		5137	EVLOOP_ONESHOT => EVRUN_ONCE
		5138
		5139	ev_unloop => ev_break
		5140	EVUNLOOP_CANCEL => EVBREAK_CANCEL
		5141	EVUNLOOP_ONE => EVBREAK_ONE
		5142	EVUNLOOP_ALL => EVBREAK_ALL
		5143
		5144	EV_TIMEOUT => EV_TIMER
		5145
		5146	ev_loop_count => ev_iteration
		5147	ev_loop_depth => ev_depth
		5148	ev_loop_verify => ev_verify
4739		5149
4740	Most functions working on C<struct ev_loop> objects don't have an	5150	Most functions working on C<struct ev_loop> objects don't have an
4741	C<ev_loop_> prefix, so it was removed. Note that C<ev_loop_fork> is	5151	C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
		5152	associated constants have been renamed to not collide with the C<struct
		5153	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
		5154	as all other watcher types. Note that C<ev_loop_fork> is still called
4742	still called C<ev_loop_fork> because it would otherwise clash with the	5155	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4743	C<ev_fork> typedef.	5156	typedef.
4744
4745	=item C<EV_TIMEOUT> renamed to C<EV_TIMER> in C<revents>
4746
4747	This is a simple rename - all other watcher types use their name
4748	as revents flag, and now C<ev_timer> does, too.
4749
4750	Both C<EV_TIMER> and C<EV_TIMEOUT> symbols were present in 3.x versions
4751	and continue to be present for the foreseeable future, so this is mostly a
4752	documentation change.
4753		5157
4754	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>	5158	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4755		5159
4756	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different	5160	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4757	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile	5161	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
…		…
4764		5168
4765	=over 4	5169	=over 4
4766		5170
4767	=item active	5171	=item active
4768		5172
4769	A watcher is active as long as it has been started (has been attached to	5173	A watcher is active as long as it has been started and not yet stopped.
4770	an event loop) but not yet stopped (disassociated from the event loop).	5174	See L<WATCHER STATES> for details.
4771		5175
4772	=item application	5176	=item application
4773		5177
4774	In this document, an application is whatever is using libev.	5178	In this document, an application is whatever is using libev.
		5179
		5180	=item backend
		5181
		5182	The part of the code dealing with the operating system interfaces.
4775		5183
4776	=item callback	5184	=item callback
4777		5185
4778	The address of a function that is called when some event has been	5186	The address of a function that is called when some event has been
4779	detected. Callbacks are being passed the event loop, the watcher that	5187	detected. Callbacks are being passed the event loop, the watcher that
4780	received the event, and the actual event bitset.	5188	received the event, and the actual event bitset.
4781		5189
4782	=item callback invocation	5190	=item callback/watcher invocation
4783		5191
4784	The act of calling the callback associated with a watcher.	5192	The act of calling the callback associated with a watcher.
4785		5193
4786	=item event	5194	=item event
4787		5195
…		…
4806	The model used to describe how an event loop handles and processes	5214	The model used to describe how an event loop handles and processes
4807	watchers and events.	5215	watchers and events.
4808		5216
4809	=item pending	5217	=item pending
4810		5218
4811	A watcher is pending as soon as the corresponding event has been detected,	5219	A watcher is pending as soon as the corresponding event has been
4812	and stops being pending as soon as the watcher will be invoked or its	5220	detected. See L<WATCHER STATES> for details.
4813	pending status is explicitly cleared by the application.
4814
4815	A watcher can be pending, but not active. Stopping a watcher also clears
4816	its pending status.
4817		5221
4818	=item real time	5222	=item real time
4819		5223
4820	The physical time that is observed. It is apparently strictly monotonic :)	5224	The physical time that is observed. It is apparently strictly monotonic :)
4821		5225
4822	=item wall-clock time	5226	=item wall-clock time
4823		5227
4824	The time and date as shown on clocks. Unlike real time, it can actually	5228	The time and date as shown on clocks. Unlike real time, it can actually
4825	be wrong and jump forwards and backwards, e.g. when the you adjust your	5229	be wrong and jump forwards and backwards, e.g. when you adjust your
4826	clock.	5230	clock.
4827		5231
4828	=item watcher	5232	=item watcher
4829		5233
4830	A data structure that describes interest in certain events. Watchers need	5234	A data structure that describes interest in certain events. Watchers need
4831	to be started (attached to an event loop) before they can receive events.	5235	to be started (attached to an event loop) before they can receive events.
4832		5236
4833	=item watcher invocation
4834
4835	The act of calling the callback associated with a watcher.
4836
4837	=back	5237	=back
4838		5238
4839	=head1 AUTHOR	5239	=head1 AUTHOR
4840		5240
4841	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.	5241	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
		5242	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
4842		5243

Diff Legend

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