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

Comparing libev/ev.pod (file contents):
Revision 1.353 by root, Mon Jan 10 14:36:44 2011 UTC vs.
Revision 1.361 by root, Sun Jan 23 18:53:06 2011 UTC

…		…
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
…		…
506	employing an additional generation counter and comparing that against the	509	employing an additional generation counter and comparing that against the
507	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
508	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
509	perfectly fine with C<select> (files, many character devices...).	512	perfectly fine with C<select> (files, many character devices...).
510		513
511	Epoll is truly the train wreck analog among event poll mechanisms.	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.
512		517
513	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
514	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
515	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
516	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
…		…
1355	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1360	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1356	functions that do not need a watcher.	1361	functions that do not need a watcher.
1357		1362
1358	=back	1363	=back
1359		1364
1360	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1365	See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1361		1366	OWN COMPOSITE WATCHERS> idioms.
1362	Each watcher has, by default, a member C<void *data> that you can change
1363	and read at any time: libev will completely ignore it. This can be used
1364	to associate arbitrary data with your watcher. If you need more data and
1365	don't want to allocate memory and store a pointer to it in that data
1366	member, you can also "subclass" the watcher type and provide your own
1367	data:
1368
1369	struct my_io
1370	{
1371	ev_io io;
1372	int otherfd;
1373	void *somedata;
1374	struct whatever *mostinteresting;
1375	};
1376
1377	...
1378	struct my_io w;
1379	ev_io_init (&w.io, my_cb, fd, EV_READ);
1380
1381	And since your callback will be called with a pointer to the watcher, you
1382	can cast it back to your own type:
1383
1384	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
1385	{
1386	struct my_io w = (struct my_io )w_;
1387	...
1388	}
1389
1390	More interesting and less C-conformant ways of casting your callback type
1391	instead have been omitted.
1392
1393	Another common scenario is to use some data structure with multiple
1394	embedded watchers:
1395
1396	struct my_biggy
1397	{
1398	int some_data;
1399	ev_timer t1;
1400	ev_timer t2;
1401	}
1402
1403	In this case getting the pointer to C<my_biggy> is a bit more
1404	complicated: Either you store the address of your C<my_biggy> struct
1405	in the C<data> member of the watcher (for woozies), or you need to use
1406	some pointer arithmetic using C<offsetof> inside your watchers (for real
1407	programmers):
1408
1409	#include <stddef.h>
1410
1411	static void
1412	t1_cb (EV_P_ ev_timer *w, int revents)
1413	{
1414	struct my_biggy big = (struct my_biggy *)
1415	(((char *)w) - offsetof (struct my_biggy, t1));
1416	}
1417
1418	static void
1419	t2_cb (EV_P_ ev_timer *w, int revents)
1420	{
1421	struct my_biggy big = (struct my_biggy *)
1422	(((char *)w) - offsetof (struct my_biggy, t2));
1423	}
1424		1367
1425	=head2 WATCHER STATES	1368	=head2 WATCHER STATES
1426		1369
1427	There are various watcher states mentioned throughout this manual -	1370	There are various watcher states mentioned throughout this manual -
1428	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
…		…
1435		1378
1436	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
1437	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
1438	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.
1439		1382
1440	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
1441	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.
1442		1387
1443	=item started/running/active	1388	=item started/running/active
1444		1389
1445	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
1446	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
…		…
1474	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
1475	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
1476	freeing it is often a good idea.	1421	freeing it is often a good idea.
1477		1422
1478	While stopped (and not pending) the watcher is essentially in the	1423	While stopped (and not pending) the watcher is essentially in the
1479	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
1480	you wish.	1425	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1426	it again).
1481		1427
1482	=back	1428	=back
1483		1429
1484	=head2 WATCHER PRIORITY MODELS	1430	=head2 WATCHER PRIORITY MODELS
1485		1431
…		…
1614	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
1615	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
1616	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
1617	required if you know what you are doing).	1563	required if you know what you are doing).
1618		1564
1619	If you cannot use non-blocking mode, then force the use of a
1620	known-to-be-good backend (at the time of this writing, this includes only
1621	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1622	descriptors for which non-blocking operation makes no sense (such as
1623	files) - libev doesn't guarantee any specific behaviour in that case.
1624
1625	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
1626	receive "spurious" readiness notifications, that is your callback might	1566	receive "spurious" readiness notifications, that is, your callback might
1627	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
1628	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
1629	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
1630	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
1631	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1632	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1571	preferable to a program hanging until some data arrives.
1633		1572
1634	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
1635	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
1636	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
1637	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
1638	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
1639	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
1640	indefinitely.	1579	indefinitely.
1641		1580
1642	But really, best use non-blocking mode.	1581	But really, best use non-blocking mode.
1643		1582
…		…
1671		1610
1672	There is no workaround possible except not registering events	1611	There is no workaround possible except not registering events
1673	for potentially C<dup ()>'ed file descriptors, or to resort to	1612	for potentially C<dup ()>'ed file descriptors, or to resort to
1674	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1613	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1675		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
1676	=head3 The special problem of fork	1648	=head3 The special problem of fork
1677		1649
1678	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
1679	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
1680	it in the child.	1652	it in the child if you want to continue to use it in the child.
1681		1653
1682	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
1683	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
1684	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1656	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1685	C<EVBACKEND_POLL>.
1686		1657
1687	=head3 The special problem of SIGPIPE	1658	=head3 The special problem of SIGPIPE
1688		1659
1689	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>:
1690	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
…		…
2335	=head3 The special problem of inheritance over fork/execve/pthread_create	2306	=head3 The special problem of inheritance over fork/execve/pthread_create
2336		2307
2337	Both the signal mask (C<sigprocmask>) and the signal disposition	2308	Both the signal mask (C<sigprocmask>) and the signal disposition
2338	(C<sigaction>) are unspecified after starting a signal watcher (and after	2309	(C<sigaction>) are unspecified after starting a signal watcher (and after
2339	stopping it again), that is, libev might or might not block the signal,	2310	stopping it again), that is, libev might or might not block the signal,
2340	and might or might not set or restore the installed signal handler.	2311	and might or might not set or restore the installed signal handler (but
		2312	see C<EVFLAG_NOSIGMASK>).
2341		2313
2342	While this does not matter for the signal disposition (libev never	2314	While this does not matter for the signal disposition (libev never
2343	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2315	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2344	C<execve>), this matters for the signal mask: many programs do not expect	2316	C<execve>), this matters for the signal mask: many programs do not expect
2345	certain signals to be blocked.	2317	certain signals to be blocked.
…		…
3429		3401
3430	This section explains some common idioms that are not immediately	3402	This section explains some common idioms that are not immediately
3431	obvious. Note that examples are sprinkled over the whole manual, and this	3403	obvious. Note that examples are sprinkled over the whole manual, and this
3432	section only contains stuff that wouldn't fit anywhere else.	3404	section only contains stuff that wouldn't fit anywhere else.
3433		3405
3434	=over 4	3406	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3435		3407
3436	=item Model/nested event loop invocations and exit conditions.	3408	Each watcher has, by default, a C<void *data> member that you can read
		3409	or modify at any time: libev will completely ignore it. This can be used
		3410	to associate arbitrary data with your watcher. If you need more data and
		3411	don't want to allocate memory separately and store a pointer to it in that
		3412	data member, you can also "subclass" the watcher type and provide your own
		3413	data:
		3414
		3415	struct my_io
		3416	{
		3417	ev_io io;
		3418	int otherfd;
		3419	void *somedata;
		3420	struct whatever *mostinteresting;
		3421	};
		3422
		3423	...
		3424	struct my_io w;
		3425	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3426
		3427	And since your callback will be called with a pointer to the watcher, you
		3428	can cast it back to your own type:
		3429
		3430	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
		3431	{
		3432	struct my_io w = (struct my_io )w_;
		3433	...
		3434	}
		3435
		3436	More interesting and less C-conformant ways of casting your callback
		3437	function type instead have been omitted.
		3438
		3439	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3440
		3441	Another common scenario is to use some data structure with multiple
		3442	embedded watchers, in effect creating your own watcher that combines
		3443	multiple libev event sources into one "super-watcher":
		3444
		3445	struct my_biggy
		3446	{
		3447	int some_data;
		3448	ev_timer t1;
		3449	ev_timer t2;
		3450	}
		3451
		3452	In this case getting the pointer to C<my_biggy> is a bit more
		3453	complicated: Either you store the address of your C<my_biggy> struct in
		3454	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3455	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3456	real programmers):
		3457
		3458	#include <stddef.h>
		3459
		3460	static void
		3461	t1_cb (EV_P_ ev_timer *w, int revents)
		3462	{
		3463	struct my_biggy big = (struct my_biggy *)
		3464	(((char *)w) - offsetof (struct my_biggy, t1));
		3465	}
		3466
		3467	static void
		3468	t2_cb (EV_P_ ev_timer *w, int revents)
		3469	{
		3470	struct my_biggy big = (struct my_biggy *)
		3471	(((char *)w) - offsetof (struct my_biggy, t2));
		3472	}
		3473
		3474	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3437		3475
3438	Often (especially in GUI toolkits) there are places where you have	3476	Often (especially in GUI toolkits) there are places where you have
3439	I<modal> interaction, which is most easily implemented by recursively	3477	I<modal> interaction, which is most easily implemented by recursively
3440	invoking C<ev_run>.	3478	invoking C<ev_run>.
3441		3479
…		…
3470	exit_main_loop = 1;	3508	exit_main_loop = 1;
3471		3509
3472	// exit both	3510	// exit both
3473	exit_main_loop = exit_nested_loop = 1;	3511	exit_main_loop = exit_nested_loop = 1;
3474		3512
3475	=back	3513	=head2 THREAD LOCKING EXAMPLE
		3514
		3515	Here is a fictitious example of how to run an event loop in a different
		3516	thread from where callbacks are being invoked and watchers are
		3517	created/added/removed.
		3518
		3519	For a real-world example, see the C<EV::Loop::Async> perl module,
		3520	which uses exactly this technique (which is suited for many high-level
		3521	languages).
		3522
		3523	The example uses a pthread mutex to protect the loop data, a condition
		3524	variable to wait for callback invocations, an async watcher to notify the
		3525	event loop thread and an unspecified mechanism to wake up the main thread.
		3526
		3527	First, you need to associate some data with the event loop:
		3528
		3529	typedef struct {
		3530	mutex_t lock; /* global loop lock */
		3531	ev_async async_w;
		3532	thread_t tid;
		3533	cond_t invoke_cv;
		3534	} userdata;
		3535
		3536	void prepare_loop (EV_P)
		3537	{
		3538	// for simplicity, we use a static userdata struct.
		3539	static userdata u;
		3540
		3541	ev_async_init (&u->async_w, async_cb);
		3542	ev_async_start (EV_A_ &u->async_w);
		3543
		3544	pthread_mutex_init (&u->lock, 0);
		3545	pthread_cond_init (&u->invoke_cv, 0);
		3546
		3547	// now associate this with the loop
		3548	ev_set_userdata (EV_A_ u);
		3549	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3550	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3551
		3552	// then create the thread running ev_loop
		3553	pthread_create (&u->tid, 0, l_run, EV_A);
		3554	}
		3555
		3556	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3557	solely to wake up the event loop so it takes notice of any new watchers
		3558	that might have been added:
		3559
		3560	static void
		3561	async_cb (EV_P_ ev_async *w, int revents)
		3562	{
		3563	// just used for the side effects
		3564	}
		3565
		3566	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3567	protecting the loop data, respectively.
		3568
		3569	static void
		3570	l_release (EV_P)
		3571	{
		3572	userdata *u = ev_userdata (EV_A);
		3573	pthread_mutex_unlock (&u->lock);
		3574	}
		3575
		3576	static void
		3577	l_acquire (EV_P)
		3578	{
		3579	userdata *u = ev_userdata (EV_A);
		3580	pthread_mutex_lock (&u->lock);
		3581	}
		3582
		3583	The event loop thread first acquires the mutex, and then jumps straight
		3584	into C<ev_run>:
		3585
		3586	void *
		3587	l_run (void *thr_arg)
		3588	{
		3589	struct ev_loop loop = (struct ev_loop )thr_arg;
		3590
		3591	l_acquire (EV_A);
		3592	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3593	ev_run (EV_A_ 0);
		3594	l_release (EV_A);
		3595
		3596	return 0;
		3597	}
		3598
		3599	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3600	signal the main thread via some unspecified mechanism (signals? pipe
		3601	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3602	have been called (in a while loop because a) spurious wakeups are possible
		3603	and b) skipping inter-thread-communication when there are no pending
		3604	watchers is very beneficial):
		3605
		3606	static void
		3607	l_invoke (EV_P)
		3608	{
		3609	userdata *u = ev_userdata (EV_A);
		3610
		3611	while (ev_pending_count (EV_A))
		3612	{
		3613	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3614	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3615	}
		3616	}
		3617
		3618	Now, whenever the main thread gets told to invoke pending watchers, it
		3619	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3620	thread to continue:
		3621
		3622	static void
		3623	real_invoke_pending (EV_P)
		3624	{
		3625	userdata *u = ev_userdata (EV_A);
		3626
		3627	pthread_mutex_lock (&u->lock);
		3628	ev_invoke_pending (EV_A);
		3629	pthread_cond_signal (&u->invoke_cv);
		3630	pthread_mutex_unlock (&u->lock);
		3631	}
		3632
		3633	Whenever you want to start/stop a watcher or do other modifications to an
		3634	event loop, you will now have to lock:
		3635
		3636	ev_timer timeout_watcher;
		3637	userdata *u = ev_userdata (EV_A);
		3638
		3639	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3640
		3641	pthread_mutex_lock (&u->lock);
		3642	ev_timer_start (EV_A_ &timeout_watcher);
		3643	ev_async_send (EV_A_ &u->async_w);
		3644	pthread_mutex_unlock (&u->lock);
		3645
		3646	Note that sending the C<ev_async> watcher is required because otherwise
		3647	an event loop currently blocking in the kernel will have no knowledge
		3648	about the newly added timer. By waking up the loop it will pick up any new
		3649	watchers in the next event loop iteration.
		3650
		3651	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3652
		3653	While the overhead of a callback that e.g. schedules a thread is small, it
		3654	is still an overhead. If you embed libev, and your main usage is with some
		3655	kind of threads or coroutines, you might want to customise libev so that
		3656	doesn't need callbacks anymore.
		3657
		3658	Imagine you have coroutines that you can switch to using a function
		3659	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3660	and that due to some magic, the currently active coroutine is stored in a
		3661	global called C<current_coro>. Then you can build your own "wait for libev
		3662	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3663	the differing C<;> conventions):
		3664
		3665	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3666	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3667
		3668	That means instead of having a C callback function, you store the
		3669	coroutine to switch to in each watcher, and instead of having libev call
		3670	your callback, you instead have it switch to that coroutine.
		3671
		3672	A coroutine might now wait for an event with a function called
		3673	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3674	matter when, or whether the watcher is active or not when this function is
		3675	called):
		3676
		3677	void
		3678	wait_for_event (ev_watcher *w)
		3679	{
		3680	ev_cb_set (w) = current_coro;
		3681	switch_to (libev_coro);
		3682	}
		3683
		3684	That basically suspends the coroutine inside C<wait_for_event> and
		3685	continues the libev coroutine, which, when appropriate, switches back to
		3686	this or any other coroutine. I am sure if you sue this your own :)
		3687
		3688	You can do similar tricks if you have, say, threads with an event queue -
		3689	instead of storing a coroutine, you store the queue object and instead of
		3690	switching to a coroutine, you push the watcher onto the queue and notify
		3691	any waiters.
		3692
		3693	To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
		3694	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3695
		3696	// my_ev.h
		3697	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3698	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
		3699	#include "../libev/ev.h"
		3700
		3701	// my_ev.c
		3702	#define EV_H "my_ev.h"
		3703	#include "../libev/ev.c"
		3704
		3705	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3706	F<my_ev.c> into your project. When properly specifying include paths, you
		3707	can even use F<ev.h> as header file name directly.
3476		3708
3477		3709
3478	=head1 LIBEVENT EMULATION	3710	=head1 LIBEVENT EMULATION
3479		3711
3480	Libev offers a compatibility emulation layer for libevent. It cannot	3712	Libev offers a compatibility emulation layer for libevent. It cannot
…		…
4410	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4642	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4411		4643
4412	#include "ev_cpp.h"	4644	#include "ev_cpp.h"
4413	#include "ev.c"	4645	#include "ev.c"
4414		4646
4415	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4647	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4416		4648
4417	=head2 THREADS AND COROUTINES	4649	=head2 THREADS AND COROUTINES
4418		4650
4419	=head3 THREADS	4651	=head3 THREADS
4420		4652
…		…
4471	default loop and triggering an C<ev_async> watcher from the default loop	4703	default loop and triggering an C<ev_async> watcher from the default loop
4472	watcher callback into the event loop interested in the signal.	4704	watcher callback into the event loop interested in the signal.
4473		4705
4474	=back	4706	=back
4475		4707
4476	=head4 THREAD LOCKING EXAMPLE	4708	See also L<THREAD LOCKING EXAMPLE>.
4477
4478	Here is a fictitious example of how to run an event loop in a different
4479	thread than where callbacks are being invoked and watchers are
4480	created/added/removed.
4481
4482	For a real-world example, see the C<EV::Loop::Async> perl module,
4483	which uses exactly this technique (which is suited for many high-level
4484	languages).
4485
4486	The example uses a pthread mutex to protect the loop data, a condition
4487	variable to wait for callback invocations, an async watcher to notify the
4488	event loop thread and an unspecified mechanism to wake up the main thread.
4489
4490	First, you need to associate some data with the event loop:
4491
4492	typedef struct {
4493	mutex_t lock; /* global loop lock */
4494	ev_async async_w;
4495	thread_t tid;
4496	cond_t invoke_cv;
4497	} userdata;
4498
4499	void prepare_loop (EV_P)
4500	{
4501	// for simplicity, we use a static userdata struct.
4502	static userdata u;
4503
4504	ev_async_init (&u->async_w, async_cb);
4505	ev_async_start (EV_A_ &u->async_w);
4506
4507	pthread_mutex_init (&u->lock, 0);
4508	pthread_cond_init (&u->invoke_cv, 0);
4509
4510	// now associate this with the loop
4511	ev_set_userdata (EV_A_ u);
4512	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4513	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4514
4515	// then create the thread running ev_loop
4516	pthread_create (&u->tid, 0, l_run, EV_A);
4517	}
4518
4519	The callback for the C<ev_async> watcher does nothing: the watcher is used
4520	solely to wake up the event loop so it takes notice of any new watchers
4521	that might have been added:
4522
4523	static void
4524	async_cb (EV_P_ ev_async *w, int revents)
4525	{
4526	// just used for the side effects
4527	}
4528
4529	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4530	protecting the loop data, respectively.
4531
4532	static void
4533	l_release (EV_P)
4534	{
4535	userdata *u = ev_userdata (EV_A);
4536	pthread_mutex_unlock (&u->lock);
4537	}
4538
4539	static void
4540	l_acquire (EV_P)
4541	{
4542	userdata *u = ev_userdata (EV_A);
4543	pthread_mutex_lock (&u->lock);
4544	}
4545
4546	The event loop thread first acquires the mutex, and then jumps straight
4547	into C<ev_run>:
4548
4549	void *
4550	l_run (void *thr_arg)
4551	{
4552	struct ev_loop loop = (struct ev_loop )thr_arg;
4553
4554	l_acquire (EV_A);
4555	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4556	ev_run (EV_A_ 0);
4557	l_release (EV_A);
4558
4559	return 0;
4560	}
4561
4562	Instead of invoking all pending watchers, the C<l_invoke> callback will
4563	signal the main thread via some unspecified mechanism (signals? pipe
4564	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4565	have been called (in a while loop because a) spurious wakeups are possible
4566	and b) skipping inter-thread-communication when there are no pending
4567	watchers is very beneficial):
4568
4569	static void
4570	l_invoke (EV_P)
4571	{
4572	userdata *u = ev_userdata (EV_A);
4573
4574	while (ev_pending_count (EV_A))
4575	{
4576	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4577	pthread_cond_wait (&u->invoke_cv, &u->lock);
4578	}
4579	}
4580
4581	Now, whenever the main thread gets told to invoke pending watchers, it
4582	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4583	thread to continue:
4584
4585	static void
4586	real_invoke_pending (EV_P)
4587	{
4588	userdata *u = ev_userdata (EV_A);
4589
4590	pthread_mutex_lock (&u->lock);
4591	ev_invoke_pending (EV_A);
4592	pthread_cond_signal (&u->invoke_cv);
4593	pthread_mutex_unlock (&u->lock);
4594	}
4595
4596	Whenever you want to start/stop a watcher or do other modifications to an
4597	event loop, you will now have to lock:
4598
4599	ev_timer timeout_watcher;
4600	userdata *u = ev_userdata (EV_A);
4601
4602	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4603
4604	pthread_mutex_lock (&u->lock);
4605	ev_timer_start (EV_A_ &timeout_watcher);
4606	ev_async_send (EV_A_ &u->async_w);
4607	pthread_mutex_unlock (&u->lock);
4608
4609	Note that sending the C<ev_async> watcher is required because otherwise
4610	an event loop currently blocking in the kernel will have no knowledge
4611	about the newly added timer. By waking up the loop it will pick up any new
4612	watchers in the next event loop iteration.
4613		4709
4614	=head3 COROUTINES	4710	=head3 COROUTINES
4615		4711
4616	Libev is very accommodating to coroutines ("cooperative threads"):	4712	Libev is very accommodating to coroutines ("cooperative threads"):
4617	libev fully supports nesting calls to its functions from different	4713	libev fully supports nesting calls to its functions from different

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.353 by root, Mon Jan 10 14:36:44 2011 UTC vs. Revision 1.361 by root, Sun Jan 23 18:53:06 2011 UTC

Diff Legend

Comparing libev/ev.pod (file contents):
Revision 1.353 by root, Mon Jan 10 14:36:44 2011 UTC vs.
Revision 1.361 by root, Sun Jan 23 18:53:06 2011 UTC