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

Comparing libev/ev.pod (file contents):
Revision 1.237 by root, Thu Apr 16 07:58:03 2009 UTC vs.
Revision 1.241 by root, Sat Apr 25 14:23:26 2009 UTC

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)
3899way (note also that glib is the slowest event library known to man). 3935way (note also that glib is the slowest event library known to man).
3900 3936
3901There is no supported compilation method available on windows except 3937There is no supported compilation method available on windows except
3902embedding it into other applications. 3938embedding it into other applications.
3903 3939
3940Sensible signal handling is officially unsupported by Microsoft - libev
3941tries its best, but under most conditions, signals will simply not work.
3942
3904Not a libev limitation but worth mentioning: windows apparently doesn't 3943Not a libev limitation but worth mentioning: windows apparently doesn't
3905accept large writes: instead of resulting in a partial write, windows will 3944accept large writes: instead of resulting in a partial write, windows will
3906either accept everything or return C<ENOBUFS> if the buffer is too large, 3945either accept everything or return C<ENOBUFS> if the buffer is too large,
3907so make sure you only write small amounts into your sockets (less than a 3946so make sure you only write small amounts into your sockets (less than a
3908megabyte seems safe, but this apparently depends on the amount of memory 3947megabyte seems safe, but this apparently depends on the amount of memory
3912the abysmal performance of winsockets, using a large number of sockets 3951the abysmal performance of winsockets, using a large number of sockets
3913is not recommended (and not reasonable). If your program needs to use 3952is not recommended (and not reasonable). If your program needs to use
3914more than a hundred or so sockets, then likely it needs to use a totally 3953more than a hundred or so sockets, then likely it needs to use a totally
3915different implementation for windows, as libev offers the POSIX readiness 3954different implementation for windows, as libev offers the POSIX readiness
3916notification model, which cannot be implemented efficiently on windows 3955notification model, which cannot be implemented efficiently on windows
3917(Microsoft monopoly games). 3956(due to Microsoft monopoly games).
3918 3957
3919A typical way to use libev under windows is to embed it (see the embedding 3958A typical way to use libev under windows is to embed it (see the embedding
3920section for details) and use the following F<evwrap.h> header file instead 3959section for details) and use the following F<evwrap.h> header file instead
3921of F<ev.h>: 3960of F<ev.h>:
3922 3961
3958 3997
3959Early versions of winsocket's select only supported waiting for a maximum 3998Early versions of winsocket's select only supported waiting for a maximum
3960of C<64> handles (probably owning to the fact that all windows kernels 3999of C<64> handles (probably owning to the fact that all windows kernels
3961can only wait for C<64> things at the same time internally; Microsoft 4000can only wait for C<64> things at the same time internally; Microsoft
3962recommends spawning a chain of threads and wait for 63 handles and the 4001recommends spawning a chain of threads and wait for 63 handles and the
3963previous thread in each. Great). 4002previous thread in each. Sounds great!).
3964 4003
3965Newer versions support more handles, but you need to define C<FD_SETSIZE> 4004Newer versions support more handles, but you need to define C<FD_SETSIZE>
3966to some high number (e.g. C<2048>) before compiling the winsocket select 4005to some high number (e.g. C<2048>) before compiling the winsocket select
3967call (which might be in libev or elsewhere, for example, perl does its own 4006call (which might be in libev or elsewhere, for example, perl and many
3968select emulation on windows). 4007other interpreters do their own select emulation on windows).
3969 4008
3970Another limit is the number of file descriptors in the Microsoft runtime 4009Another limit is the number of file descriptors in the Microsoft runtime
3971libraries, which by default is C<64> (there must be a hidden I<64> fetish 4010libraries, which by default is C<64> (there must be a hidden I<64>
3972or something like this inside Microsoft). You can increase this by calling 4011fetish or something like this inside Microsoft). You can increase this
3973C<_setmaxstdio>, which can increase this limit to C<2048> (another 4012by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3974arbitrary limit), but is broken in many versions of the Microsoft runtime 4013(another arbitrary limit), but is broken in many versions of the Microsoft
3975libraries.
3976
3977This might get you to about C<512> or C<2048> sockets (depending on 4014runtime libraries. This might get you to about C<512> or C<2048> sockets
3978windows version and/or the phase of the moon). To get more, you need to 4015(depending on windows version and/or the phase of the moon). To get more,
3979wrap all I/O functions and provide your own fd management, but the cost of 4016you need to wrap all I/O functions and provide your own fd management, but
3980calling select (O(n²)) will likely make this unworkable. 4017the cost of calling select (O(n²)) will likely make this unworkable.
3981 4018
3982=back 4019=back
3983 4020
3984=head2 PORTABILITY REQUIREMENTS 4021=head2 PORTABILITY REQUIREMENTS
3985 4022

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines