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

Comparing libev/ev.pod (file contents):
Revision 1.347 by sf-exg, Wed Nov 10 19:50:09 2010 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
…		…
299	}	299	}
300		300
301	...	301	...
302	ev_set_syserr_cb (fatal_error);	302	ev_set_syserr_cb (fatal_error);
303		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
304	=back	317	=back
305		318
306	=head1 FUNCTIONS CONTROLLING EVENT LOOPS	319	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
307		320
308	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
…		…
419		432
420	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
421	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
422	example) that can't properly initialise their signal masks.	435	example) that can't properly initialise their signal masks.
423		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.
		451
424	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	452	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
425		453
426	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
427	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,
428	but if that fails, expect a fairly low limit on the number of fds when	456	but if that fails, expect a fairly low limit on the number of fds when
…		…
455	=item C<EVBACKEND_EPOLL> (value 4, Linux)	483	=item C<EVBACKEND_EPOLL> (value 4, Linux)
456		484
457	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
458	kernels).	486	kernels).
459		487
460	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
461	but it scales phenomenally better. While poll and select usually scale	489	it scales phenomenally better. While poll and select usually scale like
462	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
463	epoll scales either O(1) or O(active_fds).	491	fd), epoll scales either O(1) or O(active_fds).
464		492
465	The epoll mechanism deserves honorable mention as the most misdesigned	493	The epoll mechanism deserves honorable mention as the most misdesigned
466	of the more advanced event mechanisms: mere annoyances include silently	494	of the more advanced event mechanisms: mere annoyances include silently
467	dropping file descriptors, requiring a system call per change per file	495	dropping file descriptors, requiring a system call per change per file
468	descriptor (and unnecessary guessing of parameters), problems with dup,	496	descriptor (and unnecessary guessing of parameters), problems with dup,
…		…
481	employing an additional generation counter and comparing that against the	509	employing an additional generation counter and comparing that against the
482	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
483	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
484	perfectly fine with C<select> (files, many character devices...).	512	perfectly fine with C<select> (files, many character devices...).
485		513
486	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.
487		517
488	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
489	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
490	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
491	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
…		…
557	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	587	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
558		588
559	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,
560	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)).
561		591
562	Please note that Solaris event ports can deliver a lot of spurious
563	notifications, so you need to use non-blocking I/O or other means to avoid
564	blocking when no data (or space) is available.
565
566	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
567	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
568	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	594	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
569	might perform better.	595	might perform better.
570		596
571	On the positive side, with the exception of the spurious readiness	597	On the positive side, this backend actually performed fully to
572	notifications, this backend actually performed fully to specification
573	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
574	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.
575		611
576	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
577	C<EVBACKEND_POLL>.	613	C<EVBACKEND_POLL>.
578		614
579	=item C<EVBACKEND_ALL>	615	=item C<EVBACKEND_ALL>
580		616
581	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
582	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
583	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	619	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
584		620
585	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).
586		630
587	=back	631	=back
588		632
589	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,
590	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
…		…
781	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
782	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
783	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
784	usually a better approach for this kind of thing.	828	usually a better approach for this kind of thing.
785		829
786	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):
787		833
788	- Increment loop depth.	834	- Increment loop depth.
789	- Reset the ev_break status.	835	- Reset the ev_break status.
790	- Before the first iteration, call any pending watchers.	836	- Before the first iteration, call any pending watchers.
791	LOOP:	837	LOOP:
…		…
824	anymore.	870	anymore.
825		871
826	... queue jobs here, make sure they register event watchers as long	872	... queue jobs here, make sure they register event watchers as long
827	... 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..)
828	ev_run (my_loop, 0);	874	ev_run (my_loop, 0);
829	... jobs done or somebody called unloop. yeah!	875	... jobs done or somebody called break. yeah!
830		876
831	=item ev_break (loop, how)	877	=item ev_break (loop, how)
832		878
833	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
834	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
…		…
867	running when nothing else is active.	913	running when nothing else is active.
868		914
869	ev_signal exitsig;	915	ev_signal exitsig;
870	ev_signal_init (&exitsig, sig_cb, SIGINT);	916	ev_signal_init (&exitsig, sig_cb, SIGINT);
871	ev_signal_start (loop, &exitsig);	917	ev_signal_start (loop, &exitsig);
872	evf_unref (loop);	918	ev_unref (loop);
873		919
874	Example: For some weird reason, unregister the above signal handler again.	920	Example: For some weird reason, unregister the above signal handler again.
875		921
876	ev_ref (loop);	922	ev_ref (loop);
877	ev_signal_stop (loop, &exitsig);	923	ev_signal_stop (loop, &exitsig);
…		…
1316	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
1317	functions that do not need a watcher.	1363	functions that do not need a watcher.
1318		1364
1319	=back	1365	=back
1320		1366
1321	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1367	See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1322		1368	OWN COMPOSITE WATCHERS> idioms.
1323	Each watcher has, by default, a member C<void *data> that you can change
1324	and read at any time: libev will completely ignore it. This can be used
1325	to associate arbitrary data with your watcher. If you need more data and
1326	don't want to allocate memory and store a pointer to it in that data
1327	member, you can also "subclass" the watcher type and provide your own
1328	data:
1329
1330	struct my_io
1331	{
1332	ev_io io;
1333	int otherfd;
1334	void *somedata;
1335	struct whatever *mostinteresting;
1336	};
1337
1338	...
1339	struct my_io w;
1340	ev_io_init (&w.io, my_cb, fd, EV_READ);
1341
1342	And since your callback will be called with a pointer to the watcher, you
1343	can cast it back to your own type:
1344
1345	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
1346	{
1347	struct my_io w = (struct my_io )w_;
1348	...
1349	}
1350
1351	More interesting and less C-conformant ways of casting your callback type
1352	instead have been omitted.
1353
1354	Another common scenario is to use some data structure with multiple
1355	embedded watchers:
1356
1357	struct my_biggy
1358	{
1359	int some_data;
1360	ev_timer t1;
1361	ev_timer t2;
1362	}
1363
1364	In this case getting the pointer to C<my_biggy> is a bit more
1365	complicated: Either you store the address of your C<my_biggy> struct
1366	in the C<data> member of the watcher (for woozies), or you need to use
1367	some pointer arithmetic using C<offsetof> inside your watchers (for real
1368	programmers):
1369
1370	#include <stddef.h>
1371
1372	static void
1373	t1_cb (EV_P_ ev_timer *w, int revents)
1374	{
1375	struct my_biggy big = (struct my_biggy *)
1376	(((char *)w) - offsetof (struct my_biggy, t1));
1377	}
1378
1379	static void
1380	t2_cb (EV_P_ ev_timer *w, int revents)
1381	{
1382	struct my_biggy big = (struct my_biggy *)
1383	(((char *)w) - offsetof (struct my_biggy, t2));
1384	}
1385		1369
1386	=head2 WATCHER STATES	1370	=head2 WATCHER STATES
1387		1371
1388	There are various watcher states mentioned throughout this manual -	1372	There are various watcher states mentioned throughout this manual -
1389	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
…		…
1396		1380
1397	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
1398	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
1399	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.
1400		1384
1401	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
1402	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.
1403		1389
1404	=item started/running/active	1390	=item started/running/active
1405		1391
1406	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
1407	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
…		…
1435	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
1436	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
1437	freeing it is often a good idea.	1423	freeing it is often a good idea.
1438		1424
1439	While stopped (and not pending) the watcher is essentially in the	1425	While stopped (and not pending) the watcher is essentially in the
1440	initialised state, that is it can be reused, moved, modified in any way	1426	initialised state, that is, it can be reused, moved, modified in any way
1441	you wish.	1427	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1428	it again).
1442		1429
1443	=back	1430	=back
1444		1431
1445	=head2 WATCHER PRIORITY MODELS	1432	=head2 WATCHER PRIORITY MODELS
1446		1433
…		…
1575	In general you can register as many read and/or write event watchers per	1562	In general you can register as many read and/or write event watchers per
1576	fd as you want (as long as you don't confuse yourself). Setting all file	1563	fd as you want (as long as you don't confuse yourself). Setting all file
1577	descriptors to non-blocking mode is also usually a good idea (but not	1564	descriptors to non-blocking mode is also usually a good idea (but not
1578	required if you know what you are doing).	1565	required if you know what you are doing).
1579		1566
1580	If you cannot use non-blocking mode, then force the use of a
1581	known-to-be-good backend (at the time of this writing, this includes only
1582	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1583	descriptors for which non-blocking operation makes no sense (such as
1584	files) - libev doesn't guarantee any specific behaviour in that case.
1585
1586	Another thing you have to watch out for is that it is quite easy to	1567	Another thing you have to watch out for is that it is quite easy to
1587	receive "spurious" readiness notifications, that is your callback might	1568	receive "spurious" readiness notifications, that is, your callback might
1588	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1569	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1589	because there is no data. Not only are some backends known to create a	1570	because there is no data. It is very easy to get into this situation even
1590	lot of those (for example Solaris ports), it is very easy to get into	1571	with a relatively standard program structure. Thus it is best to always
1591	this situation even with a relatively standard program structure. Thus	1572	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1592	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1593	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1573	preferable to a program hanging until some data arrives.
1594		1574
1595	If you cannot run the fd in non-blocking mode (for example you should	1575	If you cannot run the fd in non-blocking mode (for example you should
1596	not play around with an Xlib connection), then you have to separately	1576	not play around with an Xlib connection), then you have to separately
1597	re-test whether a file descriptor is really ready with a known-to-be good	1577	re-test whether a file descriptor is really ready with a known-to-be good
1598	interface such as poll (fortunately in our Xlib example, Xlib already	1578	interface such as poll (fortunately in the case of Xlib, it already does
1599	does this on its own, so its quite safe to use). Some people additionally	1579	this on its own, so its quite safe to use). Some people additionally
1600	use C<SIGALRM> and an interval timer, just to be sure you won't block	1580	use C<SIGALRM> and an interval timer, just to be sure you won't block
1601	indefinitely.	1581	indefinitely.
1602		1582
1603	But really, best use non-blocking mode.	1583	But really, best use non-blocking mode.
1604		1584
…		…
1632		1612
1633	There is no workaround possible except not registering events	1613	There is no workaround possible except not registering events
1634	for potentially C<dup ()>'ed file descriptors, or to resort to	1614	for potentially C<dup ()>'ed file descriptors, or to resort to
1635	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1615	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1636		1616
		1617	=head3 The special problem of files
		1618
		1619	Many people try to use C<select> (or libev) on file descriptors
		1620	representing files, and expect it to become ready when their program
		1621	doesn't block on disk accesses (which can take a long time on their own).
		1622
		1623	However, this cannot ever work in the "expected" way - you get a readiness
		1624	notification as soon as the kernel knows whether and how much data is
		1625	there, and in the case of open files, that's always the case, so you
		1626	always get a readiness notification instantly, and your read (or possibly
		1627	write) will still block on the disk I/O.
		1628
		1629	Another way to view it is that in the case of sockets, pipes, character
		1630	devices and so on, there is another party (the sender) that delivers data
		1631	on its own, but in the case of files, there is no such thing: the disk
		1632	will not send data on its own, simply because it doesn't know what you
		1633	wish to read - you would first have to request some data.
		1634
		1635	Since files are typically not-so-well supported by advanced notification
		1636	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1637	to files, even though you should not use it. The reason for this is
		1638	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1639	usually a tty, often a pipe, but also sometimes files or special devices
		1640	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1641	F</dev/urandom>), and even though the file might better be served with
		1642	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1643	it "just works" instead of freezing.
		1644
		1645	So avoid file descriptors pointing to files when you know it (e.g. use
		1646	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1647	when you rarely read from a file instead of from a socket, and want to
		1648	reuse the same code path.
		1649
1637	=head3 The special problem of fork	1650	=head3 The special problem of fork
1638		1651
1639	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1652	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1640	useless behaviour. Libev fully supports fork, but needs to be told about	1653	useless behaviour. Libev fully supports fork, but needs to be told about
1641	it in the child.	1654	it in the child if you want to continue to use it in the child.
1642		1655
1643	To support fork in your programs, you either have to call	1656	To support fork in your child processes, you have to call C<ev_loop_fork
1644	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1657	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1645	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1658	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1646	C<EVBACKEND_POLL>.
1647		1659
1648	=head3 The special problem of SIGPIPE	1660	=head3 The special problem of SIGPIPE
1649		1661
1650	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1662	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1651	when writing to a pipe whose other end has been closed, your program gets	1663	when writing to a pipe whose other end has been closed, your program gets
…		…
2141		2153
2142	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
2143	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
2144	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.
2145		2157
2146	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
2147	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
2148	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.
2149		2164
2150	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
2151	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
2152	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
2153	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).
…		…
2296	=head3 The special problem of inheritance over fork/execve/pthread_create	2311	=head3 The special problem of inheritance over fork/execve/pthread_create
2297		2312
2298	Both the signal mask (C<sigprocmask>) and the signal disposition	2313	Both the signal mask (C<sigprocmask>) and the signal disposition
2299	(C<sigaction>) are unspecified after starting a signal watcher (and after	2314	(C<sigaction>) are unspecified after starting a signal watcher (and after
2300	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,
2301	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>).
2302		2318
2303	While this does not matter for the signal disposition (libev never	2319	While this does not matter for the signal disposition (libev never
2304	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
2305	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
2306	certain signals to be blocked.	2322	certain signals to be blocked.
…		…
2319	I<has> to modify the signal mask, at least temporarily.	2335	I<has> to modify the signal mask, at least temporarily.
2320		2336
2321	So I can't stress this enough: I<If you do not reset your signal mask when	2337	So I can't stress this enough: I<If you do not reset your signal mask when
2322	you expect it to be empty, you have a race condition in your code>. This	2338	you expect it to be empty, you have a race condition in your code>. This
2323	is not a libev-specific thing, this is true for most event libraries.	2339	is not a libev-specific thing, this is true for most event libraries.
		2340
		2341	=head3 The special problem of threads signal handling
		2342
		2343	POSIX threads has problematic signal handling semantics, specifically,
		2344	a lot of functionality (sigfd, sigwait etc.) only really works if all
		2345	threads in a process block signals, which is hard to achieve.
		2346
		2347	When you want to use sigwait (or mix libev signal handling with your own
		2348	for the same signals), you can tackle this problem by globally blocking
		2349	all signals before creating any threads (or creating them with a fully set
		2350	sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
		2351	loops. Then designate one thread as "signal receiver thread" which handles
		2352	these signals. You can pass on any signals that libev might be interested
		2353	in by calling C<ev_feed_signal>.
2324		2354
2325	=head3 Watcher-Specific Functions and Data Members	2355	=head3 Watcher-Specific Functions and Data Members
2326		2356
2327	=over 4	2357	=over 4
2328		2358
…		…
3163	atexit (program_exits);	3193	atexit (program_exits);
3164		3194
3165		3195
3166	=head2 C<ev_async> - how to wake up an event loop	3196	=head2 C<ev_async> - how to wake up an event loop
3167		3197
3168	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
3169	asynchronous sources such as signal handlers (as opposed to multiple event	3199	asynchronous sources such as signal handlers (as opposed to multiple event
3170	loops - those are of course safe to use in different threads).	3200	loops - those are of course safe to use in different threads).
3171		3201
3172	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,
3173	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>
…		…
3175	it by calling C<ev_async_send>, which is thread- and signal safe.	3205	it by calling C<ev_async_send>, which is thread- and signal safe.
3176		3206
3177	This functionality is very similar to C<ev_signal> watchers, as signals,	3207	This functionality is very similar to C<ev_signal> watchers, as signals,
3178	too, are asynchronous in nature, and signals, too, will be compressed	3208	too, are asynchronous in nature, and signals, too, will be compressed
3179	(i.e. the number of callback invocations may be less than the number of	3209	(i.e. the number of callback invocations may be less than the number of
3180	C<ev_async_sent> calls).	3210	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
		3211	of "global async watchers" by using a watcher on an otherwise unused
		3212	signal, and C<ev_feed_signal> to signal this watcher from another thread,
		3213	even without knowing which loop owns the signal.
3181		3214
3182	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not	3215	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3183	just the default loop.	3216	just the default loop.
3184		3217
3185	=head3 Queueing	3218	=head3 Queueing
…		…
3280	trust me.	3313	trust me.
3281		3314
3282	=item ev_async_send (loop, ev_async *)	3315	=item ev_async_send (loop, ev_async *)
3283		3316
3284	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
3285	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
3286	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,
3287	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
3288	section below on what exactly this means).	3323	embedding section below on what exactly this means).
3289		3324
3290	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
3291	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
3292	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>,
3293	reset when the event loop detects that).	3328	reset when the event loop detects that).
…		…
3361	Feed an event on the given fd, as if a file descriptor backend detected	3396	Feed an event on the given fd, as if a file descriptor backend detected
3362	the given events it.	3397	the given events it.
3363		3398
3364	=item ev_feed_signal_event (loop, int signum)	3399	=item ev_feed_signal_event (loop, int signum)
3365		3400
3366	Feed an event as if the given signal occurred (C<loop> must be the default	3401	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3367	loop!).	3402	which is async-safe.
3368		3403
3369	=back	3404	=back
3370		3405
3371		3406
3372	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)	3407	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3373		3408
3374	This section explains some common idioms that are not immediately	3409	This section explains some common idioms that are not immediately
3375	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
3376	section only contains stuff that wouldn't fit anywhere else.	3411	section only contains stuff that wouldn't fit anywhere else.
3377		3412
3378	=over 4	3413	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3379		3414
3380	=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
3381		3482
3382	Often (especially in GUI toolkits) there are places where you have	3483	Often (especially in GUI toolkits) there are places where you have
3383	I<modal> interaction, which is most easily implemented by recursively	3484	I<modal> interaction, which is most easily implemented by recursively
3384	invoking C<ev_run>.	3485	invoking C<ev_run>.
3385		3486
…		…
3414	exit_main_loop = 1;	3515	exit_main_loop = 1;
3415		3516
3416	// exit both	3517	// exit both
3417	exit_main_loop = exit_nested_loop = 1;	3518	exit_main_loop = exit_nested_loop = 1;
3418		3519
3419	=back	3520	=head2 THREAD LOCKING EXAMPLE
		3521
		3522	Here is a fictitious example of how to run an event loop in a different
		3523	thread from where callbacks are being invoked and watchers are
		3524	created/added/removed.
		3525
		3526	For a real-world example, see the C<EV::Loop::Async> perl module,
		3527	which uses exactly this technique (which is suited for many high-level
		3528	languages).
		3529
		3530	The example uses a pthread mutex to protect the loop data, a condition
		3531	variable to wait for callback invocations, an async watcher to notify the
		3532	event loop thread and an unspecified mechanism to wake up the main thread.
		3533
		3534	First, you need to associate some data with the event loop:
		3535
		3536	typedef struct {
		3537	mutex_t lock; /* global loop lock */
		3538	ev_async async_w;
		3539	thread_t tid;
		3540	cond_t invoke_cv;
		3541	} userdata;
		3542
		3543	void prepare_loop (EV_P)
		3544	{
		3545	// for simplicity, we use a static userdata struct.
		3546	static userdata u;
		3547
		3548	ev_async_init (&u->async_w, async_cb);
		3549	ev_async_start (EV_A_ &u->async_w);
		3550
		3551	pthread_mutex_init (&u->lock, 0);
		3552	pthread_cond_init (&u->invoke_cv, 0);
		3553
		3554	// now associate this with the loop
		3555	ev_set_userdata (EV_A_ u);
		3556	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3557	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3558
		3559	// then create the thread running ev_run
		3560	pthread_create (&u->tid, 0, l_run, EV_A);
		3561	}
		3562
		3563	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3564	solely to wake up the event loop so it takes notice of any new watchers
		3565	that might have been added:
		3566
		3567	static void
		3568	async_cb (EV_P_ ev_async *w, int revents)
		3569	{
		3570	// just used for the side effects
		3571	}
		3572
		3573	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3574	protecting the loop data, respectively.
		3575
		3576	static void
		3577	l_release (EV_P)
		3578	{
		3579	userdata *u = ev_userdata (EV_A);
		3580	pthread_mutex_unlock (&u->lock);
		3581	}
		3582
		3583	static void
		3584	l_acquire (EV_P)
		3585	{
		3586	userdata *u = ev_userdata (EV_A);
		3587	pthread_mutex_lock (&u->lock);
		3588	}
		3589
		3590	The event loop thread first acquires the mutex, and then jumps straight
		3591	into C<ev_run>:
		3592
		3593	void *
		3594	l_run (void *thr_arg)
		3595	{
		3596	struct ev_loop loop = (struct ev_loop )thr_arg;
		3597
		3598	l_acquire (EV_A);
		3599	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3600	ev_run (EV_A_ 0);
		3601	l_release (EV_A);
		3602
		3603	return 0;
		3604	}
		3605
		3606	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3607	signal the main thread via some unspecified mechanism (signals? pipe
		3608	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3609	have been called (in a while loop because a) spurious wakeups are possible
		3610	and b) skipping inter-thread-communication when there are no pending
		3611	watchers is very beneficial):
		3612
		3613	static void
		3614	l_invoke (EV_P)
		3615	{
		3616	userdata *u = ev_userdata (EV_A);
		3617
		3618	while (ev_pending_count (EV_A))
		3619	{
		3620	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3621	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3622	}
		3623	}
		3624
		3625	Now, whenever the main thread gets told to invoke pending watchers, it
		3626	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3627	thread to continue:
		3628
		3629	static void
		3630	real_invoke_pending (EV_P)
		3631	{
		3632	userdata *u = ev_userdata (EV_A);
		3633
		3634	pthread_mutex_lock (&u->lock);
		3635	ev_invoke_pending (EV_A);
		3636	pthread_cond_signal (&u->invoke_cv);
		3637	pthread_mutex_unlock (&u->lock);
		3638	}
		3639
		3640	Whenever you want to start/stop a watcher or do other modifications to an
		3641	event loop, you will now have to lock:
		3642
		3643	ev_timer timeout_watcher;
		3644	userdata *u = ev_userdata (EV_A);
		3645
		3646	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3647
		3648	pthread_mutex_lock (&u->lock);
		3649	ev_timer_start (EV_A_ &timeout_watcher);
		3650	ev_async_send (EV_A_ &u->async_w);
		3651	pthread_mutex_unlock (&u->lock);
		3652
		3653	Note that sending the C<ev_async> watcher is required because otherwise
		3654	an event loop currently blocking in the kernel will have no knowledge
		3655	about the newly added timer. By waking up the loop it will pick up any new
		3656	watchers in the next event loop iteration.
		3657
		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.
3420		3715
3421		3716
3422	=head1 LIBEVENT EMULATION	3717	=head1 LIBEVENT EMULATION
3423		3718
3424	Libev offers a compatibility emulation layer for libevent. It cannot	3719	Libev offers a compatibility emulation layer for libevent. It cannot
…		…
3914	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.
3915		4210
3916	In standalone mode, libev will still try to automatically deduce the	4211	In standalone mode, libev will still try to automatically deduce the
3917	configuration, but has to be more conservative.	4212	configuration, but has to be more conservative.
3918		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
3919	=item EV_USE_MONOTONIC	4223	=item EV_USE_MONOTONIC
3920		4224
3921	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
3922	monotonic clock option at both compile time and runtime. Otherwise no	4226	monotonic clock option at both compile time and runtime. Otherwise no
3923	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,
…		…
4354	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:
4355		4659
4356	#include "ev_cpp.h"	4660	#include "ev_cpp.h"
4357	#include "ev.c"	4661	#include "ev.c"
4358		4662
4359	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4663	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4360		4664
4361	=head2 THREADS AND COROUTINES	4665	=head2 THREADS AND COROUTINES
4362		4666
4363	=head3 THREADS	4667	=head3 THREADS
4364		4668
…		…
4415	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
4416	watcher callback into the event loop interested in the signal.	4720	watcher callback into the event loop interested in the signal.
4417		4721
4418	=back	4722	=back
4419		4723
4420	=head4 THREAD LOCKING EXAMPLE	4724	See also L<THREAD LOCKING EXAMPLE>.
4421
4422	Here is a fictitious example of how to run an event loop in a different
4423	thread than where callbacks are being invoked and watchers are
4424	created/added/removed.
4425
4426	For a real-world example, see the C<EV::Loop::Async> perl module,
4427	which uses exactly this technique (which is suited for many high-level
4428	languages).
4429
4430	The example uses a pthread mutex to protect the loop data, a condition
4431	variable to wait for callback invocations, an async watcher to notify the
4432	event loop thread and an unspecified mechanism to wake up the main thread.
4433
4434	First, you need to associate some data with the event loop:
4435
4436	typedef struct {
4437	mutex_t lock; /* global loop lock */
4438	ev_async async_w;
4439	thread_t tid;
4440	cond_t invoke_cv;
4441	} userdata;
4442
4443	void prepare_loop (EV_P)
4444	{
4445	// for simplicity, we use a static userdata struct.
4446	static userdata u;
4447
4448	ev_async_init (&u->async_w, async_cb);
4449	ev_async_start (EV_A_ &u->async_w);
4450
4451	pthread_mutex_init (&u->lock, 0);
4452	pthread_cond_init (&u->invoke_cv, 0);
4453
4454	// now associate this with the loop
4455	ev_set_userdata (EV_A_ u);
4456	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4457	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4458
4459	// then create the thread running ev_loop
4460	pthread_create (&u->tid, 0, l_run, EV_A);
4461	}
4462
4463	The callback for the C<ev_async> watcher does nothing: the watcher is used
4464	solely to wake up the event loop so it takes notice of any new watchers
4465	that might have been added:
4466
4467	static void
4468	async_cb (EV_P_ ev_async *w, int revents)
4469	{
4470	// just used for the side effects
4471	}
4472
4473	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4474	protecting the loop data, respectively.
4475
4476	static void
4477	l_release (EV_P)
4478	{
4479	userdata *u = ev_userdata (EV_A);
4480	pthread_mutex_unlock (&u->lock);
4481	}
4482
4483	static void
4484	l_acquire (EV_P)
4485	{
4486	userdata *u = ev_userdata (EV_A);
4487	pthread_mutex_lock (&u->lock);
4488	}
4489
4490	The event loop thread first acquires the mutex, and then jumps straight
4491	into C<ev_run>:
4492
4493	void *
4494	l_run (void *thr_arg)
4495	{
4496	struct ev_loop loop = (struct ev_loop )thr_arg;
4497
4498	l_acquire (EV_A);
4499	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4500	ev_run (EV_A_ 0);
4501	l_release (EV_A);
4502
4503	return 0;
4504	}
4505
4506	Instead of invoking all pending watchers, the C<l_invoke> callback will
4507	signal the main thread via some unspecified mechanism (signals? pipe
4508	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4509	have been called (in a while loop because a) spurious wakeups are possible
4510	and b) skipping inter-thread-communication when there are no pending
4511	watchers is very beneficial):
4512
4513	static void
4514	l_invoke (EV_P)
4515	{
4516	userdata *u = ev_userdata (EV_A);
4517
4518	while (ev_pending_count (EV_A))
4519	{
4520	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4521	pthread_cond_wait (&u->invoke_cv, &u->lock);
4522	}
4523	}
4524
4525	Now, whenever the main thread gets told to invoke pending watchers, it
4526	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4527	thread to continue:
4528
4529	static void
4530	real_invoke_pending (EV_P)
4531	{
4532	userdata *u = ev_userdata (EV_A);
4533
4534	pthread_mutex_lock (&u->lock);
4535	ev_invoke_pending (EV_A);
4536	pthread_cond_signal (&u->invoke_cv);
4537	pthread_mutex_unlock (&u->lock);
4538	}
4539
4540	Whenever you want to start/stop a watcher or do other modifications to an
4541	event loop, you will now have to lock:
4542
4543	ev_timer timeout_watcher;
4544	userdata *u = ev_userdata (EV_A);
4545
4546	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4547
4548	pthread_mutex_lock (&u->lock);
4549	ev_timer_start (EV_A_ &timeout_watcher);
4550	ev_async_send (EV_A_ &u->async_w);
4551	pthread_mutex_unlock (&u->lock);
4552
4553	Note that sending the C<ev_async> watcher is required because otherwise
4554	an event loop currently blocking in the kernel will have no knowledge
4555	about the newly added timer. By waking up the loop it will pick up any new
4556	watchers in the next event loop iteration.
4557		4725
4558	=head3 COROUTINES	4726	=head3 COROUTINES
4559		4727
4560	Libev is very accommodating to coroutines ("cooperative threads"):	4728	Libev is very accommodating to coroutines ("cooperative threads"):
4561	libev fully supports nesting calls to its functions from different	4729	libev fully supports nesting calls to its functions from different
…		…
5070	The physical time that is observed. It is apparently strictly monotonic :)	5238	The physical time that is observed. It is apparently strictly monotonic :)
5071		5239
5072	=item wall-clock time	5240	=item wall-clock time
5073		5241
5074	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
5075	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
5076	clock.	5244	clock.
5077		5245
5078	=item watcher	5246	=item watcher
5079		5247
5080	A data structure that describes interest in certain events. Watchers need	5248	A data structure that describes interest in certain events. Watchers need
…		…
5083	=back	5251	=back
5084		5252
5085	=head1 AUTHOR	5253	=head1 AUTHOR
5086		5254
5087	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael	5255	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5088	Magnusson and Emanuele Giaquinta.	5256	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5089		5257

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.347 by sf-exg, Wed Nov 10 19:50:09 2010 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.347 by sf-exg, Wed Nov 10 19:50:09 2010 UTC vs.
Revision 1.369 by root, Mon May 30 18:34:28 2011 UTC