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

Comparing libev/ev.pod (file contents):
Revision 1.83 by root, Wed Dec 12 17:55:31 2007 UTC vs.
Revision 1.106 by root, Sun Dec 23 03:57:55 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;
53The newest version of this document is also available as a html-formatted 53The newest version of this document is also available as a html-formatted
54web page you might find easier to navigate when reading it for the first 54web page you might find easier to navigate when reading it for the first
55time: L<http://cvs.schmorp.de/libev/ev.html>. 55time: L<http://cvs.schmorp.de/libev/ev.html>.
56 56
57Libev is an event loop: you register interest in certain events (such as a 57Libev is an event loop: you register interest in certain events (such as a
58file descriptor being readable or a timeout occuring), and it will manage 58file descriptor being readable or a timeout occurring), and it will manage
59these event sources and provide your program with events. 59these event sources and provide your program with events.
60 60
61To do this, it must take more or less complete control over your process 61To do this, it must take more or less complete control over your process
62(or thread) by executing the I<event loop> handler, and will then 62(or thread) by executing the I<event loop> handler, and will then
63communicate events via a callback mechanism. 63communicate events via a callback mechanism.
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
102to the C<double> type in C, and when you need to do any calculations on 102to the C<double> type in C, and when you need to do any calculations on
103it, you should treat it as such. 103it, you should treat it as some floatingpoint value. Unlike the name
104component C<stamp> might indicate, it is also used for time differences
105throughout libev.
104 106
105=head1 GLOBAL FUNCTIONS 107=head1 GLOBAL FUNCTIONS
106 108
107These functions can be called anytime, even before initialising the 109These functions can be called anytime, even before initialising the
108library in any way. 110library in any way.
112=item ev_tstamp ev_time () 114=item ev_tstamp ev_time ()
113 115
114Returns the current time as libev would use it. Please note that the 116Returns the current time as libev would use it. Please note that the
115C<ev_now> function is usually faster and also often returns the timestamp 117C<ev_now> function is usually faster and also often returns the timestamp
116you actually want to know. 118you actually want to know.
119
120=item ev_sleep (ev_tstamp interval)
121
122Sleep for the given interval: The current thread will be blocked until
123either it is interrupted or the given time interval has passed. Basically
124this is a subsecond-resolution C<sleep ()>.
117 125
118=item int ev_version_major () 126=item int ev_version_major ()
119 127
120=item int ev_version_minor () 128=item int ev_version_minor ()
121 129
298=item C<EVBACKEND_SELECT> (value 1, portable select backend) 306=item C<EVBACKEND_SELECT> (value 1, portable select backend)
299 307
300This is your standard select(2) backend. Not I<completely> standard, as 308This is your standard select(2) backend. Not I<completely> standard, as
301libev 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,
302but 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
303using 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
304the 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.
305 320
306=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)
307 322
308And this is your standard poll(2) backend. It's more complicated than 323And this is your standard poll(2) backend. It's more complicated
309select, but handles sparse fds better and has no artificial limit on the 324than select, but handles sparse fds better and has no artificial
310number 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
311lot 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.
312 329
313=item C<EVBACKEND_EPOLL> (value 4, Linux) 330=item C<EVBACKEND_EPOLL> (value 4, Linux)
314 331
315For 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,
316but it scales phenomenally better. While poll and select usually scale like 333but it scales phenomenally better. While poll and select usually scale
317O(total_fds) where n is the total number of fds (or the highest fd), epoll scales 334like O(total_fds) where n is the total number of fds (or the highest fd),
318either O(1) or O(active_fds). 335epoll scales either O(1) or O(active_fds). The epoll design has a number
336of shortcomings, such as silently dropping events in some hard-to-detect
337cases and rewiring a syscall per fd change, no fork support and bad
338support for dup.
319 339
320While stopping and starting an I/O watcher in the same iteration will 340While stopping, setting and starting an I/O watcher in the same iteration
321result in some caching, there is still a syscall per such incident 341will result in some caching, there is still a syscall per such incident
322(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
323best to avoid that. Also, dup()ed file descriptors might not work very 343best to avoid that. Also, C<dup ()>'ed file descriptors might not work
324well if you register events for both fds. 344very well if you register events for both fds.
325 345
326Please note that epoll sometimes generates spurious notifications, so you 346Please note that epoll sometimes generates spurious notifications, so you
327need 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
328(or space) is available. 348(or space) is available.
329 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.
356
330=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 357=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
331 358
332Kqueue deserves special mention, as at the time of this writing, it 359Kqueue deserves special mention, as at the time of this writing, it
333was broken on all BSDs except NetBSD (usually it doesn't work with 360was broken on all BSDs except NetBSD (usually it doesn't work reliably
334anything but sockets and pipes, except on Darwin, where of course its 361with anything but sockets and pipes, except on Darwin, where of course
335completely useless). For this reason its not being "autodetected" 362it's completely useless). For this reason it's not being "autodetected"
336unless you explicitly specify it explicitly in the flags (i.e. using 363unless you explicitly specify it explicitly in the flags (i.e. using
337C<EVBACKEND_KQUEUE>). 364C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
365system like NetBSD.
366
367You still can embed kqueue into a normal poll or select backend and use it
368only for sockets (after having made sure that sockets work with kqueue on
369the target platform). See C<ev_embed> watchers for more info.
338 370
339It scales in the same way as the epoll backend, but the interface to the 371It scales in the same way as the epoll backend, but the interface to the
340kernel is more efficient (which says nothing about its actual speed, of 372kernel is more efficient (which says nothing about its actual speed, of
341course). While starting and stopping an I/O watcher does not cause an 373course). While stopping, setting and starting an I/O watcher does never
342extra syscall as with epoll, it still adds up to four event changes per 374cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
343incident, so its best to avoid that. 375two event changes per incident, support for C<fork ()> is very bad and it
376drops fds silently in similarly hard-to-detect cases.
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.
344 386
345=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 387=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
346 388
347This 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.
348 393
349=item C<EVBACKEND_PORT> (value 32, Solaris 10) 394=item C<EVBACKEND_PORT> (value 32, Solaris 10)
350 395
351This uses the Solaris 10 port mechanism. As with everything on Solaris, 396This uses the Solaris 10 event port mechanism. As with everything on Solaris,
352it'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)).
353 398
354Please note that solaris ports can result in a lot of spurious 399Please note that solaris event ports can deliver a lot of spurious
355notifications, 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
356blocking when no data (or space) is available. 401blocking when no data (or space) is available.
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.
357 407
358=item C<EVBACKEND_ALL> 408=item C<EVBACKEND_ALL>
359 409
360Try all backends (even potentially broken ones that wouldn't be tried 410Try all backends (even potentially broken ones that wouldn't be tried
361with 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
362C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 412C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
413
414It is definitely not recommended to use this flag.
363 415
364=back 416=back
365 417
366If 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
367backends 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
402Destroys the default loop again (frees all memory and kernel state 454Destroys the default loop again (frees all memory and kernel state
403etc.). None of the active event watchers will be stopped in the normal 455etc.). None of the active event watchers will be stopped in the normal
404sense, so e.g. C<ev_is_active> might still return true. It is your 456sense, so e.g. C<ev_is_active> might still return true. It is your
405responsibility to either stop all watchers cleanly yoursef I<before> 457responsibility to either stop all watchers cleanly yoursef I<before>
406calling this function, or cope with the fact afterwards (which is usually 458calling this function, or cope with the fact afterwards (which is usually
407the easiest thing, youc na just ignore the watchers and/or C<free ()> them 459the easiest thing, you can just ignore the watchers and/or C<free ()> them
408for example). 460for example).
461
462Note that certain global state, such as signal state, will not be freed by
463this function, and related watchers (such as signal and child watchers)
464would need to be stopped manually.
465
466In general it is not advisable to call this function except in the
467rare occasion where you really need to free e.g. the signal handling
468pipe fds. If you need dynamically allocated loops it is better to use
469C<ev_loop_new> and C<ev_loop_destroy>).
409 470
410=item ev_loop_destroy (loop) 471=item ev_loop_destroy (loop)
411 472
412Like C<ev_default_destroy>, but destroys an event loop created by an 473Like C<ev_default_destroy>, but destroys an event loop created by an
413earlier call to C<ev_loop_new>. 474earlier call to C<ev_loop_new>.
458 519
459Returns the current "event loop time", which is the time the event loop 520Returns the current "event loop time", which is the time the event loop
460received events and started processing them. This timestamp does not 521received events and started processing them. This timestamp does not
461change as long as callbacks are being processed, and this is also the base 522change as long as callbacks are being processed, and this is also the base
462time used for relative timers. You can treat it as the timestamp of the 523time used for relative timers. You can treat it as the timestamp of the
463event occuring (or more correctly, libev finding out about it). 524event occurring (or more correctly, libev finding out about it).
464 525
465=item ev_loop (loop, int flags) 526=item ev_loop (loop, int flags)
466 527
467Finally, this is it, the event handler. This function usually is called 528Finally, this is it, the event handler. This function usually is called
468after you initialised all your watchers and you want to start handling 529after you initialised all your watchers and you want to start handling
552Example: For some weird reason, unregister the above signal handler again. 613Example: For some weird reason, unregister the above signal handler again.
553 614
554 ev_ref (loop); 615 ev_ref (loop);
555 ev_signal_stop (loop, &exitsig); 616 ev_signal_stop (loop, &exitsig);
556 617
618=item ev_set_io_collect_interval (loop, ev_tstamp interval)
619
620=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
621
622These advanced functions influence the time that libev will spend waiting
623for events. Both are by default C<0>, meaning that libev will try to
624invoke timer/periodic callbacks and I/O callbacks with minimum latency.
625
626Setting these to a higher value (the C<interval> I<must> be >= C<0>)
627allows libev to delay invocation of I/O and timer/periodic callbacks to
628increase efficiency of loop iterations.
629
630The background is that sometimes your program runs just fast enough to
631handle one (or very few) event(s) per loop iteration. While this makes
632the program responsive, it also wastes a lot of CPU time to poll for new
633events, especially with backends like C<select ()> which have a high
634overhead for the actual polling but can deliver many events at once.
635
636By setting a higher I<io collect interval> you allow libev to spend more
637time collecting I/O events, so you can handle more events per iteration,
638at the cost of increasing latency. Timeouts (both C<ev_periodic> and
639C<ev_timer>) will be not affected. Setting this to a non-null value will
640introduce an additional C<ev_sleep ()> call into most loop iterations.
641
642Likewise, by setting a higher I<timeout collect interval> you allow libev
643to spend more time collecting timeouts, at the expense of increased
644latency (the watcher callback will be called later). C<ev_io> watchers
645will not be affected. Setting this to a non-null value will not introduce
646any overhead in libev.
647
648Many (busy) programs can usually benefit by setting the io collect
649interval to a value near C<0.1> or so, which is often enough for
650interactive servers (of course not for games), likewise for timeouts. It
651usually doesn't make much sense to set it to a lower value than C<0.01>,
652as this approsaches the timing granularity of most systems.
653
557=back 654=back
558 655
559 656
560=head1 ANATOMY OF A WATCHER 657=head1 ANATOMY OF A WATCHER
561 658
913such as poll (fortunately in our Xlib example, Xlib already does this on 1010such as poll (fortunately in our Xlib example, Xlib already does this on
914its own, so its quite safe to use). 1011its own, so its quite safe to use).
915 1012
916=head3 The special problem of disappearing file descriptors 1013=head3 The special problem of disappearing file descriptors
917 1014
918Some backends (e.g kqueue, epoll) need to be told about closing a file 1015Some backends (e.g. kqueue, epoll) need to be told about closing a file
919descriptor (either by calling C<close> explicitly or by any other means, 1016descriptor (either by calling C<close> explicitly or by any other means,
920such as C<dup>). The reason is that you register interest in some file 1017such as C<dup>). The reason is that you register interest in some file
921descriptor, but when it goes away, the operating system will silently drop 1018descriptor, but when it goes away, the operating system will silently drop
922this interest. If another file descriptor with the same number then is 1019this interest. If another file descriptor with the same number then is
923registered with libev, there is no efficient way to see that this is, in 1020registered with libev, there is no efficient way to see that this is, in
931descriptor even if the file descriptor number itself did not change. 1028descriptor even if the file descriptor number itself did not change.
932 1029
933This is how one would do it normally anyway, the important point is that 1030This is how one would do it normally anyway, the important point is that
934the libev application should not optimise around libev but should leave 1031the libev application should not optimise around libev but should leave
935optimisations to libev. 1032optimisations to libev.
1033
1034=head3 The special problem of dup'ed file descriptors
1035
1036Some backends (e.g. epoll), cannot register events for file descriptors,
1037but only events for the underlying file descriptions. That means when you
1038have C<dup ()>'ed file descriptors and register events for them, only one
1039file descriptor might actually receive events.
1040
1041There is no workaround possible except not registering events
1042for potentially C<dup ()>'ed file descriptors, or to resort to
1043C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1044
1045=head3 The special problem of fork
1046
1047Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1048useless behaviour. Libev fully supports fork, but needs to be told about
1049it in the child.
1050
1051To support fork in your programs, you either have to call
1052C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1053enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1054C<EVBACKEND_POLL>.
936 1055
937 1056
938=head3 Watcher-Specific Functions 1057=head3 Watcher-Specific Functions
939 1058
940=over 4 1059=over 4
1219=item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write] 1338=item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]
1220 1339
1221The current reschedule callback, or C<0>, if this functionality is 1340The current reschedule callback, or C<0>, if this functionality is
1222switched off. Can be changed any time, but changes only take effect when 1341switched off. Can be changed any time, but changes only take effect when
1223the periodic timer fires or C<ev_periodic_again> is being called. 1342the periodic timer fires or C<ev_periodic_again> is being called.
1343
1344=item ev_tstamp at [read-only]
1345
1346When active, contains the absolute time that the watcher is supposed to
1347trigger next.
1224 1348
1225=back 1349=back
1226 1350
1227Example: Call a callback every hour, or, more precisely, whenever the 1351Example: Call a callback every hour, or, more precisely, whenever the
1228system clock is divisible by 3600. The callback invocation times have 1352system clock is divisible by 3600. The callback invocation times have
1537 1661
1538It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 1662It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1539priority, to ensure that they are being run before any other watchers 1663priority, to ensure that they are being run before any other watchers
1540after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers, 1664after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1541too) should not activate ("feed") events into libev. While libev fully 1665too) should not activate ("feed") events into libev. While libev fully
1542supports this, they will be called before other C<ev_check> watchers did 1666supports this, they will be called before other C<ev_check> watchers
1543their job. As C<ev_check> watchers are often used to embed other event 1667did their job. As C<ev_check> watchers are often used to embed other
1544loops those other event loops might be in an unusable state until their 1668(non-libev) event loops those other event loops might be in an unusable
1545C<ev_check> watcher ran (always remind yourself to coexist peacefully with 1669state until their C<ev_check> watcher ran (always remind yourself to
1546others). 1670coexist peacefully with others).
1547 1671
1548=head3 Watcher-Specific Functions and Data Members 1672=head3 Watcher-Specific Functions and Data Members
1549 1673
1550=over 4 1674=over 4
1551 1675
1775 1899
1776Make a single, non-blocking sweep over the embedded loop. This works 1900Make a single, non-blocking sweep over the embedded loop. This works
1777similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 1901similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1778apropriate way for embedded loops. 1902apropriate way for embedded loops.
1779 1903
1780=item struct ev_loop *loop [read-only] 1904=item struct ev_loop *other [read-only]
1781 1905
1782The embedded event loop. 1906The embedded event loop.
1783 1907
1784=back 1908=back
1785 1909
2019 2143
2020=item w->stop () 2144=item w->stop ()
2021 2145
2022Stops the watcher if it is active. Again, no C<loop> argument. 2146Stops the watcher if it is active. Again, no C<loop> argument.
2023 2147
2024=item w->again () C<ev::timer>, C<ev::periodic> only 2148=item w->again () (C<ev::timer>, C<ev::periodic> only)
2025 2149
2026For C<ev::timer> and C<ev::periodic>, this invokes the corresponding 2150For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
2027C<ev_TYPE_again> function. 2151C<ev_TYPE_again> function.
2028 2152
2029=item w->sweep () C<ev::embed> only 2153=item w->sweep () (C<ev::embed> only)
2030 2154
2031Invokes C<ev_embed_sweep>. 2155Invokes C<ev_embed_sweep>.
2032 2156
2033=item w->update () C<ev::stat> only 2157=item w->update () (C<ev::stat> only)
2034 2158
2035Invokes C<ev_stat_stat>. 2159Invokes C<ev_stat_stat>.
2036 2160
2037=back 2161=back
2038 2162
2058 } 2182 }
2059 2183
2060 2184
2061=head1 MACRO MAGIC 2185=head1 MACRO MAGIC
2062 2186
2063Libev can be compiled with a variety of options, the most fundemantal is 2187Libev can be compiled with a variety of options, the most fundamantal
2064C<EV_MULTIPLICITY>. This option determines whether (most) functions and 2188of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2065callbacks have an initial C<struct ev_loop *> argument. 2189functions and callbacks have an initial C<struct ev_loop *> argument.
2066 2190
2067To make it easier to write programs that cope with either variant, the 2191To make it easier to write programs that cope with either variant, the
2068following macros are defined: 2192following macros are defined:
2069 2193
2070=over 4 2194=over 4
2124Libev can (and often is) directly embedded into host 2248Libev can (and often is) directly embedded into host
2125applications. Examples of applications that embed it include the Deliantra 2249applications. Examples of applications that embed it include the Deliantra
2126Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2250Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2127and rxvt-unicode. 2251and rxvt-unicode.
2128 2252
2129The goal is to enable you to just copy the neecssary files into your 2253The goal is to enable you to just copy the necessary files into your
2130source directory without having to change even a single line in them, so 2254source directory without having to change even a single line in them, so
2131you can easily upgrade by simply copying (or having a checked-out copy of 2255you can easily upgrade by simply copying (or having a checked-out copy of
2132libev somewhere in your source tree). 2256libev somewhere in your source tree).
2133 2257
2134=head2 FILESETS 2258=head2 FILESETS
2224 2348
2225If defined to be C<1>, libev will try to detect the availability of the 2349If defined to be C<1>, libev will try to detect the availability of the
2226monotonic clock option at both compiletime and runtime. Otherwise no use 2350monotonic clock option at both compiletime and runtime. Otherwise no use
2227of the monotonic clock option will be attempted. If you enable this, you 2351of the monotonic clock option will be attempted. If you enable this, you
2228usually have to link against librt or something similar. Enabling it when 2352usually have to link against librt or something similar. Enabling it when
2229the functionality isn't available is safe, though, althoguh you have 2353the functionality isn't available is safe, though, although you have
2230to make sure you link against any libraries where the C<clock_gettime> 2354to make sure you link against any libraries where the C<clock_gettime>
2231function is hiding in (often F<-lrt>). 2355function is hiding in (often F<-lrt>).
2232 2356
2233=item EV_USE_REALTIME 2357=item EV_USE_REALTIME
2234 2358
2235If defined to be C<1>, libev will try to detect the availability of the 2359If defined to be C<1>, libev will try to detect the availability of the
2236realtime clock option at compiletime (and assume its availability at 2360realtime clock option at compiletime (and assume its availability at
2237runtime if successful). Otherwise no use of the realtime clock option will 2361runtime if successful). Otherwise no use of the realtime clock option will
2238be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2362be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2239(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2363(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2240in the description of C<EV_USE_MONOTONIC>, though. 2364note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2365
2366=item EV_USE_NANOSLEEP
2367
2368If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2369and will use it for delays. Otherwise it will use C<select ()>.
2241 2370
2242=item EV_USE_SELECT 2371=item EV_USE_SELECT
2243 2372
2244If undefined or defined to be C<1>, libev will compile in support for the 2373If undefined or defined to be C<1>, libev will compile in support for the
2245C<select>(2) backend. No attempt at autodetection will be done: if no 2374C<select>(2) backend. No attempt at autodetection will be done: if no
2397than 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
2398increase this value (I<must> be a power of two). 2527increase this value (I<must> be a power of two).
2399 2528
2400=item EV_INOTIFY_HASHSIZE 2529=item EV_INOTIFY_HASHSIZE
2401 2530
2402C<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
2403inotify 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>),
2404usually 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>
2405watchers 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
2406two). 2535two).
2407 2536
2424 2553
2425=item ev_set_cb (ev, cb) 2554=item ev_set_cb (ev, cb)
2426 2555
2427Can be used to change the callback member declaration in each watcher, 2556Can be used to change the callback member declaration in each watcher,
2428and the way callbacks are invoked and set. Must expand to a struct member 2557and the way callbacks are invoked and set. Must expand to a struct member
2429definition and a statement, respectively. See the F<ev.v> header file for 2558definition and a statement, respectively. See the F<ev.h> header file for
2430their default definitions. One possible use for overriding these is to 2559their default definitions. One possible use for overriding these is to
2431avoid the C<struct ev_loop *> as first argument in all cases, or to use 2560avoid the C<struct ev_loop *> as first argument in all cases, or to use
2432method calls instead of plain function calls in C++. 2561method calls instead of plain function calls in C++.
2562
2563=head2 EXPORTED API SYMBOLS
2564
2565If you need to re-export the API (e.g. via a dll) and you need a list of
2566exported symbols, you can use the provided F<Symbol.*> files which list
2567all public symbols, one per line:
2568
2569 Symbols.ev for libev proper
2570 Symbols.event for the libevent emulation
2571
2572This can also be used to rename all public symbols to avoid clashes with
2573multiple versions of libev linked together (which is obviously bad in
2574itself, but sometimes it is inconvinient to avoid this).
2575
2576A sed command like this will create wrapper C<#define>'s that you need to
2577include before including F<ev.h>:
2578
2579 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2580
2581This would create a file F<wrap.h> which essentially looks like this:
2582
2583 #define ev_backend myprefix_ev_backend
2584 #define ev_check_start myprefix_ev_check_start
2585 #define ev_check_stop myprefix_ev_check_stop
2586 ...
2433 2587
2434=head2 EXAMPLES 2588=head2 EXAMPLES
2435 2589
2436For a real-world example of a program the includes libev 2590For a real-world example of a program the includes libev
2437verbatim, you can have a look at the EV perl module 2591verbatim, you can have a look at the EV perl module
2478 2632
2479=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2633=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2480 2634
2481This means that, when you have a watcher that triggers in one hour and 2635This means that, when you have a watcher that triggers in one hour and
2482there are 100 watchers that would trigger before that then inserting will 2636there are 100 watchers that would trigger before that then inserting will
2483have to skip those 100 watchers. 2637have to skip roughly seven (C<ld 100>) of these watchers.
2484 2638
2485=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2639=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2486 2640
2487That means that for changing a timer costs less than removing/adding them 2641That means that changing a timer costs less than removing/adding them
2488as only the relative motion in the event queue has to be paid for. 2642as only the relative motion in the event queue has to be paid for.
2489 2643
2490=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2644=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2491 2645
2492These just add the watcher into an array or at the head of a list. 2646These just add the watcher into an array or at the head of a list.
2647
2493=item Stopping check/prepare/idle watchers: O(1) 2648=item Stopping check/prepare/idle watchers: O(1)
2494 2649
2495=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 2650=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2496 2651
2497These watchers are stored in lists then need to be walked to find the 2652These watchers are stored in lists then need to be walked to find the
2498correct watcher to remove. The lists are usually short (you don't usually 2653correct watcher to remove. The lists are usually short (you don't usually
2499have many watchers waiting for the same fd or signal). 2654have many watchers waiting for the same fd or signal).
2500 2655
2501=item Finding the next timer per loop iteration: O(1) 2656=item Finding the next timer in each loop iteration: O(1)
2657
2658By virtue of using a binary heap, the next timer is always found at the
2659beginning of the storage array.
2502 2660
2503=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2661=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2504 2662
2505A change means an I/O watcher gets started or stopped, which requires 2663A change means an I/O watcher gets started or stopped, which requires
2506libev to recalculate its status (and possibly tell the kernel). 2664libev to recalculate its status (and possibly tell the kernel, depending
2665on backend and wether C<ev_io_set> was used).
2507 2666
2508=item Activating one watcher: O(1) 2667=item Activating one watcher (putting it into the pending state): O(1)
2509 2668
2510=item Priority handling: O(number_of_priorities) 2669=item Priority handling: O(number_of_priorities)
2511 2670
2512Priorities are implemented by allocating some space for each 2671Priorities are implemented by allocating some space for each
2513priority. When doing priority-based operations, libev usually has to 2672priority. When doing priority-based operations, libev usually has to
2514linearly search all the priorities. 2673linearly search all the priorities, but starting/stopping and activating
2674watchers becomes O(1) w.r.t. prioritiy handling.
2515 2675
2516=back 2676=back
2517 2677
2518 2678
2519=head1 AUTHOR 2679=head1 AUTHOR

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines