ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
(Generate patch)

Comparing libev/ev.pod (file contents):
Revision 1.235 by root, Thu Apr 16 07:50:39 2009 UTC vs.
Revision 1.240 by root, Sat Apr 25 14:12:48 2009 UTC

62 62
63 // unloop was called, so exit 63 // unloop was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
67=head1 DESCRIPTION 67=head1 ABOUT THIS DOCUMENT
68
69This document documents the libev software package.
68 70
69The newest version of this document is also available as an html-formatted 71The newest version of this document is also available as an html-formatted
70web page you might find easier to navigate when reading it for the first 72web page you might find easier to navigate when reading it for the first
71time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>. 73time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
74
75While this document tries to be as complete as possible in documenting
76libev, its usage and the rationale behind its design, it is not a tutorial
77on event-based programming, nor will it introduce event-based programming
78with libev.
79
80Familarity with event based programming techniques in general is assumed
81throughout this document.
82
83=head1 ABOUT LIBEV
72 84
73Libev is an event loop: you register interest in certain events (such as a 85Libev is an event loop: you register interest in certain events (such as a
74file descriptor being readable or a timeout occurring), and it will manage 86file descriptor being readable or a timeout occurring), and it will manage
75these event sources and provide your program with events. 87these event sources and provide your program with events.
76 88
110name C<loop> (which is always of type C<ev_loop *>) will not have 122name C<loop> (which is always of type C<ev_loop *>) will not have
111this argument. 123this argument.
112 124
113=head2 TIME REPRESENTATION 125=head2 TIME REPRESENTATION
114 126
115Libev represents time as a single floating point number, representing the 127Libev represents time as a single floating point number, representing
116(fractional) number of seconds since the (POSIX) epoch (somewhere near 128the (fractional) number of seconds since the (POSIX) epoch (somewhere
117the beginning of 1970, details are complicated, don't ask). This type is 129near the beginning of 1970, details are complicated, don't ask). This
118called C<ev_tstamp>, which is what you should use too. It usually aliases 130type is called C<ev_tstamp>, which is what you should use too. It usually
119to the C<double> type in C, and when you need to do any calculations on 131aliases to the C<double> type in C. When you need to do any calculations
120it, you should treat it as some floating point value. Unlike the name 132on it, you should treat it as some floating point value. Unlike the name
121component C<stamp> might indicate, it is also used for time differences 133component C<stamp> might indicate, it is also used for time differences
122throughout libev. 134throughout libev.
123 135
124=head1 ERROR HANDLING 136=head1 ERROR HANDLING
125 137
632 644
633This function is rarely useful, but when some event callback runs for a 645This function is rarely useful, but when some event callback runs for a
634very long time without entering the event loop, updating libev's idea of 646very long time without entering the event loop, updating libev's idea of
635the current time is a good idea. 647the current time is a good idea.
636 648
637See also "The special problem of time updates" in the C<ev_timer> section. 649See also L<The special problem of time updates> in the C<ev_timer> section.
638 650
639=item ev_suspend (loop) 651=item ev_suspend (loop)
640 652
641=item ev_resume (loop) 653=item ev_resume (loop)
642 654
1320descriptors to non-blocking mode is also usually a good idea (but not 1332descriptors to non-blocking mode is also usually a good idea (but not
1321required if you know what you are doing). 1333required if you know what you are doing).
1322 1334
1323If you cannot use non-blocking mode, then force the use of a 1335If you cannot use non-blocking mode, then force the use of a
1324known-to-be-good backend (at the time of this writing, this includes only 1336known-to-be-good backend (at the time of this writing, this includes only
1325C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1337C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1338descriptors for which non-blocking operation makes no sense (such as
1339files) - libev doesn't guarentee any specific behaviour in that case.
1326 1340
1327Another thing you have to watch out for is that it is quite easy to 1341Another thing you have to watch out for is that it is quite easy to
1328receive "spurious" readiness notifications, that is your callback might 1342receive "spurious" readiness notifications, that is your callback might
1329be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1343be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1330because there is no data. Not only are some backends known to create a 1344because there is no data. Not only are some backends known to create a
1451year, it will still time out after (roughly) one hour. "Roughly" because 1465year, it will still time out after (roughly) one hour. "Roughly" because
1452detecting time jumps is hard, and some inaccuracies are unavoidable (the 1466detecting time jumps is hard, and some inaccuracies are unavoidable (the
1453monotonic clock option helps a lot here). 1467monotonic clock option helps a lot here).
1454 1468
1455The callback is guaranteed to be invoked only I<after> its timeout has 1469The callback is guaranteed to be invoked only I<after> its timeout has
1456passed. If multiple timers become ready during the same loop iteration 1470passed (not I<at>, so on systems with very low-resolution clocks this
1457then the ones with earlier time-out values are invoked before ones with 1471might introduce a small delay). If multiple timers become ready during the
1472same loop iteration then the ones with earlier time-out values are invoked
1458later time-out values (but this is no longer true when a callback calls 1473before ones with later time-out values (but this is no longer true when a
1459C<ev_loop> recursively). 1474callback calls C<ev_loop> recursively).
1460 1475
1461=head3 Be smart about timeouts 1476=head3 Be smart about timeouts
1462 1477
1463Many real-world problems involve some kind of timeout, usually for error 1478Many real-world problems involve some kind of timeout, usually for error
1464recovery. A typical example is an HTTP request - if the other side hangs, 1479recovery. A typical example is an HTTP request - if the other side hangs,
2696event loop blocks next and before C<ev_check> watchers are being called, 2711event loop blocks next and before C<ev_check> watchers are being called,
2697and only in the child after the fork. If whoever good citizen calling 2712and only in the child after the fork. If whoever good citizen calling
2698C<ev_default_fork> cheats and calls it in the wrong process, the fork 2713C<ev_default_fork> cheats and calls it in the wrong process, the fork
2699handlers will be invoked, too, of course. 2714handlers will be invoked, too, of course.
2700 2715
2716=head3 The special problem of life after fork - how is it possible?
2717
2718Most uses of C<fork()> consist of forking, then some simple calls to ste
2719up/change the process environment, followed by a call to C<exec()>. This
2720sequence should be handled by libev without any problems.
2721
2722This changes when the application actually wants to do event handling
2723in the child, or both parent in child, in effect "continuing" after the
2724fork.
2725
2726The default mode of operation (for libev, with application help to detect
2727forks) is to duplicate all the state in the child, as would be expected
2728when I<either> the parent I<or> the child process continues.
2729
2730When both processes want to continue using libev, then this is usually the
2731wrong result. In that case, usually one process (typically the parent) is
2732supposed to continue with all watchers in place as before, while the other
2733process typically wants to start fresh, i.e. without any active watchers.
2734
2735The cleanest and most efficient way to achieve that with libev is to
2736simply create a new event loop, which of course will be "empty", and
2737use that for new watchers. This has the advantage of not touching more
2738memory than necessary, and thus avoiding the copy-on-write, and the
2739disadvantage of having to use multiple event loops (which do not support
2740signal watchers).
2741
2742When this is not possible, or you want to use the default loop for
2743other reasons, then in the process that wants to start "fresh", call
2744C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying
2745the default loop will "orphan" (not stop) all registered watchers, so you
2746have to be careful not to execute code that modifies those watchers. Note
2747also that in that case, you have to re-register any signal watchers.
2748
2701=head3 Watcher-Specific Functions and Data Members 2749=head3 Watcher-Specific Functions and Data Members
2702 2750
2703=over 4 2751=over 4
2704 2752
2705=item ev_fork_init (ev_signal *, callback) 2753=item ev_fork_init (ev_signal *, callback)

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines