ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.316 by root, Fri Oct 22 09:34:01 2010 UTC vs.
Revision 1.368 by root, Thu Apr 14 23:02:33 2011 UTC

…		…
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);
…		…
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_run (loop, 0);	61	ev_run (loop, 0);
62		62
63	// unloop was called, so exit	63	// break was called, so exit
64	return 0;	64	return 0;
65	}	65	}
66		66
67	=head1 ABOUT THIS DOCUMENT	67	=head1 ABOUT THIS DOCUMENT
68		68
…		…
77	on event-based programming, nor will it introduce event-based programming	77	on event-based programming, nor will it introduce event-based programming
78	with libev.	78	with libev.
79		79
80	Familiarity with event based programming techniques in general is assumed	80	Familiarity with event based programming techniques in general is assumed
81	throughout this document.	81	throughout this document.
		82
		83	=head1 WHAT TO READ WHEN IN A HURRY
		84
		85	This manual tries to be very detailed, but unfortunately, this also makes
		86	it very long. If you just want to know the basics of libev, I suggest
		87	reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and
		88	look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and
		89	C<ev_timer> sections in L<WATCHER TYPES>.
82		90
83	=head1 ABOUT LIBEV	91	=head1 ABOUT LIBEV
84		92
85	Libev is an event loop: you register interest in certain events (such as a	93	Libev is an event loop: you register interest in certain events (such as a
86	file descriptor being readable or a timeout occurring), and it will manage	94	file descriptor being readable or a timeout occurring), and it will manage
…		…
124	this argument.	132	this argument.
125		133
126	=head2 TIME REPRESENTATION	134	=head2 TIME REPRESENTATION
127		135
128	Libev represents time as a single floating point number, representing	136	Libev represents time as a single floating point number, representing
129	the (fractional) number of seconds since the (POSIX) epoch (in practise	137	the (fractional) number of seconds since the (POSIX) epoch (in practice
130	somewhere near the beginning of 1970, details are complicated, don't	138	somewhere near the beginning of 1970, details are complicated, don't
131	ask). This type is called C<ev_tstamp>, which is what you should use	139	ask). This type is called C<ev_tstamp>, which is what you should use
132	too. It usually aliases to the C<double> type in C. When you need to do	140	too. It usually aliases to the C<double> type in C. When you need to do
133	any calculations on it, you should treat it as some floating point value.	141	any calculations on it, you should treat it as some floating point value.
134		142
…		…
165		173
166	=item ev_tstamp ev_time ()	174	=item ev_tstamp ev_time ()
167		175
168	Returns the current time as libev would use it. Please note that the	176	Returns the current time as libev would use it. Please note that the
169	C<ev_now> function is usually faster and also often returns the timestamp	177	C<ev_now> function is usually faster and also often returns the timestamp
170	you actually want to know.	178	you actually want to know. Also interesting is the combination of
		179	C<ev_update_now> and C<ev_now>.
171		180
172	=item ev_sleep (ev_tstamp interval)	181	=item ev_sleep (ev_tstamp interval)
173		182
174	Sleep for the given interval: The current thread will be blocked until	183	Sleep for the given interval: The current thread will be blocked until
175	either it is interrupted or the given time interval has passed. Basically	184	either it is interrupted or the given time interval has passed. Basically
…		…
192	as this indicates an incompatible change. Minor versions are usually	201	as this indicates an incompatible change. Minor versions are usually
193	compatible to older versions, so a larger minor version alone is usually	202	compatible to older versions, so a larger minor version alone is usually
194	not a problem.	203	not a problem.
195		204
196	Example: Make sure we haven't accidentally been linked against the wrong	205	Example: Make sure we haven't accidentally been linked against the wrong
197	version (note, however, that this will not detect ABI mismatches :).	206	version (note, however, that this will not detect other ABI mismatches,
		207	such as LFS or reentrancy).
198		208
199	assert (("libev version mismatch",	209	assert (("libev version mismatch",
200	ev_version_major () == EV_VERSION_MAJOR	210	ev_version_major () == EV_VERSION_MAJOR
201	&& ev_version_minor () >= EV_VERSION_MINOR));	211	&& ev_version_minor () >= EV_VERSION_MINOR));
202		212
…		…
213	assert (("sorry, no epoll, no sex",	223	assert (("sorry, no epoll, no sex",
214	ev_supported_backends () & EVBACKEND_EPOLL));	224	ev_supported_backends () & EVBACKEND_EPOLL));
215		225
216	=item unsigned int ev_recommended_backends ()	226	=item unsigned int ev_recommended_backends ()
217		227
218	Return the set of all backends compiled into this binary of libev and also	228	Return the set of all backends compiled into this binary of libev and
219	recommended for this platform. This set is often smaller than the one	229	also recommended for this platform, meaning it will work for most file
		230	descriptor types. This set is often smaller than the one returned by
220	returned by C<ev_supported_backends>, as for example kqueue is broken on	231	C<ev_supported_backends>, as for example kqueue is broken on most BSDs
221	most BSDs and will not be auto-detected unless you explicitly request it	232	and will not be auto-detected unless you explicitly request it (assuming
222	(assuming you know what you are doing). This is the set of backends that	233	you know what you are doing). This is the set of backends that libev will
223	libev will probe for if you specify no backends explicitly.	234	probe for if you specify no backends explicitly.
224		235
225	=item unsigned int ev_embeddable_backends ()	236	=item unsigned int ev_embeddable_backends ()
226		237
227	Returns the set of backends that are embeddable in other event loops. This	238	Returns the set of backends that are embeddable in other event loops. This
228	is the theoretical, all-platform, value. To find which backends	239	value is platform-specific but can include backends not available on the
229	might be supported on the current system, you would need to look at	240	current system. To find which embeddable backends might be supported on
230	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	241	the current system, you would need to look at C<ev_embeddable_backends ()
231	recommended ones.	242	& ev_supported_backends ()>, likewise for recommended ones.
232		243
233	See the description of C<ev_embed> watchers for more info.	244	See the description of C<ev_embed> watchers for more info.
234		245
235	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]	246	=item ev_set_allocator (void *(*cb)(void *ptr, long size))
236		247
237	Sets the allocation function to use (the prototype is similar - the	248	Sets the allocation function to use (the prototype is similar - the
238	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is	249	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
239	used to allocate and free memory (no surprises here). If it returns zero	250	used to allocate and free memory (no surprises here). If it returns zero
240	when memory needs to be allocated (C<size != 0>), the library might abort	251	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
266	}	277	}
267		278
268	...	279	...
269	ev_set_allocator (persistent_realloc);	280	ev_set_allocator (persistent_realloc);
270		281
271	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]	282	=item ev_set_syserr_cb (void (*cb)(const char *msg))
272		283
273	Set the callback function to call on a retryable system call error (such	284	Set the callback function to call on a retryable system call error (such
274	as failed select, poll, epoll_wait). The message is a printable string	285	as failed select, poll, epoll_wait). The message is a printable string
275	indicating the system call or subsystem causing the problem. If this	286	indicating the system call or subsystem causing the problem. If this
276	callback is set, then libev will expect it to remedy the situation, no	287	callback is set, then libev will expect it to remedy the situation, no
…		…
288	}	299	}
289		300
290	...	301	...
291	ev_set_syserr_cb (fatal_error);	302	ev_set_syserr_cb (fatal_error);
292		303
		304	=item ev_feed_signal (int signum)
		305
		306	This function can be used to "simulate" a signal receive. It is completely
		307	safe to call this function at any time, from any context, including signal
		308	handlers or random threads.
		309
		310	Its main use is to customise signal handling in your process, especially
		311	in the presence of threads. For example, you could block signals
		312	by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
		313	creating any loops), and in one thread, use C<sigwait> or any other
		314	mechanism to wait for signals, then "deliver" them to libev by calling
		315	C<ev_feed_signal>.
		316
293	=back	317	=back
294		318
295	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	319	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
296		320
297	An event loop is described by a C<struct ev_loop *> (the C<struct> is	321	An event loop is described by a C<struct ev_loop *> (the C<struct> is
298	I<not> optional in this case unless libev 3 compatibility is disabled, as	322	I<not> optional in this case unless libev 3 compatibility is disabled, as
299	libev 3 had an C<ev_loop> function colliding with the struct name).	323	libev 3 had an C<ev_loop> function colliding with the struct name).
300		324
301	The library knows two types of such loops, the I<default> loop, which	325	The library knows two types of such loops, the I<default> loop, which
302	supports signals and child events, and dynamically created event loops	326	supports child process events, and dynamically created event loops which
303	which do not.	327	do not.
304		328
305	=over 4	329	=over 4
306		330
307	=item struct ev_loop *ev_default_loop (unsigned int flags)	331	=item struct ev_loop *ev_default_loop (unsigned int flags)
308		332
309	This will initialise the default event loop if it hasn't been initialised	333	This returns the "default" event loop object, which is what you should
310	yet and return it. If the default loop could not be initialised, returns	334	normally use when you just need "the event loop". Event loop objects and
311	false. If it already was initialised it simply returns it (and ignores the	335	the C<flags> parameter are described in more detail in the entry for
312	flags. If that is troubling you, check C<ev_backend ()> afterwards).	336	C<ev_loop_new>.
		337
		338	If the default loop is already initialised then this function simply
		339	returns it (and ignores the flags. If that is troubling you, check
		340	C<ev_backend ()> afterwards). Otherwise it will create it with the given
		341	flags, which should almost always be C<0>, unless the caller is also the
		342	one calling C<ev_run> or otherwise qualifies as "the main program".
313		343
314	If you don't know what event loop to use, use the one returned from this	344	If you don't know what event loop to use, use the one returned from this
315	function.	345	function (or via the C<EV_DEFAULT> macro).
316		346
317	Note that this function is I<not> thread-safe, so if you want to use it	347	Note that this function is I<not> thread-safe, so if you want to use it
318	from multiple threads, you have to lock (note also that this is unlikely,	348	from multiple threads, you have to employ some kind of mutex (note also
319	as loops cannot be shared easily between threads anyway).	349	that this case is unlikely, as loops cannot be shared easily between
		350	threads anyway).
320		351
321	The default loop is the only loop that can handle C<ev_signal> and	352	The default loop is the only loop that can handle C<ev_child> watchers,
322	C<ev_child> watchers, and to do this, it always registers a handler	353	and to do this, it always registers a handler for C<SIGCHLD>. If this is
323	for C<SIGCHLD>. If this is a problem for your application you can either	354	a problem for your application you can either create a dynamic loop with
324	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you	355	C<ev_loop_new> which doesn't do that, or you can simply overwrite the
325	can simply overwrite the C<SIGCHLD> signal handler I<after> calling	356	C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
326	C<ev_default_init>.	357
		358	Example: This is the most typical usage.
		359
		360	if (!ev_default_loop (0))
		361	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
		362
		363	Example: Restrict libev to the select and poll backends, and do not allow
		364	environment settings to be taken into account:
		365
		366	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
		367
		368	=item struct ev_loop *ev_loop_new (unsigned int flags)
		369
		370	This will create and initialise a new event loop object. If the loop
		371	could not be initialised, returns false.
		372
		373	This function is thread-safe, and one common way to use libev with
		374	threads is indeed to create one loop per thread, and using the default
		375	loop in the "main" or "initial" thread.
327		376
328	The flags argument can be used to specify special behaviour or specific	377	The flags argument can be used to specify special behaviour or specific
329	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	378	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
330		379
331	The following flags are supported:	380	The following flags are supported:
…		…
366	environment variable.	415	environment variable.
367		416
368	=item C<EVFLAG_NOINOTIFY>	417	=item C<EVFLAG_NOINOTIFY>
369		418
370	When this flag is specified, then libev will not attempt to use the	419	When this flag is specified, then libev will not attempt to use the
371	I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and	420	I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
372	testing, this flag can be useful to conserve inotify file descriptors, as	421	testing, this flag can be useful to conserve inotify file descriptors, as
373	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.	422	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374		423
375	=item C<EVFLAG_SIGNALFD>	424	=item C<EVFLAG_SIGNALFD>
376		425
377	When this flag is specified, then libev will attempt to use the	426	When this flag is specified, then libev will attempt to use the
378	I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API	427	I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API
379	delivers signals synchronously, which makes it both faster and might make	428	delivers signals synchronously, which makes it both faster and might make
380	it possible to get the queued signal data. It can also simplify signal	429	it possible to get the queued signal data. It can also simplify signal
381	handling with threads, as long as you properly block signals in your	430	handling with threads, as long as you properly block signals in your
382	threads that are not interested in handling them.	431	threads that are not interested in handling them.
383		432
384	Signalfd will not be used by default as this changes your signal mask, and	433	Signalfd will not be used by default as this changes your signal mask, and
385	there are a lot of shoddy libraries and programs (glib's threadpool for	434	there are a lot of shoddy libraries and programs (glib's threadpool for
386	example) that can't properly initialise their signal masks.	435	example) that can't properly initialise their signal masks.
		436
		437	=item C<EVFLAG_NOSIGMASK>
		438
		439	When this flag is specified, then libev will avoid to modify the signal
		440	mask. Specifically, this means you ahve to make sure signals are unblocked
		441	when you want to receive them.
		442
		443	This behaviour is useful when you want to do your own signal handling, or
		444	want to handle signals only in specific threads and want to avoid libev
		445	unblocking the signals.
		446
		447	It's also required by POSIX in a threaded program, as libev calls
		448	C<sigprocmask>, whose behaviour is officially unspecified.
		449
		450	This flag's behaviour will become the default in future versions of libev.
387		451
388	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	452	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
389		453
390	This is your standard select(2) backend. Not I<completely> standard, as	454	This is your standard select(2) backend. Not I<completely> standard, as
391	libev tries to roll its own fd_set with no limits on the number of fds,	455	libev tries to roll its own fd_set with no limits on the number of fds,
…		…
419	=item C<EVBACKEND_EPOLL> (value 4, Linux)	483	=item C<EVBACKEND_EPOLL> (value 4, Linux)
420		484
421	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9	485	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
422	kernels).	486	kernels).
423		487
424	For few fds, this backend is a bit little slower than poll and select,	488	For few fds, this backend is a bit little slower than poll and select, but
425	but it scales phenomenally better. While poll and select usually scale	489	it scales phenomenally better. While poll and select usually scale like
426	like O(total_fds) where n is the total number of fds (or the highest fd),	490	O(total_fds) where total_fds is the total number of fds (or the highest
427	epoll scales either O(1) or O(active_fds).	491	fd), epoll scales either O(1) or O(active_fds).
428		492
429	The epoll mechanism deserves honorable mention as the most misdesigned	493	The epoll mechanism deserves honorable mention as the most misdesigned
430	of the more advanced event mechanisms: mere annoyances include silently	494	of the more advanced event mechanisms: mere annoyances include silently
431	dropping file descriptors, requiring a system call per change per file	495	dropping file descriptors, requiring a system call per change per file
432	descriptor (and unnecessary guessing of parameters), problems with dup and	496	descriptor (and unnecessary guessing of parameters), problems with dup,
		497	returning before the timeout value, resulting in additional iterations
		498	(and only giving 5ms accuracy while select on the same platform gives
433	so on. The biggest issue is fork races, however - if a program forks then	499	0.1ms) and so on. The biggest issue is fork races, however - if a program
434	I<both> parent and child process have to recreate the epoll set, which can	500	forks then I<both> parent and child process have to recreate the epoll
435	take considerable time (one syscall per file descriptor) and is of course	501	set, which can take considerable time (one syscall per file descriptor)
436	hard to detect.	502	and is of course hard to detect.
437		503
438	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	504	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
439	of course I<doesn't>, and epoll just loves to report events for totally	505	of course I<doesn't>, and epoll just loves to report events for totally
440	I<different> file descriptors (even already closed ones, so one cannot	506	I<different> file descriptors (even already closed ones, so one cannot
441	even remove them from the set) than registered in the set (especially	507	even remove them from the set) than registered in the set (especially
…		…
443	employing an additional generation counter and comparing that against the	509	employing an additional generation counter and comparing that against the
444	events to filter out spurious ones, recreating the set when required. Last	510	events to filter out spurious ones, recreating the set when required. Last
445	not least, it also refuses to work with some file descriptors which work	511	not least, it also refuses to work with some file descriptors which work
446	perfectly fine with C<select> (files, many character devices...).	512	perfectly fine with C<select> (files, many character devices...).
447		513
		514	Epoll is truly the train wreck analog among event poll mechanisms,
		515	a frankenpoll, cobbled together in a hurry, no thought to design or
		516	interaction with others.
		517
448	While stopping, setting and starting an I/O watcher in the same iteration	518	While stopping, setting and starting an I/O watcher in the same iteration
449	will result in some caching, there is still a system call per such	519	will result in some caching, there is still a system call per such
450	incident (because the same I<file descriptor> could point to a different	520	incident (because the same I<file descriptor> could point to a different
451	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	521	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
452	file descriptors might not work very well if you register events for both	522	file descriptors might not work very well if you register events for both
…		…
517	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	587	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
518		588
519	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	589	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
520	it's really slow, but it still scales very well (O(active_fds)).	590	it's really slow, but it still scales very well (O(active_fds)).
521		591
522	Please note that Solaris event ports can deliver a lot of spurious
523	notifications, so you need to use non-blocking I/O or other means to avoid
524	blocking when no data (or space) is available.
525
526	While this backend scales well, it requires one system call per active	592	While this backend scales well, it requires one system call per active
527	file descriptor per loop iteration. For small and medium numbers of file	593	file descriptor per loop iteration. For small and medium numbers of file
528	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	594	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
529	might perform better.	595	might perform better.
530		596
531	On the positive side, with the exception of the spurious readiness	597	On the positive side, this backend actually performed fully to
532	notifications, this backend actually performed fully to specification
533	in all tests and is fully embeddable, which is a rare feat among the	598	specification in all tests and is fully embeddable, which is a rare feat
534	OS-specific backends (I vastly prefer correctness over speed hacks).	599	among the OS-specific backends (I vastly prefer correctness over speed
		600	hacks).
		601
		602	On the negative side, the interface is I<bizarre> - so bizarre that
		603	even sun itself gets it wrong in their code examples: The event polling
		604	function sometimes returning events to the caller even though an error
		605	occurred, but with no indication whether it has done so or not (yes, it's
		606	even documented that way) - deadly for edge-triggered interfaces where
		607	you absolutely have to know whether an event occurred or not because you
		608	have to re-arm the watcher.
		609
		610	Fortunately libev seems to be able to work around these idiocies.
535		611
536	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	612	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
537	C<EVBACKEND_POLL>.	613	C<EVBACKEND_POLL>.
538		614
539	=item C<EVBACKEND_ALL>	615	=item C<EVBACKEND_ALL>
540		616
541	Try all backends (even potentially broken ones that wouldn't be tried	617	Try all backends (even potentially broken ones that wouldn't be tried
542	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	618	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
543	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	619	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
544		620
545	It is definitely not recommended to use this flag.	621	It is definitely not recommended to use this flag, use whatever
		622	C<ev_recommended_backends ()> returns, or simply do not specify a backend
		623	at all.
		624
		625	=item C<EVBACKEND_MASK>
		626
		627	Not a backend at all, but a mask to select all backend bits from a
		628	C<flags> value, in case you want to mask out any backends from a flags
		629	value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
546		630
547	=back	631	=back
548		632
549	If one or more of the backend flags are or'ed into the flags value,	633	If one or more of the backend flags are or'ed into the flags value,
550	then only these backends will be tried (in the reverse order as listed	634	then only these backends will be tried (in the reverse order as listed
551	here). If none are specified, all backends in C<ev_recommended_backends	635	here). If none are specified, all backends in C<ev_recommended_backends
552	()> will be tried.	636	()> will be tried.
553		637
554	Example: This is the most typical usage.
555
556	if (!ev_default_loop (0))
557	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
558
559	Example: Restrict libev to the select and poll backends, and do not allow
560	environment settings to be taken into account:
561
562	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
563
564	Example: Use whatever libev has to offer, but make sure that kqueue is
565	used if available (warning, breaks stuff, best use only with your own
566	private event loop and only if you know the OS supports your types of
567	fds):
568
569	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
570
571	=item struct ev_loop *ev_loop_new (unsigned int flags)
572
573	Similar to C<ev_default_loop>, but always creates a new event loop that is
574	always distinct from the default loop.
575
576	Note that this function I<is> thread-safe, and one common way to use
577	libev with threads is indeed to create one loop per thread, and using the
578	default loop in the "main" or "initial" thread.
579
580	Example: Try to create a event loop that uses epoll and nothing else.	638	Example: Try to create a event loop that uses epoll and nothing else.
581		639
582	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	640	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
583	if (!epoller)	641	if (!epoller)
584	fatal ("no epoll found here, maybe it hides under your chair");	642	fatal ("no epoll found here, maybe it hides under your chair");
585		643
		644	Example: Use whatever libev has to offer, but make sure that kqueue is
		645	used if available.
		646
		647	struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
		648
586	=item ev_default_destroy ()	649	=item ev_loop_destroy (loop)
587		650
588	Destroys the default loop (frees all memory and kernel state etc.). None	651	Destroys an event loop object (frees all memory and kernel state
589	of the active event watchers will be stopped in the normal sense, so	652	etc.). None of the active event watchers will be stopped in the normal
590	e.g. C<ev_is_active> might still return true. It is your responsibility to	653	sense, so e.g. C<ev_is_active> might still return true. It is your
591	either stop all watchers cleanly yourself I<before> calling this function,	654	responsibility to either stop all watchers cleanly yourself I<before>
592	or cope with the fact afterwards (which is usually the easiest thing, you	655	calling this function, or cope with the fact afterwards (which is usually
593	can just ignore the watchers and/or C<free ()> them for example).	656	the easiest thing, you can just ignore the watchers and/or C<free ()> them
		657	for example).
594		658
595	Note that certain global state, such as signal state (and installed signal	659	Note that certain global state, such as signal state (and installed signal
596	handlers), will not be freed by this function, and related watchers (such	660	handlers), will not be freed by this function, and related watchers (such
597	as signal and child watchers) would need to be stopped manually.	661	as signal and child watchers) would need to be stopped manually.
598		662
599	In general it is not advisable to call this function except in the	663	This function is normally used on loop objects allocated by
600	rare occasion where you really need to free e.g. the signal handling	664	C<ev_loop_new>, but it can also be used on the default loop returned by
		665	C<ev_default_loop>, in which case it is not thread-safe.
		666
		667	Note that it is not advisable to call this function on the default loop
		668	except in the rare occasion where you really need to free its resources.
601	pipe fds. If you need dynamically allocated loops it is better to use	669	If you need dynamically allocated loops it is better to use C<ev_loop_new>
602	C<ev_loop_new> and C<ev_loop_destroy>.	670	and C<ev_loop_destroy>.
603		671
604	=item ev_loop_destroy (loop)	672	=item ev_loop_fork (loop)
605		673
606	Like C<ev_default_destroy>, but destroys an event loop created by an
607	earlier call to C<ev_loop_new>.
608
609	=item ev_default_fork ()
610
611	This function sets a flag that causes subsequent C<ev_run> iterations	674	This function sets a flag that causes subsequent C<ev_run> iterations to
612	to reinitialise the kernel state for backends that have one. Despite the	675	reinitialise the kernel state for backends that have one. Despite the
613	name, you can call it anytime, but it makes most sense after forking, in	676	name, you can call it anytime, but it makes most sense after forking, in
614	the child process (or both child and parent, but that again makes little	677	the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
615	sense). You I<must> call it in the child before using any of the libev	678	child before resuming or calling C<ev_run>.
616	functions, and it will only take effect at the next C<ev_run> iteration.
617		679
618	Again, you I<have> to call it on I<any> loop that you want to re-use after	680	Again, you I<have> to call it on I<any> loop that you want to re-use after
619	a fork, I<even if you do not plan to use the loop in the parent>. This is	681	a fork, I<even if you do not plan to use the loop in the parent>. This is
620	because some kernel interfaces *cough* I<kqueue> *cough* do funny things	682	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
621	during fork.	683	during fork.
…		…
626	call it at all (in fact, C<epoll> is so badly broken that it makes a	688	call it at all (in fact, C<epoll> is so badly broken that it makes a
627	difference, but libev will usually detect this case on its own and do a	689	difference, but libev will usually detect this case on its own and do a
628	costly reset of the backend).	690	costly reset of the backend).
629		691
630	The function itself is quite fast and it's usually not a problem to call	692	The function itself is quite fast and it's usually not a problem to call
631	it just in case after a fork. To make this easy, the function will fit in	693	it just in case after a fork.
632	quite nicely into a call to C<pthread_atfork>:
633		694
		695	Example: Automate calling C<ev_loop_fork> on the default loop when
		696	using pthreads.
		697
		698	static void
		699	post_fork_child (void)
		700	{
		701	ev_loop_fork (EV_DEFAULT);
		702	}
		703
		704	...
634	pthread_atfork (0, 0, ev_default_fork);	705	pthread_atfork (0, 0, post_fork_child);
635
636	=item ev_loop_fork (loop)
637
638	Like C<ev_default_fork>, but acts on an event loop created by
639	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
640	after fork that you want to re-use in the child, and how you keep track of
641	them is entirely your own problem.
642		706
643	=item int ev_is_default_loop (loop)	707	=item int ev_is_default_loop (loop)
644		708
645	Returns true when the given loop is, in fact, the default loop, and false	709	Returns true when the given loop is, in fact, the default loop, and false
646	otherwise.	710	otherwise.
…		…
657	prepare and check phases.	721	prepare and check phases.
658		722
659	=item unsigned int ev_depth (loop)	723	=item unsigned int ev_depth (loop)
660		724
661	Returns the number of times C<ev_run> was entered minus the number of	725	Returns the number of times C<ev_run> was entered minus the number of
662	times C<ev_run> was exited, in other words, the recursion depth.	726	times C<ev_run> was exited normally, in other words, the recursion depth.
663		727
664	Outside C<ev_run>, this number is zero. In a callback, this number is	728	Outside C<ev_run>, this number is zero. In a callback, this number is
665	C<1>, unless C<ev_run> was invoked recursively (or from another thread),	729	C<1>, unless C<ev_run> was invoked recursively (or from another thread),
666	in which case it is higher.	730	in which case it is higher.
667		731
668	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread	732	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
669	etc.), doesn't count as "exit" - consider this as a hint to avoid such	733	throwing an exception etc.), doesn't count as "exit" - consider this
670	ungentleman-like behaviour unless it's really convenient.	734	as a hint to avoid such ungentleman-like behaviour unless it's really
		735	convenient, in which case it is fully supported.
671		736
672	=item unsigned int ev_backend (loop)	737	=item unsigned int ev_backend (loop)
673		738
674	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	739	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
675	use.	740	use.
…		…
736	relying on all watchers to be stopped when deciding when a program has	801	relying on all watchers to be stopped when deciding when a program has
737	finished (especially in interactive programs), but having a program	802	finished (especially in interactive programs), but having a program
738	that automatically loops as long as it has to and no longer by virtue	803	that automatically loops as long as it has to and no longer by virtue
739	of relying on its watchers stopping correctly, that is truly a thing of	804	of relying on its watchers stopping correctly, that is truly a thing of
740	beauty.	805	beauty.
		806
		807	This function is also I<mostly> exception-safe - you can break out of
		808	a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
		809	exception and so on. This does not decrement the C<ev_depth> value, nor
		810	will it clear any outstanding C<EVBREAK_ONE> breaks.
741		811
742	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle	812	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
743	those events and any already outstanding ones, but will not wait and	813	those events and any already outstanding ones, but will not wait and
744	block your process in case there are no events and will return after one	814	block your process in case there are no events and will return after one
745	iteration of the loop. This is sometimes useful to poll and handle new	815	iteration of the loop. This is sometimes useful to poll and handle new
…		…
798	anymore.	868	anymore.
799		869
800	... queue jobs here, make sure they register event watchers as long	870	... queue jobs here, make sure they register event watchers as long
801	... as they still have work to do (even an idle watcher will do..)	871	... as they still have work to do (even an idle watcher will do..)
802	ev_run (my_loop, 0);	872	ev_run (my_loop, 0);
803	... jobs done or somebody called unloop. yeah!	873	... jobs done or somebody called break. yeah!
804		874
805	=item ev_break (loop, how)	875	=item ev_break (loop, how)
806		876
807	Can be used to make a call to C<ev_run> return early (but only after it	877	Can be used to make a call to C<ev_run> return early (but only after it
808	has processed all outstanding events). The C<how> argument must be either	878	has processed all outstanding events). The C<how> argument must be either
809	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or	879	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
810	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.	880	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
811		881
812	This "unloop state" will be cleared when entering C<ev_run> again.	882	This "break state" will be cleared on the next call to C<ev_run>.
813		883
814	It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO##	884	It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
		885	which case it will have no effect.
815		886
816	=item ev_ref (loop)	887	=item ev_ref (loop)
817		888
818	=item ev_unref (loop)	889	=item ev_unref (loop)
819		890
…		…
840	running when nothing else is active.	911	running when nothing else is active.
841		912
842	ev_signal exitsig;	913	ev_signal exitsig;
843	ev_signal_init (&exitsig, sig_cb, SIGINT);	914	ev_signal_init (&exitsig, sig_cb, SIGINT);
844	ev_signal_start (loop, &exitsig);	915	ev_signal_start (loop, &exitsig);
845	evf_unref (loop);	916	ev_unref (loop);
846		917
847	Example: For some weird reason, unregister the above signal handler again.	918	Example: For some weird reason, unregister the above signal handler again.
848		919
849	ev_ref (loop);	920	ev_ref (loop);
850	ev_signal_stop (loop, &exitsig);	921	ev_signal_stop (loop, &exitsig);
…		…
962	See also the locking example in the C<THREADS> section later in this	1033	See also the locking example in the C<THREADS> section later in this
963	document.	1034	document.
964		1035
965	=item ev_set_userdata (loop, void *data)	1036	=item ev_set_userdata (loop, void *data)
966		1037
967	=item ev_userdata (loop)	1038	=item void *ev_userdata (loop)
968		1039
969	Set and retrieve a single C<void *> associated with a loop. When	1040	Set and retrieve a single C<void *> associated with a loop. When
970	C<ev_set_userdata> has never been called, then C<ev_userdata> returns	1041	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
971	C<0.>	1042	C<0>.
972		1043
973	These two functions can be used to associate arbitrary data with a loop,	1044	These two functions can be used to associate arbitrary data with a loop,
974	and are intended solely for the C<invoke_pending_cb>, C<release> and	1045	and are intended solely for the C<invoke_pending_cb>, C<release> and
975	C<acquire> callbacks described above, but of course can be (ab-)used for	1046	C<acquire> callbacks described above, but of course can be (ab-)used for
976	any other purpose as well.	1047	any other purpose as well.
…		…
1104	=item C<EV_FORK>	1175	=item C<EV_FORK>
1105		1176
1106	The event loop has been resumed in the child process after fork (see	1177	The event loop has been resumed in the child process after fork (see
1107	C<ev_fork>).	1178	C<ev_fork>).
1108		1179
		1180	=item C<EV_CLEANUP>
		1181
		1182	The event loop is about to be destroyed (see C<ev_cleanup>).
		1183
1109	=item C<EV_ASYNC>	1184	=item C<EV_ASYNC>
1110		1185
1111	The given async watcher has been asynchronously notified (see C<ev_async>).	1186	The given async watcher has been asynchronously notified (see C<ev_async>).
1112		1187
1113	=item C<EV_CUSTOM>	1188	=item C<EV_CUSTOM>
…		…
1134	programs, though, as the fd could already be closed and reused for another	1209	programs, though, as the fd could already be closed and reused for another
1135	thing, so beware.	1210	thing, so beware.
1136		1211
1137	=back	1212	=back
1138		1213
		1214	=head2 GENERIC WATCHER FUNCTIONS
		1215
		1216	=over 4
		1217
		1218	=item C<ev_init> (ev_TYPE *watcher, callback)
		1219
		1220	This macro initialises the generic portion of a watcher. The contents
		1221	of the watcher object can be arbitrary (so C<malloc> will do). Only
		1222	the generic parts of the watcher are initialised, you I<need> to call
		1223	the type-specific C<ev_TYPE_set> macro afterwards to initialise the
		1224	type-specific parts. For each type there is also a C<ev_TYPE_init> macro
		1225	which rolls both calls into one.
		1226
		1227	You can reinitialise a watcher at any time as long as it has been stopped
		1228	(or never started) and there are no pending events outstanding.
		1229
		1230	The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
		1231	int revents)>.
		1232
		1233	Example: Initialise an C<ev_io> watcher in two steps.
		1234
		1235	ev_io w;
		1236	ev_init (&w, my_cb);
		1237	ev_io_set (&w, STDIN_FILENO, EV_READ);
		1238
		1239	=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
		1240
		1241	This macro initialises the type-specific parts of a watcher. You need to
		1242	call C<ev_init> at least once before you call this macro, but you can
		1243	call C<ev_TYPE_set> any number of times. You must not, however, call this
		1244	macro on a watcher that is active (it can be pending, however, which is a
		1245	difference to the C<ev_init> macro).
		1246
		1247	Although some watcher types do not have type-specific arguments
		1248	(e.g. C<ev_prepare>) you still need to call its C<set> macro.
		1249
		1250	See C<ev_init>, above, for an example.
		1251
		1252	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
		1253
		1254	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
		1255	calls into a single call. This is the most convenient method to initialise
		1256	a watcher. The same limitations apply, of course.
		1257
		1258	Example: Initialise and set an C<ev_io> watcher in one step.
		1259
		1260	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
		1261
		1262	=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
		1263
		1264	Starts (activates) the given watcher. Only active watchers will receive
		1265	events. If the watcher is already active nothing will happen.
		1266
		1267	Example: Start the C<ev_io> watcher that is being abused as example in this
		1268	whole section.
		1269
		1270	ev_io_start (EV_DEFAULT_UC, &w);
		1271
		1272	=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
		1273
		1274	Stops the given watcher if active, and clears the pending status (whether
		1275	the watcher was active or not).
		1276
		1277	It is possible that stopped watchers are pending - for example,
		1278	non-repeating timers are being stopped when they become pending - but
		1279	calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
		1280	pending. If you want to free or reuse the memory used by the watcher it is
		1281	therefore a good idea to always call its C<ev_TYPE_stop> function.
		1282
		1283	=item bool ev_is_active (ev_TYPE *watcher)
		1284
		1285	Returns a true value iff the watcher is active (i.e. it has been started
		1286	and not yet been stopped). As long as a watcher is active you must not modify
		1287	it.
		1288
		1289	=item bool ev_is_pending (ev_TYPE *watcher)
		1290
		1291	Returns a true value iff the watcher is pending, (i.e. it has outstanding
		1292	events but its callback has not yet been invoked). As long as a watcher
		1293	is pending (but not active) you must not call an init function on it (but
		1294	C<ev_TYPE_set> is safe), you must not change its priority, and you must
		1295	make sure the watcher is available to libev (e.g. you cannot C<free ()>
		1296	it).
		1297
		1298	=item callback ev_cb (ev_TYPE *watcher)
		1299
		1300	Returns the callback currently set on the watcher.
		1301
		1302	=item ev_cb_set (ev_TYPE *watcher, callback)
		1303
		1304	Change the callback. You can change the callback at virtually any time
		1305	(modulo threads).
		1306
		1307	=item ev_set_priority (ev_TYPE *watcher, int priority)
		1308
		1309	=item int ev_priority (ev_TYPE *watcher)
		1310
		1311	Set and query the priority of the watcher. The priority is a small
		1312	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
		1313	(default: C<-2>). Pending watchers with higher priority will be invoked
		1314	before watchers with lower priority, but priority will not keep watchers
		1315	from being executed (except for C<ev_idle> watchers).
		1316
		1317	If you need to suppress invocation when higher priority events are pending
		1318	you need to look at C<ev_idle> watchers, which provide this functionality.
		1319
		1320	You I<must not> change the priority of a watcher as long as it is active or
		1321	pending.
		1322
		1323	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
		1324	fine, as long as you do not mind that the priority value you query might
		1325	or might not have been clamped to the valid range.
		1326
		1327	The default priority used by watchers when no priority has been set is
		1328	always C<0>, which is supposed to not be too high and not be too low :).
		1329
		1330	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
		1331	priorities.
		1332
		1333	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
		1334
		1335	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
		1336	C<loop> nor C<revents> need to be valid as long as the watcher callback
		1337	can deal with that fact, as both are simply passed through to the
		1338	callback.
		1339
		1340	=item int ev_clear_pending (loop, ev_TYPE *watcher)
		1341
		1342	If the watcher is pending, this function clears its pending status and
		1343	returns its C<revents> bitset (as if its callback was invoked). If the
		1344	watcher isn't pending it does nothing and returns C<0>.
		1345
		1346	Sometimes it can be useful to "poll" a watcher instead of waiting for its
		1347	callback to be invoked, which can be accomplished with this function.
		1348
		1349	=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
		1350
		1351	Feeds the given event set into the event loop, as if the specified event
		1352	had happened for the specified watcher (which must be a pointer to an
		1353	initialised but not necessarily started event watcher). Obviously you must
		1354	not free the watcher as long as it has pending events.
		1355
		1356	Stopping the watcher, letting libev invoke it, or calling
		1357	C<ev_clear_pending> will clear the pending event, even if the watcher was
		1358	not started in the first place.
		1359
		1360	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
		1361	functions that do not need a watcher.
		1362
		1363	=back
		1364
		1365	See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
		1366	OWN COMPOSITE WATCHERS> idioms.
		1367
1139	=head2 WATCHER STATES	1368	=head2 WATCHER STATES
1140		1369
1141	There are various watcher states mentioned throughout this manual -	1370	There are various watcher states mentioned throughout this manual -
1142	active, pending and so on. In this section these states and the rules to	1371	active, pending and so on. In this section these states and the rules to
1143	transition between them will be described in more detail - and while these	1372	transition between them will be described in more detail - and while these
…		…
1149		1378
1150	Before a watcher can be registered with the event looop it has to be	1379	Before a watcher can be registered with the event looop it has to be
1151	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to	1380	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1152	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.	1381	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1153		1382
1154	In this state it is simply some block of memory that is suitable for use	1383	In this state it is simply some block of memory that is suitable for
1155	in an event loop. It can be moved around, freed, reused etc. at will.	1384	use in an event loop. It can be moved around, freed, reused etc. at
		1385	will - as long as you either keep the memory contents intact, or call
		1386	C<ev_TYPE_init> again.
1156		1387
1157	=item started/running/active	1388	=item started/running/active
1158		1389
1159	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes	1390	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1160	property of the event loop, and is actively waiting for events. While in	1391	property of the event loop, and is actively waiting for events. While in
…		…
1188	latter will clear any pending state the watcher might be in, regardless	1419	latter will clear any pending state the watcher might be in, regardless
1189	of whether it was active or not, so stopping a watcher explicitly before	1420	of whether it was active or not, so stopping a watcher explicitly before
1190	freeing it is often a good idea.	1421	freeing it is often a good idea.
1191		1422
1192	While stopped (and not pending) the watcher is essentially in the	1423	While stopped (and not pending) the watcher is essentially in the
1193	initialised state, that is it can be reused, moved, modified in any way	1424	initialised state, that is, it can be reused, moved, modified in any way
1194	you wish.	1425	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1426	it again).
1195		1427
1196	=back	1428	=back
1197
1198	=head2 GENERIC WATCHER FUNCTIONS
1199
1200	=over 4
1201
1202	=item C<ev_init> (ev_TYPE *watcher, callback)
1203
1204	This macro initialises the generic portion of a watcher. The contents
1205	of the watcher object can be arbitrary (so C<malloc> will do). Only
1206	the generic parts of the watcher are initialised, you I<need> to call
1207	the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1208	type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1209	which rolls both calls into one.
1210
1211	You can reinitialise a watcher at any time as long as it has been stopped
1212	(or never started) and there are no pending events outstanding.
1213
1214	The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1215	int revents)>.
1216
1217	Example: Initialise an C<ev_io> watcher in two steps.
1218
1219	ev_io w;
1220	ev_init (&w, my_cb);
1221	ev_io_set (&w, STDIN_FILENO, EV_READ);
1222
1223	=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1224
1225	This macro initialises the type-specific parts of a watcher. You need to
1226	call C<ev_init> at least once before you call this macro, but you can
1227	call C<ev_TYPE_set> any number of times. You must not, however, call this
1228	macro on a watcher that is active (it can be pending, however, which is a
1229	difference to the C<ev_init> macro).
1230
1231	Although some watcher types do not have type-specific arguments
1232	(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1233
1234	See C<ev_init>, above, for an example.
1235
1236	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1237
1238	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1239	calls into a single call. This is the most convenient method to initialise
1240	a watcher. The same limitations apply, of course.
1241
1242	Example: Initialise and set an C<ev_io> watcher in one step.
1243
1244	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1245
1246	=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1247
1248	Starts (activates) the given watcher. Only active watchers will receive
1249	events. If the watcher is already active nothing will happen.
1250
1251	Example: Start the C<ev_io> watcher that is being abused as example in this
1252	whole section.
1253
1254	ev_io_start (EV_DEFAULT_UC, &w);
1255
1256	=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1257
1258	Stops the given watcher if active, and clears the pending status (whether
1259	the watcher was active or not).
1260
1261	It is possible that stopped watchers are pending - for example,
1262	non-repeating timers are being stopped when they become pending - but
1263	calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1264	pending. If you want to free or reuse the memory used by the watcher it is
1265	therefore a good idea to always call its C<ev_TYPE_stop> function.
1266
1267	=item bool ev_is_active (ev_TYPE *watcher)
1268
1269	Returns a true value iff the watcher is active (i.e. it has been started
1270	and not yet been stopped). As long as a watcher is active you must not modify
1271	it.
1272
1273	=item bool ev_is_pending (ev_TYPE *watcher)
1274
1275	Returns a true value iff the watcher is pending, (i.e. it has outstanding
1276	events but its callback has not yet been invoked). As long as a watcher
1277	is pending (but not active) you must not call an init function on it (but
1278	C<ev_TYPE_set> is safe), you must not change its priority, and you must
1279	make sure the watcher is available to libev (e.g. you cannot C<free ()>
1280	it).
1281
1282	=item callback ev_cb (ev_TYPE *watcher)
1283
1284	Returns the callback currently set on the watcher.
1285
1286	=item ev_cb_set (ev_TYPE *watcher, callback)
1287
1288	Change the callback. You can change the callback at virtually any time
1289	(modulo threads).
1290
1291	=item ev_set_priority (ev_TYPE *watcher, int priority)
1292
1293	=item int ev_priority (ev_TYPE *watcher)
1294
1295	Set and query the priority of the watcher. The priority is a small
1296	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1297	(default: C<-2>). Pending watchers with higher priority will be invoked
1298	before watchers with lower priority, but priority will not keep watchers
1299	from being executed (except for C<ev_idle> watchers).
1300
1301	If you need to suppress invocation when higher priority events are pending
1302	you need to look at C<ev_idle> watchers, which provide this functionality.
1303
1304	You I<must not> change the priority of a watcher as long as it is active or
1305	pending.
1306
1307	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1308	fine, as long as you do not mind that the priority value you query might
1309	or might not have been clamped to the valid range.
1310
1311	The default priority used by watchers when no priority has been set is
1312	always C<0>, which is supposed to not be too high and not be too low :).
1313
1314	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1315	priorities.
1316
1317	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1318
1319	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1320	C<loop> nor C<revents> need to be valid as long as the watcher callback
1321	can deal with that fact, as both are simply passed through to the
1322	callback.
1323
1324	=item int ev_clear_pending (loop, ev_TYPE *watcher)
1325
1326	If the watcher is pending, this function clears its pending status and
1327	returns its C<revents> bitset (as if its callback was invoked). If the
1328	watcher isn't pending it does nothing and returns C<0>.
1329
1330	Sometimes it can be useful to "poll" a watcher instead of waiting for its
1331	callback to be invoked, which can be accomplished with this function.
1332
1333	=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1334
1335	Feeds the given event set into the event loop, as if the specified event
1336	had happened for the specified watcher (which must be a pointer to an
1337	initialised but not necessarily started event watcher). Obviously you must
1338	not free the watcher as long as it has pending events.
1339
1340	Stopping the watcher, letting libev invoke it, or calling
1341	C<ev_clear_pending> will clear the pending event, even if the watcher was
1342	not started in the first place.
1343
1344	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1345	functions that do not need a watcher.
1346
1347	=back
1348
1349
1350	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1351
1352	Each watcher has, by default, a member C<void *data> that you can change
1353	and read at any time: libev will completely ignore it. This can be used
1354	to associate arbitrary data with your watcher. If you need more data and
1355	don't want to allocate memory and store a pointer to it in that data
1356	member, you can also "subclass" the watcher type and provide your own
1357	data:
1358
1359	struct my_io
1360	{
1361	ev_io io;
1362	int otherfd;
1363	void *somedata;
1364	struct whatever *mostinteresting;
1365	};
1366
1367	...
1368	struct my_io w;
1369	ev_io_init (&w.io, my_cb, fd, EV_READ);
1370
1371	And since your callback will be called with a pointer to the watcher, you
1372	can cast it back to your own type:
1373
1374	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1375	{
1376	struct my_io *w = (struct my_io *)w_;
1377	...
1378	}
1379
1380	More interesting and less C-conformant ways of casting your callback type
1381	instead have been omitted.
1382
1383	Another common scenario is to use some data structure with multiple
1384	embedded watchers:
1385
1386	struct my_biggy
1387	{
1388	int some_data;
1389	ev_timer t1;
1390	ev_timer t2;
1391	}
1392
1393	In this case getting the pointer to C<my_biggy> is a bit more
1394	complicated: Either you store the address of your C<my_biggy> struct
1395	in the C<data> member of the watcher (for woozies), or you need to use
1396	some pointer arithmetic using C<offsetof> inside your watchers (for real
1397	programmers):
1398
1399	#include <stddef.h>
1400
1401	static void
1402	t1_cb (EV_P_ ev_timer *w, int revents)
1403	{
1404	struct my_biggy big = (struct my_biggy *)
1405	(((char *)w) - offsetof (struct my_biggy, t1));
1406	}
1407
1408	static void
1409	t2_cb (EV_P_ ev_timer *w, int revents)
1410	{
1411	struct my_biggy big = (struct my_biggy *)
1412	(((char *)w) - offsetof (struct my_biggy, t2));
1413	}
1414		1429
1415	=head2 WATCHER PRIORITY MODELS	1430	=head2 WATCHER PRIORITY MODELS
1416		1431
1417	Many event loops support I<watcher priorities>, which are usually small	1432	Many event loops support I<watcher priorities>, which are usually small
1418	integers that influence the ordering of event callback invocation	1433	integers that influence the ordering of event callback invocation
…		…
1545	In general you can register as many read and/or write event watchers per	1560	In general you can register as many read and/or write event watchers per
1546	fd as you want (as long as you don't confuse yourself). Setting all file	1561	fd as you want (as long as you don't confuse yourself). Setting all file
1547	descriptors to non-blocking mode is also usually a good idea (but not	1562	descriptors to non-blocking mode is also usually a good idea (but not
1548	required if you know what you are doing).	1563	required if you know what you are doing).
1549		1564
1550	If you cannot use non-blocking mode, then force the use of a
1551	known-to-be-good backend (at the time of this writing, this includes only
1552	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1553	descriptors for which non-blocking operation makes no sense (such as
1554	files) - libev doesn't guarantee any specific behaviour in that case.
1555
1556	Another thing you have to watch out for is that it is quite easy to	1565	Another thing you have to watch out for is that it is quite easy to
1557	receive "spurious" readiness notifications, that is your callback might	1566	receive "spurious" readiness notifications, that is, your callback might
1558	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1567	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1559	because there is no data. Not only are some backends known to create a	1568	because there is no data. It is very easy to get into this situation even
1560	lot of those (for example Solaris ports), it is very easy to get into	1569	with a relatively standard program structure. Thus it is best to always
1561	this situation even with a relatively standard program structure. Thus	1570	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1562	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1563	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1571	preferable to a program hanging until some data arrives.
1564		1572
1565	If you cannot run the fd in non-blocking mode (for example you should	1573	If you cannot run the fd in non-blocking mode (for example you should
1566	not play around with an Xlib connection), then you have to separately	1574	not play around with an Xlib connection), then you have to separately
1567	re-test whether a file descriptor is really ready with a known-to-be good	1575	re-test whether a file descriptor is really ready with a known-to-be good
1568	interface such as poll (fortunately in our Xlib example, Xlib already	1576	interface such as poll (fortunately in the case of Xlib, it already does
1569	does this on its own, so its quite safe to use). Some people additionally	1577	this on its own, so its quite safe to use). Some people additionally
1570	use C<SIGALRM> and an interval timer, just to be sure you won't block	1578	use C<SIGALRM> and an interval timer, just to be sure you won't block
1571	indefinitely.	1579	indefinitely.
1572		1580
1573	But really, best use non-blocking mode.	1581	But really, best use non-blocking mode.
1574		1582
…		…
1602		1610
1603	There is no workaround possible except not registering events	1611	There is no workaround possible except not registering events
1604	for potentially C<dup ()>'ed file descriptors, or to resort to	1612	for potentially C<dup ()>'ed file descriptors, or to resort to
1605	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1613	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1606		1614
		1615	=head3 The special problem of files
		1616
		1617	Many people try to use C<select> (or libev) on file descriptors
		1618	representing files, and expect it to become ready when their program
		1619	doesn't block on disk accesses (which can take a long time on their own).
		1620
		1621	However, this cannot ever work in the "expected" way - you get a readiness
		1622	notification as soon as the kernel knows whether and how much data is
		1623	there, and in the case of open files, that's always the case, so you
		1624	always get a readiness notification instantly, and your read (or possibly
		1625	write) will still block on the disk I/O.
		1626
		1627	Another way to view it is that in the case of sockets, pipes, character
		1628	devices and so on, there is another party (the sender) that delivers data
		1629	on its own, but in the case of files, there is no such thing: the disk
		1630	will not send data on its own, simply because it doesn't know what you
		1631	wish to read - you would first have to request some data.
		1632
		1633	Since files are typically not-so-well supported by advanced notification
		1634	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1635	to files, even though you should not use it. The reason for this is
		1636	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1637	usually a tty, often a pipe, but also sometimes files or special devices
		1638	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1639	F</dev/urandom>), and even though the file might better be served with
		1640	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1641	it "just works" instead of freezing.
		1642
		1643	So avoid file descriptors pointing to files when you know it (e.g. use
		1644	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1645	when you rarely read from a file instead of from a socket, and want to
		1646	reuse the same code path.
		1647
1607	=head3 The special problem of fork	1648	=head3 The special problem of fork
1608		1649
1609	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1650	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1610	useless behaviour. Libev fully supports fork, but needs to be told about	1651	useless behaviour. Libev fully supports fork, but needs to be told about
1611	it in the child.	1652	it in the child if you want to continue to use it in the child.
1612		1653
1613	To support fork in your programs, you either have to call	1654	To support fork in your child processes, you have to call C<ev_loop_fork
1614	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1655	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1615	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1656	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1616	C<EVBACKEND_POLL>.
1617		1657
1618	=head3 The special problem of SIGPIPE	1658	=head3 The special problem of SIGPIPE
1619		1659
1620	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1660	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1621	when writing to a pipe whose other end has been closed, your program gets	1661	when writing to a pipe whose other end has been closed, your program gets
…		…
2111		2151
2112	Another way to think about it (for the mathematically inclined) is that	2152	Another way to think about it (for the mathematically inclined) is that
2113	C<ev_periodic> will try to run the callback in this mode at the next possible	2153	C<ev_periodic> will try to run the callback in this mode at the next possible
2114	time where C<time = offset (mod interval)>, regardless of any time jumps.	2154	time where C<time = offset (mod interval)>, regardless of any time jumps.
2115		2155
2116	For numerical stability it is preferable that the C<offset> value is near	2156	The C<interval> I<MUST> be positive, and for numerical stability, the
2117	C<ev_now ()> (the current time), but there is no range requirement for	2157	interval value should be higher than C<1/8192> (which is around 100
2118	this value, and in fact is often specified as zero.	2158	microseconds) and C<offset> should be higher than C<0> and should have
		2159	at most a similar magnitude as the current time (say, within a factor of
		2160	ten). Typical values for offset are, in fact, C<0> or something between
		2161	C<0> and C<interval>, which is also the recommended range.
2119		2162
2120	Note also that there is an upper limit to how often a timer can fire (CPU	2163	Note also that there is an upper limit to how often a timer can fire (CPU
2121	speed for example), so if C<interval> is very small then timing stability	2164	speed for example), so if C<interval> is very small then timing stability
2122	will of course deteriorate. Libev itself tries to be exact to be about one	2165	will of course deteriorate. Libev itself tries to be exact to be about one
2123	millisecond (if the OS supports it and the machine is fast enough).	2166	millisecond (if the OS supports it and the machine is fast enough).
…		…
2237		2280
2238	=head2 C<ev_signal> - signal me when a signal gets signalled!	2281	=head2 C<ev_signal> - signal me when a signal gets signalled!
2239		2282
2240	Signal watchers will trigger an event when the process receives a specific	2283	Signal watchers will trigger an event when the process receives a specific
2241	signal one or more times. Even though signals are very asynchronous, libev	2284	signal one or more times. Even though signals are very asynchronous, libev
2242	will try it's best to deliver signals synchronously, i.e. as part of the	2285	will try its best to deliver signals synchronously, i.e. as part of the
2243	normal event processing, like any other event.	2286	normal event processing, like any other event.
2244		2287
2245	If you want signals to be delivered truly asynchronously, just use	2288	If you want signals to be delivered truly asynchronously, just use
2246	C<sigaction> as you would do without libev and forget about sharing	2289	C<sigaction> as you would do without libev and forget about sharing
2247	the signal. You can even use C<ev_async> from a signal handler to	2290	the signal. You can even use C<ev_async> from a signal handler to
…		…
2266	=head3 The special problem of inheritance over fork/execve/pthread_create	2309	=head3 The special problem of inheritance over fork/execve/pthread_create
2267		2310
2268	Both the signal mask (C<sigprocmask>) and the signal disposition	2311	Both the signal mask (C<sigprocmask>) and the signal disposition
2269	(C<sigaction>) are unspecified after starting a signal watcher (and after	2312	(C<sigaction>) are unspecified after starting a signal watcher (and after
2270	stopping it again), that is, libev might or might not block the signal,	2313	stopping it again), that is, libev might or might not block the signal,
2271	and might or might not set or restore the installed signal handler.	2314	and might or might not set or restore the installed signal handler (but
		2315	see C<EVFLAG_NOSIGMASK>).
2272		2316
2273	While this does not matter for the signal disposition (libev never	2317	While this does not matter for the signal disposition (libev never
2274	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2318	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2275	C<execve>), this matters for the signal mask: many programs do not expect	2319	C<execve>), this matters for the signal mask: many programs do not expect
2276	certain signals to be blocked.	2320	certain signals to be blocked.
…		…
2289	I<has> to modify the signal mask, at least temporarily.	2333	I<has> to modify the signal mask, at least temporarily.
2290		2334
2291	So I can't stress this enough: I<If you do not reset your signal mask when	2335	So I can't stress this enough: I<If you do not reset your signal mask when
2292	you expect it to be empty, you have a race condition in your code>. This	2336	you expect it to be empty, you have a race condition in your code>. This
2293	is not a libev-specific thing, this is true for most event libraries.	2337	is not a libev-specific thing, this is true for most event libraries.
		2338
		2339	=head3 The special problem of threads signal handling
		2340
		2341	POSIX threads has problematic signal handling semantics, specifically,
		2342	a lot of functionality (sigfd, sigwait etc.) only really works if all
		2343	threads in a process block signals, which is hard to achieve.
		2344
		2345	When you want to use sigwait (or mix libev signal handling with your own
		2346	for the same signals), you can tackle this problem by globally blocking
		2347	all signals before creating any threads (or creating them with a fully set
		2348	sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
		2349	loops. Then designate one thread as "signal receiver thread" which handles
		2350	these signals. You can pass on any signals that libev might be interested
		2351	in by calling C<ev_feed_signal>.
2294		2352
2295	=head3 Watcher-Specific Functions and Data Members	2353	=head3 Watcher-Specific Functions and Data Members
2296		2354
2297	=over 4	2355	=over 4
2298		2356
…		…
3072	disadvantage of having to use multiple event loops (which do not support	3130	disadvantage of having to use multiple event loops (which do not support
3073	signal watchers).	3131	signal watchers).
3074		3132
3075	When this is not possible, or you want to use the default loop for	3133	When this is not possible, or you want to use the default loop for
3076	other reasons, then in the process that wants to start "fresh", call	3134	other reasons, then in the process that wants to start "fresh", call
3077	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying	3135	C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
3078	the default loop will "orphan" (not stop) all registered watchers, so you	3136	Destroying the default loop will "orphan" (not stop) all registered
3079	have to be careful not to execute code that modifies those watchers. Note	3137	watchers, so you have to be careful not to execute code that modifies
3080	also that in that case, you have to re-register any signal watchers.	3138	those watchers. Note also that in that case, you have to re-register any
		3139	signal watchers.
3081		3140
3082	=head3 Watcher-Specific Functions and Data Members	3141	=head3 Watcher-Specific Functions and Data Members
3083		3142
3084	=over 4	3143	=over 4
3085		3144
3086	=item ev_fork_init (ev_signal *, callback)	3145	=item ev_fork_init (ev_fork *, callback)
3087		3146
3088	Initialises and configures the fork watcher - it has no parameters of any	3147	Initialises and configures the fork watcher - it has no parameters of any
3089	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,	3148	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3090	believe me.	3149	really.
3091		3150
3092	=back	3151	=back
3093		3152
3094		3153
		3154	=head2 C<ev_cleanup> - even the best things end
		3155
		3156	Cleanup watchers are called just before the event loop is being destroyed
		3157	by a call to C<ev_loop_destroy>.
		3158
		3159	While there is no guarantee that the event loop gets destroyed, cleanup
		3160	watchers provide a convenient method to install cleanup hooks for your
		3161	program, worker threads and so on - you just to make sure to destroy the
		3162	loop when you want them to be invoked.
		3163
		3164	Cleanup watchers are invoked in the same way as any other watcher. Unlike
		3165	all other watchers, they do not keep a reference to the event loop (which
		3166	makes a lot of sense if you think about it). Like all other watchers, you
		3167	can call libev functions in the callback, except C<ev_cleanup_start>.
		3168
		3169	=head3 Watcher-Specific Functions and Data Members
		3170
		3171	=over 4
		3172
		3173	=item ev_cleanup_init (ev_cleanup *, callback)
		3174
		3175	Initialises and configures the cleanup watcher - it has no parameters of
		3176	any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
		3177	pointless, I assure you.
		3178
		3179	=back
		3180
		3181	Example: Register an atexit handler to destroy the default loop, so any
		3182	cleanup functions are called.
		3183
		3184	static void
		3185	program_exits (void)
		3186	{
		3187	ev_loop_destroy (EV_DEFAULT_UC);
		3188	}
		3189
		3190	...
		3191	atexit (program_exits);
		3192
		3193
3095	=head2 C<ev_async> - how to wake up an event loop	3194	=head2 C<ev_async> - how to wake up an event loop
3096		3195
3097	In general, you cannot use an C<ev_run> from multiple threads or other	3196	In general, you cannot use an C<ev_loop> from multiple threads or other
3098	asynchronous sources such as signal handlers (as opposed to multiple event	3197	asynchronous sources such as signal handlers (as opposed to multiple event
3099	loops - those are of course safe to use in different threads).	3198	loops - those are of course safe to use in different threads).
3100		3199
3101	Sometimes, however, you need to wake up an event loop you do not control,	3200	Sometimes, however, you need to wake up an event loop you do not control,
3102	for example because it belongs to another thread. This is what C<ev_async>	3201	for example because it belongs to another thread. This is what C<ev_async>
…		…
3104	it by calling C<ev_async_send>, which is thread- and signal safe.	3203	it by calling C<ev_async_send>, which is thread- and signal safe.
3105		3204
3106	This functionality is very similar to C<ev_signal> watchers, as signals,	3205	This functionality is very similar to C<ev_signal> watchers, as signals,
3107	too, are asynchronous in nature, and signals, too, will be compressed	3206	too, are asynchronous in nature, and signals, too, will be compressed
3108	(i.e. the number of callback invocations may be less than the number of	3207	(i.e. the number of callback invocations may be less than the number of
3109	C<ev_async_sent> calls).	3208	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
		3209	of "global async watchers" by using a watcher on an otherwise unused
		3210	signal, and C<ev_feed_signal> to signal this watcher from another thread,
		3211	even without knowing which loop owns the signal.
3110		3212
3111	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not	3213	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3112	just the default loop.	3214	just the default loop.
3113		3215
3114	=head3 Queueing	3216	=head3 Queueing
…		…
3209	trust me.	3311	trust me.
3210		3312
3211	=item ev_async_send (loop, ev_async *)	3313	=item ev_async_send (loop, ev_async *)
3212		3314
3213	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3315	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3214	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3316	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3317	returns.
		3318
3215	C<ev_feed_event>, this call is safe to do from other threads, signal or	3319	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3216	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3320	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3217	section below on what exactly this means).	3321	embedding section below on what exactly this means).
3218		3322
3219	Note that, as with other watchers in libev, multiple events might get	3323	Note that, as with other watchers in libev, multiple events might get
3220	compressed into a single callback invocation (another way to look at this	3324	compressed into a single callback invocation (another way to look at this
3221	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3325	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
3222	reset when the event loop detects that).	3326	reset when the event loop detects that).
…		…
3290	Feed an event on the given fd, as if a file descriptor backend detected	3394	Feed an event on the given fd, as if a file descriptor backend detected
3291	the given events it.	3395	the given events it.
3292		3396
3293	=item ev_feed_signal_event (loop, int signum)	3397	=item ev_feed_signal_event (loop, int signum)
3294		3398
3295	Feed an event as if the given signal occurred (C<loop> must be the default	3399	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3296	loop!).	3400	which is async-safe.
3297		3401
3298	=back	3402	=back
		3403
		3404
		3405	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
		3406
		3407	This section explains some common idioms that are not immediately
		3408	obvious. Note that examples are sprinkled over the whole manual, and this
		3409	section only contains stuff that wouldn't fit anywhere else.
		3410
		3411	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3412
		3413	Each watcher has, by default, a C<void *data> member that you can read
		3414	or modify at any time: libev will completely ignore it. This can be used
		3415	to associate arbitrary data with your watcher. If you need more data and
		3416	don't want to allocate memory separately and store a pointer to it in that
		3417	data member, you can also "subclass" the watcher type and provide your own
		3418	data:
		3419
		3420	struct my_io
		3421	{
		3422	ev_io io;
		3423	int otherfd;
		3424	void *somedata;
		3425	struct whatever *mostinteresting;
		3426	};
		3427
		3428	...
		3429	struct my_io w;
		3430	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3431
		3432	And since your callback will be called with a pointer to the watcher, you
		3433	can cast it back to your own type:
		3434
		3435	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
		3436	{
		3437	struct my_io *w = (struct my_io *)w_;
		3438	...
		3439	}
		3440
		3441	More interesting and less C-conformant ways of casting your callback
		3442	function type instead have been omitted.
		3443
		3444	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3445
		3446	Another common scenario is to use some data structure with multiple
		3447	embedded watchers, in effect creating your own watcher that combines
		3448	multiple libev event sources into one "super-watcher":
		3449
		3450	struct my_biggy
		3451	{
		3452	int some_data;
		3453	ev_timer t1;
		3454	ev_timer t2;
		3455	}
		3456
		3457	In this case getting the pointer to C<my_biggy> is a bit more
		3458	complicated: Either you store the address of your C<my_biggy> struct in
		3459	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3460	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3461	real programmers):
		3462
		3463	#include <stddef.h>
		3464
		3465	static void
		3466	t1_cb (EV_P_ ev_timer *w, int revents)
		3467	{
		3468	struct my_biggy big = (struct my_biggy *)
		3469	(((char *)w) - offsetof (struct my_biggy, t1));
		3470	}
		3471
		3472	static void
		3473	t2_cb (EV_P_ ev_timer *w, int revents)
		3474	{
		3475	struct my_biggy big = (struct my_biggy *)
		3476	(((char *)w) - offsetof (struct my_biggy, t2));
		3477	}
		3478
		3479	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
		3480
		3481	Often (especially in GUI toolkits) there are places where you have
		3482	I<modal> interaction, which is most easily implemented by recursively
		3483	invoking C<ev_run>.
		3484
		3485	This brings the problem of exiting - a callback might want to finish the
		3486	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
		3487	a modal "Are you sure?" dialog is still waiting), or just the nested one
		3488	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
		3489	other combination: In these cases, C<ev_break> will not work alone.
		3490
		3491	The solution is to maintain "break this loop" variable for each C<ev_run>
		3492	invocation, and use a loop around C<ev_run> until the condition is
		3493	triggered, using C<EVRUN_ONCE>:
		3494
		3495	// main loop
		3496	int exit_main_loop = 0;
		3497
		3498	while (!exit_main_loop)
		3499	ev_run (EV_DEFAULT_ EVRUN_ONCE);
		3500
		3501	// in a model watcher
		3502	int exit_nested_loop = 0;
		3503
		3504	while (!exit_nested_loop)
		3505	ev_run (EV_A_ EVRUN_ONCE);
		3506
		3507	To exit from any of these loops, just set the corresponding exit variable:
		3508
		3509	// exit modal loop
		3510	exit_nested_loop = 1;
		3511
		3512	// exit main program, after modal loop is finished
		3513	exit_main_loop = 1;
		3514
		3515	// exit both
		3516	exit_main_loop = exit_nested_loop = 1;
		3517
		3518	=head2 THREAD LOCKING EXAMPLE
		3519
		3520	Here is a fictitious example of how to run an event loop in a different
		3521	thread from where callbacks are being invoked and watchers are
		3522	created/added/removed.
		3523
		3524	For a real-world example, see the C<EV::Loop::Async> perl module,
		3525	which uses exactly this technique (which is suited for many high-level
		3526	languages).
		3527
		3528	The example uses a pthread mutex to protect the loop data, a condition
		3529	variable to wait for callback invocations, an async watcher to notify the
		3530	event loop thread and an unspecified mechanism to wake up the main thread.
		3531
		3532	First, you need to associate some data with the event loop:
		3533
		3534	typedef struct {
		3535	mutex_t lock; /* global loop lock */
		3536	ev_async async_w;
		3537	thread_t tid;
		3538	cond_t invoke_cv;
		3539	} userdata;
		3540
		3541	void prepare_loop (EV_P)
		3542	{
		3543	// for simplicity, we use a static userdata struct.
		3544	static userdata u;
		3545
		3546	ev_async_init (&u->async_w, async_cb);
		3547	ev_async_start (EV_A_ &u->async_w);
		3548
		3549	pthread_mutex_init (&u->lock, 0);
		3550	pthread_cond_init (&u->invoke_cv, 0);
		3551
		3552	// now associate this with the loop
		3553	ev_set_userdata (EV_A_ u);
		3554	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3555	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3556
		3557	// then create the thread running ev_run
		3558	pthread_create (&u->tid, 0, l_run, EV_A);
		3559	}
		3560
		3561	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3562	solely to wake up the event loop so it takes notice of any new watchers
		3563	that might have been added:
		3564
		3565	static void
		3566	async_cb (EV_P_ ev_async *w, int revents)
		3567	{
		3568	// just used for the side effects
		3569	}
		3570
		3571	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3572	protecting the loop data, respectively.
		3573
		3574	static void
		3575	l_release (EV_P)
		3576	{
		3577	userdata *u = ev_userdata (EV_A);
		3578	pthread_mutex_unlock (&u->lock);
		3579	}
		3580
		3581	static void
		3582	l_acquire (EV_P)
		3583	{
		3584	userdata *u = ev_userdata (EV_A);
		3585	pthread_mutex_lock (&u->lock);
		3586	}
		3587
		3588	The event loop thread first acquires the mutex, and then jumps straight
		3589	into C<ev_run>:
		3590
		3591	void *
		3592	l_run (void *thr_arg)
		3593	{
		3594	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		3595
		3596	l_acquire (EV_A);
		3597	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3598	ev_run (EV_A_ 0);
		3599	l_release (EV_A);
		3600
		3601	return 0;
		3602	}
		3603
		3604	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3605	signal the main thread via some unspecified mechanism (signals? pipe
		3606	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3607	have been called (in a while loop because a) spurious wakeups are possible
		3608	and b) skipping inter-thread-communication when there are no pending
		3609	watchers is very beneficial):
		3610
		3611	static void
		3612	l_invoke (EV_P)
		3613	{
		3614	userdata *u = ev_userdata (EV_A);
		3615
		3616	while (ev_pending_count (EV_A))
		3617	{
		3618	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3619	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3620	}
		3621	}
		3622
		3623	Now, whenever the main thread gets told to invoke pending watchers, it
		3624	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3625	thread to continue:
		3626
		3627	static void
		3628	real_invoke_pending (EV_P)
		3629	{
		3630	userdata *u = ev_userdata (EV_A);
		3631
		3632	pthread_mutex_lock (&u->lock);
		3633	ev_invoke_pending (EV_A);
		3634	pthread_cond_signal (&u->invoke_cv);
		3635	pthread_mutex_unlock (&u->lock);
		3636	}
		3637
		3638	Whenever you want to start/stop a watcher or do other modifications to an
		3639	event loop, you will now have to lock:
		3640
		3641	ev_timer timeout_watcher;
		3642	userdata *u = ev_userdata (EV_A);
		3643
		3644	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3645
		3646	pthread_mutex_lock (&u->lock);
		3647	ev_timer_start (EV_A_ &timeout_watcher);
		3648	ev_async_send (EV_A_ &u->async_w);
		3649	pthread_mutex_unlock (&u->lock);
		3650
		3651	Note that sending the C<ev_async> watcher is required because otherwise
		3652	an event loop currently blocking in the kernel will have no knowledge
		3653	about the newly added timer. By waking up the loop it will pick up any new
		3654	watchers in the next event loop iteration.
		3655
		3656	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3657
		3658	While the overhead of a callback that e.g. schedules a thread is small, it
		3659	is still an overhead. If you embed libev, and your main usage is with some
		3660	kind of threads or coroutines, you might want to customise libev so that
		3661	doesn't need callbacks anymore.
		3662
		3663	Imagine you have coroutines that you can switch to using a function
		3664	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3665	and that due to some magic, the currently active coroutine is stored in a
		3666	global called C<current_coro>. Then you can build your own "wait for libev
		3667	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3668	the differing C<;> conventions):
		3669
		3670	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3671	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3672
		3673	That means instead of having a C callback function, you store the
		3674	coroutine to switch to in each watcher, and instead of having libev call
		3675	your callback, you instead have it switch to that coroutine.
		3676
		3677	A coroutine might now wait for an event with a function called
		3678	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3679	matter when, or whether the watcher is active or not when this function is
		3680	called):
		3681
		3682	void
		3683	wait_for_event (ev_watcher *w)
		3684	{
		3685	ev_cb_set (w) = current_coro;
		3686	switch_to (libev_coro);
		3687	}
		3688
		3689	That basically suspends the coroutine inside C<wait_for_event> and
		3690	continues the libev coroutine, which, when appropriate, switches back to
		3691	this or any other coroutine. I am sure if you sue this your own :)
		3692
		3693	You can do similar tricks if you have, say, threads with an event queue -
		3694	instead of storing a coroutine, you store the queue object and instead of
		3695	switching to a coroutine, you push the watcher onto the queue and notify
		3696	any waiters.
		3697
		3698	To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
		3699	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3700
		3701	// my_ev.h
		3702	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3703	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
		3704	#include "../libev/ev.h"
		3705
		3706	// my_ev.c
		3707	#define EV_H "my_ev.h"
		3708	#include "../libev/ev.c"
		3709
		3710	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3711	F<my_ev.c> into your project. When properly specifying include paths, you
		3712	can even use F<ev.h> as header file name directly.
3299		3713
3300		3714
3301	=head1 LIBEVENT EMULATION	3715	=head1 LIBEVENT EMULATION
3302		3716
3303	Libev offers a compatibility emulation layer for libevent. It cannot	3717	Libev offers a compatibility emulation layer for libevent. It cannot
3304	emulate the internals of libevent, so here are some usage hints:	3718	emulate the internals of libevent, so here are some usage hints:
3305		3719
3306	=over 4	3720	=over 4
		3721
		3722	=item * Only the libevent-1.4.1-beta API is being emulated.
		3723
		3724	This was the newest libevent version available when libev was implemented,
		3725	and is still mostly unchanged in 2010.
3307		3726
3308	=item * Use it by including <event.h>, as usual.	3727	=item * Use it by including <event.h>, as usual.
3309		3728
3310	=item * The following members are fully supported: ev_base, ev_callback,	3729	=item * The following members are fully supported: ev_base, ev_callback,
3311	ev_arg, ev_fd, ev_res, ev_events.	3730	ev_arg, ev_fd, ev_res, ev_events.
…		…
3317	=item * Priorities are not currently supported. Initialising priorities	3736	=item * Priorities are not currently supported. Initialising priorities
3318	will fail and all watchers will have the same priority, even though there	3737	will fail and all watchers will have the same priority, even though there
3319	is an ev_pri field.	3738	is an ev_pri field.
3320		3739
3321	=item * In libevent, the last base created gets the signals, in libev, the	3740	=item * In libevent, the last base created gets the signals, in libev, the
3322	first base created (== the default loop) gets the signals.	3741	base that registered the signal gets the signals.
3323		3742
3324	=item * Other members are not supported.	3743	=item * Other members are not supported.
3325		3744
3326	=item * The libev emulation is I<not> ABI compatible to libevent, you need	3745	=item * The libev emulation is I<not> ABI compatible to libevent, you need
3327	to use the libev header file and library.	3746	to use the libev header file and library.
…		…
3346	Care has been taken to keep the overhead low. The only data member the C++	3765	Care has been taken to keep the overhead low. The only data member the C++
3347	classes add (compared to plain C-style watchers) is the event loop pointer	3766	classes add (compared to plain C-style watchers) is the event loop pointer
3348	that the watcher is associated with (or no additional members at all if	3767	that the watcher is associated with (or no additional members at all if
3349	you disable C<EV_MULTIPLICITY> when embedding libev).	3768	you disable C<EV_MULTIPLICITY> when embedding libev).
3350		3769
3351	Currently, functions, and static and non-static member functions can be	3770	Currently, functions, static and non-static member functions and classes
3352	used as callbacks. Other types should be easy to add as long as they only	3771	with C<operator ()> can be used as callbacks. Other types should be easy
3353	need one additional pointer for context. If you need support for other	3772	to add as long as they only need one additional pointer for context. If
3354	types of functors please contact the author (preferably after implementing	3773	you need support for other types of functors please contact the author
3355	it).	3774	(preferably after implementing it).
3356		3775
3357	Here is a list of things available in the C<ev> namespace:	3776	Here is a list of things available in the C<ev> namespace:
3358		3777
3359	=over 4	3778	=over 4
3360		3779
…		…
3788	F<event.h> that are not directly supported by the libev core alone.	4207	F<event.h> that are not directly supported by the libev core alone.
3789		4208
3790	In standalone mode, libev will still try to automatically deduce the	4209	In standalone mode, libev will still try to automatically deduce the
3791	configuration, but has to be more conservative.	4210	configuration, but has to be more conservative.
3792		4211
		4212	=item EV_USE_FLOOR
		4213
		4214	If defined to be C<1>, libev will use the C<floor ()> function for its
		4215	periodic reschedule calculations, otherwise libev will fall back on a
		4216	portable (slower) implementation. If you enable this, you usually have to
		4217	link against libm or something equivalent. Enabling this when the C<floor>
		4218	function is not available will fail, so the safe default is to not enable
		4219	this.
		4220
3793	=item EV_USE_MONOTONIC	4221	=item EV_USE_MONOTONIC
3794		4222
3795	If defined to be C<1>, libev will try to detect the availability of the	4223	If defined to be C<1>, libev will try to detect the availability of the
3796	monotonic clock option at both compile time and runtime. Otherwise no	4224	monotonic clock option at both compile time and runtime. Otherwise no
3797	use of the monotonic clock option will be attempted. If you enable this,	4225	use of the monotonic clock option will be attempted. If you enable this,
…		…
4228	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4656	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4229		4657
4230	#include "ev_cpp.h"	4658	#include "ev_cpp.h"
4231	#include "ev.c"	4659	#include "ev.c"
4232		4660
4233	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4661	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4234		4662
4235	=head2 THREADS AND COROUTINES	4663	=head2 THREADS AND COROUTINES
4236		4664
4237	=head3 THREADS	4665	=head3 THREADS
4238		4666
…		…
4289	default loop and triggering an C<ev_async> watcher from the default loop	4717	default loop and triggering an C<ev_async> watcher from the default loop
4290	watcher callback into the event loop interested in the signal.	4718	watcher callback into the event loop interested in the signal.
4291		4719
4292	=back	4720	=back
4293		4721
4294	=head4 THREAD LOCKING EXAMPLE	4722	See also L<THREAD LOCKING EXAMPLE>.
4295
4296	Here is a fictitious example of how to run an event loop in a different
4297	thread than where callbacks are being invoked and watchers are
4298	created/added/removed.
4299
4300	For a real-world example, see the C<EV::Loop::Async> perl module,
4301	which uses exactly this technique (which is suited for many high-level
4302	languages).
4303
4304	The example uses a pthread mutex to protect the loop data, a condition
4305	variable to wait for callback invocations, an async watcher to notify the
4306	event loop thread and an unspecified mechanism to wake up the main thread.
4307
4308	First, you need to associate some data with the event loop:
4309
4310	typedef struct {
4311	mutex_t lock; /* global loop lock */
4312	ev_async async_w;
4313	thread_t tid;
4314	cond_t invoke_cv;
4315	} userdata;
4316
4317	void prepare_loop (EV_P)
4318	{
4319	// for simplicity, we use a static userdata struct.
4320	static userdata u;
4321
4322	ev_async_init (&u->async_w, async_cb);
4323	ev_async_start (EV_A_ &u->async_w);
4324
4325	pthread_mutex_init (&u->lock, 0);
4326	pthread_cond_init (&u->invoke_cv, 0);
4327
4328	// now associate this with the loop
4329	ev_set_userdata (EV_A_ u);
4330	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4331	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4332
4333	// then create the thread running ev_loop
4334	pthread_create (&u->tid, 0, l_run, EV_A);
4335	}
4336
4337	The callback for the C<ev_async> watcher does nothing: the watcher is used
4338	solely to wake up the event loop so it takes notice of any new watchers
4339	that might have been added:
4340
4341	static void
4342	async_cb (EV_P_ ev_async *w, int revents)
4343	{
4344	// just used for the side effects
4345	}
4346
4347	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4348	protecting the loop data, respectively.
4349
4350	static void
4351	l_release (EV_P)
4352	{
4353	userdata *u = ev_userdata (EV_A);
4354	pthread_mutex_unlock (&u->lock);
4355	}
4356
4357	static void
4358	l_acquire (EV_P)
4359	{
4360	userdata *u = ev_userdata (EV_A);
4361	pthread_mutex_lock (&u->lock);
4362	}
4363
4364	The event loop thread first acquires the mutex, and then jumps straight
4365	into C<ev_run>:
4366
4367	void *
4368	l_run (void *thr_arg)
4369	{
4370	struct ev_loop *loop = (struct ev_loop *)thr_arg;
4371
4372	l_acquire (EV_A);
4373	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4374	ev_run (EV_A_ 0);
4375	l_release (EV_A);
4376
4377	return 0;
4378	}
4379
4380	Instead of invoking all pending watchers, the C<l_invoke> callback will
4381	signal the main thread via some unspecified mechanism (signals? pipe
4382	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4383	have been called (in a while loop because a) spurious wakeups are possible
4384	and b) skipping inter-thread-communication when there are no pending
4385	watchers is very beneficial):
4386
4387	static void
4388	l_invoke (EV_P)
4389	{
4390	userdata *u = ev_userdata (EV_A);
4391
4392	while (ev_pending_count (EV_A))
4393	{
4394	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4395	pthread_cond_wait (&u->invoke_cv, &u->lock);
4396	}
4397	}
4398
4399	Now, whenever the main thread gets told to invoke pending watchers, it
4400	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4401	thread to continue:
4402
4403	static void
4404	real_invoke_pending (EV_P)
4405	{
4406	userdata *u = ev_userdata (EV_A);
4407
4408	pthread_mutex_lock (&u->lock);
4409	ev_invoke_pending (EV_A);
4410	pthread_cond_signal (&u->invoke_cv);
4411	pthread_mutex_unlock (&u->lock);
4412	}
4413
4414	Whenever you want to start/stop a watcher or do other modifications to an
4415	event loop, you will now have to lock:
4416
4417	ev_timer timeout_watcher;
4418	userdata *u = ev_userdata (EV_A);
4419
4420	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4421
4422	pthread_mutex_lock (&u->lock);
4423	ev_timer_start (EV_A_ &timeout_watcher);
4424	ev_async_send (EV_A_ &u->async_w);
4425	pthread_mutex_unlock (&u->lock);
4426
4427	Note that sending the C<ev_async> watcher is required because otherwise
4428	an event loop currently blocking in the kernel will have no knowledge
4429	about the newly added timer. By waking up the loop it will pick up any new
4430	watchers in the next event loop iteration.
4431		4723
4432	=head3 COROUTINES	4724	=head3 COROUTINES
4433		4725
4434	Libev is very accommodating to coroutines ("cooperative threads"):	4726	Libev is very accommodating to coroutines ("cooperative threads"):
4435	libev fully supports nesting calls to its functions from different	4727	libev fully supports nesting calls to its functions from different
…		…
4704	structure (guaranteed by POSIX but not by ISO C for example), but it also	4996	structure (guaranteed by POSIX but not by ISO C for example), but it also
4705	assumes that the same (machine) code can be used to call any watcher	4997	assumes that the same (machine) code can be used to call any watcher
4706	callback: The watcher callbacks have different type signatures, but libev	4998	callback: The watcher callbacks have different type signatures, but libev
4707	calls them using an C<ev_watcher *> internally.	4999	calls them using an C<ev_watcher *> internally.
4708		5000
		5001	=item pointer accesses must be thread-atomic
		5002
		5003	Accessing a pointer value must be atomic, it must both be readable and
		5004	writable in one piece - this is the case on all current architectures.
		5005
4709	=item C<sig_atomic_t volatile> must be thread-atomic as well	5006	=item C<sig_atomic_t volatile> must be thread-atomic as well
4710		5007
4711	The type C<sig_atomic_t volatile> (or whatever is defined as	5008	The type C<sig_atomic_t volatile> (or whatever is defined as
4712	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different	5009	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4713	threads. This is not part of the specification for C<sig_atomic_t>, but is	5010	threads. This is not part of the specification for C<sig_atomic_t>, but is
…		…
4819	=back	5116	=back
4820		5117
4821		5118
4822	=head1 PORTING FROM LIBEV 3.X TO 4.X	5119	=head1 PORTING FROM LIBEV 3.X TO 4.X
4823		5120
4824	The major version 4 introduced some minor incompatible changes to the API.	5121	The major version 4 introduced some incompatible changes to the API.
4825		5122
4826	At the moment, the C<ev.h> header file tries to implement superficial	5123	At the moment, the C<ev.h> header file provides compatibility definitions
4827	compatibility, so most programs should still compile. Those might be	5124	for all changes, so most programs should still compile. The compatibility
4828	removed in later versions of libev, so better update early than late.	5125	layer might be removed in later versions of libev, so better update to the
		5126	new API early than late.
4829		5127
4830	=over 4	5128	=over 4
		5129
		5130	=item C<EV_COMPAT3> backwards compatibility mechanism
		5131
		5132	The backward compatibility mechanism can be controlled by
		5133	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
		5134	section.
		5135
		5136	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
		5137
		5138	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
		5139
		5140	ev_loop_destroy (EV_DEFAULT_UC);
		5141	ev_loop_fork (EV_DEFAULT);
4831		5142
4832	=item function/symbol renames	5143	=item function/symbol renames
4833		5144
4834	A number of functions and symbols have been renamed:	5145	A number of functions and symbols have been renamed:
4835		5146
…		…
4854	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme	5165	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4855	as all other watcher types. Note that C<ev_loop_fork> is still called	5166	as all other watcher types. Note that C<ev_loop_fork> is still called
4856	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>	5167	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4857	typedef.	5168	typedef.
4858		5169
4859	=item C<EV_COMPAT3> backwards compatibility mechanism
4860
4861	The backward compatibility mechanism can be controlled by
4862	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4863	section.
4864
4865	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>	5170	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4866		5171
4867	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different	5172	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4868	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile	5173	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4869	and work, but the library code will of course be larger.	5174	and work, but the library code will of course be larger.
…		…
4931	The physical time that is observed. It is apparently strictly monotonic :)	5236	The physical time that is observed. It is apparently strictly monotonic :)
4932		5237
4933	=item wall-clock time	5238	=item wall-clock time
4934		5239
4935	The time and date as shown on clocks. Unlike real time, it can actually	5240	The time and date as shown on clocks. Unlike real time, it can actually
4936	be wrong and jump forwards and backwards, e.g. when the you adjust your	5241	be wrong and jump forwards and backwards, e.g. when you adjust your
4937	clock.	5242	clock.
4938		5243
4939	=item watcher	5244	=item watcher
4940		5245
4941	A data structure that describes interest in certain events. Watchers need	5246	A data structure that describes interest in certain events. Watchers need
…		…
4943		5248
4944	=back	5249	=back
4945		5250
4946	=head1 AUTHOR	5251	=head1 AUTHOR
4947		5252
4948	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.	5253	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
		5254	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
4949		5255

Diff Legend

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