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

Comparing libev/ev.pod (file contents):
Revision 1.100 by root, Sat Dec 22 11:49:17 2007 UTC vs.
Revision 1.105 by root, Sun Dec 23 03:50:10 2007 UTC

4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 #include <ev.h> 7 #include <ev.h>
8 8
9=head1 EXAMPLE PROGRAM 9=head2 EXAMPLE PROGRAM
10 10
11 #include <ev.h> 11 #include <ev.h>
12 12
13 ev_io stdin_watcher; 13 ev_io stdin_watcher;
14 ev_timer timeout_watcher; 14 ev_timer timeout_watcher;
65You register interest in certain events by registering so-called I<event 65You register interest in certain events by registering so-called I<event
66watchers>, which are relatively small C structures you initialise with the 66watchers>, which are relatively small C structures you initialise with the
67details of the event, and then hand it over to libev by I<starting> the 67details of the event, and then hand it over to libev by I<starting> the
68watcher. 68watcher.
69 69
70=head1 FEATURES 70=head2 FEATURES
71 71
72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
74for file descriptor events (C<ev_io>), the Linux C<inotify> interface 74for file descriptor events (C<ev_io>), the Linux C<inotify> interface
75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
82 82
83It also is quite fast (see this 83It also is quite fast (see this
84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
85for example). 85for example).
86 86
87=head1 CONVENTIONS 87=head2 CONVENTIONS
88 88
89Libev is very configurable. In this manual the default configuration will 89Libev is very configurable. In this manual the default configuration will
90be described, which supports multiple event loops. For more info about 90be described, which supports multiple event loops. For more info about
91various configuration options please have a look at B<EMBED> section in 91various configuration options please have a look at B<EMBED> section in
92this manual. If libev was configured without support for multiple event 92this manual. If libev was configured without support for multiple event
93loops, then all functions taking an initial argument of name C<loop> 93loops, then all functions taking an initial argument of name C<loop>
94(which is always of type C<struct ev_loop *>) will not have this argument. 94(which is always of type C<struct ev_loop *>) will not have this argument.
95 95
96=head1 TIME REPRESENTATION 96=head2 TIME REPRESENTATION
97 97
98Libev represents time as a single floating point number, representing the 98Libev represents time as a single floating point number, representing the
99(fractional) number of seconds since the (POSIX) epoch (somewhere near 99(fractional) number of seconds since the (POSIX) epoch (somewhere near
100the beginning of 1970, details are complicated, don't ask). This type is 100the beginning of 1970, details are complicated, don't ask). This type is
101called C<ev_tstamp>, which is what you should use too. It usually aliases 101called C<ev_tstamp>, which is what you should use too. It usually aliases
306=item C<EVBACKEND_SELECT> (value 1, portable select backend) 306=item C<EVBACKEND_SELECT> (value 1, portable select backend)
307 307
308This is your standard select(2) backend. Not I<completely> standard, as 308This is your standard select(2) backend. Not I<completely> standard, as
309libev tries to roll its own fd_set with no limits on the number of fds, 309libev tries to roll its own fd_set with no limits on the number of fds,
310but if that fails, expect a fairly low limit on the number of fds when 310but if that fails, expect a fairly low limit on the number of fds when
311using this backend. It doesn't scale too well (O(highest_fd)), but its usually 311using this backend. It doesn't scale too well (O(highest_fd)), but its
312the fastest backend for a low number of fds. 312usually the fastest backend for a low number of (low-numbered :) fds.
313
314To get good performance out of this backend you need a high amount of
315parallelity (most of the file descriptors should be busy). If you are
316writing a server, you should C<accept ()> in a loop to accept as many
317connections as possible during one iteration. You might also want to have
318a look at C<ev_set_io_collect_interval ()> to increase the amount of
319readyness notifications you get per iteration.
313 320
314=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) 321=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
315 322
316And this is your standard poll(2) backend. It's more complicated than 323And this is your standard poll(2) backend. It's more complicated
317select, but handles sparse fds better and has no artificial limit on the 324than select, but handles sparse fds better and has no artificial
318number of fds you can use (except it will slow down considerably with a 325limit on the number of fds you can use (except it will slow down
319lot of inactive fds). It scales similarly to select, i.e. O(total_fds). 326considerably with a lot of inactive fds). It scales similarly to select,
327i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
328performance tips.
320 329
321=item C<EVBACKEND_EPOLL> (value 4, Linux) 330=item C<EVBACKEND_EPOLL> (value 4, Linux)
322 331
323For few fds, this backend is a bit little slower than poll and select, 332For few fds, this backend is a bit little slower than poll and select,
324but it scales phenomenally better. While poll and select usually scale 333but it scales phenomenally better. While poll and select usually scale
325like O(total_fds) where n is the total number of fds (or the highest fd), 334like O(total_fds) where n is the total number of fds (or the highest fd),
326epoll scales either O(1) or O(active_fds). The epoll design has a number 335epoll scales either O(1) or O(active_fds). The epoll design has a number
327of shortcomings, such as silently dropping events in some hard-to-detect 336of shortcomings, such as silently dropping events in some hard-to-detect
328cases and rewiring a syscall per fd change, no fork support and bad 337cases and rewiring a syscall per fd change, no fork support and bad
329support for dup: 338support for dup.
330 339
331While stopping, setting and starting an I/O watcher in the same iteration 340While stopping, setting and starting an I/O watcher in the same iteration
332will result in some caching, there is still a syscall per such incident 341will result in some caching, there is still a syscall per such incident
333(because the fd could point to a different file description now), so its 342(because the fd could point to a different file description now), so its
334best to avoid that. Also, C<dup ()>'ed file descriptors might not work 343best to avoid that. Also, C<dup ()>'ed file descriptors might not work
335very well if you register events for both fds. 344very well if you register events for both fds.
336 345
337Please note that epoll sometimes generates spurious notifications, so you 346Please note that epoll sometimes generates spurious notifications, so you
338need to use non-blocking I/O or other means to avoid blocking when no data 347need to use non-blocking I/O or other means to avoid blocking when no data
339(or space) is available. 348(or space) is available.
349
350Best performance from this backend is achieved by not unregistering all
351watchers for a file descriptor until it has been closed, if possible, i.e.
352keep at least one watcher active per fd at all times.
353
354While nominally embeddeble in other event loops, this feature is broken in
355all kernel versions tested so far.
340 356
341=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 357=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
342 358
343Kqueue deserves special mention, as at the time of this writing, it 359Kqueue deserves special mention, as at the time of this writing, it
344was broken on all BSDs except NetBSD (usually it doesn't work reliably 360was broken on all BSDs except NetBSD (usually it doesn't work reliably
357course). While stopping, setting and starting an I/O watcher does never 373course). While stopping, setting and starting an I/O watcher does never
358cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to 374cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
359two event changes per incident, support for C<fork ()> is very bad and it 375two event changes per incident, support for C<fork ()> is very bad and it
360drops fds silently in similarly hard-to-detect cases. 376drops fds silently in similarly hard-to-detect cases.
361 377
378This backend usually performs well under most conditions.
379
380While nominally embeddable in other event loops, this doesn't work
381everywhere, so you might need to test for this. And since it is broken
382almost everywhere, you should only use it when you have a lot of sockets
383(for which it usually works), by embedding it into another event loop
384(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for
385sockets.
386
362=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 387=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
363 388
364This is not implemented yet (and might never be). 389This is not implemented yet (and might never be, unless you send me an
390implementation). According to reports, C</dev/poll> only supports sockets
391and is not embeddable, which would limit the usefulness of this backend
392immensely.
365 393
366=item C<EVBACKEND_PORT> (value 32, Solaris 10) 394=item C<EVBACKEND_PORT> (value 32, Solaris 10)
367 395
368This uses the Solaris 10 event port mechanism. As with everything on Solaris, 396This uses the Solaris 10 event port mechanism. As with everything on Solaris,
369it's really slow, but it still scales very well (O(active_fds)). 397it's really slow, but it still scales very well (O(active_fds)).
370 398
371Please note that solaris event ports can deliver a lot of spurious 399Please note that solaris event ports can deliver a lot of spurious
372notifications, so you need to use non-blocking I/O or other means to avoid 400notifications, so you need to use non-blocking I/O or other means to avoid
373blocking when no data (or space) is available. 401blocking when no data (or space) is available.
374 402
403While this backend scales well, it requires one system call per active
404file descriptor per loop iteration. For small and medium numbers of file
405descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
406might perform better.
407
375=item C<EVBACKEND_ALL> 408=item C<EVBACKEND_ALL>
376 409
377Try all backends (even potentially broken ones that wouldn't be tried 410Try all backends (even potentially broken ones that wouldn't be tried
378with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 411with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
379C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 412C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
413
414It is definitely not recommended to use this flag.
380 415
381=back 416=back
382 417
383If one or more of these are ored into the flags value, then only these 418If one or more of these are ored into the flags value, then only these
384backends will be tried (in the reverse order as given here). If none are 419backends will be tried (in the reverse order as given here). If none are
599overhead for the actual polling but can deliver many events at once. 634overhead for the actual polling but can deliver many events at once.
600 635
601By setting a higher I<io collect interval> you allow libev to spend more 636By setting a higher I<io collect interval> you allow libev to spend more
602time collecting I/O events, so you can handle more events per iteration, 637time collecting I/O events, so you can handle more events per iteration,
603at the cost of increasing latency. Timeouts (both C<ev_periodic> and 638at the cost of increasing latency. Timeouts (both C<ev_periodic> and
604C<ev_timer>) will be not affected. Setting this to a non-null bvalue will 639C<ev_timer>) will be not affected. Setting this to a non-null value will
605introduce an additional C<ev_sleep ()> call into most loop iterations. 640introduce an additional C<ev_sleep ()> call into most loop iterations.
606 641
607Likewise, by setting a higher I<timeout collect interval> you allow libev 642Likewise, by setting a higher I<timeout collect interval> you allow libev
608to spend more time collecting timeouts, at the expense of increased 643to spend more time collecting timeouts, at the expense of increased
609latency (the watcher callback will be called later). C<ev_io> watchers 644latency (the watcher callback will be called later). C<ev_io> watchers
997optimisations to libev. 1032optimisations to libev.
998 1033
999=head3 The special problem of dup'ed file descriptors 1034=head3 The special problem of dup'ed file descriptors
1000 1035
1001Some backends (e.g. epoll), cannot register events for file descriptors, 1036Some backends (e.g. epoll), cannot register events for file descriptors,
1002but only events for the underlying file descriptions. That menas when you 1037but only events for the underlying file descriptions. That means when you
1003have C<dup ()>'ed file descriptors and register events for them, only one 1038have C<dup ()>'ed file descriptors and register events for them, only one
1004file descriptor might actually receive events. 1039file descriptor might actually receive events.
1005 1040
1006There is no workaorund possible except not registering events 1041There is no workaround possible except not registering events
1007for potentially C<dup ()>'ed file descriptors or to resort to 1042for potentially C<dup ()>'ed file descriptors, or to resort to
1008C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1043C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1009 1044
1010=head3 The special problem of fork 1045=head3 The special problem of fork
1011 1046
1012Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1047Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
2491than enough. If you need to manage thousands of children you might want to 2526than enough. If you need to manage thousands of children you might want to
2492increase this value (I<must> be a power of two). 2527increase this value (I<must> be a power of two).
2493 2528
2494=item EV_INOTIFY_HASHSIZE 2529=item EV_INOTIFY_HASHSIZE
2495 2530
2496C<ev_staz> watchers use a small hash table to distribute workload by 2531C<ev_stat> watchers use a small hash table to distribute workload by
2497inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 2532inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2498usually more than enough. If you need to manage thousands of C<ev_stat> 2533usually more than enough. If you need to manage thousands of C<ev_stat>
2499watchers you might want to increase this value (I<must> be a power of 2534watchers you might want to increase this value (I<must> be a power of
2500two). 2535two).
2501 2536

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines