[ViewVC] Diff of: cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.354 by root, Tue Jan 11 01:40:25 2011 UTC vs.
Revision 1.369 by root, Mon May 30 18:34:28 2011 UTC

…		…
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
…		…
442		442
443	This behaviour is useful when you want to do your own signal handling, or	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	444	want to handle signals only in specific threads and want to avoid libev
445	unblocking the signals.	445	unblocking the signals.
446		446
		447	It's also required by POSIX in a threaded program, as libev calls
		448	C<sigprocmask>, whose behaviour is officially unspecified.
		449
447	This flag's behaviour will become the default in future versions of libev.	450	This flag's behaviour will become the default in future versions of libev.
448		451
449	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	452	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
450		453
451	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
…		…
480	=item C<EVBACKEND_EPOLL> (value 4, Linux)	483	=item C<EVBACKEND_EPOLL> (value 4, Linux)
481		484
482	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
483	kernels).	486	kernels).
484		487
485	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
486	but it scales phenomenally better. While poll and select usually scale	489	it scales phenomenally better. While poll and select usually scale like
487	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
488	epoll scales either O(1) or O(active_fds).	491	fd), epoll scales either O(1) or O(active_fds).
489		492
490	The epoll mechanism deserves honorable mention as the most misdesigned	493	The epoll mechanism deserves honorable mention as the most misdesigned
491	of the more advanced event mechanisms: mere annoyances include silently	494	of the more advanced event mechanisms: mere annoyances include silently
492	dropping file descriptors, requiring a system call per change per file	495	dropping file descriptors, requiring a system call per change per file
493	descriptor (and unnecessary guessing of parameters), problems with dup,	496	descriptor (and unnecessary guessing of parameters), problems with dup,
…		…
822	This is useful if you are waiting for some external event in conjunction	825	This is useful if you are waiting for some external event in conjunction
823	with something not expressible using other libev watchers (i.e. "roll your	826	with something not expressible using other libev watchers (i.e. "roll your
824	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	827	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
825	usually a better approach for this kind of thing.	828	usually a better approach for this kind of thing.
826		829
827	Here are the gory details of what C<ev_run> does:	830	Here are the gory details of what C<ev_run> does (this is for your
		831	understanding, not a guarantee that things will work exactly like this in
		832	future versions):
828		833
829	- Increment loop depth.	834	- Increment loop depth.
830	- Reset the ev_break status.	835	- Reset the ev_break status.
831	- Before the first iteration, call any pending watchers.	836	- Before the first iteration, call any pending watchers.
832	LOOP:	837	LOOP:
…		…
865	anymore.	870	anymore.
866		871
867	... queue jobs here, make sure they register event watchers as long	872	... queue jobs here, make sure they register event watchers as long
868	... as they still have work to do (even an idle watcher will do..)	873	... as they still have work to do (even an idle watcher will do..)
869	ev_run (my_loop, 0);	874	ev_run (my_loop, 0);
870	... jobs done or somebody called unloop. yeah!	875	... jobs done or somebody called break. yeah!
871		876
872	=item ev_break (loop, how)	877	=item ev_break (loop, how)
873		878
874	Can be used to make a call to C<ev_run> return early (but only after it	879	Can be used to make a call to C<ev_run> return early (but only after it
875	has processed all outstanding events). The C<how> argument must be either	880	has processed all outstanding events). The C<how> argument must be either
…		…
1357	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1362	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1358	functions that do not need a watcher.	1363	functions that do not need a watcher.
1359		1364
1360	=back	1365	=back
1361		1366
1362	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1367	See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1363		1368	OWN COMPOSITE WATCHERS> idioms.
1364	Each watcher has, by default, a member C<void *data> that you can change
1365	and read at any time: libev will completely ignore it. This can be used
1366	to associate arbitrary data with your watcher. If you need more data and
1367	don't want to allocate memory and store a pointer to it in that data
1368	member, you can also "subclass" the watcher type and provide your own
1369	data:
1370
1371	struct my_io
1372	{
1373	ev_io io;
1374	int otherfd;
1375	void *somedata;
1376	struct whatever *mostinteresting;
1377	};
1378
1379	...
1380	struct my_io w;
1381	ev_io_init (&w.io, my_cb, fd, EV_READ);
1382
1383	And since your callback will be called with a pointer to the watcher, you
1384	can cast it back to your own type:
1385
1386	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
1387	{
1388	struct my_io w = (struct my_io )w_;
1389	...
1390	}
1391
1392	More interesting and less C-conformant ways of casting your callback type
1393	instead have been omitted.
1394
1395	Another common scenario is to use some data structure with multiple
1396	embedded watchers:
1397
1398	struct my_biggy
1399	{
1400	int some_data;
1401	ev_timer t1;
1402	ev_timer t2;
1403	}
1404
1405	In this case getting the pointer to C<my_biggy> is a bit more
1406	complicated: Either you store the address of your C<my_biggy> struct
1407	in the C<data> member of the watcher (for woozies), or you need to use
1408	some pointer arithmetic using C<offsetof> inside your watchers (for real
1409	programmers):
1410
1411	#include <stddef.h>
1412
1413	static void
1414	t1_cb (EV_P_ ev_timer *w, int revents)
1415	{
1416	struct my_biggy big = (struct my_biggy *)
1417	(((char *)w) - offsetof (struct my_biggy, t1));
1418	}
1419
1420	static void
1421	t2_cb (EV_P_ ev_timer *w, int revents)
1422	{
1423	struct my_biggy big = (struct my_biggy *)
1424	(((char *)w) - offsetof (struct my_biggy, t2));
1425	}
1426		1369
1427	=head2 WATCHER STATES	1370	=head2 WATCHER STATES
1428		1371
1429	There are various watcher states mentioned throughout this manual -	1372	There are various watcher states mentioned throughout this manual -
1430	active, pending and so on. In this section these states and the rules to	1373	active, pending and so on. In this section these states and the rules to
…		…
1437		1380
1438	Before a watcher can be registered with the event looop it has to be	1381	Before a watcher can be registered with the event looop it has to be
1439	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to	1382	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1440	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.	1383	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1441		1384
1442	In this state it is simply some block of memory that is suitable for use	1385	In this state it is simply some block of memory that is suitable for
1443	in an event loop. It can be moved around, freed, reused etc. at will.	1386	use in an event loop. It can be moved around, freed, reused etc. at
		1387	will - as long as you either keep the memory contents intact, or call
		1388	C<ev_TYPE_init> again.
1444		1389
1445	=item started/running/active	1390	=item started/running/active
1446		1391
1447	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes	1392	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1448	property of the event loop, and is actively waiting for events. While in	1393	property of the event loop, and is actively waiting for events. While in
…		…
1476	latter will clear any pending state the watcher might be in, regardless	1421	latter will clear any pending state the watcher might be in, regardless
1477	of whether it was active or not, so stopping a watcher explicitly before	1422	of whether it was active or not, so stopping a watcher explicitly before
1478	freeing it is often a good idea.	1423	freeing it is often a good idea.
1479		1424
1480	While stopped (and not pending) the watcher is essentially in the	1425	While stopped (and not pending) the watcher is essentially in the
1481	initialised state, that is it can be reused, moved, modified in any way	1426	initialised state, that is, it can be reused, moved, modified in any way
1482	you wish.	1427	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1428	it again).
1483		1429
1484	=back	1430	=back
1485		1431
1486	=head2 WATCHER PRIORITY MODELS	1432	=head2 WATCHER PRIORITY MODELS
1487		1433
…		…
1680	always get a readiness notification instantly, and your read (or possibly	1626	always get a readiness notification instantly, and your read (or possibly
1681	write) will still block on the disk I/O.	1627	write) will still block on the disk I/O.
1682		1628
1683	Another way to view it is that in the case of sockets, pipes, character	1629	Another way to view it is that in the case of sockets, pipes, character
1684	devices and so on, there is another party (the sender) that delivers data	1630	devices and so on, there is another party (the sender) that delivers data
1685	on it's own, but in the case of files, there is no such thing: the disk	1631	on its own, but in the case of files, there is no such thing: the disk
1686	will not send data on it's own, simply because it doesn't know what you	1632	will not send data on its own, simply because it doesn't know what you
1687	wish to read - you would first have to request some data.	1633	wish to read - you would first have to request some data.
1688		1634
1689	Since files are typically not-so-well supported by advanced notification	1635	Since files are typically not-so-well supported by advanced notification
1690	mechanism, libev tries hard to emulate POSIX behaviour with respect	1636	mechanism, libev tries hard to emulate POSIX behaviour with respect
1691	to files, even though you should not use it. The reason for this is	1637	to files, even though you should not use it. The reason for this is
…		…
2207		2153
2208	Another way to think about it (for the mathematically inclined) is that	2154	Another way to think about it (for the mathematically inclined) is that
2209	C<ev_periodic> will try to run the callback in this mode at the next possible	2155	C<ev_periodic> will try to run the callback in this mode at the next possible
2210	time where C<time = offset (mod interval)>, regardless of any time jumps.	2156	time where C<time = offset (mod interval)>, regardless of any time jumps.
2211		2157
2212	For numerical stability it is preferable that the C<offset> value is near	2158	The C<interval> I<MUST> be positive, and for numerical stability, the
2213	C<ev_now ()> (the current time), but there is no range requirement for	2159	interval value should be higher than C<1/8192> (which is around 100
2214	this value, and in fact is often specified as zero.	2160	microseconds) and C<offset> should be higher than C<0> and should have
		2161	at most a similar magnitude as the current time (say, within a factor of
		2162	ten). Typical values for offset are, in fact, C<0> or something between
		2163	C<0> and C<interval>, which is also the recommended range.
2215		2164
2216	Note also that there is an upper limit to how often a timer can fire (CPU	2165	Note also that there is an upper limit to how often a timer can fire (CPU
2217	speed for example), so if C<interval> is very small then timing stability	2166	speed for example), so if C<interval> is very small then timing stability
2218	will of course deteriorate. Libev itself tries to be exact to be about one	2167	will of course deteriorate. Libev itself tries to be exact to be about one
2219	millisecond (if the OS supports it and the machine is fast enough).	2168	millisecond (if the OS supports it and the machine is fast enough).
…		…
2362	=head3 The special problem of inheritance over fork/execve/pthread_create	2311	=head3 The special problem of inheritance over fork/execve/pthread_create
2363		2312
2364	Both the signal mask (C<sigprocmask>) and the signal disposition	2313	Both the signal mask (C<sigprocmask>) and the signal disposition
2365	(C<sigaction>) are unspecified after starting a signal watcher (and after	2314	(C<sigaction>) are unspecified after starting a signal watcher (and after
2366	stopping it again), that is, libev might or might not block the signal,	2315	stopping it again), that is, libev might or might not block the signal,
2367	and might or might not set or restore the installed signal handler.	2316	and might or might not set or restore the installed signal handler (but
		2317	see C<EVFLAG_NOSIGMASK>).
2368		2318
2369	While this does not matter for the signal disposition (libev never	2319	While this does not matter for the signal disposition (libev never
2370	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2320	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2371	C<execve>), this matters for the signal mask: many programs do not expect	2321	C<execve>), this matters for the signal mask: many programs do not expect
2372	certain signals to be blocked.	2322	certain signals to be blocked.
…		…
3243	atexit (program_exits);	3193	atexit (program_exits);
3244		3194
3245		3195
3246	=head2 C<ev_async> - how to wake up an event loop	3196	=head2 C<ev_async> - how to wake up an event loop
3247		3197
3248	In general, you cannot use an C<ev_run> from multiple threads or other	3198	In general, you cannot use an C<ev_loop> from multiple threads or other
3249	asynchronous sources such as signal handlers (as opposed to multiple event	3199	asynchronous sources such as signal handlers (as opposed to multiple event
3250	loops - those are of course safe to use in different threads).	3200	loops - those are of course safe to use in different threads).
3251		3201
3252	Sometimes, however, you need to wake up an event loop you do not control,	3202	Sometimes, however, you need to wake up an event loop you do not control,
3253	for example because it belongs to another thread. This is what C<ev_async>	3203	for example because it belongs to another thread. This is what C<ev_async>
…		…
3363	trust me.	3313	trust me.
3364		3314
3365	=item ev_async_send (loop, ev_async *)	3315	=item ev_async_send (loop, ev_async *)
3366		3316
3367	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3317	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3368	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3318	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3319	returns.
		3320
3369	C<ev_feed_event>, this call is safe to do from other threads, signal or	3321	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3370	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3322	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3371	section below on what exactly this means).	3323	embedding section below on what exactly this means).
3372		3324
3373	Note that, as with other watchers in libev, multiple events might get	3325	Note that, as with other watchers in libev, multiple events might get
3374	compressed into a single callback invocation (another way to look at this	3326	compressed into a single callback invocation (another way to look at this
3375	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3327	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
3376	reset when the event loop detects that).	3328	reset when the event loop detects that).
…		…
3456		3408
3457	This section explains some common idioms that are not immediately	3409	This section explains some common idioms that are not immediately
3458	obvious. Note that examples are sprinkled over the whole manual, and this	3410	obvious. Note that examples are sprinkled over the whole manual, and this
3459	section only contains stuff that wouldn't fit anywhere else.	3411	section only contains stuff that wouldn't fit anywhere else.
3460		3412
3461	=over 4	3413	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3462		3414
3463	=item Model/nested event loop invocations and exit conditions.	3415	Each watcher has, by default, a C<void *data> member that you can read
		3416	or modify at any time: libev will completely ignore it. This can be used
		3417	to associate arbitrary data with your watcher. If you need more data and
		3418	don't want to allocate memory separately and store a pointer to it in that
		3419	data member, you can also "subclass" the watcher type and provide your own
		3420	data:
		3421
		3422	struct my_io
		3423	{
		3424	ev_io io;
		3425	int otherfd;
		3426	void *somedata;
		3427	struct whatever *mostinteresting;
		3428	};
		3429
		3430	...
		3431	struct my_io w;
		3432	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3433
		3434	And since your callback will be called with a pointer to the watcher, you
		3435	can cast it back to your own type:
		3436
		3437	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
		3438	{
		3439	struct my_io w = (struct my_io )w_;
		3440	...
		3441	}
		3442
		3443	More interesting and less C-conformant ways of casting your callback
		3444	function type instead have been omitted.
		3445
		3446	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3447
		3448	Another common scenario is to use some data structure with multiple
		3449	embedded watchers, in effect creating your own watcher that combines
		3450	multiple libev event sources into one "super-watcher":
		3451
		3452	struct my_biggy
		3453	{
		3454	int some_data;
		3455	ev_timer t1;
		3456	ev_timer t2;
		3457	}
		3458
		3459	In this case getting the pointer to C<my_biggy> is a bit more
		3460	complicated: Either you store the address of your C<my_biggy> struct in
		3461	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3462	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3463	real programmers):
		3464
		3465	#include <stddef.h>
		3466
		3467	static void
		3468	t1_cb (EV_P_ ev_timer *w, int revents)
		3469	{
		3470	struct my_biggy big = (struct my_biggy *)
		3471	(((char *)w) - offsetof (struct my_biggy, t1));
		3472	}
		3473
		3474	static void
		3475	t2_cb (EV_P_ ev_timer *w, int revents)
		3476	{
		3477	struct my_biggy big = (struct my_biggy *)
		3478	(((char *)w) - offsetof (struct my_biggy, t2));
		3479	}
		3480
		3481	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3464		3482
3465	Often (especially in GUI toolkits) there are places where you have	3483	Often (especially in GUI toolkits) there are places where you have
3466	I<modal> interaction, which is most easily implemented by recursively	3484	I<modal> interaction, which is most easily implemented by recursively
3467	invoking C<ev_run>.	3485	invoking C<ev_run>.
3468		3486
…		…
3497	exit_main_loop = 1;	3515	exit_main_loop = 1;
3498		3516
3499	// exit both	3517	// exit both
3500	exit_main_loop = exit_nested_loop = 1;	3518	exit_main_loop = exit_nested_loop = 1;
3501		3519
3502	=item Thread locking example	3520	=head2 THREAD LOCKING EXAMPLE
3503		3521
3504	Here is a fictitious example of how to run an event loop in a different	3522	Here is a fictitious example of how to run an event loop in a different
3505	thread than where callbacks are being invoked and watchers are	3523	thread from where callbacks are being invoked and watchers are
3506	created/added/removed.	3524	created/added/removed.
3507		3525
3508	For a real-world example, see the C<EV::Loop::Async> perl module,	3526	For a real-world example, see the C<EV::Loop::Async> perl module,
3509	which uses exactly this technique (which is suited for many high-level	3527	which uses exactly this technique (which is suited for many high-level
3510	languages).	3528	languages).
…		…
3536	// now associate this with the loop	3554	// now associate this with the loop
3537	ev_set_userdata (EV_A_ u);	3555	ev_set_userdata (EV_A_ u);
3538	ev_set_invoke_pending_cb (EV_A_ l_invoke);	3556	ev_set_invoke_pending_cb (EV_A_ l_invoke);
3539	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);	3557	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3540		3558
3541	// then create the thread running ev_loop	3559	// then create the thread running ev_run
3542	pthread_create (&u->tid, 0, l_run, EV_A);	3560	pthread_create (&u->tid, 0, l_run, EV_A);
3543	}	3561	}
3544		3562
3545	The callback for the C<ev_async> watcher does nothing: the watcher is used	3563	The callback for the C<ev_async> watcher does nothing: the watcher is used
3546	solely to wake up the event loop so it takes notice of any new watchers	3564	solely to wake up the event loop so it takes notice of any new watchers
…		…
3635	Note that sending the C<ev_async> watcher is required because otherwise	3653	Note that sending the C<ev_async> watcher is required because otherwise
3636	an event loop currently blocking in the kernel will have no knowledge	3654	an event loop currently blocking in the kernel will have no knowledge
3637	about the newly added timer. By waking up the loop it will pick up any new	3655	about the newly added timer. By waking up the loop it will pick up any new
3638	watchers in the next event loop iteration.	3656	watchers in the next event loop iteration.
3639		3657
3640	=back	3658	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3659
		3660	While the overhead of a callback that e.g. schedules a thread is small, it
		3661	is still an overhead. If you embed libev, and your main usage is with some
		3662	kind of threads or coroutines, you might want to customise libev so that
		3663	doesn't need callbacks anymore.
		3664
		3665	Imagine you have coroutines that you can switch to using a function
		3666	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3667	and that due to some magic, the currently active coroutine is stored in a
		3668	global called C<current_coro>. Then you can build your own "wait for libev
		3669	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3670	the differing C<;> conventions):
		3671
		3672	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3673	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3674
		3675	That means instead of having a C callback function, you store the
		3676	coroutine to switch to in each watcher, and instead of having libev call
		3677	your callback, you instead have it switch to that coroutine.
		3678
		3679	A coroutine might now wait for an event with a function called
		3680	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3681	matter when, or whether the watcher is active or not when this function is
		3682	called):
		3683
		3684	void
		3685	wait_for_event (ev_watcher *w)
		3686	{
		3687	ev_cb_set (w) = current_coro;
		3688	switch_to (libev_coro);
		3689	}
		3690
		3691	That basically suspends the coroutine inside C<wait_for_event> and
		3692	continues the libev coroutine, which, when appropriate, switches back to
		3693	this or any other coroutine. I am sure if you sue this your own :)
		3694
		3695	You can do similar tricks if you have, say, threads with an event queue -
		3696	instead of storing a coroutine, you store the queue object and instead of
		3697	switching to a coroutine, you push the watcher onto the queue and notify
		3698	any waiters.
		3699
		3700	To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
		3701	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3702
		3703	// my_ev.h
		3704	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3705	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
		3706	#include "../libev/ev.h"
		3707
		3708	// my_ev.c
		3709	#define EV_H "my_ev.h"
		3710	#include "../libev/ev.c"
		3711
		3712	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3713	F<my_ev.c> into your project. When properly specifying include paths, you
		3714	can even use F<ev.h> as header file name directly.
3641		3715
3642		3716
3643	=head1 LIBEVENT EMULATION	3717	=head1 LIBEVENT EMULATION
3644		3718
3645	Libev offers a compatibility emulation layer for libevent. It cannot	3719	Libev offers a compatibility emulation layer for libevent. It cannot
…		…
4135	F<event.h> that are not directly supported by the libev core alone.	4209	F<event.h> that are not directly supported by the libev core alone.
4136		4210
4137	In standalone mode, libev will still try to automatically deduce the	4211	In standalone mode, libev will still try to automatically deduce the
4138	configuration, but has to be more conservative.	4212	configuration, but has to be more conservative.
4139		4213
		4214	=item EV_USE_FLOOR
		4215
		4216	If defined to be C<1>, libev will use the C<floor ()> function for its
		4217	periodic reschedule calculations, otherwise libev will fall back on a
		4218	portable (slower) implementation. If you enable this, you usually have to
		4219	link against libm or something equivalent. Enabling this when the C<floor>
		4220	function is not available will fail, so the safe default is to not enable
		4221	this.
		4222
4140	=item EV_USE_MONOTONIC	4223	=item EV_USE_MONOTONIC
4141		4224
4142	If defined to be C<1>, libev will try to detect the availability of the	4225	If defined to be C<1>, libev will try to detect the availability of the
4143	monotonic clock option at both compile time and runtime. Otherwise no	4226	monotonic clock option at both compile time and runtime. Otherwise no
4144	use of the monotonic clock option will be attempted. If you enable this,	4227	use of the monotonic clock option will be attempted. If you enable this,
…		…
4575	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4658	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4576		4659
4577	#include "ev_cpp.h"	4660	#include "ev_cpp.h"
4578	#include "ev.c"	4661	#include "ev.c"
4579		4662
4580	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4663	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4581		4664
4582	=head2 THREADS AND COROUTINES	4665	=head2 THREADS AND COROUTINES
4583		4666
4584	=head3 THREADS	4667	=head3 THREADS
4585		4668
…		…
4636	default loop and triggering an C<ev_async> watcher from the default loop	4719	default loop and triggering an C<ev_async> watcher from the default loop
4637	watcher callback into the event loop interested in the signal.	4720	watcher callback into the event loop interested in the signal.
4638		4721
4639	=back	4722	=back
4640		4723
4641	See also L<Thread locking example>.	4724	See also L<THREAD LOCKING EXAMPLE>.
4642		4725
4643	=head3 COROUTINES	4726	=head3 COROUTINES
4644		4727
4645	Libev is very accommodating to coroutines ("cooperative threads"):	4728	Libev is very accommodating to coroutines ("cooperative threads"):
4646	libev fully supports nesting calls to its functions from different	4729	libev fully supports nesting calls to its functions from different
…		…
5155	The physical time that is observed. It is apparently strictly monotonic :)	5238	The physical time that is observed. It is apparently strictly monotonic :)
5156		5239
5157	=item wall-clock time	5240	=item wall-clock time
5158		5241
5159	The time and date as shown on clocks. Unlike real time, it can actually	5242	The time and date as shown on clocks. Unlike real time, it can actually
5160	be wrong and jump forwards and backwards, e.g. when the you adjust your	5243	be wrong and jump forwards and backwards, e.g. when you adjust your
5161	clock.	5244	clock.
5162		5245
5163	=item watcher	5246	=item watcher
5164		5247
5165	A data structure that describes interest in certain events. Watchers need	5248	A data structure that describes interest in certain events. Watchers need
…		…
5168	=back	5251	=back
5169		5252
5170	=head1 AUTHOR	5253	=head1 AUTHOR
5171		5254
5172	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael	5255	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5173	Magnusson and Emanuele Giaquinta.	5256	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5174		5257

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.354 by root, Tue Jan 11 01:40:25 2011 UTC vs. Revision 1.369 by root, Mon May 30 18:34:28 2011 UTC

Diff Legend

Comparing libev/ev.pod (file contents):
Revision 1.354 by root, Tue Jan 11 01:40:25 2011 UTC vs.
Revision 1.369 by root, Mon May 30 18:34:28 2011 UTC