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

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

122name 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
123this argument. 123this argument.
124 124
125=head2 TIME REPRESENTATION 125=head2 TIME REPRESENTATION
126 126
127Libev represents time as a single floating point number, representing the 127Libev represents time as a single floating point number, representing
128(fractional) number of seconds since the (POSIX) epoch (somewhere near 128the (fractional) number of seconds since the (POSIX) epoch (somewhere
129the beginning of 1970, details are complicated, don't ask). This type is 129near the beginning of 1970, details are complicated, don't ask). This
130called 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
131to 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
132it, 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
133component C<stamp> might indicate, it is also used for time differences 133component C<stamp> might indicate, it is also used for time differences
134throughout libev. 134throughout libev.
135 135
136=head1 ERROR HANDLING 136=head1 ERROR HANDLING
137 137
644 644
645This 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
646very 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
647the current time is a good idea. 647the current time is a good idea.
648 648
649See 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.
650 650
651=item ev_suspend (loop) 651=item ev_suspend (loop)
652 652
653=item ev_resume (loop) 653=item ev_resume (loop)
654 654
1332descriptors 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
1333required if you know what you are doing). 1333required if you know what you are doing).
1334 1334
1335If 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
1336known-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
1337C<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.
1338 1340
1339Another 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
1340receive "spurious" readiness notifications, that is your callback might 1342receive "spurious" readiness notifications, that is your callback might
1341be 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
1342because 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
1463year, it will still time out after (roughly) one hour. "Roughly" because 1465year, it will still time out after (roughly) one hour. "Roughly" because
1464detecting time jumps is hard, and some inaccuracies are unavoidable (the 1466detecting time jumps is hard, and some inaccuracies are unavoidable (the
1465monotonic clock option helps a lot here). 1467monotonic clock option helps a lot here).
1466 1468
1467The 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
1468passed. If multiple timers become ready during the same loop iteration 1470passed (not I<at>, so on systems with very low-resolution clocks this
1469then 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
1470later 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
1471C<ev_loop> recursively). 1474callback calls C<ev_loop> recursively).
1472 1475
1473=head3 Be smart about timeouts 1476=head3 Be smart about timeouts
1474 1477
1475Many real-world problems involve some kind of timeout, usually for error 1478Many real-world problems involve some kind of timeout, usually for error
1476recovery. 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,
2708event 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,
2709and 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
2710C<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
2711handlers will be invoked, too, of course. 2714handlers will be invoked, too, of course.
2712 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
2713=head3 Watcher-Specific Functions and Data Members 2749=head3 Watcher-Specific Functions and Data Members
2714 2750
2715=over 4 2751=over 4
2716 2752
2717=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