ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.282 by root, Wed Mar 10 08:19:39 2010 UTC vs.
Revision 1.343 by root, Wed Nov 10 13:39:10 2010 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	// unloop was called, so exit
64	return 0;	64	return 0;
65	}	65	}
66		66
…		…
75	While this document tries to be as complete as possible in documenting	75	While this document tries to be as complete as possible in documenting
76	libev, its usage and the rationale behind its design, it is not a tutorial	76	libev, its usage and the rationale behind its design, it is not a tutorial
77	on event-based programming, nor will it introduce event-based programming	77	on event-based programming, nor will it introduce event-based programming
78	with libev.	78	with libev.
79		79
80	Familarity with event based programming techniques in general is assumed	80	Familiarity with event based programming techniques in general is assumed
81	throughout this document.	81	throughout this document.
		82
		83	=head1 WHAT TO READ WHEN IN A HURRY
		84
		85	This manual tries to be very detailed, but unfortunately, this also makes
		86	it very long. If you just want to know the basics of libev, I suggest
		87	reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and
		88	look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and
		89	C<ev_timer> sections in L<WATCHER TYPES>.
82		90
83	=head1 ABOUT LIBEV	91	=head1 ABOUT LIBEV
84		92
85	Libev is an event loop: you register interest in certain events (such as a	93	Libev is an event loop: you register interest in certain events (such as a
86	file descriptor being readable or a timeout occurring), and it will manage	94	file descriptor being readable or a timeout occurring), and it will manage
…		…
124	this argument.	132	this argument.
125		133
126	=head2 TIME REPRESENTATION	134	=head2 TIME REPRESENTATION
127		135
128	Libev represents time as a single floating point number, representing	136	Libev represents time as a single floating point number, representing
129	the (fractional) number of seconds since the (POSIX) epoch (somewhere	137	the (fractional) number of seconds since the (POSIX) epoch (in practice
130	near the beginning of 1970, details are complicated, don't ask). This	138	somewhere near the beginning of 1970, details are complicated, don't
131	type is called C<ev_tstamp>, which is what you should use too. It usually	139	ask). This type is called C<ev_tstamp>, which is what you should use
132	aliases to the C<double> type in C. When you need to do any calculations	140	too. It usually aliases to the C<double> type in C. When you need to do
133	on it, you should treat it as some floating point value. Unlike the name	141	any calculations on it, you should treat it as some floating point value.
		142
134	component C<stamp> might indicate, it is also used for time differences	143	Unlike the name component C<stamp> might indicate, it is also used for
135	throughout libev.	144	time differences (e.g. delays) throughout libev.
136		145
137	=head1 ERROR HANDLING	146	=head1 ERROR HANDLING
138		147
139	Libev knows three classes of errors: operating system errors, usage errors	148	Libev knows three classes of errors: operating system errors, usage errors
140	and internal errors (bugs).	149	and internal errors (bugs).
…		…
164		173
165	=item ev_tstamp ev_time ()	174	=item ev_tstamp ev_time ()
166		175
167	Returns the current time as libev would use it. Please note that the	176	Returns the current time as libev would use it. Please note that the
168	C<ev_now> function is usually faster and also often returns the timestamp	177	C<ev_now> function is usually faster and also often returns the timestamp
169	you actually want to know.	178	you actually want to know. Also interesting is the combination of
		179	C<ev_update_now> and C<ev_now>.
170		180
171	=item ev_sleep (ev_tstamp interval)	181	=item ev_sleep (ev_tstamp interval)
172		182
173	Sleep for the given interval: The current thread will be blocked until	183	Sleep for the given interval: The current thread will be blocked until
174	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
…		…
191	as this indicates an incompatible change. Minor versions are usually	201	as this indicates an incompatible change. Minor versions are usually
192	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
193	not a problem.	203	not a problem.
194		204
195	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
196	version.	206	version (note, however, that this will not detect other ABI mismatches,
		207	such as LFS or reentrancy).
197		208
198	assert (("libev version mismatch",	209	assert (("libev version mismatch",
199	ev_version_major () == EV_VERSION_MAJOR	210	ev_version_major () == EV_VERSION_MAJOR
200	&& ev_version_minor () >= EV_VERSION_MINOR));	211	&& ev_version_minor () >= EV_VERSION_MINOR));
201		212
…		…
212	assert (("sorry, no epoll, no sex",	223	assert (("sorry, no epoll, no sex",
213	ev_supported_backends () & EVBACKEND_EPOLL));	224	ev_supported_backends () & EVBACKEND_EPOLL));
214		225
215	=item unsigned int ev_recommended_backends ()	226	=item unsigned int ev_recommended_backends ()
216		227
217	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
218	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
219	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
220	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
221	(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
222	libev will probe for if you specify no backends explicitly.	234	probe for if you specify no backends explicitly.
223		235
224	=item unsigned int ev_embeddable_backends ()	236	=item unsigned int ev_embeddable_backends ()
225		237
226	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
227	is the theoretical, all-platform, value. To find which backends	239	value is platform-specific but can include backends not available on the
228	might be supported on the current system, you would need to look at	240	current system. To find which embeddable backends might be supported on
229	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	241	the current system, you would need to look at C<ev_embeddable_backends ()
230	recommended ones.	242	& ev_supported_backends ()>, likewise for recommended ones.
231		243
232	See the description of C<ev_embed> watchers for more info.	244	See the description of C<ev_embed> watchers for more info.
233		245
234	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]	246	=item ev_set_allocator (void *(*cb)(void *ptr, long size))
235		247
236	Sets the allocation function to use (the prototype is similar - the	248	Sets the allocation function to use (the prototype is similar - the
237	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is	249	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
238	used to allocate and free memory (no surprises here). If it returns zero	250	used to allocate and free memory (no surprises here). If it returns zero
239	when memory needs to be allocated (C<size != 0>), the library might abort	251	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
265	}	277	}
266		278
267	...	279	...
268	ev_set_allocator (persistent_realloc);	280	ev_set_allocator (persistent_realloc);
269		281
270	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]	282	=item ev_set_syserr_cb (void (*cb)(const char *msg))
271		283
272	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
273	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
274	indicating the system call or subsystem causing the problem. If this	286	indicating the system call or subsystem causing the problem. If this
275	callback is set, then libev will expect it to remedy the situation, no	287	callback is set, then libev will expect it to remedy the situation, no
…		…
289	...	301	...
290	ev_set_syserr_cb (fatal_error);	302	ev_set_syserr_cb (fatal_error);
291		303
292	=back	304	=back
293		305
294	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	306	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
295		307
296	An event loop is described by a C<struct ev_loop *> (the C<struct>	308	An event loop is described by a C<struct ev_loop *> (the C<struct> is
297	is I<not> optional in this case, as there is also an C<ev_loop>	309	I<not> optional in this case unless libev 3 compatibility is disabled, as
298	I<function>).	310	libev 3 had an C<ev_loop> function colliding with the struct name).
299		311
300	The library knows two types of such loops, the I<default> loop, which	312	The library knows two types of such loops, the I<default> loop, which
301	supports signals and child events, and dynamically created loops which do	313	supports child process events, and dynamically created event loops which
302	not.	314	do not.
303		315
304	=over 4	316	=over 4
305		317
306	=item struct ev_loop *ev_default_loop (unsigned int flags)	318	=item struct ev_loop *ev_default_loop (unsigned int flags)
307		319
308	This will initialise the default event loop if it hasn't been initialised	320	This returns the "default" event loop object, which is what you should
309	yet and return it. If the default loop could not be initialised, returns	321	normally use when you just need "the event loop". Event loop objects and
310	false. If it already was initialised it simply returns it (and ignores the	322	the C<flags> parameter are described in more detail in the entry for
311	flags. If that is troubling you, check C<ev_backend ()> afterwards).	323	C<ev_loop_new>.
		324
		325	If the default loop is already initialised then this function simply
		326	returns it (and ignores the flags. If that is troubling you, check
		327	C<ev_backend ()> afterwards). Otherwise it will create it with the given
		328	flags, which should almost always be C<0>, unless the caller is also the
		329	one calling C<ev_run> or otherwise qualifies as "the main program".
312		330
313	If you don't know what event loop to use, use the one returned from this	331	If you don't know what event loop to use, use the one returned from this
314	function.	332	function (or via the C<EV_DEFAULT> macro).
315		333
316	Note that this function is I<not> thread-safe, so if you want to use it	334	Note that this function is I<not> thread-safe, so if you want to use it
317	from multiple threads, you have to lock (note also that this is unlikely,	335	from multiple threads, you have to employ some kind of mutex (note also
318	as loops cannot be shared easily between threads anyway).	336	that this case is unlikely, as loops cannot be shared easily between
		337	threads anyway).
319		338
320	The default loop is the only loop that can handle C<ev_signal> and	339	The default loop is the only loop that can handle C<ev_child> watchers,
321	C<ev_child> watchers, and to do this, it always registers a handler	340	and to do this, it always registers a handler for C<SIGCHLD>. If this is
322	for C<SIGCHLD>. If this is a problem for your application you can either	341	a problem for your application you can either create a dynamic loop with
323	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you	342	C<ev_loop_new> which doesn't do that, or you can simply overwrite the
324	can simply overwrite the C<SIGCHLD> signal handler I<after> calling	343	C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
325	C<ev_default_init>.	344
		345	Example: This is the most typical usage.
		346
		347	if (!ev_default_loop (0))
		348	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
		349
		350	Example: Restrict libev to the select and poll backends, and do not allow
		351	environment settings to be taken into account:
		352
		353	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
		354
		355	=item struct ev_loop *ev_loop_new (unsigned int flags)
		356
		357	This will create and initialise a new event loop object. If the loop
		358	could not be initialised, returns false.
		359
		360	This function is thread-safe, and one common way to use libev with
		361	threads is indeed to create one loop per thread, and using the default
		362	loop in the "main" or "initial" thread.
326		363
327	The flags argument can be used to specify special behaviour or specific	364	The flags argument can be used to specify special behaviour or specific
328	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	365	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
329		366
330	The following flags are supported:	367	The following flags are supported:
…		…
345	useful to try out specific backends to test their performance, or to work	382	useful to try out specific backends to test their performance, or to work
346	around bugs.	383	around bugs.
347		384
348	=item C<EVFLAG_FORKCHECK>	385	=item C<EVFLAG_FORKCHECK>
349		386
350	Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after	387	Instead of calling C<ev_loop_fork> manually after a fork, you can also
351	a fork, you can also make libev check for a fork in each iteration by	388	make libev check for a fork in each iteration by enabling this flag.
352	enabling this flag.
353		389
354	This works by calling C<getpid ()> on every iteration of the loop,	390	This works by calling C<getpid ()> on every iteration of the loop,
355	and thus this might slow down your event loop if you do a lot of loop	391	and thus this might slow down your event loop if you do a lot of loop
356	iterations and little real work, but is usually not noticeable (on my	392	iterations and little real work, but is usually not noticeable (on my
357	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence	393	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
…		…
366	environment variable.	402	environment variable.
367		403
368	=item C<EVFLAG_NOINOTIFY>	404	=item C<EVFLAG_NOINOTIFY>
369		405
370	When this flag is specified, then libev will not attempt to use the	406	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	407	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	408	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.	409	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374		410
375	=item C<EVFLAG_SIGNALFD>	411	=item C<EVFLAG_SIGNALFD>
376		412
377	When this flag is specified, then libev will attempt to use the	413	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	414	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	415	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	416	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	417	handling with threads, as long as you properly block signals in your
382	threads that are not interested in handling them.	418	threads that are not interested in handling them.
383		419
…		…
427	epoll scales either O(1) or O(active_fds).	463	epoll scales either O(1) or O(active_fds).
428		464
429	The epoll mechanism deserves honorable mention as the most misdesigned	465	The epoll mechanism deserves honorable mention as the most misdesigned
430	of the more advanced event mechanisms: mere annoyances include silently	466	of the more advanced event mechanisms: mere annoyances include silently
431	dropping file descriptors, requiring a system call per change per file	467	dropping file descriptors, requiring a system call per change per file
432	descriptor (and unnecessary guessing of parameters), problems with dup and	468	descriptor (and unnecessary guessing of parameters), problems with dup,
		469	returning before the timeout value, resulting in additional iterations
		470	(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	471	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	472	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	473	set, which can take considerable time (one syscall per file descriptor)
436	hard to detect.	474	and is of course hard to detect.
437		475
438	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	476	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	477	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	478	I<different> file descriptors (even already closed ones, so one cannot
441	even remove them from the set) than registered in the set (especially	479	even remove them from the set) than registered in the set (especially
442	on SMP systems). Libev tries to counter these spurious notifications by	480	on SMP systems). Libev tries to counter these spurious notifications by
443	employing an additional generation counter and comparing that against the	481	employing an additional generation counter and comparing that against the
444	events to filter out spurious ones, recreating the set when required.	482	events to filter out spurious ones, recreating the set when required. Last
		483	not least, it also refuses to work with some file descriptors which work
		484	perfectly fine with C<select> (files, many character devices...).
		485
		486	Epoll is truly the train wreck analog among event poll mechanisms.
445		487
446	While stopping, setting and starting an I/O watcher in the same iteration	488	While stopping, setting and starting an I/O watcher in the same iteration
447	will result in some caching, there is still a system call per such	489	will result in some caching, there is still a system call per such
448	incident (because the same I<file descriptor> could point to a different	490	incident (because the same I<file descriptor> could point to a different
449	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	491	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
547	If one or more of the backend flags are or'ed into the flags value,	589	If one or more of the backend flags are or'ed into the flags value,
548	then only these backends will be tried (in the reverse order as listed	590	then only these backends will be tried (in the reverse order as listed
549	here). If none are specified, all backends in C<ev_recommended_backends	591	here). If none are specified, all backends in C<ev_recommended_backends
550	()> will be tried.	592	()> will be tried.
551		593
552	Example: This is the most typical usage.
553
554	if (!ev_default_loop (0))
555	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
556
557	Example: Restrict libev to the select and poll backends, and do not allow
558	environment settings to be taken into account:
559
560	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
561
562	Example: Use whatever libev has to offer, but make sure that kqueue is
563	used if available (warning, breaks stuff, best use only with your own
564	private event loop and only if you know the OS supports your types of
565	fds):
566
567	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
568
569	=item struct ev_loop *ev_loop_new (unsigned int flags)
570
571	Similar to C<ev_default_loop>, but always creates a new event loop that is
572	always distinct from the default loop. Unlike the default loop, it cannot
573	handle signal and child watchers, and attempts to do so will be greeted by
574	undefined behaviour (or a failed assertion if assertions are enabled).
575
576	Note that this function I<is> thread-safe, and the recommended 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.	594	Example: Try to create a event loop that uses epoll and nothing else.
581		595
582	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	596	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
583	if (!epoller)	597	if (!epoller)
584	fatal ("no epoll found here, maybe it hides under your chair");	598	fatal ("no epoll found here, maybe it hides under your chair");
585		599
		600	Example: Use whatever libev has to offer, but make sure that kqueue is
		601	used if available.
		602
		603	struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
		604
586	=item ev_default_destroy ()	605	=item ev_loop_destroy (loop)
587		606
588	Destroys the default loop again (frees all memory and kernel state	607	Destroys an event loop object (frees all memory and kernel state
589	etc.). None of the active event watchers will be stopped in the normal	608	etc.). None of the active event watchers will be stopped in the normal
590	sense, so e.g. C<ev_is_active> might still return true. It is your	609	sense, so e.g. C<ev_is_active> might still return true. It is your
591	responsibility to either stop all watchers cleanly yourself I<before>	610	responsibility to either stop all watchers cleanly yourself I<before>
592	calling this function, or cope with the fact afterwards (which is usually	611	calling this function, or cope with the fact afterwards (which is usually
593	the easiest thing, you can just ignore the watchers and/or C<free ()> them	612	the easiest thing, you can just ignore the watchers and/or C<free ()> them
…		…
595		614
596	Note that certain global state, such as signal state (and installed signal	615	Note that certain global state, such as signal state (and installed signal
597	handlers), will not be freed by this function, and related watchers (such	616	handlers), will not be freed by this function, and related watchers (such
598	as signal and child watchers) would need to be stopped manually.	617	as signal and child watchers) would need to be stopped manually.
599		618
600	In general it is not advisable to call this function except in the	619	This function is normally used on loop objects allocated by
601	rare occasion where you really need to free e.g. the signal handling	620	C<ev_loop_new>, but it can also be used on the default loop returned by
		621	C<ev_default_loop>, in which case it is not thread-safe.
		622
		623	Note that it is not advisable to call this function on the default loop
		624	except in the rare occasion where you really need to free its resources.
602	pipe fds. If you need dynamically allocated loops it is better to use	625	If you need dynamically allocated loops it is better to use C<ev_loop_new>
603	C<ev_loop_new> and C<ev_loop_destroy>.	626	and C<ev_loop_destroy>.
604		627
605	=item ev_loop_destroy (loop)	628	=item ev_loop_fork (loop)
606		629
607	Like C<ev_default_destroy>, but destroys an event loop created by an
608	earlier call to C<ev_loop_new>.
609
610	=item ev_default_fork ()
611
612	This function sets a flag that causes subsequent C<ev_loop> iterations	630	This function sets a flag that causes subsequent C<ev_run> iterations to
613	to reinitialise the kernel state for backends that have one. Despite the	631	reinitialise the kernel state for backends that have one. Despite the
614	name, you can call it anytime, but it makes most sense after forking, in	632	name, you can call it anytime, but it makes most sense after forking, in
615	the child process (or both child and parent, but that again makes little	633	the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
616	sense). You I<must> call it in the child before using any of the libev	634	child before resuming or calling C<ev_run>.
617	functions, and it will only take effect at the next C<ev_loop> iteration.	635
		636	Again, you I<have> to call it on I<any> loop that you want to re-use after
		637	a fork, I<even if you do not plan to use the loop in the parent>. This is
		638	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
		639	during fork.
618		640
619	On the other hand, you only need to call this function in the child	641	On the other hand, you only need to call this function in the child
620	process if and only if you want to use the event library in the child. If	642	process if and only if you want to use the event loop in the child. If
621	you just fork+exec, you don't have to call it at all.	643	you just fork+exec or create a new loop in the child, you don't have to
		644	call it at all (in fact, C<epoll> is so badly broken that it makes a
		645	difference, but libev will usually detect this case on its own and do a
		646	costly reset of the backend).
622		647
623	The function itself is quite fast and it's usually not a problem to call	648	The function itself is quite fast and it's usually not a problem to call
624	it just in case after a fork. To make this easy, the function will fit in	649	it just in case after a fork.
625	quite nicely into a call to C<pthread_atfork>:
626		650
		651	Example: Automate calling C<ev_loop_fork> on the default loop when
		652	using pthreads.
		653
		654	static void
		655	post_fork_child (void)
		656	{
		657	ev_loop_fork (EV_DEFAULT);
		658	}
		659
		660	...
627	pthread_atfork (0, 0, ev_default_fork);	661	pthread_atfork (0, 0, post_fork_child);
628
629	=item ev_loop_fork (loop)
630
631	Like C<ev_default_fork>, but acts on an event loop created by
632	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
633	after fork that you want to re-use in the child, and how you do this is
634	entirely your own problem.
635		662
636	=item int ev_is_default_loop (loop)	663	=item int ev_is_default_loop (loop)
637		664
638	Returns true when the given loop is, in fact, the default loop, and false	665	Returns true when the given loop is, in fact, the default loop, and false
639	otherwise.	666	otherwise.
640		667
641	=item unsigned int ev_loop_count (loop)	668	=item unsigned int ev_iteration (loop)
642		669
643	Returns the count of loop iterations for the loop, which is identical to	670	Returns the current iteration count for the event loop, which is identical
644	the number of times libev did poll for new events. It starts at C<0> and	671	to the number of times libev did poll for new events. It starts at C<0>
645	happily wraps around with enough iterations.	672	and happily wraps around with enough iterations.
646		673
647	This value can sometimes be useful as a generation counter of sorts (it	674	This value can sometimes be useful as a generation counter of sorts (it
648	"ticks" the number of loop iterations), as it roughly corresponds with	675	"ticks" the number of loop iterations), as it roughly corresponds with
649	C<ev_prepare> and C<ev_check> calls.	676	C<ev_prepare> and C<ev_check> calls - and is incremented between the
		677	prepare and check phases.
650		678
651	=item unsigned int ev_loop_depth (loop)	679	=item unsigned int ev_depth (loop)
652		680
653	Returns the number of times C<ev_loop> was entered minus the number of	681	Returns the number of times C<ev_run> was entered minus the number of
654	times C<ev_loop> was exited, in other words, the recursion depth.	682	times C<ev_run> was exited normally, in other words, the recursion depth.
655		683
656	Outside C<ev_loop>, this number is zero. In a callback, this number is	684	Outside C<ev_run>, this number is zero. In a callback, this number is
657	C<1>, unless C<ev_loop> was invoked recursively (or from another thread),	685	C<1>, unless C<ev_run> was invoked recursively (or from another thread),
658	in which case it is higher.	686	in which case it is higher.
659		687
660	Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread	688	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
661	etc.), doesn't count as exit.	689	throwing an exception etc.), doesn't count as "exit" - consider this
		690	as a hint to avoid such ungentleman-like behaviour unless it's really
		691	convenient, in which case it is fully supported.
662		692
663	=item unsigned int ev_backend (loop)	693	=item unsigned int ev_backend (loop)
664		694
665	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	695	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
666	use.	696	use.
…		…
675		705
676	=item ev_now_update (loop)	706	=item ev_now_update (loop)
677		707
678	Establishes the current time by querying the kernel, updating the time	708	Establishes the current time by querying the kernel, updating the time
679	returned by C<ev_now ()> in the progress. This is a costly operation and	709	returned by C<ev_now ()> in the progress. This is a costly operation and
680	is usually done automatically within C<ev_loop ()>.	710	is usually done automatically within C<ev_run ()>.
681		711
682	This function is rarely useful, but when some event callback runs for a	712	This function is rarely useful, but when some event callback runs for a
683	very long time without entering the event loop, updating libev's idea of	713	very long time without entering the event loop, updating libev's idea of
684	the current time is a good idea.	714	the current time is a good idea.
685		715
…		…
687		717
688	=item ev_suspend (loop)	718	=item ev_suspend (loop)
689		719
690	=item ev_resume (loop)	720	=item ev_resume (loop)
691		721
692	These two functions suspend and resume a loop, for use when the loop is	722	These two functions suspend and resume an event loop, for use when the
693	not used for a while and timeouts should not be processed.	723	loop is not used for a while and timeouts should not be processed.
694		724
695	A typical use case would be an interactive program such as a game: When	725	A typical use case would be an interactive program such as a game: When
696	the user presses C<^Z> to suspend the game and resumes it an hour later it	726	the user presses C<^Z> to suspend the game and resumes it an hour later it
697	would be best to handle timeouts as if no time had actually passed while	727	would be best to handle timeouts as if no time had actually passed while
698	the program was suspended. This can be achieved by calling C<ev_suspend>	728	the program was suspended. This can be achieved by calling C<ev_suspend>
…		…
700	C<ev_resume> directly afterwards to resume timer processing.	730	C<ev_resume> directly afterwards to resume timer processing.
701		731
702	Effectively, all C<ev_timer> watchers will be delayed by the time spend	732	Effectively, all C<ev_timer> watchers will be delayed by the time spend
703	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers	733	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
704	will be rescheduled (that is, they will lose any events that would have	734	will be rescheduled (that is, they will lose any events that would have
705	occured while suspended).	735	occurred while suspended).
706		736
707	After calling C<ev_suspend> you B<must not> call I<any> function on the	737	After calling C<ev_suspend> you B<must not> call I<any> function on the
708	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>	738	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
709	without a previous call to C<ev_suspend>.	739	without a previous call to C<ev_suspend>.
710		740
711	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	741	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
712	event loop time (see C<ev_now_update>).	742	event loop time (see C<ev_now_update>).
713		743
714	=item ev_loop (loop, int flags)	744	=item ev_run (loop, int flags)
715		745
716	Finally, this is it, the event handler. This function usually is called	746	Finally, this is it, the event handler. This function usually is called
717	after you have initialised all your watchers and you want to start	747	after you have initialised all your watchers and you want to start
718	handling events.	748	handling events. It will ask the operating system for any new events, call
		749	the watcher callbacks, an then repeat the whole process indefinitely: This
		750	is why event loops are called I<loops>.
719		751
720	If the flags argument is specified as C<0>, it will not return until	752	If the flags argument is specified as C<0>, it will keep handling events
721	either no event watchers are active anymore or C<ev_unloop> was called.	753	until either no event watchers are active anymore or C<ev_break> was
		754	called.
722		755
723	Please note that an explicit C<ev_unloop> is usually better than	756	Please note that an explicit C<ev_break> is usually better than
724	relying on all watchers to be stopped when deciding when a program has	757	relying on all watchers to be stopped when deciding when a program has
725	finished (especially in interactive programs), but having a program	758	finished (especially in interactive programs), but having a program
726	that automatically loops as long as it has to and no longer by virtue	759	that automatically loops as long as it has to and no longer by virtue
727	of relying on its watchers stopping correctly, that is truly a thing of	760	of relying on its watchers stopping correctly, that is truly a thing of
728	beauty.	761	beauty.
729		762
		763	This function is also I<mostly> exception-safe - you can break out of
		764	a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
		765	exception and so on. This does not decrement the C<ev_depth> value, nor
		766	will it clear any outstanding C<EVBREAK_ONE> breaks.
		767
730	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	768	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
731	those events and any already outstanding ones, but will not block your	769	those events and any already outstanding ones, but will not wait and
732	process in case there are no events and will return after one iteration of	770	block your process in case there are no events and will return after one
733	the loop.	771	iteration of the loop. This is sometimes useful to poll and handle new
		772	events while doing lengthy calculations, to keep the program responsive.
734		773
735	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	774	A flags value of C<EVRUN_ONCE> will look for new events (waiting if
736	necessary) and will handle those and any already outstanding ones. It	775	necessary) and will handle those and any already outstanding ones. It
737	will block your process until at least one new event arrives (which could	776	will block your process until at least one new event arrives (which could
738	be an event internal to libev itself, so there is no guarantee that a	777	be an event internal to libev itself, so there is no guarantee that a
739	user-registered callback will be called), and will return after one	778	user-registered callback will be called), and will return after one
740	iteration of the loop.	779	iteration of the loop.
741		780
742	This is useful if you are waiting for some external event in conjunction	781	This is useful if you are waiting for some external event in conjunction
743	with something not expressible using other libev watchers (i.e. "roll your	782	with something not expressible using other libev watchers (i.e. "roll your
744	own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	783	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
745	usually a better approach for this kind of thing.	784	usually a better approach for this kind of thing.
746		785
747	Here are the gory details of what C<ev_loop> does:	786	Here are the gory details of what C<ev_run> does:
748		787
		788	- Increment loop depth.
		789	- Reset the ev_break status.
749	- Before the first iteration, call any pending watchers.	790	- Before the first iteration, call any pending watchers.
		791	LOOP:
750	* If EVFLAG_FORKCHECK was used, check for a fork.	792	- If EVFLAG_FORKCHECK was used, check for a fork.
751	- If a fork was detected (by any means), queue and call all fork watchers.	793	- If a fork was detected (by any means), queue and call all fork watchers.
752	- Queue and call all prepare watchers.	794	- Queue and call all prepare watchers.
		795	- If ev_break was called, goto FINISH.
753	- If we have been forked, detach and recreate the kernel state	796	- If we have been forked, detach and recreate the kernel state
754	as to not disturb the other process.	797	as to not disturb the other process.
755	- Update the kernel state with all outstanding changes.	798	- Update the kernel state with all outstanding changes.
756	- Update the "event loop time" (ev_now ()).	799	- Update the "event loop time" (ev_now ()).
757	- Calculate for how long to sleep or block, if at all	800	- Calculate for how long to sleep or block, if at all
758	(active idle watchers, EVLOOP_NONBLOCK or not having	801	(active idle watchers, EVRUN_NOWAIT or not having
759	any active watchers at all will result in not sleeping).	802	any active watchers at all will result in not sleeping).
760	- Sleep if the I/O and timer collect interval say so.	803	- Sleep if the I/O and timer collect interval say so.
		804	- Increment loop iteration counter.
761	- Block the process, waiting for any events.	805	- Block the process, waiting for any events.
762	- Queue all outstanding I/O (fd) events.	806	- Queue all outstanding I/O (fd) events.
763	- Update the "event loop time" (ev_now ()), and do time jump adjustments.	807	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
764	- Queue all expired timers.	808	- Queue all expired timers.
765	- Queue all expired periodics.	809	- Queue all expired periodics.
766	- Unless any events are pending now, queue all idle watchers.	810	- Queue all idle watchers with priority higher than that of pending events.
767	- Queue all check watchers.	811	- Queue all check watchers.
768	- Call all queued watchers in reverse order (i.e. check watchers first).	812	- Call all queued watchers in reverse order (i.e. check watchers first).
769	Signals and child watchers are implemented as I/O watchers, and will	813	Signals and child watchers are implemented as I/O watchers, and will
770	be handled here by queueing them when their watcher gets executed.	814	be handled here by queueing them when their watcher gets executed.
771	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	815	- If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
772	were used, or there are no active watchers, return, otherwise	816	were used, or there are no active watchers, goto FINISH, otherwise
773	continue with step *.	817	continue with step LOOP.
		818	FINISH:
		819	- Reset the ev_break status iff it was EVBREAK_ONE.
		820	- Decrement the loop depth.
		821	- Return.
774		822
775	Example: Queue some jobs and then loop until no events are outstanding	823	Example: Queue some jobs and then loop until no events are outstanding
776	anymore.	824	anymore.
777		825
778	... queue jobs here, make sure they register event watchers as long	826	... queue jobs here, make sure they register event watchers as long
779	... as they still have work to do (even an idle watcher will do..)	827	... as they still have work to do (even an idle watcher will do..)
780	ev_loop (my_loop, 0);	828	ev_run (my_loop, 0);
781	... jobs done or somebody called unloop. yeah!	829	... jobs done or somebody called unloop. yeah!
782		830
783	=item ev_unloop (loop, how)	831	=item ev_break (loop, how)
784		832
785	Can be used to make a call to C<ev_loop> return early (but only after it	833	Can be used to make a call to C<ev_run> return early (but only after it
786	has processed all outstanding events). The C<how> argument must be either	834	has processed all outstanding events). The C<how> argument must be either
787	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	835	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
788	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	836	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
789		837
790	This "unloop state" will be cleared when entering C<ev_loop> again.	838	This "break state" will be cleared on the next call to C<ev_run>.
791		839
792	It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls.	840	It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
		841	which case it will have no effect.
793		842
794	=item ev_ref (loop)	843	=item ev_ref (loop)
795		844
796	=item ev_unref (loop)	845	=item ev_unref (loop)
797		846
798	Ref/unref can be used to add or remove a reference count on the event	847	Ref/unref can be used to add or remove a reference count on the event
799	loop: Every watcher keeps one reference, and as long as the reference	848	loop: Every watcher keeps one reference, and as long as the reference
800	count is nonzero, C<ev_loop> will not return on its own.	849	count is nonzero, C<ev_run> will not return on its own.
801		850
802	This is useful when you have a watcher that you never intend to	851	This is useful when you have a watcher that you never intend to
803	unregister, but that nevertheless should not keep C<ev_loop> from	852	unregister, but that nevertheless should not keep C<ev_run> from
804	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>	853	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
805	before stopping it.	854	before stopping it.
806		855
807	As an example, libev itself uses this for its internal signal pipe: It	856	As an example, libev itself uses this for its internal signal pipe: It
808	is not visible to the libev user and should not keep C<ev_loop> from	857	is not visible to the libev user and should not keep C<ev_run> from
809	exiting if no event watchers registered by it are active. It is also an	858	exiting if no event watchers registered by it are active. It is also an
810	excellent way to do this for generic recurring timers or from within	859	excellent way to do this for generic recurring timers or from within
811	third-party libraries. Just remember to I<unref after start> and I<ref	860	third-party libraries. Just remember to I<unref after start> and I<ref
812	before stop> (but only if the watcher wasn't active before, or was active	861	before stop> (but only if the watcher wasn't active before, or was active
813	before, respectively. Note also that libev might stop watchers itself	862	before, respectively. Note also that libev might stop watchers itself
814	(e.g. non-repeating timers) in which case you have to C<ev_ref>	863	(e.g. non-repeating timers) in which case you have to C<ev_ref>
815	in the callback).	864	in the callback).
816		865
817	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	866	Example: Create a signal watcher, but keep it from keeping C<ev_run>
818	running when nothing else is active.	867	running when nothing else is active.
819		868
820	ev_signal exitsig;	869	ev_signal exitsig;
821	ev_signal_init (&exitsig, sig_cb, SIGINT);	870	ev_signal_init (&exitsig, sig_cb, SIGINT);
822	ev_signal_start (loop, &exitsig);	871	ev_signal_start (loop, &exitsig);
…		…
867	usually doesn't make much sense to set it to a lower value than C<0.01>,	916	usually doesn't make much sense to set it to a lower value than C<0.01>,
868	as this approaches the timing granularity of most systems. Note that if	917	as this approaches the timing granularity of most systems. Note that if
869	you do transactions with the outside world and you can't increase the	918	you do transactions with the outside world and you can't increase the
870	parallelity, then this setting will limit your transaction rate (if you	919	parallelity, then this setting will limit your transaction rate (if you
871	need to poll once per transaction and the I/O collect interval is 0.01,	920	need to poll once per transaction and the I/O collect interval is 0.01,
872	then you can't do more than 100 transations per second).	921	then you can't do more than 100 transactions per second).
873		922
874	Setting the I<timeout collect interval> can improve the opportunity for	923	Setting the I<timeout collect interval> can improve the opportunity for
875	saving power, as the program will "bundle" timer callback invocations that	924	saving power, as the program will "bundle" timer callback invocations that
876	are "near" in time together, by delaying some, thus reducing the number of	925	are "near" in time together, by delaying some, thus reducing the number of
877	times the process sleeps and wakes up again. Another useful technique to	926	times the process sleeps and wakes up again. Another useful technique to
…		…
885	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);	934	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
886		935
887	=item ev_invoke_pending (loop)	936	=item ev_invoke_pending (loop)
888		937
889	This call will simply invoke all pending watchers while resetting their	938	This call will simply invoke all pending watchers while resetting their
890	pending state. Normally, C<ev_loop> does this automatically when required,	939	pending state. Normally, C<ev_run> does this automatically when required,
891	but when overriding the invoke callback this call comes handy.	940	but when overriding the invoke callback this call comes handy. This
		941	function can be invoked from a watcher - this can be useful for example
		942	when you want to do some lengthy calculation and want to pass further
		943	event handling to another thread (you still have to make sure only one
		944	thread executes within C<ev_invoke_pending> or C<ev_run> of course).
892		945
893	=item int ev_pending_count (loop)	946	=item int ev_pending_count (loop)
894		947
895	Returns the number of pending watchers - zero indicates that no watchers	948	Returns the number of pending watchers - zero indicates that no watchers
896	are pending.	949	are pending.
897		950
898	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))	951	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
899		952
900	This overrides the invoke pending functionality of the loop: Instead of	953	This overrides the invoke pending functionality of the loop: Instead of
901	invoking all pending watchers when there are any, C<ev_loop> will call	954	invoking all pending watchers when there are any, C<ev_run> will call
902	this callback instead. This is useful, for example, when you want to	955	this callback instead. This is useful, for example, when you want to
903	invoke the actual watchers inside another context (another thread etc.).	956	invoke the actual watchers inside another context (another thread etc.).
904		957
905	If you want to reset the callback, use C<ev_invoke_pending> as new	958	If you want to reset the callback, use C<ev_invoke_pending> as new
906	callback.	959	callback.
…		…
909		962
910	Sometimes you want to share the same loop between multiple threads. This	963	Sometimes you want to share the same loop between multiple threads. This
911	can be done relatively simply by putting mutex_lock/unlock calls around	964	can be done relatively simply by putting mutex_lock/unlock calls around
912	each call to a libev function.	965	each call to a libev function.
913		966
914	However, C<ev_loop> can run an indefinite time, so it is not feasible to	967	However, C<ev_run> can run an indefinite time, so it is not feasible
915	wait for it to return. One way around this is to wake up the loop via	968	to wait for it to return. One way around this is to wake up the event
916	C<ev_unloop> and C<av_async_send>, another way is to set these I<release>	969	loop via C<ev_break> and C<av_async_send>, another way is to set these
917	and I<acquire> callbacks on the loop.	970	I<release> and I<acquire> callbacks on the loop.
918		971
919	When set, then C<release> will be called just before the thread is	972	When set, then C<release> will be called just before the thread is
920	suspended waiting for new events, and C<acquire> is called just	973	suspended waiting for new events, and C<acquire> is called just
921	afterwards.	974	afterwards.
922		975
…		…
925		978
926	While event loop modifications are allowed between invocations of	979	While event loop modifications are allowed between invocations of
927	C<release> and C<acquire> (that's their only purpose after all), no	980	C<release> and C<acquire> (that's their only purpose after all), no
928	modifications done will affect the event loop, i.e. adding watchers will	981	modifications done will affect the event loop, i.e. adding watchers will
929	have no effect on the set of file descriptors being watched, or the time	982	have no effect on the set of file descriptors being watched, or the time
930	waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it	983	waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
931	to take note of any changes you made.	984	to take note of any changes you made.
932		985
933	In theory, threads executing C<ev_loop> will be async-cancel safe between	986	In theory, threads executing C<ev_run> will be async-cancel safe between
934	invocations of C<release> and C<acquire>.	987	invocations of C<release> and C<acquire>.
935		988
936	See also the locking example in the C<THREADS> section later in this	989	See also the locking example in the C<THREADS> section later in this
937	document.	990	document.
938		991
…		…
940		993
941	=item ev_userdata (loop)	994	=item ev_userdata (loop)
942		995
943	Set and retrieve a single C<void *> associated with a loop. When	996	Set and retrieve a single C<void *> associated with a loop. When
944	C<ev_set_userdata> has never been called, then C<ev_userdata> returns	997	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
945	C<0.>	998	C<0>.
946		999
947	These two functions can be used to associate arbitrary data with a loop,	1000	These two functions can be used to associate arbitrary data with a loop,
948	and are intended solely for the C<invoke_pending_cb>, C<release> and	1001	and are intended solely for the C<invoke_pending_cb>, C<release> and
949	C<acquire> callbacks described above, but of course can be (ab-)used for	1002	C<acquire> callbacks described above, but of course can be (ab-)used for
950	any other purpose as well.	1003	any other purpose as well.
951		1004
952	=item ev_loop_verify (loop)	1005	=item ev_verify (loop)
953		1006
954	This function only does something when C<EV_VERIFY> support has been	1007	This function only does something when C<EV_VERIFY> support has been
955	compiled in, which is the default for non-minimal builds. It tries to go	1008	compiled in, which is the default for non-minimal builds. It tries to go
956	through all internal structures and checks them for validity. If anything	1009	through all internal structures and checks them for validity. If anything
957	is found to be inconsistent, it will print an error message to standard	1010	is found to be inconsistent, it will print an error message to standard
…		…
968		1021
969	In the following description, uppercase C<TYPE> in names stands for the	1022	In the following description, uppercase C<TYPE> in names stands for the
970	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer	1023	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
971	watchers and C<ev_io_start> for I/O watchers.	1024	watchers and C<ev_io_start> for I/O watchers.
972		1025
973	A watcher is a structure that you create and register to record your	1026	A watcher is an opaque structure that you allocate and register to record
974	interest in some event. For instance, if you want to wait for STDIN to	1027	your interest in some event. To make a concrete example, imagine you want
975	become readable, you would create an C<ev_io> watcher for that:	1028	to wait for STDIN to become readable, you would create an C<ev_io> watcher
		1029	for that:
976		1030
977	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)	1031	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
978	{	1032	{
979	ev_io_stop (w);	1033	ev_io_stop (w);
980	ev_unloop (loop, EVUNLOOP_ALL);	1034	ev_break (loop, EVBREAK_ALL);
981	}	1035	}
982		1036
983	struct ev_loop *loop = ev_default_loop (0);	1037	struct ev_loop *loop = ev_default_loop (0);
984		1038
985	ev_io stdin_watcher;	1039	ev_io stdin_watcher;
986		1040
987	ev_init (&stdin_watcher, my_cb);	1041	ev_init (&stdin_watcher, my_cb);
988	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	1042	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
989	ev_io_start (loop, &stdin_watcher);	1043	ev_io_start (loop, &stdin_watcher);
990		1044
991	ev_loop (loop, 0);	1045	ev_run (loop, 0);
992		1046
993	As you can see, you are responsible for allocating the memory for your	1047	As you can see, you are responsible for allocating the memory for your
994	watcher structures (and it is I<usually> a bad idea to do this on the	1048	watcher structures (and it is I<usually> a bad idea to do this on the
995	stack).	1049	stack).
996		1050
997	Each watcher has an associated watcher structure (called C<struct ev_TYPE>	1051	Each watcher has an associated watcher structure (called C<struct ev_TYPE>
998	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).	1052	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
999		1053
1000	Each watcher structure must be initialised by a call to C<ev_init	1054	Each watcher structure must be initialised by a call to C<ev_init (watcher
1001	(watcher *, callback)>, which expects a callback to be provided. This	1055	*, callback)>, which expects a callback to be provided. This callback is
1002	callback gets invoked each time the event occurs (or, in the case of I/O	1056	invoked each time the event occurs (or, in the case of I/O watchers, each
1003	watchers, each time the event loop detects that the file descriptor given	1057	time the event loop detects that the file descriptor given is readable
1004	is readable and/or writable).	1058	and/or writable).
1005		1059
1006	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>	1060	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
1007	macro to configure it, with arguments specific to the watcher type. There	1061	macro to configure it, with arguments specific to the watcher type. There
1008	is also a macro to combine initialisation and setting in one call: C<<	1062	is also a macro to combine initialisation and setting in one call: C<<
1009	ev_TYPE_init (watcher *, callback, ...) >>.	1063	ev_TYPE_init (watcher *, callback, ...) >>.
…		…
1032	=item C<EV_WRITE>	1086	=item C<EV_WRITE>
1033		1087
1034	The file descriptor in the C<ev_io> watcher has become readable and/or	1088	The file descriptor in the C<ev_io> watcher has become readable and/or
1035	writable.	1089	writable.
1036		1090
1037	=item C<EV_TIMEOUT>	1091	=item C<EV_TIMER>
1038		1092
1039	The C<ev_timer> watcher has timed out.	1093	The C<ev_timer> watcher has timed out.
1040		1094
1041	=item C<EV_PERIODIC>	1095	=item C<EV_PERIODIC>
1042		1096
…		…
1060		1114
1061	=item C<EV_PREPARE>	1115	=item C<EV_PREPARE>
1062		1116
1063	=item C<EV_CHECK>	1117	=item C<EV_CHECK>
1064		1118
1065	All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts	1119	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
1066	to gather new events, and all C<ev_check> watchers are invoked just after	1120	to gather new events, and all C<ev_check> watchers are invoked just after
1067	C<ev_loop> has gathered them, but before it invokes any callbacks for any	1121	C<ev_run> has gathered them, but before it invokes any callbacks for any
1068	received events. Callbacks of both watcher types can start and stop as	1122	received events. Callbacks of both watcher types can start and stop as
1069	many watchers as they want, and all of them will be taken into account	1123	many watchers as they want, and all of them will be taken into account
1070	(for example, a C<ev_prepare> watcher might start an idle watcher to keep	1124	(for example, a C<ev_prepare> watcher might start an idle watcher to keep
1071	C<ev_loop> from blocking).	1125	C<ev_run> from blocking).
1072		1126
1073	=item C<EV_EMBED>	1127	=item C<EV_EMBED>
1074		1128
1075	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1129	The embedded event loop specified in the C<ev_embed> watcher needs attention.
1076		1130
1077	=item C<EV_FORK>	1131	=item C<EV_FORK>
1078		1132
1079	The event loop has been resumed in the child process after fork (see	1133	The event loop has been resumed in the child process after fork (see
1080	C<ev_fork>).	1134	C<ev_fork>).
		1135
		1136	=item C<EV_CLEANUP>
		1137
		1138	The event loop is about to be destroyed (see C<ev_cleanup>).
1081		1139
1082	=item C<EV_ASYNC>	1140	=item C<EV_ASYNC>
1083		1141
1084	The given async watcher has been asynchronously notified (see C<ev_async>).	1142	The given async watcher has been asynchronously notified (see C<ev_async>).
1085		1143
…		…
1257		1315
1258	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1316	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1259	functions that do not need a watcher.	1317	functions that do not need a watcher.
1260		1318
1261	=back	1319	=back
1262
1263		1320
1264	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1321	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1265		1322
1266	Each watcher has, by default, a member C<void *data> that you can change	1323	Each watcher has, by default, a member C<void *data> that you can change
1267	and read at any time: libev will completely ignore it. This can be used	1324	and read at any time: libev will completely ignore it. This can be used
…		…
1323	t2_cb (EV_P_ ev_timer *w, int revents)	1380	t2_cb (EV_P_ ev_timer *w, int revents)
1324	{	1381	{
1325	struct my_biggy big = (struct my_biggy *)	1382	struct my_biggy big = (struct my_biggy *)
1326	(((char *)w) - offsetof (struct my_biggy, t2));	1383	(((char *)w) - offsetof (struct my_biggy, t2));
1327	}	1384	}
		1385
		1386	=head2 WATCHER STATES
		1387
		1388	There are various watcher states mentioned throughout this manual -
		1389	active, pending and so on. In this section these states and the rules to
		1390	transition between them will be described in more detail - and while these
		1391	rules might look complicated, they usually do "the right thing".
		1392
		1393	=over 4
		1394
		1395	=item initialiased
		1396
		1397	Before a watcher can be registered with the event looop it has to be
		1398	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
		1399	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
		1400
		1401	In this state it is simply some block of memory that is suitable for use
		1402	in an event loop. It can be moved around, freed, reused etc. at will.
		1403
		1404	=item started/running/active
		1405
		1406	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
		1407	property of the event loop, and is actively waiting for events. While in
		1408	this state it cannot be accessed (except in a few documented ways), moved,
		1409	freed or anything else - the only legal thing is to keep a pointer to it,
		1410	and call libev functions on it that are documented to work on active watchers.
		1411
		1412	=item pending
		1413
		1414	If a watcher is active and libev determines that an event it is interested
		1415	in has occurred (such as a timer expiring), it will become pending. It will
		1416	stay in this pending state until either it is stopped or its callback is
		1417	about to be invoked, so it is not normally pending inside the watcher
		1418	callback.
		1419
		1420	The watcher might or might not be active while it is pending (for example,
		1421	an expired non-repeating timer can be pending but no longer active). If it
		1422	is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
		1423	but it is still property of the event loop at this time, so cannot be
		1424	moved, freed or reused. And if it is active the rules described in the
		1425	previous item still apply.
		1426
		1427	It is also possible to feed an event on a watcher that is not active (e.g.
		1428	via C<ev_feed_event>), in which case it becomes pending without being
		1429	active.
		1430
		1431	=item stopped
		1432
		1433	A watcher can be stopped implicitly by libev (in which case it might still
		1434	be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
		1435	latter will clear any pending state the watcher might be in, regardless
		1436	of whether it was active or not, so stopping a watcher explicitly before
		1437	freeing it is often a good idea.
		1438
		1439	While stopped (and not pending) the watcher is essentially in the
		1440	initialised state, that is it can be reused, moved, modified in any way
		1441	you wish.
		1442
		1443	=back
1328		1444
1329	=head2 WATCHER PRIORITY MODELS	1445	=head2 WATCHER PRIORITY MODELS
1330		1446
1331	Many event loops support I<watcher priorities>, which are usually small	1447	Many event loops support I<watcher priorities>, which are usually small
1332	integers that influence the ordering of event callback invocation	1448	integers that influence the ordering of event callback invocation
…		…
1375		1491
1376	For example, to emulate how many other event libraries handle priorities,	1492	For example, to emulate how many other event libraries handle priorities,
1377	you can associate an C<ev_idle> watcher to each such watcher, and in	1493	you can associate an C<ev_idle> watcher to each such watcher, and in
1378	the normal watcher callback, you just start the idle watcher. The real	1494	the normal watcher callback, you just start the idle watcher. The real
1379	processing is done in the idle watcher callback. This causes libev to	1495	processing is done in the idle watcher callback. This causes libev to
1380	continously poll and process kernel event data for the watcher, but when	1496	continuously poll and process kernel event data for the watcher, but when
1381	the lock-out case is known to be rare (which in turn is rare :), this is	1497	the lock-out case is known to be rare (which in turn is rare :), this is
1382	workable.	1498	workable.
1383		1499
1384	Usually, however, the lock-out model implemented that way will perform	1500	Usually, however, the lock-out model implemented that way will perform
1385	miserably under the type of load it was designed to handle. In that case,	1501	miserably under the type of load it was designed to handle. In that case,
…		…
1399	{	1515	{
1400	// stop the I/O watcher, we received the event, but	1516	// stop the I/O watcher, we received the event, but
1401	// are not yet ready to handle it.	1517	// are not yet ready to handle it.
1402	ev_io_stop (EV_A_ w);	1518	ev_io_stop (EV_A_ w);
1403		1519
1404	// start the idle watcher to ahndle the actual event.	1520	// start the idle watcher to handle the actual event.
1405	// it will not be executed as long as other watchers	1521	// it will not be executed as long as other watchers
1406	// with the default priority are receiving events.	1522	// with the default priority are receiving events.
1407	ev_idle_start (EV_A_ &idle);	1523	ev_idle_start (EV_A_ &idle);
1408	}	1524	}
1409		1525
…		…
1463		1579
1464	If you cannot use non-blocking mode, then force the use of a	1580	If you cannot use non-blocking mode, then force the use of a
1465	known-to-be-good backend (at the time of this writing, this includes only	1581	known-to-be-good backend (at the time of this writing, this includes only
1466	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file	1582	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1467	descriptors for which non-blocking operation makes no sense (such as	1583	descriptors for which non-blocking operation makes no sense (such as
1468	files) - libev doesn't guarentee any specific behaviour in that case.	1584	files) - libev doesn't guarantee any specific behaviour in that case.
1469		1585
1470	Another thing you have to watch out for is that it is quite easy to	1586	Another thing you have to watch out for is that it is quite easy to
1471	receive "spurious" readiness notifications, that is your callback might	1587	receive "spurious" readiness notifications, that is your callback might
1472	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1588	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1473	because there is no data. Not only are some backends known to create a	1589	because there is no data. Not only are some backends known to create a
…		…
1538		1654
1539	So when you encounter spurious, unexplained daemon exits, make sure you	1655	So when you encounter spurious, unexplained daemon exits, make sure you
1540	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon	1656	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1541	somewhere, as that would have given you a big clue).	1657	somewhere, as that would have given you a big clue).
1542		1658
		1659	=head3 The special problem of accept()ing when you can't
		1660
		1661	Many implementations of the POSIX C<accept> function (for example,
		1662	found in post-2004 Linux) have the peculiar behaviour of not removing a
		1663	connection from the pending queue in all error cases.
		1664
		1665	For example, larger servers often run out of file descriptors (because
		1666	of resource limits), causing C<accept> to fail with C<ENFILE> but not
		1667	rejecting the connection, leading to libev signalling readiness on
		1668	the next iteration again (the connection still exists after all), and
		1669	typically causing the program to loop at 100% CPU usage.
		1670
		1671	Unfortunately, the set of errors that cause this issue differs between
		1672	operating systems, there is usually little the app can do to remedy the
		1673	situation, and no known thread-safe method of removing the connection to
		1674	cope with overload is known (to me).
		1675
		1676	One of the easiest ways to handle this situation is to just ignore it
		1677	- when the program encounters an overload, it will just loop until the
		1678	situation is over. While this is a form of busy waiting, no OS offers an
		1679	event-based way to handle this situation, so it's the best one can do.
		1680
		1681	A better way to handle the situation is to log any errors other than
		1682	C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
		1683	messages, and continue as usual, which at least gives the user an idea of
		1684	what could be wrong ("raise the ulimit!"). For extra points one could stop
		1685	the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
		1686	usage.
		1687
		1688	If your program is single-threaded, then you could also keep a dummy file
		1689	descriptor for overload situations (e.g. by opening F</dev/null>), and
		1690	when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
		1691	close that fd, and create a new dummy fd. This will gracefully refuse
		1692	clients under typical overload conditions.
		1693
		1694	The last way to handle it is to simply log the error and C<exit>, as
		1695	is often done with C<malloc> failures, but this results in an easy
		1696	opportunity for a DoS attack.
1543		1697
1544	=head3 Watcher-Specific Functions	1698	=head3 Watcher-Specific Functions
1545		1699
1546	=over 4	1700	=over 4
1547		1701
…		…
1579	...	1733	...
1580	struct ev_loop *loop = ev_default_init (0);	1734	struct ev_loop *loop = ev_default_init (0);
1581	ev_io stdin_readable;	1735	ev_io stdin_readable;
1582	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1736	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1583	ev_io_start (loop, &stdin_readable);	1737	ev_io_start (loop, &stdin_readable);
1584	ev_loop (loop, 0);	1738	ev_run (loop, 0);
1585		1739
1586		1740
1587	=head2 C<ev_timer> - relative and optionally repeating timeouts	1741	=head2 C<ev_timer> - relative and optionally repeating timeouts
1588		1742
1589	Timer watchers are simple relative timers that generate an event after a	1743	Timer watchers are simple relative timers that generate an event after a
…		…
1598	The callback is guaranteed to be invoked only I<after> its timeout has	1752	The callback is guaranteed to be invoked only I<after> its timeout has
1599	passed (not I<at>, so on systems with very low-resolution clocks this	1753	passed (not I<at>, so on systems with very low-resolution clocks this
1600	might introduce a small delay). If multiple timers become ready during the	1754	might introduce a small delay). If multiple timers become ready during the
1601	same loop iteration then the ones with earlier time-out values are invoked	1755	same loop iteration then the ones with earlier time-out values are invoked
1602	before ones of the same priority with later time-out values (but this is	1756	before ones of the same priority with later time-out values (but this is
1603	no longer true when a callback calls C<ev_loop> recursively).	1757	no longer true when a callback calls C<ev_run> recursively).
1604		1758
1605	=head3 Be smart about timeouts	1759	=head3 Be smart about timeouts
1606		1760
1607	Many real-world problems involve some kind of timeout, usually for error	1761	Many real-world problems involve some kind of timeout, usually for error
1608	recovery. A typical example is an HTTP request - if the other side hangs,	1762	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1694	ev_tstamp timeout = last_activity + 60.;	1848	ev_tstamp timeout = last_activity + 60.;
1695		1849
1696	// if last_activity + 60. is older than now, we did time out	1850	// if last_activity + 60. is older than now, we did time out
1697	if (timeout < now)	1851	if (timeout < now)
1698	{	1852	{
1699	// timeout occured, take action	1853	// timeout occurred, take action
1700	}	1854	}
1701	else	1855	else
1702	{	1856	{
1703	// callback was invoked, but there was some activity, re-arm	1857	// callback was invoked, but there was some activity, re-arm
1704	// the watcher to fire in last_activity + 60, which is	1858	// the watcher to fire in last_activity + 60, which is
…		…
1726	to the current time (meaning we just have some activity :), then call the	1880	to the current time (meaning we just have some activity :), then call the
1727	callback, which will "do the right thing" and start the timer:	1881	callback, which will "do the right thing" and start the timer:
1728		1882
1729	ev_init (timer, callback);	1883	ev_init (timer, callback);
1730	last_activity = ev_now (loop);	1884	last_activity = ev_now (loop);
1731	callback (loop, timer, EV_TIMEOUT);	1885	callback (loop, timer, EV_TIMER);
1732		1886
1733	And when there is some activity, simply store the current time in	1887	And when there is some activity, simply store the current time in
1734	C<last_activity>, no libev calls at all:	1888	C<last_activity>, no libev calls at all:
1735		1889
1736	last_actiivty = ev_now (loop);	1890	last_activity = ev_now (loop);
1737		1891
1738	This technique is slightly more complex, but in most cases where the	1892	This technique is slightly more complex, but in most cases where the
1739	time-out is unlikely to be triggered, much more efficient.	1893	time-out is unlikely to be triggered, much more efficient.
1740		1894
1741	Changing the timeout is trivial as well (if it isn't hard-coded in the	1895	Changing the timeout is trivial as well (if it isn't hard-coded in the
…		…
1779		1933
1780	=head3 The special problem of time updates	1934	=head3 The special problem of time updates
1781		1935
1782	Establishing the current time is a costly operation (it usually takes at	1936	Establishing the current time is a costly operation (it usually takes at
1783	least two system calls): EV therefore updates its idea of the current	1937	least two system calls): EV therefore updates its idea of the current
1784	time only before and after C<ev_loop> collects new events, which causes a	1938	time only before and after C<ev_run> collects new events, which causes a
1785	growing difference between C<ev_now ()> and C<ev_time ()> when handling	1939	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1786	lots of events in one iteration.	1940	lots of events in one iteration.
1787		1941
1788	The relative timeouts are calculated relative to the C<ev_now ()>	1942	The relative timeouts are calculated relative to the C<ev_now ()>
1789	time. This is usually the right thing as this timestamp refers to the time	1943	time. This is usually the right thing as this timestamp refers to the time
…		…
1906	}	2060	}
1907		2061
1908	ev_timer mytimer;	2062	ev_timer mytimer;
1909	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	2063	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1910	ev_timer_again (&mytimer); /* start timer */	2064	ev_timer_again (&mytimer); /* start timer */
1911	ev_loop (loop, 0);	2065	ev_run (loop, 0);
1912		2066
1913	// and in some piece of code that gets executed on any "activity":	2067	// and in some piece of code that gets executed on any "activity":
1914	// reset the timeout to start ticking again at 10 seconds	2068	// reset the timeout to start ticking again at 10 seconds
1915	ev_timer_again (&mytimer);	2069	ev_timer_again (&mytimer);
1916		2070
…		…
1942		2096
1943	As with timers, the callback is guaranteed to be invoked only when the	2097	As with timers, the callback is guaranteed to be invoked only when the
1944	point in time where it is supposed to trigger has passed. If multiple	2098	point in time where it is supposed to trigger has passed. If multiple
1945	timers become ready during the same loop iteration then the ones with	2099	timers become ready during the same loop iteration then the ones with
1946	earlier time-out values are invoked before ones with later time-out values	2100	earlier time-out values are invoked before ones with later time-out values
1947	(but this is no longer true when a callback calls C<ev_loop> recursively).	2101	(but this is no longer true when a callback calls C<ev_run> recursively).
1948		2102
1949	=head3 Watcher-Specific Functions and Data Members	2103	=head3 Watcher-Specific Functions and Data Members
1950		2104
1951	=over 4	2105	=over 4
1952		2106
…		…
2080	Example: Call a callback every hour, or, more precisely, whenever the	2234	Example: Call a callback every hour, or, more precisely, whenever the
2081	system time is divisible by 3600. The callback invocation times have	2235	system time is divisible by 3600. The callback invocation times have
2082	potentially a lot of jitter, but good long-term stability.	2236	potentially a lot of jitter, but good long-term stability.
2083		2237
2084	static void	2238	static void
2085	clock_cb (struct ev_loop *loop, ev_io *w, int revents)	2239	clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
2086	{	2240	{
2087	... its now a full hour (UTC, or TAI or whatever your clock follows)	2241	... its now a full hour (UTC, or TAI or whatever your clock follows)
2088	}	2242	}
2089		2243
2090	ev_periodic hourly_tick;	2244	ev_periodic hourly_tick;
…		…
2113		2267
2114	=head2 C<ev_signal> - signal me when a signal gets signalled!	2268	=head2 C<ev_signal> - signal me when a signal gets signalled!
2115		2269
2116	Signal watchers will trigger an event when the process receives a specific	2270	Signal watchers will trigger an event when the process receives a specific
2117	signal one or more times. Even though signals are very asynchronous, libev	2271	signal one or more times. Even though signals are very asynchronous, libev
2118	will try it's best to deliver signals synchronously, i.e. as part of the	2272	will try its best to deliver signals synchronously, i.e. as part of the
2119	normal event processing, like any other event.	2273	normal event processing, like any other event.
2120		2274
2121	If you want signals to be delivered truly asynchronously, just use	2275	If you want signals to be delivered truly asynchronously, just use
2122	C<sigaction> as you would do without libev and forget about sharing	2276	C<sigaction> as you would do without libev and forget about sharing
2123	the signal. You can even use C<ev_async> from a signal handler to	2277	the signal. You can even use C<ev_async> from a signal handler to
…		…
2190	Example: Try to exit cleanly on SIGINT.	2344	Example: Try to exit cleanly on SIGINT.
2191		2345
2192	static void	2346	static void
2193	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)	2347	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2194	{	2348	{
2195	ev_unloop (loop, EVUNLOOP_ALL);	2349	ev_break (loop, EVBREAK_ALL);
2196	}	2350	}
2197		2351
2198	ev_signal signal_watcher;	2352	ev_signal signal_watcher;
2199	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	2353	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2200	ev_signal_start (loop, &signal_watcher);	2354	ev_signal_start (loop, &signal_watcher);
…		…
2586		2740
2587	Prepare and check watchers are usually (but not always) used in pairs:	2741	Prepare and check watchers are usually (but not always) used in pairs:
2588	prepare watchers get invoked before the process blocks and check watchers	2742	prepare watchers get invoked before the process blocks and check watchers
2589	afterwards.	2743	afterwards.
2590		2744
2591	You I<must not> call C<ev_loop> or similar functions that enter	2745	You I<must not> call C<ev_run> or similar functions that enter
2592	the current event loop from either C<ev_prepare> or C<ev_check>	2746	the current event loop from either C<ev_prepare> or C<ev_check>
2593	watchers. Other loops than the current one are fine, however. The	2747	watchers. Other loops than the current one are fine, however. The
2594	rationale behind this is that you do not need to check for recursion in	2748	rationale behind this is that you do not need to check for recursion in
2595	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2749	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2596	C<ev_check> so if you have one watcher of each kind they will always be	2750	C<ev_check> so if you have one watcher of each kind they will always be
…		…
2764		2918
2765	if (timeout >= 0)	2919	if (timeout >= 0)
2766	// create/start timer	2920	// create/start timer
2767		2921
2768	// poll	2922	// poll
2769	ev_loop (EV_A_ 0);	2923	ev_run (EV_A_ 0);
2770		2924
2771	// stop timer again	2925	// stop timer again
2772	if (timeout >= 0)	2926	if (timeout >= 0)
2773	ev_timer_stop (EV_A_ &to);	2927	ev_timer_stop (EV_A_ &to);
2774		2928
…		…
2852	if you do not want that, you need to temporarily stop the embed watcher).	3006	if you do not want that, you need to temporarily stop the embed watcher).
2853		3007
2854	=item ev_embed_sweep (loop, ev_embed *)	3008	=item ev_embed_sweep (loop, ev_embed *)
2855		3009
2856	Make a single, non-blocking sweep over the embedded loop. This works	3010	Make a single, non-blocking sweep over the embedded loop. This works
2857	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most	3011	similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2858	appropriate way for embedded loops.	3012	appropriate way for embedded loops.
2859		3013
2860	=item struct ev_loop *other [read-only]	3014	=item struct ev_loop *other [read-only]
2861		3015
2862	The embedded event loop.	3016	The embedded event loop.
…		…
2922	C<ev_default_fork> cheats and calls it in the wrong process, the fork	3076	C<ev_default_fork> cheats and calls it in the wrong process, the fork
2923	handlers will be invoked, too, of course.	3077	handlers will be invoked, too, of course.
2924		3078
2925	=head3 The special problem of life after fork - how is it possible?	3079	=head3 The special problem of life after fork - how is it possible?
2926		3080
2927	Most uses of C<fork()> consist of forking, then some simple calls to ste	3081	Most uses of C<fork()> consist of forking, then some simple calls to set
2928	up/change the process environment, followed by a call to C<exec()>. This	3082	up/change the process environment, followed by a call to C<exec()>. This
2929	sequence should be handled by libev without any problems.	3083	sequence should be handled by libev without any problems.
2930		3084
2931	This changes when the application actually wants to do event handling	3085	This changes when the application actually wants to do event handling
2932	in the child, or both parent in child, in effect "continuing" after the	3086	in the child, or both parent in child, in effect "continuing" after the
…		…
2948	disadvantage of having to use multiple event loops (which do not support	3102	disadvantage of having to use multiple event loops (which do not support
2949	signal watchers).	3103	signal watchers).
2950		3104
2951	When this is not possible, or you want to use the default loop for	3105	When this is not possible, or you want to use the default loop for
2952	other reasons, then in the process that wants to start "fresh", call	3106	other reasons, then in the process that wants to start "fresh", call
2953	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying	3107	C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
2954	the default loop will "orphan" (not stop) all registered watchers, so you	3108	Destroying the default loop will "orphan" (not stop) all registered
2955	have to be careful not to execute code that modifies those watchers. Note	3109	watchers, so you have to be careful not to execute code that modifies
2956	also that in that case, you have to re-register any signal watchers.	3110	those watchers. Note also that in that case, you have to re-register any
		3111	signal watchers.
2957		3112
2958	=head3 Watcher-Specific Functions and Data Members	3113	=head3 Watcher-Specific Functions and Data Members
2959		3114
2960	=over 4	3115	=over 4
2961		3116
2962	=item ev_fork_init (ev_signal *, callback)	3117	=item ev_fork_init (ev_fork *, callback)
2963		3118
2964	Initialises and configures the fork watcher - it has no parameters of any	3119	Initialises and configures the fork watcher - it has no parameters of any
2965	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,	3120	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
2966	believe me.	3121	really.
2967		3122
2968	=back	3123	=back
2969		3124
2970		3125
		3126	=head2 C<ev_cleanup> - even the best things end
		3127
		3128	Cleanup watchers are called just before the event loop is being destroyed
		3129	by a call to C<ev_loop_destroy>.
		3130
		3131	While there is no guarantee that the event loop gets destroyed, cleanup
		3132	watchers provide a convenient method to install cleanup hooks for your
		3133	program, worker threads and so on - you just to make sure to destroy the
		3134	loop when you want them to be invoked.
		3135
		3136	Cleanup watchers are invoked in the same way as any other watcher. Unlike
		3137	all other watchers, they do not keep a reference to the event loop (which
		3138	makes a lot of sense if you think about it). Like all other watchers, you
		3139	can call libev functions in the callback, except C<ev_cleanup_start>.
		3140
		3141	=head3 Watcher-Specific Functions and Data Members
		3142
		3143	=over 4
		3144
		3145	=item ev_cleanup_init (ev_cleanup *, callback)
		3146
		3147	Initialises and configures the cleanup watcher - it has no parameters of
		3148	any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
		3149	pointless, I assure you.
		3150
		3151	=back
		3152
		3153	Example: Register an atexit handler to destroy the default loop, so any
		3154	cleanup functions are called.
		3155
		3156	static void
		3157	program_exits (void)
		3158	{
		3159	ev_loop_destroy (EV_DEFAULT_UC);
		3160	}
		3161
		3162	...
		3163	atexit (program_exits);
		3164
		3165
2971	=head2 C<ev_async> - how to wake up another event loop	3166	=head2 C<ev_async> - how to wake up an event loop
2972		3167
2973	In general, you cannot use an C<ev_loop> from multiple threads or other	3168	In general, you cannot use an C<ev_run> from multiple threads or other
2974	asynchronous sources such as signal handlers (as opposed to multiple event	3169	asynchronous sources such as signal handlers (as opposed to multiple event
2975	loops - those are of course safe to use in different threads).	3170	loops - those are of course safe to use in different threads).
2976		3171
2977	Sometimes, however, you need to wake up another event loop you do not	3172	Sometimes, however, you need to wake up an event loop you do not control,
2978	control, for example because it belongs to another thread. This is what	3173	for example because it belongs to another thread. This is what C<ev_async>
2979	C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you	3174	watchers do: as long as the C<ev_async> watcher is active, you can signal
2980	can signal it by calling C<ev_async_send>, which is thread- and signal	3175	it by calling C<ev_async_send>, which is thread- and signal safe.
2981	safe.
2982		3176
2983	This functionality is very similar to C<ev_signal> watchers, as signals,	3177	This functionality is very similar to C<ev_signal> watchers, as signals,
2984	too, are asynchronous in nature, and signals, too, will be compressed	3178	too, are asynchronous in nature, and signals, too, will be compressed
2985	(i.e. the number of callback invocations may be less than the number of	3179	(i.e. the number of callback invocations may be less than the number of
2986	C<ev_async_sent> calls).	3180	C<ev_async_sent> calls).
…		…
3141		3335
3142	If C<timeout> is less than 0, then no timeout watcher will be	3336	If C<timeout> is less than 0, then no timeout watcher will be
3143	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and	3337	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
3144	repeat = 0) will be started. C<0> is a valid timeout.	3338	repeat = 0) will be started. C<0> is a valid timeout.
3145		3339
3146	The callback has the type C<void (*cb)(int revents, void *arg)> and gets	3340	The callback has the type C<void (*cb)(int revents, void *arg)> and is
3147	passed an C<revents> set like normal event callbacks (a combination of	3341	passed an C<revents> set like normal event callbacks (a combination of
3148	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>	3342	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
3149	value passed to C<ev_once>. Note that it is possible to receive I<both>	3343	value passed to C<ev_once>. Note that it is possible to receive I<both>
3150	a timeout and an io event at the same time - you probably should give io	3344	a timeout and an io event at the same time - you probably should give io
3151	events precedence.	3345	events precedence.
3152		3346
3153	Example: wait up to ten seconds for data to appear on STDIN_FILENO.	3347	Example: wait up to ten seconds for data to appear on STDIN_FILENO.
3154		3348
3155	static void stdin_ready (int revents, void *arg)	3349	static void stdin_ready (int revents, void *arg)
3156	{	3350	{
3157	if (revents & EV_READ)	3351	if (revents & EV_READ)
3158	/* stdin might have data for us, joy! */;	3352	/* stdin might have data for us, joy! */;
3159	else if (revents & EV_TIMEOUT)	3353	else if (revents & EV_TIMER)
3160	/* doh, nothing entered */;	3354	/* doh, nothing entered */;
3161	}	3355	}
3162		3356
3163	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3357	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3164		3358
…		…
3194	=item * Priorities are not currently supported. Initialising priorities	3388	=item * Priorities are not currently supported. Initialising priorities
3195	will fail and all watchers will have the same priority, even though there	3389	will fail and all watchers will have the same priority, even though there
3196	is an ev_pri field.	3390	is an ev_pri field.
3197		3391
3198	=item * In libevent, the last base created gets the signals, in libev, the	3392	=item * In libevent, the last base created gets the signals, in libev, the
3199	first base created (== the default loop) gets the signals.	3393	base that registered the signal gets the signals.
3200		3394
3201	=item * Other members are not supported.	3395	=item * Other members are not supported.
3202		3396
3203	=item * The libev emulation is I<not> ABI compatible to libevent, you need	3397	=item * The libev emulation is I<not> ABI compatible to libevent, you need
3204	to use the libev header file and library.	3398	to use the libev header file and library.
…		…
3298	myclass obj;	3492	myclass obj;
3299	ev::io iow;	3493	ev::io iow;
3300	iow.set <myclass, &myclass::io_cb> (&obj);	3494	iow.set <myclass, &myclass::io_cb> (&obj);
3301		3495
3302	=item w->set (object *)	3496	=item w->set (object *)
3303
3304	This is an B<experimental> feature that might go away in a future version.
3305		3497
3306	This is a variation of a method callback - leaving out the method to call	3498	This is a variation of a method callback - leaving out the method to call
3307	will default the method to C<operator ()>, which makes it possible to use	3499	will default the method to C<operator ()>, which makes it possible to use
3308	functor objects without having to manually specify the C<operator ()> all	3500	functor objects without having to manually specify the C<operator ()> all
3309	the time. Incidentally, you can then also leave out the template argument	3501	the time. Incidentally, you can then also leave out the template argument
…		…
3349	Associates a different C<struct ev_loop> with this watcher. You can only	3541	Associates a different C<struct ev_loop> with this watcher. You can only
3350	do this when the watcher is inactive (and not pending either).	3542	do this when the watcher is inactive (and not pending either).
3351		3543
3352	=item w->set ([arguments])	3544	=item w->set ([arguments])
3353		3545
3354	Basically the same as C<ev_TYPE_set>, with the same arguments. Must be	3546	Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3355	called at least once. Unlike the C counterpart, an active watcher gets	3547	method or a suitable start method must be called at least once. Unlike the
3356	automatically stopped and restarted when reconfiguring it with this	3548	C counterpart, an active watcher gets automatically stopped and restarted
3357	method.	3549	when reconfiguring it with this method.
3358		3550
3359	=item w->start ()	3551	=item w->start ()
3360		3552
3361	Starts the watcher. Note that there is no C<loop> argument, as the	3553	Starts the watcher. Note that there is no C<loop> argument, as the
3362	constructor already stores the event loop.	3554	constructor already stores the event loop.
3363		3555
		3556	=item w->start ([arguments])
		3557
		3558	Instead of calling C<set> and C<start> methods separately, it is often
		3559	convenient to wrap them in one call. Uses the same type of arguments as
		3560	the configure C<set> method of the watcher.
		3561
3364	=item w->stop ()	3562	=item w->stop ()
3365		3563
3366	Stops the watcher if it is active. Again, no C<loop> argument.	3564	Stops the watcher if it is active. Again, no C<loop> argument.
3367		3565
3368	=item w->again () (C<ev::timer>, C<ev::periodic> only)	3566	=item w->again () (C<ev::timer>, C<ev::periodic> only)
…		…
3380		3578
3381	=back	3579	=back
3382		3580
3383	=back	3581	=back
3384		3582
3385	Example: Define a class with an IO and idle watcher, start one of them in	3583	Example: Define a class with two I/O and idle watchers, start the I/O
3386	the constructor.	3584	watchers in the constructor.
3387		3585
3388	class myclass	3586	class myclass
3389	{	3587	{
3390	ev::io io ; void io_cb (ev::io &w, int revents);	3588	ev::io io ; void io_cb (ev::io &w, int revents);
		3589	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3391	ev::idle idle; void idle_cb (ev::idle &w, int revents);	3590	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3392		3591
3393	myclass (int fd)	3592	myclass (int fd)
3394	{	3593	{
3395	io .set <myclass, &myclass::io_cb > (this);	3594	io .set <myclass, &myclass::io_cb > (this);
		3595	io2 .set <myclass, &myclass::io2_cb > (this);
3396	idle.set <myclass, &myclass::idle_cb> (this);	3596	idle.set <myclass, &myclass::idle_cb> (this);
3397		3597
3398	io.start (fd, ev::READ);	3598	io.set (fd, ev::WRITE); // configure the watcher
		3599	io.start (); // start it whenever convenient
		3600
		3601	io2.start (fd, ev::READ); // set + start in one call
3399	}	3602	}
3400	};	3603	};
3401		3604
3402		3605
3403	=head1 OTHER LANGUAGE BINDINGS	3606	=head1 OTHER LANGUAGE BINDINGS
…		…
3477	loop argument"). The C<EV_A> form is used when this is the sole argument,	3680	loop argument"). The C<EV_A> form is used when this is the sole argument,
3478	C<EV_A_> is used when other arguments are following. Example:	3681	C<EV_A_> is used when other arguments are following. Example:
3479		3682
3480	ev_unref (EV_A);	3683	ev_unref (EV_A);
3481	ev_timer_add (EV_A_ watcher);	3684	ev_timer_add (EV_A_ watcher);
3482	ev_loop (EV_A_ 0);	3685	ev_run (EV_A_ 0);
3483		3686
3484	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,	3687	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3485	which is often provided by the following macro.	3688	which is often provided by the following macro.
3486		3689
3487	=item C<EV_P>, C<EV_P_>	3690	=item C<EV_P>, C<EV_P_>
…		…
3527	}	3730	}
3528		3731
3529	ev_check check;	3732	ev_check check;
3530	ev_check_init (&check, check_cb);	3733	ev_check_init (&check, check_cb);
3531	ev_check_start (EV_DEFAULT_ &check);	3734	ev_check_start (EV_DEFAULT_ &check);
3532	ev_loop (EV_DEFAULT_ 0);	3735	ev_run (EV_DEFAULT_ 0);
3533		3736
3534	=head1 EMBEDDING	3737	=head1 EMBEDDING
3535		3738
3536	Libev can (and often is) directly embedded into host	3739	Libev can (and often is) directly embedded into host
3537	applications. Examples of applications that embed it include the Deliantra	3740	applications. Examples of applications that embed it include the Deliantra
…		…
3622	define before including (or compiling) any of its files. The default in	3825	define before including (or compiling) any of its files. The default in
3623	the absence of autoconf is documented for every option.	3826	the absence of autoconf is documented for every option.
3624		3827
3625	Symbols marked with "(h)" do not change the ABI, and can have different	3828	Symbols marked with "(h)" do not change the ABI, and can have different
3626	values when compiling libev vs. including F<ev.h>, so it is permissible	3829	values when compiling libev vs. including F<ev.h>, so it is permissible
3627	to redefine them before including F<ev.h> without breakign compatibility	3830	to redefine them before including F<ev.h> without breaking compatibility
3628	to a compiled library. All other symbols change the ABI, which means all	3831	to a compiled library. All other symbols change the ABI, which means all
3629	users of libev and the libev code itself must be compiled with compatible	3832	users of libev and the libev code itself must be compiled with compatible
3630	settings.	3833	settings.
3631		3834
3632	=over 4	3835	=over 4
		3836
		3837	=item EV_COMPAT3 (h)
		3838
		3839	Backwards compatibility is a major concern for libev. This is why this
		3840	release of libev comes with wrappers for the functions and symbols that
		3841	have been renamed between libev version 3 and 4.
		3842
		3843	You can disable these wrappers (to test compatibility with future
		3844	versions) by defining C<EV_COMPAT3> to C<0> when compiling your
		3845	sources. This has the additional advantage that you can drop the C<struct>
		3846	from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
		3847	typedef in that case.
		3848
		3849	In some future version, the default for C<EV_COMPAT3> will become C<0>,
		3850	and in some even more future version the compatibility code will be
		3851	removed completely.
3633		3852
3634	=item EV_STANDALONE (h)	3853	=item EV_STANDALONE (h)
3635		3854
3636	Must always be C<1> if you do not use autoconf configuration, which	3855	Must always be C<1> if you do not use autoconf configuration, which
3637	keeps libev from including F<config.h>, and it also defines dummy	3856	keeps libev from including F<config.h>, and it also defines dummy
…		…
3838	fine.	4057	fine.
3839		4058
3840	If your embedding application does not need any priorities, defining these	4059	If your embedding application does not need any priorities, defining these
3841	both to C<0> will save some memory and CPU.	4060	both to C<0> will save some memory and CPU.
3842		4061
3843	=item EV_PERIODIC_ENABLE	4062	=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
		4063	EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
		4064	EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3844		4065
3845	If undefined or defined to be C<1>, then periodic timers are supported. If	4066	If undefined or defined to be C<1> (and the platform supports it), then
3846	defined to be C<0>, then they are not. Disabling them saves a few kB of	4067	the respective watcher type is supported. If defined to be C<0>, then it
3847	code.	4068	is not. Disabling watcher types mainly saves code size.
3848		4069
3849	=item EV_IDLE_ENABLE	4070	=item EV_FEATURES
3850
3851	If undefined or defined to be C<1>, then idle watchers are supported. If
3852	defined to be C<0>, then they are not. Disabling them saves a few kB of
3853	code.
3854
3855	=item EV_EMBED_ENABLE
3856
3857	If undefined or defined to be C<1>, then embed watchers are supported. If
3858	defined to be C<0>, then they are not. Embed watchers rely on most other
3859	watcher types, which therefore must not be disabled.
3860
3861	=item EV_STAT_ENABLE
3862
3863	If undefined or defined to be C<1>, then stat watchers are supported. If
3864	defined to be C<0>, then they are not.
3865
3866	=item EV_FORK_ENABLE
3867
3868	If undefined or defined to be C<1>, then fork watchers are supported. If
3869	defined to be C<0>, then they are not.
3870
3871	=item EV_SIGNAL_ENABLE
3872
3873	If undefined or defined to be C<1>, then signal watchers are supported. If
3874	defined to be C<0>, then they are not.
3875
3876	=item EV_ASYNC_ENABLE
3877
3878	If undefined or defined to be C<1>, then async watchers are supported. If
3879	defined to be C<0>, then they are not.
3880
3881	=item EV_CHILD_ENABLE
3882
3883	If undefined or defined to be C<1> (and C<_WIN32> is not defined), then
3884	child watchers are supported. If defined to be C<0>, then they are not.
3885
3886	=item EV_MINIMAL
3887		4071
3888	If you need to shave off some kilobytes of code at the expense of some	4072	If you need to shave off some kilobytes of code at the expense of some
3889	speed (but with the full API), define this symbol to C<1>. Currently this	4073	speed (but with the full API), you can define this symbol to request
3890	is used to override some inlining decisions, saves roughly 30% code size	4074	certain subsets of functionality. The default is to enable all features
3891	on amd64. It also selects a much smaller 2-heap for timer management over	4075	that can be enabled on the platform.
3892	the default 4-heap.
3893		4076
3894	You can save even more by disabling watcher types you do not need	4077	A typical way to use this symbol is to define it to C<0> (or to a bitset
3895	and setting C<EV_MAXPRI> == C<EV_MINPRI>. Also, disabling C<assert>	4078	with some broad features you want) and then selectively re-enable
3896	(C<-DNDEBUG>) will usually reduce code size a lot. Disabling inotify,	4079	additional parts you want, for example if you want everything minimal,
3897	eventfd and signalfd will further help, and disabling backends one doesn't	4080	but multiple event loop support, async and child watchers and the poll
3898	need (e.g. poll, epoll, kqueue, ports) will help further.	4081	backend, use this:
3899		4082
3900	Defining C<EV_MINIMAL> to C<2> will additionally reduce the core API to	4083	#define EV_FEATURES 0
3901	provide a bare-bones event library. See C<ev.h> for details on what parts
3902	of the API are still available, and do not complain if this subset changes
3903	over time.
3904
3905	This example set of settings reduces the compiled size of libev from 24Kb
3906	to 8Kb on my GNU/Linux amd64 system (and leaves little in - there is also
3907	an effect on the amount of memory used). With an intelligent-enough linker
3908	further unused functions might be left out as well automatically.
3909
3910	// tuning and API changes
3911	#define EV_MINIMAL 2
3912	#define EV_MULTIPLICITY 0	4084	#define EV_MULTIPLICITY 1
3913	#define EV_MINPRI 0
3914	#define EV_MAXPRI 0
3915
3916	// OS-specific backends
3917	#define EV_USE_INOTIFY 0
3918	#define EV_USE_EVENTFD 0
3919	#define EV_USE_SIGNALFD 0
3920	#define EV_USE_REALTIME 0
3921	#define EV_USE_MONOTONIC 0
3922	#define EV_USE_CLOCK_SYSCALL 0
3923
3924	// disable all backends except select
3925	#define EV_USE_POLL 0	4085	#define EV_USE_POLL 1
3926	#define EV_USE_PORT 0
3927	#define EV_USE_KQUEUE 0
3928	#define EV_USE_EPOLL 0
3929
3930	// disable all watcher types that cna be disabled
3931	#define EV_STAT_ENABLE 0
3932	#define EV_PERIODIC_ENABLE 0
3933	#define EV_IDLE_ENABLE 0
3934	#define EV_FORK_ENABLE 0
3935	#define EV_SIGNAL_ENABLE 0
3936	#define EV_CHILD_ENABLE 0	4086	#define EV_CHILD_ENABLE 1
3937	#define EV_ASYNC_ENABLE 0	4087	#define EV_ASYNC_ENABLE 1
3938	#define EV_EMBED_ENABLE 0	4088
		4089	The actual value is a bitset, it can be a combination of the following
		4090	values:
		4091
		4092	=over 4
		4093
		4094	=item C<1> - faster/larger code
		4095
		4096	Use larger code to speed up some operations.
		4097
		4098	Currently this is used to override some inlining decisions (enlarging the
		4099	code size by roughly 30% on amd64).
		4100
		4101	When optimising for size, use of compiler flags such as C<-Os> with
		4102	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
		4103	assertions.
		4104
		4105	=item C<2> - faster/larger data structures
		4106
		4107	Replaces the small 2-heap for timer management by a faster 4-heap, larger
		4108	hash table sizes and so on. This will usually further increase code size
		4109	and can additionally have an effect on the size of data structures at
		4110	runtime.
		4111
		4112	=item C<4> - full API configuration
		4113
		4114	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
		4115	enables multiplicity (C<EV_MULTIPLICITY>=1).
		4116
		4117	=item C<8> - full API
		4118
		4119	This enables a lot of the "lesser used" API functions. See C<ev.h> for
		4120	details on which parts of the API are still available without this
		4121	feature, and do not complain if this subset changes over time.
		4122
		4123	=item C<16> - enable all optional watcher types
		4124
		4125	Enables all optional watcher types. If you want to selectively enable
		4126	only some watcher types other than I/O and timers (e.g. prepare,
		4127	embed, async, child...) you can enable them manually by defining
		4128	C<EV_watchertype_ENABLE> to C<1> instead.
		4129
		4130	=item C<32> - enable all backends
		4131
		4132	This enables all backends - without this feature, you need to enable at
		4133	least one backend manually (C<EV_USE_SELECT> is a good choice).
		4134
		4135	=item C<64> - enable OS-specific "helper" APIs
		4136
		4137	Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
		4138	default.
		4139
		4140	=back
		4141
		4142	Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
		4143	reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
		4144	code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
		4145	watchers, timers and monotonic clock support.
		4146
		4147	With an intelligent-enough linker (gcc+binutils are intelligent enough
		4148	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
		4149	your program might be left out as well - a binary starting a timer and an
		4150	I/O watcher then might come out at only 5Kb.
3939		4151
3940	=item EV_AVOID_STDIO	4152	=item EV_AVOID_STDIO
3941		4153
3942	If this is set to C<1> at compiletime, then libev will avoid using stdio	4154	If this is set to C<1> at compiletime, then libev will avoid using stdio
3943	functions (printf, scanf, perror etc.). This will increase the codesize	4155	functions (printf, scanf, perror etc.). This will increase the code size
3944	somewhat, but if your program doesn't otherwise depend on stdio and your	4156	somewhat, but if your program doesn't otherwise depend on stdio and your
3945	libc allows it, this avoids linking in the stdio library which is quite	4157	libc allows it, this avoids linking in the stdio library which is quite
3946	big.	4158	big.
3947		4159
3948	Note that error messages might become less precise when this option is	4160	Note that error messages might become less precise when this option is
…		…
3952		4164
3953	The highest supported signal number, +1 (or, the number of	4165	The highest supported signal number, +1 (or, the number of
3954	signals): Normally, libev tries to deduce the maximum number of signals	4166	signals): Normally, libev tries to deduce the maximum number of signals
3955	automatically, but sometimes this fails, in which case it can be	4167	automatically, but sometimes this fails, in which case it can be
3956	specified. Also, using a lower number than detected (C<32> should be	4168	specified. Also, using a lower number than detected (C<32> should be
3957	good for about any system in existance) can save some memory, as libev	4169	good for about any system in existence) can save some memory, as libev
3958	statically allocates some 12-24 bytes per signal number.	4170	statically allocates some 12-24 bytes per signal number.
3959		4171
3960	=item EV_PID_HASHSIZE	4172	=item EV_PID_HASHSIZE
3961		4173
3962	C<ev_child> watchers use a small hash table to distribute workload by	4174	C<ev_child> watchers use a small hash table to distribute workload by
3963	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more	4175	pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3964	than enough. If you need to manage thousands of children you might want to	4176	usually more than enough. If you need to manage thousands of children you
3965	increase this value (I<must> be a power of two).	4177	might want to increase this value (I<must> be a power of two).
3966		4178
3967	=item EV_INOTIFY_HASHSIZE	4179	=item EV_INOTIFY_HASHSIZE
3968		4180
3969	C<ev_stat> watchers use a small hash table to distribute workload by	4181	C<ev_stat> watchers use a small hash table to distribute workload by
3970	inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),	4182	inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3971	usually more than enough. If you need to manage thousands of C<ev_stat>	4183	disabled), usually more than enough. If you need to manage thousands of
3972	watchers you might want to increase this value (I<must> be a power of	4184	C<ev_stat> watchers you might want to increase this value (I<must> be a
3973	two).	4185	power of two).
3974		4186
3975	=item EV_USE_4HEAP	4187	=item EV_USE_4HEAP
3976		4188
3977	Heaps are not very cache-efficient. To improve the cache-efficiency of the	4189	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3978	timer and periodics heaps, libev uses a 4-heap when this symbol is defined	4190	timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3979	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably	4191	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3980	faster performance with many (thousands) of watchers.	4192	faster performance with many (thousands) of watchers.
3981		4193
3982	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	4194	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3983	(disabled).	4195	will be C<0>.
3984		4196
3985	=item EV_HEAP_CACHE_AT	4197	=item EV_HEAP_CACHE_AT
3986		4198
3987	Heaps are not very cache-efficient. To improve the cache-efficiency of the	4199	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3988	timer and periodics heaps, libev can cache the timestamp (I<at>) within	4200	timer and periodics heaps, libev can cache the timestamp (I<at>) within
3989	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),	4201	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3990	which uses 8-12 bytes more per watcher and a few hundred bytes more code,	4202	which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3991	but avoids random read accesses on heap changes. This improves performance	4203	but avoids random read accesses on heap changes. This improves performance
3992	noticeably with many (hundreds) of watchers.	4204	noticeably with many (hundreds) of watchers.
3993		4205
3994	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	4206	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3995	(disabled).	4207	will be C<0>.
3996		4208
3997	=item EV_VERIFY	4209	=item EV_VERIFY
3998		4210
3999	Controls how much internal verification (see C<ev_loop_verify ()>) will	4211	Controls how much internal verification (see C<ev_verify ()>) will
4000	be done: If set to C<0>, no internal verification code will be compiled	4212	be done: If set to C<0>, no internal verification code will be compiled
4001	in. If set to C<1>, then verification code will be compiled in, but not	4213	in. If set to C<1>, then verification code will be compiled in, but not
4002	called. If set to C<2>, then the internal verification code will be	4214	called. If set to C<2>, then the internal verification code will be
4003	called once per loop, which can slow down libev. If set to C<3>, then the	4215	called once per loop, which can slow down libev. If set to C<3>, then the
4004	verification code will be called very frequently, which will slow down	4216	verification code will be called very frequently, which will slow down
4005	libev considerably.	4217	libev considerably.
4006		4218
4007	The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be	4219	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
4008	C<0>.	4220	will be C<0>.
4009		4221
4010	=item EV_COMMON	4222	=item EV_COMMON
4011		4223
4012	By default, all watchers have a C<void *data> member. By redefining	4224	By default, all watchers have a C<void *data> member. By redefining
4013	this macro to a something else you can include more and other types of	4225	this macro to something else you can include more and other types of
4014	members. You have to define it each time you include one of the files,	4226	members. You have to define it each time you include one of the files,
4015	though, and it must be identical each time.	4227	though, and it must be identical each time.
4016		4228
4017	For example, the perl EV module uses something like this:	4229	For example, the perl EV module uses something like this:
4018		4230
…		…
4071	file.	4283	file.
4072		4284
4073	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file	4285	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
4074	that everybody includes and which overrides some configure choices:	4286	that everybody includes and which overrides some configure choices:
4075		4287
4076	#define EV_MINIMAL 1	4288	#define EV_FEATURES 8
4077	#define EV_USE_POLL 0	4289	#define EV_USE_SELECT 1
4078	#define EV_MULTIPLICITY 0
4079	#define EV_PERIODIC_ENABLE 0	4290	#define EV_PREPARE_ENABLE 1
		4291	#define EV_IDLE_ENABLE 1
4080	#define EV_STAT_ENABLE 0	4292	#define EV_SIGNAL_ENABLE 1
4081	#define EV_FORK_ENABLE 0	4293	#define EV_CHILD_ENABLE 1
		4294	#define EV_USE_STDEXCEPT 0
4082	#define EV_CONFIG_H <config.h>	4295	#define EV_CONFIG_H <config.h>
4083	#define EV_MINPRI 0
4084	#define EV_MAXPRI 0
4085		4296
4086	#include "ev++.h"	4297	#include "ev++.h"
4087		4298
4088	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4299	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4089		4300
…		…
4220	userdata *u = ev_userdata (EV_A);	4431	userdata *u = ev_userdata (EV_A);
4221	pthread_mutex_lock (&u->lock);	4432	pthread_mutex_lock (&u->lock);
4222	}	4433	}
4223		4434
4224	The event loop thread first acquires the mutex, and then jumps straight	4435	The event loop thread first acquires the mutex, and then jumps straight
4225	into C<ev_loop>:	4436	into C<ev_run>:
4226		4437
4227	void *	4438	void *
4228	l_run (void *thr_arg)	4439	l_run (void *thr_arg)
4229	{	4440	{
4230	struct ev_loop *loop = (struct ev_loop *)thr_arg;	4441	struct ev_loop *loop = (struct ev_loop *)thr_arg;
4231		4442
4232	l_acquire (EV_A);	4443	l_acquire (EV_A);
4233	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);	4444	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4234	ev_loop (EV_A_ 0);	4445	ev_run (EV_A_ 0);
4235	l_release (EV_A);	4446	l_release (EV_A);
4236		4447
4237	return 0;	4448	return 0;
4238	}	4449	}
4239		4450
…		…
4291		4502
4292	=head3 COROUTINES	4503	=head3 COROUTINES
4293		4504
4294	Libev is very accommodating to coroutines ("cooperative threads"):	4505	Libev is very accommodating to coroutines ("cooperative threads"):
4295	libev fully supports nesting calls to its functions from different	4506	libev fully supports nesting calls to its functions from different
4296	coroutines (e.g. you can call C<ev_loop> on the same loop from two	4507	coroutines (e.g. you can call C<ev_run> on the same loop from two
4297	different coroutines, and switch freely between both coroutines running	4508	different coroutines, and switch freely between both coroutines running
4298	the loop, as long as you don't confuse yourself). The only exception is	4509	the loop, as long as you don't confuse yourself). The only exception is
4299	that you must not do this from C<ev_periodic> reschedule callbacks.	4510	that you must not do this from C<ev_periodic> reschedule callbacks.
4300		4511
4301	Care has been taken to ensure that libev does not keep local state inside	4512	Care has been taken to ensure that libev does not keep local state inside
4302	C<ev_loop>, and other calls do not usually allow for coroutine switches as	4513	C<ev_run>, and other calls do not usually allow for coroutine switches as
4303	they do not call any callbacks.	4514	they do not call any callbacks.
4304		4515
4305	=head2 COMPILER WARNINGS	4516	=head2 COMPILER WARNINGS
4306		4517
4307	Depending on your compiler and compiler settings, you might get no or a	4518	Depending on your compiler and compiler settings, you might get no or a
…		…
4318	maintainable.	4529	maintainable.
4319		4530
4320	And of course, some compiler warnings are just plain stupid, or simply	4531	And of course, some compiler warnings are just plain stupid, or simply
4321	wrong (because they don't actually warn about the condition their message	4532	wrong (because they don't actually warn about the condition their message
4322	seems to warn about). For example, certain older gcc versions had some	4533	seems to warn about). For example, certain older gcc versions had some
4323	warnings that resulted an extreme number of false positives. These have	4534	warnings that resulted in an extreme number of false positives. These have
4324	been fixed, but some people still insist on making code warn-free with	4535	been fixed, but some people still insist on making code warn-free with
4325	such buggy versions.	4536	such buggy versions.
4326		4537
4327	While libev is written to generate as few warnings as possible,	4538	While libev is written to generate as few warnings as possible,
4328	"warn-free" code is not a goal, and it is recommended not to build libev	4539	"warn-free" code is not a goal, and it is recommended not to build libev
…		…
4364	I suggest using suppression lists.	4575	I suggest using suppression lists.
4365		4576
4366		4577
4367	=head1 PORTABILITY NOTES	4578	=head1 PORTABILITY NOTES
4368		4579
		4580	=head2 GNU/LINUX 32 BIT LIMITATIONS
		4581
		4582	GNU/Linux is the only common platform that supports 64 bit file/large file
		4583	interfaces but I<disables> them by default.
		4584
		4585	That means that libev compiled in the default environment doesn't support
		4586	files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
		4587
		4588	Unfortunately, many programs try to work around this GNU/Linux issue
		4589	by enabling the large file API, which makes them incompatible with the
		4590	standard libev compiled for their system.
		4591
		4592	Likewise, libev cannot enable the large file API itself as this would
		4593	suddenly make it incompatible to the default compile time environment,
		4594	i.e. all programs not using special compile switches.
		4595
		4596	=head2 OS/X AND DARWIN BUGS
		4597
		4598	The whole thing is a bug if you ask me - basically any system interface
		4599	you touch is broken, whether it is locales, poll, kqueue or even the
		4600	OpenGL drivers.
		4601
		4602	=head3 C<kqueue> is buggy
		4603
		4604	The kqueue syscall is broken in all known versions - most versions support
		4605	only sockets, many support pipes.
		4606
		4607	Libev tries to work around this by not using C<kqueue> by default on this
		4608	rotten platform, but of course you can still ask for it when creating a
		4609	loop - embedding a socket-only kqueue loop into a select-based one is
		4610	probably going to work well.
		4611
		4612	=head3 C<poll> is buggy
		4613
		4614	Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
		4615	implementation by something calling C<kqueue> internally around the 10.5.6
		4616	release, so now C<kqueue> I<and> C<poll> are broken.
		4617
		4618	Libev tries to work around this by not using C<poll> by default on
		4619	this rotten platform, but of course you can still ask for it when creating
		4620	a loop.
		4621
		4622	=head3 C<select> is buggy
		4623
		4624	All that's left is C<select>, and of course Apple found a way to fuck this
		4625	one up as well: On OS/X, C<select> actively limits the number of file
		4626	descriptors you can pass in to 1024 - your program suddenly crashes when
		4627	you use more.
		4628
		4629	There is an undocumented "workaround" for this - defining
		4630	C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
		4631	work on OS/X.
		4632
		4633	=head2 SOLARIS PROBLEMS AND WORKAROUNDS
		4634
		4635	=head3 C<errno> reentrancy
		4636
		4637	The default compile environment on Solaris is unfortunately so
		4638	thread-unsafe that you can't even use components/libraries compiled
		4639	without C<-D_REENTRANT> in a threaded program, which, of course, isn't
		4640	defined by default. A valid, if stupid, implementation choice.
		4641
		4642	If you want to use libev in threaded environments you have to make sure
		4643	it's compiled with C<_REENTRANT> defined.
		4644
		4645	=head3 Event port backend
		4646
		4647	The scalable event interface for Solaris is called "event
		4648	ports". Unfortunately, this mechanism is very buggy in all major
		4649	releases. If you run into high CPU usage, your program freezes or you get
		4650	a large number of spurious wakeups, make sure you have all the relevant
		4651	and latest kernel patches applied. No, I don't know which ones, but there
		4652	are multiple ones to apply, and afterwards, event ports actually work
		4653	great.
		4654
		4655	If you can't get it to work, you can try running the program by setting
		4656	the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
		4657	C<select> backends.
		4658
		4659	=head2 AIX POLL BUG
		4660
		4661	AIX unfortunately has a broken C<poll.h> header. Libev works around
		4662	this by trying to avoid the poll backend altogether (i.e. it's not even
		4663	compiled in), which normally isn't a big problem as C<select> works fine
		4664	with large bitsets on AIX, and AIX is dead anyway.
		4665
4369	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS	4666	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
		4667
		4668	=head3 General issues
4370		4669
4371	Win32 doesn't support any of the standards (e.g. POSIX) that libev	4670	Win32 doesn't support any of the standards (e.g. POSIX) that libev
4372	requires, and its I/O model is fundamentally incompatible with the POSIX	4671	requires, and its I/O model is fundamentally incompatible with the POSIX
4373	model. Libev still offers limited functionality on this platform in	4672	model. Libev still offers limited functionality on this platform in
4374	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	4673	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4375	descriptors. This only applies when using Win32 natively, not when using	4674	descriptors. This only applies when using Win32 natively, not when using
4376	e.g. cygwin.	4675	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
		4676	as every compielr comes with a slightly differently broken/incompatible
		4677	environment.
4377		4678
4378	Lifting these limitations would basically require the full	4679	Lifting these limitations would basically require the full
4379	re-implementation of the I/O system. If you are into these kinds of	4680	re-implementation of the I/O system. If you are into this kind of thing,
4380	things, then note that glib does exactly that for you in a very portable	4681	then note that glib does exactly that for you in a very portable way (note
4381	way (note also that glib is the slowest event library known to man).	4682	also that glib is the slowest event library known to man).
4382		4683
4383	There is no supported compilation method available on windows except	4684	There is no supported compilation method available on windows except
4384	embedding it into other applications.	4685	embedding it into other applications.
4385		4686
4386	Sensible signal handling is officially unsupported by Microsoft - libev	4687	Sensible signal handling is officially unsupported by Microsoft - libev
…		…
4414	you do I<not> compile the F<ev.c> or any other embedded source files!):	4715	you do I<not> compile the F<ev.c> or any other embedded source files!):
4415		4716
4416	#include "evwrap.h"	4717	#include "evwrap.h"
4417	#include "ev.c"	4718	#include "ev.c"
4418		4719
4419	=over 4
4420
4421	=item The winsocket select function	4720	=head3 The winsocket C<select> function
4422		4721
4423	The winsocket C<select> function doesn't follow POSIX in that it	4722	The winsocket C<select> function doesn't follow POSIX in that it
4424	requires socket I<handles> and not socket I<file descriptors> (it is	4723	requires socket I<handles> and not socket I<file descriptors> (it is
4425	also extremely buggy). This makes select very inefficient, and also	4724	also extremely buggy). This makes select very inefficient, and also
4426	requires a mapping from file descriptors to socket handles (the Microsoft	4725	requires a mapping from file descriptors to socket handles (the Microsoft
…		…
4435	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */	4734	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4436		4735
4437	Note that winsockets handling of fd sets is O(n), so you can easily get a	4736	Note that winsockets handling of fd sets is O(n), so you can easily get a
4438	complexity in the O(n²) range when using win32.	4737	complexity in the O(n²) range when using win32.
4439		4738
4440	=item Limited number of file descriptors	4739	=head3 Limited number of file descriptors
4441		4740
4442	Windows has numerous arbitrary (and low) limits on things.	4741	Windows has numerous arbitrary (and low) limits on things.
4443		4742
4444	Early versions of winsocket's select only supported waiting for a maximum	4743	Early versions of winsocket's select only supported waiting for a maximum
4445	of C<64> handles (probably owning to the fact that all windows kernels	4744	of C<64> handles (probably owning to the fact that all windows kernels
…		…
4460	runtime libraries. This might get you to about C<512> or C<2048> sockets	4759	runtime libraries. This might get you to about C<512> or C<2048> sockets
4461	(depending on windows version and/or the phase of the moon). To get more,	4760	(depending on windows version and/or the phase of the moon). To get more,
4462	you need to wrap all I/O functions and provide your own fd management, but	4761	you need to wrap all I/O functions and provide your own fd management, but
4463	the cost of calling select (O(n²)) will likely make this unworkable.	4762	the cost of calling select (O(n²)) will likely make this unworkable.
4464		4763
4465	=back
4466
4467	=head2 PORTABILITY REQUIREMENTS	4764	=head2 PORTABILITY REQUIREMENTS
4468		4765
4469	In addition to a working ISO-C implementation and of course the	4766	In addition to a working ISO-C implementation and of course the
4470	backend-specific APIs, libev relies on a few additional extensions:	4767	backend-specific APIs, libev relies on a few additional extensions:
4471		4768
…		…
4477	Libev assumes not only that all watcher pointers have the same internal	4774	Libev assumes not only that all watcher pointers have the same internal
4478	structure (guaranteed by POSIX but not by ISO C for example), but it also	4775	structure (guaranteed by POSIX but not by ISO C for example), but it also
4479	assumes that the same (machine) code can be used to call any watcher	4776	assumes that the same (machine) code can be used to call any watcher
4480	callback: The watcher callbacks have different type signatures, but libev	4777	callback: The watcher callbacks have different type signatures, but libev
4481	calls them using an C<ev_watcher *> internally.	4778	calls them using an C<ev_watcher *> internally.
		4779
		4780	=item pointer accesses must be thread-atomic
		4781
		4782	Accessing a pointer value must be atomic, it must both be readable and
		4783	writable in one piece - this is the case on all current architectures.
4482		4784
4483	=item C<sig_atomic_t volatile> must be thread-atomic as well	4785	=item C<sig_atomic_t volatile> must be thread-atomic as well
4484		4786
4485	The type C<sig_atomic_t volatile> (or whatever is defined as	4787	The type C<sig_atomic_t volatile> (or whatever is defined as
4486	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different	4788	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
…		…
4509	watchers.	4811	watchers.
4510		4812
4511	=item C<double> must hold a time value in seconds with enough accuracy	4813	=item C<double> must hold a time value in seconds with enough accuracy
4512		4814
4513	The type C<double> is used to represent timestamps. It is required to	4815	The type C<double> is used to represent timestamps. It is required to
4514	have at least 51 bits of mantissa (and 9 bits of exponent), which is good	4816	have at least 51 bits of mantissa (and 9 bits of exponent), which is
4515	enough for at least into the year 4000. This requirement is fulfilled by	4817	good enough for at least into the year 4000 with millisecond accuracy
		4818	(the design goal for libev). This requirement is overfulfilled by
4516	implementations implementing IEEE 754, which is basically all existing	4819	implementations using IEEE 754, which is basically all existing ones. With
4517	ones. With IEEE 754 doubles, you get microsecond accuracy until at least	4820	IEEE 754 doubles, you get microsecond accuracy until at least 2200.
4518	2200.
4519		4821
4520	=back	4822	=back
4521		4823
4522	If you know of other additional requirements drop me a note.	4824	If you know of other additional requirements drop me a note.
4523		4825
…		…
4591	involves iterating over all running async watchers or all signal numbers.	4893	involves iterating over all running async watchers or all signal numbers.
4592		4894
4593	=back	4895	=back
4594		4896
4595		4897
		4898	=head1 PORTING FROM LIBEV 3.X TO 4.X
		4899
		4900	The major version 4 introduced some incompatible changes to the API.
		4901
		4902	At the moment, the C<ev.h> header file provides compatibility definitions
		4903	for all changes, so most programs should still compile. The compatibility
		4904	layer might be removed in later versions of libev, so better update to the
		4905	new API early than late.
		4906
		4907	=over 4
		4908
		4909	=item C<EV_COMPAT3> backwards compatibility mechanism
		4910
		4911	The backward compatibility mechanism can be controlled by
		4912	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
		4913	section.
		4914
		4915	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
		4916
		4917	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
		4918
		4919	ev_loop_destroy (EV_DEFAULT_UC);
		4920	ev_loop_fork (EV_DEFAULT);
		4921
		4922	=item function/symbol renames
		4923
		4924	A number of functions and symbols have been renamed:
		4925
		4926	ev_loop => ev_run
		4927	EVLOOP_NONBLOCK => EVRUN_NOWAIT
		4928	EVLOOP_ONESHOT => EVRUN_ONCE
		4929
		4930	ev_unloop => ev_break
		4931	EVUNLOOP_CANCEL => EVBREAK_CANCEL
		4932	EVUNLOOP_ONE => EVBREAK_ONE
		4933	EVUNLOOP_ALL => EVBREAK_ALL
		4934
		4935	EV_TIMEOUT => EV_TIMER
		4936
		4937	ev_loop_count => ev_iteration
		4938	ev_loop_depth => ev_depth
		4939	ev_loop_verify => ev_verify
		4940
		4941	Most functions working on C<struct ev_loop> objects don't have an
		4942	C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
		4943	associated constants have been renamed to not collide with the C<struct
		4944	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
		4945	as all other watcher types. Note that C<ev_loop_fork> is still called
		4946	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
		4947	typedef.
		4948
		4949	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
		4950
		4951	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
		4952	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
		4953	and work, but the library code will of course be larger.
		4954
		4955	=back
		4956
		4957
4596	=head1 GLOSSARY	4958	=head1 GLOSSARY
4597		4959
4598	=over 4	4960	=over 4
4599		4961
4600	=item active	4962	=item active
4601		4963
4602	A watcher is active as long as it has been started (has been attached to	4964	A watcher is active as long as it has been started and not yet stopped.
4603	an event loop) but not yet stopped (disassociated from the event loop).	4965	See L<WATCHER STATES> for details.
4604		4966
4605	=item application	4967	=item application
4606		4968
4607	In this document, an application is whatever is using libev.	4969	In this document, an application is whatever is using libev.
		4970
		4971	=item backend
		4972
		4973	The part of the code dealing with the operating system interfaces.
4608		4974
4609	=item callback	4975	=item callback
4610		4976
4611	The address of a function that is called when some event has been	4977	The address of a function that is called when some event has been
4612	detected. Callbacks are being passed the event loop, the watcher that	4978	detected. Callbacks are being passed the event loop, the watcher that
4613	received the event, and the actual event bitset.	4979	received the event, and the actual event bitset.
4614		4980
4615	=item callback invocation	4981	=item callback/watcher invocation
4616		4982
4617	The act of calling the callback associated with a watcher.	4983	The act of calling the callback associated with a watcher.
4618		4984
4619	=item event	4985	=item event
4620		4986
4621	A change of state of some external event, such as data now being available	4987	A change of state of some external event, such as data now being available
4622	for reading on a file descriptor, time having passed or simply not having	4988	for reading on a file descriptor, time having passed or simply not having
4623	any other events happening anymore.	4989	any other events happening anymore.
4624		4990
4625	In libev, events are represented as single bits (such as C<EV_READ> or	4991	In libev, events are represented as single bits (such as C<EV_READ> or
4626	C<EV_TIMEOUT>).	4992	C<EV_TIMER>).
4627		4993
4628	=item event library	4994	=item event library
4629		4995
4630	A software package implementing an event model and loop.	4996	A software package implementing an event model and loop.
4631		4997
…		…
4639	The model used to describe how an event loop handles and processes	5005	The model used to describe how an event loop handles and processes
4640	watchers and events.	5006	watchers and events.
4641		5007
4642	=item pending	5008	=item pending
4643		5009
4644	A watcher is pending as soon as the corresponding event has been detected,	5010	A watcher is pending as soon as the corresponding event has been
4645	and stops being pending as soon as the watcher will be invoked or its	5011	detected. See L<WATCHER STATES> for details.
4646	pending status is explicitly cleared by the application.
4647
4648	A watcher can be pending, but not active. Stopping a watcher also clears
4649	its pending status.
4650		5012
4651	=item real time	5013	=item real time
4652		5014
4653	The physical time that is observed. It is apparently strictly monotonic :)	5015	The physical time that is observed. It is apparently strictly monotonic :)
4654		5016
…		…
4661	=item watcher	5023	=item watcher
4662		5024
4663	A data structure that describes interest in certain events. Watchers need	5025	A data structure that describes interest in certain events. Watchers need
4664	to be started (attached to an event loop) before they can receive events.	5026	to be started (attached to an event loop) before they can receive events.
4665		5027
4666	=item watcher invocation
4667
4668	The act of calling the callback associated with a watcher.
4669
4670	=back	5028	=back
4671		5029
4672	=head1 AUTHOR	5030	=head1 AUTHOR
4673		5031
4674	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.	5032	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
		5033	Magnusson and Emanuele Giaquinta.
4675		5034

Diff Legend

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