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

Comparing libev/ev.pod (file contents):
Revision 1.61 by root, Thu Nov 29 12:21:05 2007 UTC vs.
Revision 1.74 by root, Sat Dec 8 14:12:08 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
266C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 270C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
267override the flags completely if it is found in the environment. This is 271override the flags completely if it is found in the environment. This is
268useful to try out specific backends to test their performance, or to work 272useful to try out specific backends to test their performance, or to work
269around bugs. 273around bugs.
270 274
275=item C<EVFLAG_FORKCHECK>
276
277Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
278a fork, you can also make libev check for a fork in each iteration by
279enabling this flag.
280
281This works by calling C<getpid ()> on every iteration of the loop,
282and thus this might slow down your event loop if you do a lot of loop
283iterations and little real work, but is usually not noticeable (on my
284Linux system for example, C<getpid> is actually a simple 5-insn sequence
285without a syscall and thus I<very> fast, but my Linux system also has
286C<pthread_atfork> which is even faster).
287
288The big advantage of this flag is that you can forget about fork (and
289forget about forgetting to tell libev about forking) when you use this
290flag.
291
292This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
293environment variable.
294
271=item C<EVBACKEND_SELECT> (value 1, portable select backend) 295=item C<EVBACKEND_SELECT> (value 1, portable select backend)
272 296
273This is your standard select(2) backend. Not I<completely> standard, as 297This is your standard select(2) backend. Not I<completely> standard, as
274libev tries to roll its own fd_set with no limits on the number of fds, 298libev tries to roll its own fd_set with no limits on the number of fds,
275but if that fails, expect a fairly low limit on the number of fds when 299but if that fails, expect a fairly low limit on the number of fds when
409=item ev_loop_fork (loop) 433=item ev_loop_fork (loop)
410 434
411Like 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
412C<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
413after 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.
414 448
415=item unsigned int ev_backend (loop) 449=item unsigned int ev_backend (loop)
416 450
417Returns one of the C<EVBACKEND_*> flags indicating the event backend in 451Returns one of the C<EVBACKEND_*> flags indicating the event backend in
418use. 452use.
702=item bool ev_is_pending (ev_TYPE *watcher) 736=item bool ev_is_pending (ev_TYPE *watcher)
703 737
704Returns 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
705events 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
706is 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
707C<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
708libev (e.g. you cnanot C<free ()> it). 742make sure the watcher is available to libev (e.g. you cannot C<free ()>
743it).
709 744
710=item callback ev_cb (ev_TYPE *watcher) 745=item callback ev_cb (ev_TYPE *watcher)
711 746
712Returns the callback currently set on the watcher. 747Returns the callback currently set on the watcher.
713 748
714=item ev_cb_set (ev_TYPE *watcher, callback) 749=item ev_cb_set (ev_TYPE *watcher, callback)
715 750
716Change the callback. You can change the callback at virtually any time 751Change the callback. You can change the callback at virtually any time
717(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.
781
782=item ev_invoke (loop, ev_TYPE *watcher, int revents)
783
784Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
785C<loop> nor C<revents> need to be valid as long as the watcher callback
786can deal with that fact.
787
788=item int ev_clear_pending (loop, ev_TYPE *watcher)
789
790If the watcher is pending, this function returns clears its pending status
791and returns its C<revents> bitset (as if its callback was invoked). If the
792watcher isn't pending it does nothing and returns C<0>.
718 793
719=back 794=back
720 795
721 796
722=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 797=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
828it is best to always use non-blocking I/O: An extra C<read>(2) returning 903it is best to always use non-blocking I/O: An extra C<read>(2) returning
829C<EAGAIN> is far preferable to a program hanging until some data arrives. 904C<EAGAIN> is far preferable to a program hanging until some data arrives.
830 905
831If you cannot run the fd in non-blocking mode (for example you should not 906If you cannot run the fd in non-blocking mode (for example you should not
832play around with an Xlib connection), then you have to seperately re-test 907play around with an Xlib connection), then you have to seperately re-test
833wether a file descriptor is really ready with a known-to-be good interface 908whether a file descriptor is really ready with a known-to-be good interface
834such as poll (fortunately in our Xlib example, Xlib already does this on 909such as poll (fortunately in our Xlib example, Xlib already does this on
835its own, so its quite safe to use). 910its own, so its quite safe to use).
836 911
837=over 4 912=over 4
838 913
1321 ev_stat_start (loop, &passwd); 1396 ev_stat_start (loop, &passwd);
1322 1397
1323 1398
1324=head2 C<ev_idle> - when you've got nothing better to do... 1399=head2 C<ev_idle> - when you've got nothing better to do...
1325 1400
1326Idle watchers trigger events when there are no other events are pending 1401Idle watchers trigger events when no other events of the same or higher
1327(prepare, check and other idle watchers do not count). That is, as long 1402priority are pending (prepare, check and other idle watchers do not
1328as your process is busy handling sockets or timeouts (or even signals, 1403count).
1329imagine) it will not be triggered. But when your process is idle all idle 1404
1330watchers are being called again and again, once per event loop iteration - 1405That is, as long as your process is busy handling sockets or timeouts
1406(or even signals, imagine) of the same or higher priority it will not be
1407triggered. But when your process is idle (or only lower-priority watchers
1408are pending), the idle watchers are being called once per event loop
1331until stopped, that is, or your process receives more events and becomes 1409iteration - until stopped, that is, or your process receives more events
1332busy. 1410and becomes busy again with higher priority stuff.
1333 1411
1334The most noteworthy effect is that as long as any idle watchers are 1412The most noteworthy effect is that as long as any idle watchers are
1335active, the process will not block when waiting for new events. 1413active, the process will not block when waiting for new events.
1336 1414
1337Apart from keeping your process non-blocking (which is a useful 1415Apart from keeping your process non-blocking (which is a useful
1437 1515
1438 // create io watchers for each fd and a timer before blocking 1516 // create io watchers for each fd and a timer before blocking
1439 static void 1517 static void
1440 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 1518 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1441 { 1519 {
1442 int timeout = 3600000;truct pollfd fds [nfd]; 1520 int timeout = 3600000;
1521 struct pollfd fds [nfd];
1443 // actual code will need to loop here and realloc etc. 1522 // actual code will need to loop here and realloc etc.
1444 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 1523 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1445 1524
1446 /* the callback is illegal, but won't be called as we stop during check */ 1525 /* the callback is illegal, but won't be called as we stop during check */
1447 ev_timer_init (&tw, 0, timeout * 1e-3); 1526 ev_timer_init (&tw, 0, timeout * 1e-3);
1681 1760
1682To use it, 1761To use it,
1683 1762
1684 #include <ev++.h> 1763 #include <ev++.h>
1685 1764
1686(it is not installed by default). This automatically includes F<ev.h> 1765This automatically includes F<ev.h> and puts all of its definitions (many
1687and puts all of its definitions (many of them macros) into the global 1766of them macros) into the global namespace. All C++ specific things are
1688namespace. All C++ specific things are put into the C<ev> namespace. 1767put into the C<ev> namespace. It should support all the same embedding
1768options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
1689 1769
1690It should support all the same embedding options as F<ev.h>, most notably 1770Care has been taken to keep the overhead low. The only data member the C++
1691C<EV_MULTIPLICITY>. 1771classes add (compared to plain C-style watchers) is the event loop pointer
1772that the watcher is associated with (or no additional members at all if
1773you disable C<EV_MULTIPLICITY> when embedding libev).
1774
1775Currently, functions, and static and non-static member functions can be
1776used as callbacks. Other types should be easy to add as long as they only
1777need one additional pointer for context. If you need support for other
1778types of functors please contact the author (preferably after implementing
1779it).
1692 1780
1693Here is a list of things available in the C<ev> namespace: 1781Here is a list of things available in the C<ev> namespace:
1694 1782
1695=over 4 1783=over 4
1696 1784
1712 1800
1713All of those classes have these methods: 1801All of those classes have these methods:
1714 1802
1715=over 4 1803=over 4
1716 1804
1717=item ev::TYPE::TYPE (object *, object::method *) 1805=item ev::TYPE::TYPE ()
1718 1806
1719=item ev::TYPE::TYPE (object *, object::method *, struct ev_loop *) 1807=item ev::TYPE::TYPE (struct ev_loop *)
1720 1808
1721=item ev::TYPE::~TYPE 1809=item ev::TYPE::~TYPE
1722 1810
1723The constructor takes a pointer to an object and a method pointer to 1811The constructor (optionally) takes an event loop to associate the watcher
1724the event handler callback to call in this class. The constructor calls 1812with. If it is omitted, it will use C<EV_DEFAULT>.
1725C<ev_init> for you, which means you have to call the C<set> method 1813
1726before starting it. If you do not specify a loop then the constructor 1814The constructor calls C<ev_init> for you, which means you have to call the
1727automatically associates the default loop with this watcher. 1815C<set> method before starting it.
1816
1817It will not set a callback, however: You have to call the templated C<set>
1818method to set a callback before you can start the watcher.
1819
1820(The reason why you have to use a method is a limitation in C++ which does
1821not allow explicit template arguments for constructors).
1728 1822
1729The destructor automatically stops the watcher if it is active. 1823The destructor automatically stops the watcher if it is active.
1824
1825=item w->set<class, &class::method> (object *)
1826
1827This method sets the callback method to call. The method has to have a
1828signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
1829first argument and the C<revents> as second. The object must be given as
1830parameter and is stored in the C<data> member of the watcher.
1831
1832This method synthesizes efficient thunking code to call your method from
1833the C callback that libev requires. If your compiler can inline your
1834callback (i.e. it is visible to it at the place of the C<set> call and
1835your compiler is good :), then the method will be fully inlined into the
1836thunking function, making it as fast as a direct C callback.
1837
1838Example: simple class declaration and watcher initialisation
1839
1840 struct myclass
1841 {
1842 void io_cb (ev::io &w, int revents) { }
1843 }
1844
1845 myclass obj;
1846 ev::io iow;
1847 iow.set <myclass, &myclass::io_cb> (&obj);
1848
1849=item w->set (void (*function)(watcher &w, int), void *data = 0)
1850
1851Also sets a callback, but uses a static method or plain function as
1852callback. The optional C<data> argument will be stored in the watcher's
1853C<data> member and is free for you to use.
1854
1855See the method-C<set> above for more details.
1730 1856
1731=item w->set (struct ev_loop *) 1857=item w->set (struct ev_loop *)
1732 1858
1733Associates a different C<struct ev_loop> with this watcher. You can only 1859Associates a different C<struct ev_loop> with this watcher. You can only
1734do this when the watcher is inactive (and not pending either). 1860do this when the watcher is inactive (and not pending either).
1735 1861
1736=item w->set ([args]) 1862=item w->set ([args])
1737 1863
1738Basically the same as C<ev_TYPE_set>, with the same args. Must be 1864Basically the same as C<ev_TYPE_set>, with the same args. Must be
1739called at least once. Unlike the C counterpart, an active watcher gets 1865called at least once. Unlike the C counterpart, an active watcher gets
1740automatically stopped and restarted. 1866automatically stopped and restarted when reconfiguring it with this
1867method.
1741 1868
1742=item w->start () 1869=item w->start ()
1743 1870
1744Starts the watcher. Note that there is no C<loop> argument as the 1871Starts the watcher. Note that there is no C<loop> argument, as the
1745constructor already takes the loop. 1872constructor already stores the event loop.
1746 1873
1747=item w->stop () 1874=item w->stop ()
1748 1875
1749Stops the watcher if it is active. Again, no C<loop> argument. 1876Stops the watcher if it is active. Again, no C<loop> argument.
1750 1877
1775 1902
1776 myclass (); 1903 myclass ();
1777 } 1904 }
1778 1905
1779 myclass::myclass (int fd) 1906 myclass::myclass (int fd)
1780 : io (this, &myclass::io_cb),
1781 idle (this, &myclass::idle_cb)
1782 { 1907 {
1908 io .set <myclass, &myclass::io_cb > (this);
1909 idle.set <myclass, &myclass::idle_cb> (this);
1910
1783 io.start (fd, ev::READ); 1911 io.start (fd, ev::READ);
1784 } 1912 }
1785 1913
1786 1914
1787=head1 MACRO MAGIC 1915=head1 MACRO MAGIC
1788 1916
1789Libev can be compiled with a variety of options, the most fundemantal is 1917Libev can be compiled with a variety of options, the most fundemantal is
1790C<EV_MULTIPLICITY>. This option determines wether (most) functions and 1918C<EV_MULTIPLICITY>. This option determines whether (most) functions and
1791callbacks have an initial C<struct ev_loop *> argument. 1919callbacks have an initial C<struct ev_loop *> argument.
1792 1920
1793To make it easier to write programs that cope with either variant, the 1921To make it easier to write programs that cope with either variant, the
1794following macros are defined: 1922following macros are defined:
1795 1923
1828Similar to the other two macros, this gives you the value of the default 1956Similar to the other two macros, this gives you the value of the default
1829loop, if multiple loops are supported ("ev loop default"). 1957loop, if multiple loops are supported ("ev loop default").
1830 1958
1831=back 1959=back
1832 1960
1833Example: Declare and initialise a check watcher, working regardless of 1961Example: Declare and initialise a check watcher, utilising the above
1834wether multiple loops are supported or not. 1962macros so it will work regardless of whether multiple loops are supported
1963or not.
1835 1964
1836 static void 1965 static void
1837 check_cb (EV_P_ ev_timer *w, int revents) 1966 check_cb (EV_P_ ev_timer *w, int revents)
1838 { 1967 {
1839 ev_check_stop (EV_A_ w); 1968 ev_check_stop (EV_A_ w);
1841 1970
1842 ev_check check; 1971 ev_check check;
1843 ev_check_init (&check, check_cb); 1972 ev_check_init (&check, check_cb);
1844 ev_check_start (EV_DEFAULT_ &check); 1973 ev_check_start (EV_DEFAULT_ &check);
1845 ev_loop (EV_DEFAULT_ 0); 1974 ev_loop (EV_DEFAULT_ 0);
1846
1847 1975
1848=head1 EMBEDDING 1976=head1 EMBEDDING
1849 1977
1850Libev can (and often is) directly embedded into host 1978Libev can (and often is) directly embedded into host
1851applications. Examples of applications that embed it include the Deliantra 1979applications. Examples of applications that embed it include the Deliantra
1891 ev_vars.h 2019 ev_vars.h
1892 ev_wrap.h 2020 ev_wrap.h
1893 2021
1894 ev_win32.c required on win32 platforms only 2022 ev_win32.c required on win32 platforms only
1895 2023
1896 ev_select.c only when select backend is enabled (which is by default) 2024 ev_select.c only when select backend is enabled (which is enabled by default)
1897 ev_poll.c only when poll backend is enabled (disabled by default) 2025 ev_poll.c only when poll backend is enabled (disabled by default)
1898 ev_epoll.c only when the epoll backend is enabled (disabled by default) 2026 ev_epoll.c only when the epoll backend is enabled (disabled by default)
1899 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 2027 ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
1900 ev_port.c only when the solaris port backend is enabled (disabled by default) 2028 ev_port.c only when the solaris port backend is enabled (disabled by default)
1901 2029
2064will have the C<struct ev_loop *> as first argument, and you can create 2192will have the C<struct ev_loop *> as first argument, and you can create
2065additional independent event loops. Otherwise there will be no support 2193additional independent event loops. Otherwise there will be no support
2066for multiple event loops and there is no first event loop pointer 2194for multiple event loops and there is no first event loop pointer
2067argument. Instead, all functions act on the single default loop. 2195argument. Instead, all functions act on the single default loop.
2068 2196
2197=item EV_MINPRI
2198
2199=item EV_MAXPRI
2200
2201The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2202C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2203provide for more priorities by overriding those symbols (usually defined
2204to be C<-2> and C<2>, respectively).
2205
2206When doing priority-based operations, libev usually has to linearly search
2207all the priorities, so having many of them (hundreds) uses a lot of space
2208and time, so using the defaults of five priorities (-2 .. +2) is usually
2209fine.
2210
2211If your embedding app does not need any priorities, defining these both to
2212C<0> will save some memory and cpu.
2213
2069=item EV_PERIODIC_ENABLE 2214=item EV_PERIODIC_ENABLE
2070 2215
2071If undefined or defined to be C<1>, then periodic timers are supported. If 2216If undefined or defined to be C<1>, then periodic timers are supported. If
2217defined to be C<0>, then they are not. Disabling them saves a few kB of
2218code.
2219
2220=item EV_IDLE_ENABLE
2221
2222If undefined or defined to be C<1>, then idle watchers are supported. If
2072defined to be C<0>, then they are not. Disabling them saves a few kB of 2223defined to be C<0>, then they are not. Disabling them saves a few kB of
2073code. 2224code.
2074 2225
2075=item EV_EMBED_ENABLE 2226=item EV_EMBED_ENABLE
2076 2227
2143interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file 2294interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file
2144will be compiled. It is pretty complex because it provides its own header 2295will be compiled. It is pretty complex because it provides its own header
2145file. 2296file.
2146 2297
2147The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 2298The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2148that everybody includes and which overrides some autoconf choices: 2299that everybody includes and which overrides some configure choices:
2149 2300
2301 #define EV_MINIMAL 1
2150 #define EV_USE_POLL 0 2302 #define EV_USE_POLL 0
2151 #define EV_MULTIPLICITY 0 2303 #define EV_MULTIPLICITY 0
2152 #define EV_PERIODICS 0 2304 #define EV_PERIODIC_ENABLE 0
2305 #define EV_STAT_ENABLE 0
2306 #define EV_FORK_ENABLE 0
2153 #define EV_CONFIG_H <config.h> 2307 #define EV_CONFIG_H <config.h>
2308 #define EV_MINPRI 0
2309 #define EV_MAXPRI 0
2154 2310
2155 #include "ev++.h" 2311 #include "ev++.h"
2156 2312
2157And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 2313And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2158 2314
2164 2320
2165In this section the complexities of (many of) the algorithms used inside 2321In this section the complexities of (many of) the algorithms used inside
2166libev will be explained. For complexity discussions about backends see the 2322libev will be explained. For complexity discussions about backends see the
2167documentation for C<ev_default_init>. 2323documentation for C<ev_default_init>.
2168 2324
2325All of the following are about amortised time: If an array needs to be
2326extended, libev needs to realloc and move the whole array, but this
2327happens asymptotically never with higher number of elements, so O(1) might
2328mean it might do a lengthy realloc operation in rare cases, but on average
2329it is much faster and asymptotically approaches constant time.
2330
2169=over 4 2331=over 4
2170 2332
2171=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2333=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2172 2334
2335This means that, when you have a watcher that triggers in one hour and
2336there are 100 watchers that would trigger before that then inserting will
2337have to skip those 100 watchers.
2338
2173=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2339=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)
2174 2340
2341That means that for changing a timer costs less than removing/adding them
2342as only the relative motion in the event queue has to be paid for.
2343
2175=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2344=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2176 2345
2346These just add the watcher into an array or at the head of a list.
2177=item Stopping check/prepare/idle watchers: O(1) 2347=item Stopping check/prepare/idle watchers: O(1)
2178 2348
2179=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 2349=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2180 2350
2351These watchers are stored in lists then need to be walked to find the
2352correct watcher to remove. The lists are usually short (you don't usually
2353have many watchers waiting for the same fd or signal).
2354
2181=item Finding the next timer per loop iteration: O(1) 2355=item Finding the next timer per loop iteration: O(1)
2182 2356
2183=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2357=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2184 2358
2359A change means an I/O watcher gets started or stopped, which requires
2360libev to recalculate its status (and possibly tell the kernel).
2361
2185=item Activating one watcher: O(1) 2362=item Activating one watcher: O(1)
2186 2363
2364=item Priority handling: O(number_of_priorities)
2365
2366Priorities are implemented by allocating some space for each
2367priority. When doing priority-based operations, libev usually has to
2368linearly search all the priorities.
2369
2187=back 2370=back
2188 2371
2189 2372
2190=head1 AUTHOR 2373=head1 AUTHOR
2191 2374

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines