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

Comparing libev/ev.pod (file contents):
Revision 1.65 by ayin, Sat Dec 1 15:38:54 2007 UTC vs.
Revision 1.76 by root, Sat Dec 8 15:30:30 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
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.
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>.
738 793
739=back 794=back
740 795
741 796
742=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 797=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
848it 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
849C<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.
850 905
851If 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
852play 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
853wether 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
854such 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
855its own, so its quite safe to use). 910its own, so its quite safe to use).
856 911
857=over 4 912=over 4
858 913
1341 ev_stat_start (loop, &passwd); 1396 ev_stat_start (loop, &passwd);
1342 1397
1343 1398
1344=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...
1345 1400
1346Idle watchers trigger events when there are no other events are pending 1401Idle 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 1402priority are pending (prepare, check and other idle watchers do not
1348as your process is busy handling sockets or timeouts (or even signals, 1403count).
1349imagine) it will not be triggered. But when your process is idle all idle 1404
1350watchers 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
1351until stopped, that is, or your process receives more events and becomes 1409iteration - until stopped, that is, or your process receives more events
1352busy. 1410and becomes busy again with higher priority stuff.
1353 1411
1354The 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
1355active, the process will not block when waiting for new events. 1413active, the process will not block when waiting for new events.
1356 1414
1357Apart from keeping your process non-blocking (which is a useful 1415Apart from keeping your process non-blocking (which is a useful
1435parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 1493parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1436macros, but using them is utterly, utterly and completely pointless. 1494macros, but using them is utterly, utterly and completely pointless.
1437 1495
1438=back 1496=back
1439 1497
1440Example: To include a library such as adns, you would add IO watchers 1498There are a number of principal ways to embed other event loops or modules
1441and a timeout watcher in a prepare handler, as required by libadns, and 1499into libev. Here are some ideas on how to include libadns into libev
1500(there is a Perl module named C<EV::ADNS> that does this, which you could
1501use for an actually working example. Another Perl module named C<EV::Glib>
1502embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV
1503into the Glib event loop).
1504
1505Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1442in a check watcher, destroy them and call into libadns. What follows is 1506and in a check watcher, destroy them and call into libadns. What follows
1443pseudo-code only of course: 1507is pseudo-code only of course. This requires you to either use a low
1508priority for the check watcher or use C<ev_clear_pending> explicitly, as
1509the callbacks for the IO/timeout watchers might not have been called yet.
1444 1510
1445 static ev_io iow [nfd]; 1511 static ev_io iow [nfd];
1446 static ev_timer tw; 1512 static ev_timer tw;
1447 1513
1448 static void 1514 static void
1449 io_cb (ev_loop *loop, ev_io *w, int revents) 1515 io_cb (ev_loop *loop, ev_io *w, int revents)
1450 { 1516 {
1451 // set the relevant poll flags
1452 // could also call adns_processreadable etc. here
1453 struct pollfd *fd = (struct pollfd *)w->data;
1454 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1455 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1456 } 1517 }
1457 1518
1458 // create io watchers for each fd and a timer before blocking 1519 // create io watchers for each fd and a timer before blocking
1459 static void 1520 static void
1460 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 1521 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1466 1527
1467 /* the callback is illegal, but won't be called as we stop during check */ 1528 /* the callback is illegal, but won't be called as we stop during check */
1468 ev_timer_init (&tw, 0, timeout * 1e-3); 1529 ev_timer_init (&tw, 0, timeout * 1e-3);
1469 ev_timer_start (loop, &tw); 1530 ev_timer_start (loop, &tw);
1470 1531
1471 // create on ev_io per pollfd 1532 // create one ev_io per pollfd
1472 for (int i = 0; i < nfd; ++i) 1533 for (int i = 0; i < nfd; ++i)
1473 { 1534 {
1474 ev_io_init (iow + i, io_cb, fds [i].fd, 1535 ev_io_init (iow + i, io_cb, fds [i].fd,
1475 ((fds [i].events & POLLIN ? EV_READ : 0) 1536 ((fds [i].events & POLLIN ? EV_READ : 0)
1476 | (fds [i].events & POLLOUT ? EV_WRITE : 0))); 1537 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1477 1538
1478 fds [i].revents = 0; 1539 fds [i].revents = 0;
1479 iow [i].data = fds + i;
1480 ev_io_start (loop, iow + i); 1540 ev_io_start (loop, iow + i);
1481 } 1541 }
1482 } 1542 }
1483 1543
1484 // stop all watchers after blocking 1544 // stop all watchers after blocking
1486 adns_check_cb (ev_loop *loop, ev_check *w, int revents) 1546 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1487 { 1547 {
1488 ev_timer_stop (loop, &tw); 1548 ev_timer_stop (loop, &tw);
1489 1549
1490 for (int i = 0; i < nfd; ++i) 1550 for (int i = 0; i < nfd; ++i)
1551 {
1552 // set the relevant poll flags
1553 // could also call adns_processreadable etc. here
1554 struct pollfd *fd = fds + i;
1555 int revents = ev_clear_pending (iow + i);
1556 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1557 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1558
1559 // now stop the watcher
1491 ev_io_stop (loop, iow + i); 1560 ev_io_stop (loop, iow + i);
1561 }
1492 1562
1493 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); 1563 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1564 }
1565
1566Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1567in the prepare watcher and would dispose of the check watcher.
1568
1569Method 3: If the module to be embedded supports explicit event
1570notification (adns does), you can also make use of the actual watcher
1571callbacks, and only destroy/create the watchers in the prepare watcher.
1572
1573 static void
1574 timer_cb (EV_P_ ev_timer *w, int revents)
1575 {
1576 adns_state ads = (adns_state)w->data;
1577 update_now (EV_A);
1578
1579 adns_processtimeouts (ads, &tv_now);
1580 }
1581
1582 static void
1583 io_cb (EV_P_ ev_io *w, int revents)
1584 {
1585 adns_state ads = (adns_state)w->data;
1586 update_now (EV_A);
1587
1588 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1589 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1590 }
1591
1592 // do not ever call adns_afterpoll
1593
1594Method 4: Do not use a prepare or check watcher because the module you
1595want to embed is too inflexible to support it. Instead, youc na override
1596their poll function. The drawback with this solution is that the main
1597loop is now no longer controllable by EV. The C<Glib::EV> module does
1598this.
1599
1600 static gint
1601 event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1602 {
1603 int got_events = 0;
1604
1605 for (n = 0; n < nfds; ++n)
1606 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1607
1608 if (timeout >= 0)
1609 // create/start timer
1610
1611 // poll
1612 ev_loop (EV_A_ 0);
1613
1614 // stop timer again
1615 if (timeout >= 0)
1616 ev_timer_stop (EV_A_ &to);
1617
1618 // stop io watchers again - their callbacks should have set
1619 for (n = 0; n < nfds; ++n)
1620 ev_io_stop (EV_A_ iow [n]);
1621
1622 return got_events;
1494 } 1623 }
1495 1624
1496 1625
1497=head2 C<ev_embed> - when one backend isn't enough... 1626=head2 C<ev_embed> - when one backend isn't enough...
1498 1627
1702 1831
1703To use it, 1832To use it,
1704 1833
1705 #include <ev++.h> 1834 #include <ev++.h>
1706 1835
1707(it is not installed by default). This automatically includes F<ev.h> 1836This 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 1837of them macros) into the global namespace. All C++ specific things are
1709namespace. All C++ specific things are put into the C<ev> namespace. 1838put into the C<ev> namespace. It should support all the same embedding
1839options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
1710 1840
1711It should support all the same embedding options as F<ev.h>, most notably 1841Care has been taken to keep the overhead low. The only data member the C++
1712C<EV_MULTIPLICITY>. 1842classes add (compared to plain C-style watchers) is the event loop pointer
1843that the watcher is associated with (or no additional members at all if
1844you disable C<EV_MULTIPLICITY> when embedding libev).
1845
1846Currently, functions, and static and non-static member functions can be
1847used as callbacks. Other types should be easy to add as long as they only
1848need one additional pointer for context. If you need support for other
1849types of functors please contact the author (preferably after implementing
1850it).
1713 1851
1714Here is a list of things available in the C<ev> namespace: 1852Here is a list of things available in the C<ev> namespace:
1715 1853
1716=over 4 1854=over 4
1717 1855
1733 1871
1734All of those classes have these methods: 1872All of those classes have these methods:
1735 1873
1736=over 4 1874=over 4
1737 1875
1738=item ev::TYPE::TYPE (object *, object::method *) 1876=item ev::TYPE::TYPE ()
1739 1877
1740=item ev::TYPE::TYPE (object *, object::method *, struct ev_loop *) 1878=item ev::TYPE::TYPE (struct ev_loop *)
1741 1879
1742=item ev::TYPE::~TYPE 1880=item ev::TYPE::~TYPE
1743 1881
1744The constructor takes a pointer to an object and a method pointer to 1882The constructor (optionally) takes an event loop to associate the watcher
1745the event handler callback to call in this class. The constructor calls 1883with. 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 1884
1747before starting it. If you do not specify a loop then the constructor 1885The constructor calls C<ev_init> for you, which means you have to call the
1748automatically associates the default loop with this watcher. 1886C<set> method before starting it.
1887
1888It will not set a callback, however: You have to call the templated C<set>
1889method to set a callback before you can start the watcher.
1890
1891(The reason why you have to use a method is a limitation in C++ which does
1892not allow explicit template arguments for constructors).
1749 1893
1750The destructor automatically stops the watcher if it is active. 1894The destructor automatically stops the watcher if it is active.
1895
1896=item w->set<class, &class::method> (object *)
1897
1898This method sets the callback method to call. The method has to have a
1899signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
1900first argument and the C<revents> as second. The object must be given as
1901parameter and is stored in the C<data> member of the watcher.
1902
1903This method synthesizes efficient thunking code to call your method from
1904the C callback that libev requires. If your compiler can inline your
1905callback (i.e. it is visible to it at the place of the C<set> call and
1906your compiler is good :), then the method will be fully inlined into the
1907thunking function, making it as fast as a direct C callback.
1908
1909Example: simple class declaration and watcher initialisation
1910
1911 struct myclass
1912 {
1913 void io_cb (ev::io &w, int revents) { }
1914 }
1915
1916 myclass obj;
1917 ev::io iow;
1918 iow.set <myclass, &myclass::io_cb> (&obj);
1919
1920=item w->set<function> (void *data = 0)
1921
1922Also sets a callback, but uses a static method or plain function as
1923callback. The optional C<data> argument will be stored in the watcher's
1924C<data> member and is free for you to use.
1925
1926The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
1927
1928See the method-C<set> above for more details.
1929
1930Example:
1931
1932 static void io_cb (ev::io &w, int revents) { }
1933 iow.set <io_cb> ();
1751 1934
1752=item w->set (struct ev_loop *) 1935=item w->set (struct ev_loop *)
1753 1936
1754Associates a different C<struct ev_loop> with this watcher. You can only 1937Associates a different C<struct ev_loop> with this watcher. You can only
1755do this when the watcher is inactive (and not pending either). 1938do this when the watcher is inactive (and not pending either).
1756 1939
1757=item w->set ([args]) 1940=item w->set ([args])
1758 1941
1759Basically the same as C<ev_TYPE_set>, with the same args. Must be 1942Basically 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 1943called at least once. Unlike the C counterpart, an active watcher gets
1761automatically stopped and restarted. 1944automatically stopped and restarted when reconfiguring it with this
1945method.
1762 1946
1763=item w->start () 1947=item w->start ()
1764 1948
1765Starts the watcher. Note that there is no C<loop> argument as the 1949Starts the watcher. Note that there is no C<loop> argument, as the
1766constructor already takes the loop. 1950constructor already stores the event loop.
1767 1951
1768=item w->stop () 1952=item w->stop ()
1769 1953
1770Stops the watcher if it is active. Again, no C<loop> argument. 1954Stops the watcher if it is active. Again, no C<loop> argument.
1771 1955
1796 1980
1797 myclass (); 1981 myclass ();
1798 } 1982 }
1799 1983
1800 myclass::myclass (int fd) 1984 myclass::myclass (int fd)
1801 : io (this, &myclass::io_cb),
1802 idle (this, &myclass::idle_cb)
1803 { 1985 {
1986 io .set <myclass, &myclass::io_cb > (this);
1987 idle.set <myclass, &myclass::idle_cb> (this);
1988
1804 io.start (fd, ev::READ); 1989 io.start (fd, ev::READ);
1805 } 1990 }
1806 1991
1807 1992
1808=head1 MACRO MAGIC 1993=head1 MACRO MAGIC
1809 1994
1810Libev can be compiled with a variety of options, the most fundemantal is 1995Libev can be compiled with a variety of options, the most fundemantal is
1811C<EV_MULTIPLICITY>. This option determines wether (most) functions and 1996C<EV_MULTIPLICITY>. This option determines whether (most) functions and
1812callbacks have an initial C<struct ev_loop *> argument. 1997callbacks have an initial C<struct ev_loop *> argument.
1813 1998
1814To make it easier to write programs that cope with either variant, the 1999To make it easier to write programs that cope with either variant, the
1815following macros are defined: 2000following macros are defined:
1816 2001
1850loop, if multiple loops are supported ("ev loop default"). 2035loop, if multiple loops are supported ("ev loop default").
1851 2036
1852=back 2037=back
1853 2038
1854Example: Declare and initialise a check watcher, utilising the above 2039Example: Declare and initialise a check watcher, utilising the above
1855macros so it will work regardless of wether multiple loops are supported 2040macros so it will work regardless of whether multiple loops are supported
1856or not. 2041or not.
1857 2042
1858 static void 2043 static void
1859 check_cb (EV_P_ ev_timer *w, int revents) 2044 check_cb (EV_P_ ev_timer *w, int revents)
1860 { 2045 {
2085will have the C<struct ev_loop *> as first argument, and you can create 2270will have the C<struct ev_loop *> as first argument, and you can create
2086additional independent event loops. Otherwise there will be no support 2271additional independent event loops. Otherwise there will be no support
2087for multiple event loops and there is no first event loop pointer 2272for multiple event loops and there is no first event loop pointer
2088argument. Instead, all functions act on the single default loop. 2273argument. Instead, all functions act on the single default loop.
2089 2274
2275=item EV_MINPRI
2276
2277=item EV_MAXPRI
2278
2279The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2280C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2281provide for more priorities by overriding those symbols (usually defined
2282to be C<-2> and C<2>, respectively).
2283
2284When doing priority-based operations, libev usually has to linearly search
2285all the priorities, so having many of them (hundreds) uses a lot of space
2286and time, so using the defaults of five priorities (-2 .. +2) is usually
2287fine.
2288
2289If your embedding app does not need any priorities, defining these both to
2290C<0> will save some memory and cpu.
2291
2090=item EV_PERIODIC_ENABLE 2292=item EV_PERIODIC_ENABLE
2091 2293
2092If undefined or defined to be C<1>, then periodic timers are supported. If 2294If undefined or defined to be C<1>, then periodic timers are supported. If
2295defined to be C<0>, then they are not. Disabling them saves a few kB of
2296code.
2297
2298=item EV_IDLE_ENABLE
2299
2300If 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 2301defined to be C<0>, then they are not. Disabling them saves a few kB of
2094code. 2302code.
2095 2303
2096=item EV_EMBED_ENABLE 2304=item EV_EMBED_ENABLE
2097 2305
2190 2398
2191In this section the complexities of (many of) the algorithms used inside 2399In this section the complexities of (many of) the algorithms used inside
2192libev will be explained. For complexity discussions about backends see the 2400libev will be explained. For complexity discussions about backends see the
2193documentation for C<ev_default_init>. 2401documentation for C<ev_default_init>.
2194 2402
2403All of the following are about amortised time: If an array needs to be
2404extended, libev needs to realloc and move the whole array, but this
2405happens asymptotically never with higher number of elements, so O(1) might
2406mean it might do a lengthy realloc operation in rare cases, but on average
2407it is much faster and asymptotically approaches constant time.
2408
2195=over 4 2409=over 4
2196 2410
2197=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2411=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2198 2412
2413This means that, when you have a watcher that triggers in one hour and
2414there are 100 watchers that would trigger before that then inserting will
2415have to skip those 100 watchers.
2416
2199=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2417=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)
2200 2418
2419That means that for changing a timer costs less than removing/adding them
2420as only the relative motion in the event queue has to be paid for.
2421
2201=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2422=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2202 2423
2424These just add the watcher into an array or at the head of a list.
2203=item Stopping check/prepare/idle watchers: O(1) 2425=item Stopping check/prepare/idle watchers: O(1)
2204 2426
2205=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 2427=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2206 2428
2429These watchers are stored in lists then need to be walked to find the
2430correct watcher to remove. The lists are usually short (you don't usually
2431have many watchers waiting for the same fd or signal).
2432
2207=item Finding the next timer per loop iteration: O(1) 2433=item Finding the next timer per loop iteration: O(1)
2208 2434
2209=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2435=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2210 2436
2437A change means an I/O watcher gets started or stopped, which requires
2438libev to recalculate its status (and possibly tell the kernel).
2439
2211=item Activating one watcher: O(1) 2440=item Activating one watcher: O(1)
2212 2441
2442=item Priority handling: O(number_of_priorities)
2443
2444Priorities are implemented by allocating some space for each
2445priority. When doing priority-based operations, libev usually has to
2446linearly search all the priorities.
2447
2213=back 2448=back
2214 2449
2215 2450
2216=head1 AUTHOR 2451=head1 AUTHOR
2217 2452

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines