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

Comparing libev/ev.pod (file contents):
Revision 1.64 by root, Sat Dec 1 15:32:53 2007 UTC vs.
Revision 1.73 by root, Sat Dec 8 03:53:36 2007 UTC

47 47
48 return 0; 48 return 0;
49 } 49 }
50 50
51=head1 DESCRIPTION 51=head1 DESCRIPTION
52
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
55time: L<http://cvs.schmorp.de/libev/ev.html>.
52 56
53Libev 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
54file descriptor being readable or a timeout occuring), and it will manage 58file descriptor being readable or a timeout occuring), and it will manage
55these event sources and provide your program with events. 59these event sources and provide your program with events.
56 60
274a fork, you can also make libev check for a fork in each iteration by 278a fork, you can also make libev check for a fork in each iteration by
275enabling this flag. 279enabling this flag.
276 280
277This works by calling C<getpid ()> on every iteration of the loop, 281This works by calling C<getpid ()> on every iteration of the loop,
278and thus this might slow down your event loop if you do a lot of loop 282and thus this might slow down your event loop if you do a lot of loop
279iterations and little real work, but is usually not noticable (on my 283iterations and little real work, but is usually not noticeable (on my
280Linux system for example, C<getpid> is actually a simple 5-insn sequence 284Linux system for example, C<getpid> is actually a simple 5-insn sequence
281without a syscall and thus I<very> fast, but my Linux system also has 285without a syscall and thus I<very> fast, but my Linux system also has
282C<pthread_atfork> which is even faster). 286C<pthread_atfork> which is even faster).
283 287
284The big advantage of this flag is that you can forget about fork (and 288The big advantage of this flag is that you can forget about fork (and
429=item ev_loop_fork (loop) 433=item ev_loop_fork (loop)
430 434
431Like C<ev_default_fork>, but acts on an event loop created by 435Like C<ev_default_fork>, but acts on an event loop created by
432C<ev_loop_new>. Yes, you have to call this on every allocated event loop 436C<ev_loop_new>. Yes, you have to call this on every allocated event loop
433after fork, and how you do this is entirely your own problem. 437after fork, and how you do this is entirely your own problem.
438
439=item unsigned int ev_loop_count (loop)
440
441Returns the count of loop iterations for the loop, which is identical to
442the number of times libev did poll for new events. It starts at C<0> and
443happily wraps around with enough iterations.
444
445This value can sometimes be useful as a generation counter of sorts (it
446"ticks" the number of loop iterations), as it roughly corresponds with
447C<ev_prepare> and C<ev_check> calls.
434 448
435=item unsigned int ev_backend (loop) 449=item unsigned int ev_backend (loop)
436 450
437Returns one of the C<EVBACKEND_*> flags indicating the event backend in 451Returns one of the C<EVBACKEND_*> flags indicating the event backend in
438use. 452use.
722=item bool ev_is_pending (ev_TYPE *watcher) 736=item bool ev_is_pending (ev_TYPE *watcher)
723 737
724Returns a true value iff the watcher is pending, (i.e. it has outstanding 738Returns a true value iff the watcher is pending, (i.e. it has outstanding
725events but its callback has not yet been invoked). As long as a watcher 739events but its callback has not yet been invoked). As long as a watcher
726is pending (but not active) you must not call an init function on it (but 740is pending (but not active) you must not call an init function on it (but
727C<ev_TYPE_set> is safe) and you must make sure the watcher is available to 741C<ev_TYPE_set> is safe), you must not change its priority, and you must
728libev (e.g. you cnanot C<free ()> it). 742make sure the watcher is available to libev (e.g. you cannot C<free ()>
743it).
729 744
730=item callback ev_cb (ev_TYPE *watcher) 745=item callback ev_cb (ev_TYPE *watcher)
731 746
732Returns the callback currently set on the watcher. 747Returns the callback currently set on the watcher.
733 748
734=item ev_cb_set (ev_TYPE *watcher, callback) 749=item ev_cb_set (ev_TYPE *watcher, callback)
735 750
736Change the callback. You can change the callback at virtually any time 751Change the callback. You can change the callback at virtually any time
737(modulo threads). 752(modulo threads).
753
754=item ev_set_priority (ev_TYPE *watcher, priority)
755
756=item int ev_priority (ev_TYPE *watcher)
757
758Set and query the priority of the watcher. The priority is a small
759integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
760(default: C<-2>). Pending watchers with higher priority will be invoked
761before watchers with lower priority, but priority will not keep watchers
762from being executed (except for C<ev_idle> watchers).
763
764This means that priorities are I<only> used for ordering callback
765invocation after new events have been received. This is useful, for
766example, to reduce latency after idling, or more often, to bind two
767watchers on the same event and make sure one is called first.
768
769If you need to suppress invocation when higher priority events are pending
770you need to look at C<ev_idle> watchers, which provide this functionality.
771
772You I<must not> change the priority of a watcher as long as it is active or
773pending.
774
775The default priority used by watchers when no priority has been set is
776always C<0>, which is supposed to not be too high and not be too low :).
777
778Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
779fine, as long as you do not mind that the priority value you query might
780or might not have been adjusted to be within valid range.
738 781
739=back 782=back
740 783
741 784
742=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 785=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
848it is best to always use non-blocking I/O: An extra C<read>(2) returning 891it is best to always use non-blocking I/O: An extra C<read>(2) returning
849C<EAGAIN> is far preferable to a program hanging until some data arrives. 892C<EAGAIN> is far preferable to a program hanging until some data arrives.
850 893
851If you cannot run the fd in non-blocking mode (for example you should not 894If you cannot run the fd in non-blocking mode (for example you should not
852play around with an Xlib connection), then you have to seperately re-test 895play around with an Xlib connection), then you have to seperately re-test
853wether a file descriptor is really ready with a known-to-be good interface 896whether a file descriptor is really ready with a known-to-be good interface
854such as poll (fortunately in our Xlib example, Xlib already does this on 897such as poll (fortunately in our Xlib example, Xlib already does this on
855its own, so its quite safe to use). 898its own, so its quite safe to use).
856 899
857=over 4 900=over 4
858 901
1341 ev_stat_start (loop, &passwd); 1384 ev_stat_start (loop, &passwd);
1342 1385
1343 1386
1344=head2 C<ev_idle> - when you've got nothing better to do... 1387=head2 C<ev_idle> - when you've got nothing better to do...
1345 1388
1346Idle watchers trigger events when there are no other events are pending 1389Idle watchers trigger events when no other events of the same or higher
1347(prepare, check and other idle watchers do not count). That is, as long 1390priority are pending (prepare, check and other idle watchers do not
1348as your process is busy handling sockets or timeouts (or even signals, 1391count).
1349imagine) it will not be triggered. But when your process is idle all idle 1392
1350watchers are being called again and again, once per event loop iteration - 1393That is, as long as your process is busy handling sockets or timeouts
1394(or even signals, imagine) of the same or higher priority it will not be
1395triggered. But when your process is idle (or only lower-priority watchers
1396are pending), the idle watchers are being called once per event loop
1351until stopped, that is, or your process receives more events and becomes 1397iteration - until stopped, that is, or your process receives more events
1352busy. 1398and becomes busy again with higher priority stuff.
1353 1399
1354The most noteworthy effect is that as long as any idle watchers are 1400The most noteworthy effect is that as long as any idle watchers are
1355active, the process will not block when waiting for new events. 1401active, the process will not block when waiting for new events.
1356 1402
1357Apart from keeping your process non-blocking (which is a useful 1403Apart from keeping your process non-blocking (which is a useful
1702 1748
1703To use it, 1749To use it,
1704 1750
1705 #include <ev++.h> 1751 #include <ev++.h>
1706 1752
1707(it is not installed by default). This automatically includes F<ev.h> 1753This automatically includes F<ev.h> and puts all of its definitions (many
1708and puts all of its definitions (many of them macros) into the global 1754of them macros) into the global namespace. All C++ specific things are
1709namespace. All C++ specific things are put into the C<ev> namespace. 1755put into the C<ev> namespace. It should support all the same embedding
1756options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
1710 1757
1711It should support all the same embedding options as F<ev.h>, most notably 1758Care has been taken to keep the overhead low. The only data member the C++
1712C<EV_MULTIPLICITY>. 1759classes add (compared to plain C-style watchers) is the event loop pointer
1760that the watcher is associated with (or no additional members at all if
1761you disable C<EV_MULTIPLICITY> when embedding libev).
1762
1763Currently, functions, and static and non-static member functions can be
1764used as callbacks. Other types should be easy to add as long as they only
1765need one additional pointer for context. If you need support for other
1766types of functors please contact the author (preferably after implementing
1767it).
1713 1768
1714Here is a list of things available in the C<ev> namespace: 1769Here is a list of things available in the C<ev> namespace:
1715 1770
1716=over 4 1771=over 4
1717 1772
1733 1788
1734All of those classes have these methods: 1789All of those classes have these methods:
1735 1790
1736=over 4 1791=over 4
1737 1792
1738=item ev::TYPE::TYPE (object *, object::method *) 1793=item ev::TYPE::TYPE ()
1739 1794
1740=item ev::TYPE::TYPE (object *, object::method *, struct ev_loop *) 1795=item ev::TYPE::TYPE (struct ev_loop *)
1741 1796
1742=item ev::TYPE::~TYPE 1797=item ev::TYPE::~TYPE
1743 1798
1744The constructor takes a pointer to an object and a method pointer to 1799The constructor (optionally) takes an event loop to associate the watcher
1745the event handler callback to call in this class. The constructor calls 1800with. If it is omitted, it will use C<EV_DEFAULT>.
1746C<ev_init> for you, which means you have to call the C<set> method 1801
1747before starting it. If you do not specify a loop then the constructor 1802The constructor calls C<ev_init> for you, which means you have to call the
1748automatically associates the default loop with this watcher. 1803C<set> method before starting it.
1804
1805It will not set a callback, however: You have to call the templated C<set>
1806method to set a callback before you can start the watcher.
1807
1808(The reason why you have to use a method is a limitation in C++ which does
1809not allow explicit template arguments for constructors).
1749 1810
1750The destructor automatically stops the watcher if it is active. 1811The destructor automatically stops the watcher if it is active.
1812
1813=item w->set<class, &class::method> (object *)
1814
1815This method sets the callback method to call. The method has to have a
1816signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
1817first argument and the C<revents> as second. The object must be given as
1818parameter and is stored in the C<data> member of the watcher.
1819
1820This method synthesizes efficient thunking code to call your method from
1821the C callback that libev requires. If your compiler can inline your
1822callback (i.e. it is visible to it at the place of the C<set> call and
1823your compiler is good :), then the method will be fully inlined into the
1824thunking function, making it as fast as a direct C callback.
1825
1826Example: simple class declaration and watcher initialisation
1827
1828 struct myclass
1829 {
1830 void io_cb (ev::io &w, int revents) { }
1831 }
1832
1833 myclass obj;
1834 ev::io iow;
1835 iow.set <myclass, &myclass::io_cb> (&obj);
1836
1837=item w->set (void (*function)(watcher &w, int), void *data = 0)
1838
1839Also sets a callback, but uses a static method or plain function as
1840callback. The optional C<data> argument will be stored in the watcher's
1841C<data> member and is free for you to use.
1842
1843See the method-C<set> above for more details.
1751 1844
1752=item w->set (struct ev_loop *) 1845=item w->set (struct ev_loop *)
1753 1846
1754Associates a different C<struct ev_loop> with this watcher. You can only 1847Associates a different C<struct ev_loop> with this watcher. You can only
1755do this when the watcher is inactive (and not pending either). 1848do this when the watcher is inactive (and not pending either).
1756 1849
1757=item w->set ([args]) 1850=item w->set ([args])
1758 1851
1759Basically the same as C<ev_TYPE_set>, with the same args. Must be 1852Basically the same as C<ev_TYPE_set>, with the same args. Must be
1760called at least once. Unlike the C counterpart, an active watcher gets 1853called at least once. Unlike the C counterpart, an active watcher gets
1761automatically stopped and restarted. 1854automatically stopped and restarted when reconfiguring it with this
1855method.
1762 1856
1763=item w->start () 1857=item w->start ()
1764 1858
1765Starts the watcher. Note that there is no C<loop> argument as the 1859Starts the watcher. Note that there is no C<loop> argument, as the
1766constructor already takes the loop. 1860constructor already stores the event loop.
1767 1861
1768=item w->stop () 1862=item w->stop ()
1769 1863
1770Stops the watcher if it is active. Again, no C<loop> argument. 1864Stops the watcher if it is active. Again, no C<loop> argument.
1771 1865
1796 1890
1797 myclass (); 1891 myclass ();
1798 } 1892 }
1799 1893
1800 myclass::myclass (int fd) 1894 myclass::myclass (int fd)
1801 : io (this, &myclass::io_cb),
1802 idle (this, &myclass::idle_cb)
1803 { 1895 {
1896 io .set <myclass, &myclass::io_cb > (this);
1897 idle.set <myclass, &myclass::idle_cb> (this);
1898
1804 io.start (fd, ev::READ); 1899 io.start (fd, ev::READ);
1805 } 1900 }
1806 1901
1807 1902
1808=head1 MACRO MAGIC 1903=head1 MACRO MAGIC
1809 1904
1810Libev can be compiled with a variety of options, the most fundemantal is 1905Libev can be compiled with a variety of options, the most fundemantal is
1811C<EV_MULTIPLICITY>. This option determines wether (most) functions and 1906C<EV_MULTIPLICITY>. This option determines whether (most) functions and
1812callbacks have an initial C<struct ev_loop *> argument. 1907callbacks have an initial C<struct ev_loop *> argument.
1813 1908
1814To make it easier to write programs that cope with either variant, the 1909To make it easier to write programs that cope with either variant, the
1815following macros are defined: 1910following macros are defined:
1816 1911
1850loop, if multiple loops are supported ("ev loop default"). 1945loop, if multiple loops are supported ("ev loop default").
1851 1946
1852=back 1947=back
1853 1948
1854Example: Declare and initialise a check watcher, utilising the above 1949Example: Declare and initialise a check watcher, utilising the above
1855macros so it will work regardless of wether multiple loops are supported 1950macros so it will work regardless of whether multiple loops are supported
1856or not. 1951or not.
1857 1952
1858 static void 1953 static void
1859 check_cb (EV_P_ ev_timer *w, int revents) 1954 check_cb (EV_P_ ev_timer *w, int revents)
1860 { 1955 {
2085will have the C<struct ev_loop *> as first argument, and you can create 2180will have the C<struct ev_loop *> as first argument, and you can create
2086additional independent event loops. Otherwise there will be no support 2181additional independent event loops. Otherwise there will be no support
2087for multiple event loops and there is no first event loop pointer 2182for multiple event loops and there is no first event loop pointer
2088argument. Instead, all functions act on the single default loop. 2183argument. Instead, all functions act on the single default loop.
2089 2184
2185=item EV_MINPRI
2186
2187=item EV_MAXPRI
2188
2189The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2190C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2191provide for more priorities by overriding those symbols (usually defined
2192to be C<-2> and C<2>, respectively).
2193
2194When doing priority-based operations, libev usually has to linearly search
2195all the priorities, so having many of them (hundreds) uses a lot of space
2196and time, so using the defaults of five priorities (-2 .. +2) is usually
2197fine.
2198
2199If your embedding app does not need any priorities, defining these both to
2200C<0> will save some memory and cpu.
2201
2090=item EV_PERIODIC_ENABLE 2202=item EV_PERIODIC_ENABLE
2091 2203
2092If undefined or defined to be C<1>, then periodic timers are supported. If 2204If undefined or defined to be C<1>, then periodic timers are supported. If
2205defined to be C<0>, then they are not. Disabling them saves a few kB of
2206code.
2207
2208=item EV_IDLE_ENABLE
2209
2210If undefined or defined to be C<1>, then idle watchers are supported. If
2093defined to be C<0>, then they are not. Disabling them saves a few kB of 2211defined to be C<0>, then they are not. Disabling them saves a few kB of
2094code. 2212code.
2095 2213
2096=item EV_EMBED_ENABLE 2214=item EV_EMBED_ENABLE
2097 2215
2190 2308
2191In this section the complexities of (many of) the algorithms used inside 2309In this section the complexities of (many of) the algorithms used inside
2192libev will be explained. For complexity discussions about backends see the 2310libev will be explained. For complexity discussions about backends see the
2193documentation for C<ev_default_init>. 2311documentation for C<ev_default_init>.
2194 2312
2313All of the following are about amortised time: If an array needs to be
2314extended, libev needs to realloc and move the whole array, but this
2315happens asymptotically never with higher number of elements, so O(1) might
2316mean it might do a lengthy realloc operation in rare cases, but on average
2317it is much faster and asymptotically approaches constant time.
2318
2195=over 4 2319=over 4
2196 2320
2197=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2321=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2198 2322
2323This means that, when you have a watcher that triggers in one hour and
2324there are 100 watchers that would trigger before that then inserting will
2325have to skip those 100 watchers.
2326
2199=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2327=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)
2200 2328
2329That means that for changing a timer costs less than removing/adding them
2330as only the relative motion in the event queue has to be paid for.
2331
2201=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2332=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2202 2333
2334These just add the watcher into an array or at the head of a list.
2203=item Stopping check/prepare/idle watchers: O(1) 2335=item Stopping check/prepare/idle watchers: O(1)
2204 2336
2205=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 2337=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2206 2338
2339These watchers are stored in lists then need to be walked to find the
2340correct watcher to remove. The lists are usually short (you don't usually
2341have many watchers waiting for the same fd or signal).
2342
2207=item Finding the next timer per loop iteration: O(1) 2343=item Finding the next timer per loop iteration: O(1)
2208 2344
2209=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2345=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2210 2346
2347A change means an I/O watcher gets started or stopped, which requires
2348libev to recalculate its status (and possibly tell the kernel).
2349
2211=item Activating one watcher: O(1) 2350=item Activating one watcher: O(1)
2212 2351
2352=item Priority handling: O(number_of_priorities)
2353
2354Priorities are implemented by allocating some space for each
2355priority. When doing priority-based operations, libev usually has to
2356linearly search all the priorities.
2357
2213=back 2358=back
2214 2359
2215 2360
2216=head1 AUTHOR 2361=head1 AUTHOR
2217 2362

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines