… | |
… | |
127 | .\} |
127 | .\} |
128 | .rm #[ #] #H #V #F C |
128 | .rm #[ #] #H #V #F C |
129 | .\" ======================================================================== |
129 | .\" ======================================================================== |
130 | .\" |
130 | .\" |
131 | .IX Title ""<STANDARD INPUT>" 1" |
131 | .IX Title ""<STANDARD INPUT>" 1" |
132 | .TH "<STANDARD INPUT>" 1 "2007-11-29" "perl v5.8.8" "User Contributed Perl Documentation" |
132 | .TH "<STANDARD INPUT>" 1 "2007-12-07" "perl v5.8.8" "User Contributed Perl Documentation" |
133 | .SH "NAME" |
133 | .SH "NAME" |
134 | libev \- a high performance full\-featured event loop written in C |
134 | libev \- a high performance full\-featured event loop written in C |
135 | .SH "SYNOPSIS" |
135 | .SH "SYNOPSIS" |
136 | .IX Header "SYNOPSIS" |
136 | .IX Header "SYNOPSIS" |
137 | .Vb 1 |
137 | .Vb 1 |
… | |
… | |
196 | \& return 0; |
196 | \& return 0; |
197 | \& } |
197 | \& } |
198 | .Ve |
198 | .Ve |
199 | .SH "DESCRIPTION" |
199 | .SH "DESCRIPTION" |
200 | .IX Header "DESCRIPTION" |
200 | .IX Header "DESCRIPTION" |
|
|
201 | The newest version of this document is also available as a html-formatted |
|
|
202 | web page you might find easier to navigate when reading it for the first |
|
|
203 | time: <http://cvs.schmorp.de/libev/ev.html>. |
|
|
204 | .PP |
201 | Libev is an event loop: you register interest in certain events (such as a |
205 | Libev is an event loop: you register interest in certain events (such as a |
202 | file descriptor being readable or a timeout occuring), and it will manage |
206 | file descriptor being readable or a timeout occuring), and it will manage |
203 | these event sources and provide your program with events. |
207 | these event sources and provide your program with events. |
204 | .PP |
208 | .PP |
205 | To do this, it must take more or less complete control over your process |
209 | To do this, it must take more or less complete control over your process |
… | |
… | |
420 | a fork, you can also make libev check for a fork in each iteration by |
424 | a fork, you can also make libev check for a fork in each iteration by |
421 | enabling this flag. |
425 | enabling this flag. |
422 | .Sp |
426 | .Sp |
423 | This works by calling \f(CW\*(C`getpid ()\*(C'\fR on every iteration of the loop, |
427 | This works by calling \f(CW\*(C`getpid ()\*(C'\fR on every iteration of the loop, |
424 | and thus this might slow down your event loop if you do a lot of loop |
428 | and thus this might slow down your event loop if you do a lot of loop |
425 | iterations and little real work, but is usually not noticable (on my |
429 | iterations and little real work, but is usually not noticeable (on my |
426 | Linux system for example, \f(CW\*(C`getpid\*(C'\fR is actually a simple 5\-insn sequence |
430 | Linux system for example, \f(CW\*(C`getpid\*(C'\fR is actually a simple 5\-insn sequence |
427 | without a syscall and thus \fIvery\fR fast, but my Linux system also has |
431 | without a syscall and thus \fIvery\fR fast, but my Linux system also has |
428 | \&\f(CW\*(C`pthread_atfork\*(C'\fR which is even faster). |
432 | \&\f(CW\*(C`pthread_atfork\*(C'\fR which is even faster). |
429 | .Sp |
433 | .Sp |
430 | The big advantage of this flag is that you can forget about fork (and |
434 | The big advantage of this flag is that you can forget about fork (and |
… | |
… | |
581 | .IP "ev_loop_fork (loop)" 4 |
585 | .IP "ev_loop_fork (loop)" 4 |
582 | .IX Item "ev_loop_fork (loop)" |
586 | .IX Item "ev_loop_fork (loop)" |
583 | Like \f(CW\*(C`ev_default_fork\*(C'\fR, but acts on an event loop created by |
587 | Like \f(CW\*(C`ev_default_fork\*(C'\fR, but acts on an event loop created by |
584 | \&\f(CW\*(C`ev_loop_new\*(C'\fR. Yes, you have to call this on every allocated event loop |
588 | \&\f(CW\*(C`ev_loop_new\*(C'\fR. Yes, you have to call this on every allocated event loop |
585 | after fork, and how you do this is entirely your own problem. |
589 | after fork, and how you do this is entirely your own problem. |
|
|
590 | .IP "unsigned int ev_loop_count (loop)" 4 |
|
|
591 | .IX Item "unsigned int ev_loop_count (loop)" |
|
|
592 | Returns the count of loop iterations for the loop, which is identical to |
|
|
593 | the number of times libev did poll for new events. It starts at \f(CW0\fR and |
|
|
594 | happily wraps around with enough iterations. |
|
|
595 | .Sp |
|
|
596 | This value can sometimes be useful as a generation counter of sorts (it |
|
|
597 | \&\*(L"ticks\*(R" the number of loop iterations), as it roughly corresponds with |
|
|
598 | \&\f(CW\*(C`ev_prepare\*(C'\fR and \f(CW\*(C`ev_check\*(C'\fR calls. |
586 | .IP "unsigned int ev_backend (loop)" 4 |
599 | .IP "unsigned int ev_backend (loop)" 4 |
587 | .IX Item "unsigned int ev_backend (loop)" |
600 | .IX Item "unsigned int ev_backend (loop)" |
588 | Returns one of the \f(CW\*(C`EVBACKEND_*\*(C'\fR flags indicating the event backend in |
601 | Returns one of the \f(CW\*(C`EVBACKEND_*\*(C'\fR flags indicating the event backend in |
589 | use. |
602 | use. |
590 | .IP "ev_tstamp ev_now (loop)" 4 |
603 | .IP "ev_tstamp ev_now (loop)" 4 |
… | |
… | |
885 | Returns the callback currently set on the watcher. |
898 | Returns the callback currently set on the watcher. |
886 | .IP "ev_cb_set (ev_TYPE *watcher, callback)" 4 |
899 | .IP "ev_cb_set (ev_TYPE *watcher, callback)" 4 |
887 | .IX Item "ev_cb_set (ev_TYPE *watcher, callback)" |
900 | .IX Item "ev_cb_set (ev_TYPE *watcher, callback)" |
888 | Change the callback. You can change the callback at virtually any time |
901 | Change the callback. You can change the callback at virtually any time |
889 | (modulo threads). |
902 | (modulo threads). |
|
|
903 | .IP "ev_set_priority (ev_TYPE *watcher, priority)" 4 |
|
|
904 | .IX Item "ev_set_priority (ev_TYPE *watcher, priority)" |
|
|
905 | .PD 0 |
|
|
906 | .IP "int ev_priority (ev_TYPE *watcher)" 4 |
|
|
907 | .IX Item "int ev_priority (ev_TYPE *watcher)" |
|
|
908 | .PD |
|
|
909 | Set and query the priority of the watcher. The priority is a small |
|
|
910 | integer between \f(CW\*(C`EV_MAXPRI\*(C'\fR (default: \f(CW2\fR) and \f(CW\*(C`EV_MINPRI\*(C'\fR |
|
|
911 | (default: \f(CW\*(C`\-2\*(C'\fR). Pending watchers with higher priority will be invoked |
|
|
912 | before watchers with lower priority, but priority will not keep watchers |
|
|
913 | from being executed (except for \f(CW\*(C`ev_idle\*(C'\fR watchers). |
|
|
914 | .Sp |
|
|
915 | This means that priorities are \fIonly\fR used for ordering callback |
|
|
916 | invocation after new events have been received. This is useful, for |
|
|
917 | example, to reduce latency after idling, or more often, to bind two |
|
|
918 | watchers on the same event and make sure one is called first. |
|
|
919 | .Sp |
|
|
920 | If you need to suppress invocation when higher priority events are pending |
|
|
921 | you need to look at \f(CW\*(C`ev_idle\*(C'\fR watchers, which provide this functionality. |
|
|
922 | .Sp |
|
|
923 | The default priority used by watchers when no priority has been set is |
|
|
924 | always \f(CW0\fR, which is supposed to not be too high and not be too low :). |
|
|
925 | .Sp |
|
|
926 | Setting a priority outside the range of \f(CW\*(C`EV_MINPRI\*(C'\fR to \f(CW\*(C`EV_MAXPRI\*(C'\fR is |
|
|
927 | fine, as long as you do not mind that the priority value you query might |
|
|
928 | or might not have been adjusted to be within valid range. |
890 | .Sh "\s-1ASSOCIATING\s0 \s-1CUSTOM\s0 \s-1DATA\s0 \s-1WITH\s0 A \s-1WATCHER\s0" |
929 | .Sh "\s-1ASSOCIATING\s0 \s-1CUSTOM\s0 \s-1DATA\s0 \s-1WITH\s0 A \s-1WATCHER\s0" |
891 | .IX Subsection "ASSOCIATING CUSTOM DATA WITH A WATCHER" |
930 | .IX Subsection "ASSOCIATING CUSTOM DATA WITH A WATCHER" |
892 | Each watcher has, by default, a member \f(CW\*(C`void *data\*(C'\fR that you can change |
931 | Each watcher has, by default, a member \f(CW\*(C`void *data\*(C'\fR that you can change |
893 | and read at any time, libev will completely ignore it. This can be used |
932 | and read at any time, libev will completely ignore it. This can be used |
894 | to associate arbitrary data with your watcher. If you need more data and |
933 | to associate arbitrary data with your watcher. If you need more data and |
… | |
… | |
1005 | it is best to always use non-blocking I/O: An extra \f(CW\*(C`read\*(C'\fR(2) returning |
1044 | it is best to always use non-blocking I/O: An extra \f(CW\*(C`read\*(C'\fR(2) returning |
1006 | \&\f(CW\*(C`EAGAIN\*(C'\fR is far preferable to a program hanging until some data arrives. |
1045 | \&\f(CW\*(C`EAGAIN\*(C'\fR is far preferable to a program hanging until some data arrives. |
1007 | .PP |
1046 | .PP |
1008 | If you cannot run the fd in non-blocking mode (for example you should not |
1047 | If you cannot run the fd in non-blocking mode (for example you should not |
1009 | play around with an Xlib connection), then you have to seperately re-test |
1048 | play around with an Xlib connection), then you have to seperately re-test |
1010 | wether a file descriptor is really ready with a known-to-be good interface |
1049 | whether a file descriptor is really ready with a known-to-be good interface |
1011 | such as poll (fortunately in our Xlib example, Xlib already does this on |
1050 | such as poll (fortunately in our Xlib example, Xlib already does this on |
1012 | its own, so its quite safe to use). |
1051 | its own, so its quite safe to use). |
1013 | .IP "ev_io_init (ev_io *, callback, int fd, int events)" 4 |
1052 | .IP "ev_io_init (ev_io *, callback, int fd, int events)" 4 |
1014 | .IX Item "ev_io_init (ev_io *, callback, int fd, int events)" |
1053 | .IX Item "ev_io_init (ev_io *, callback, int fd, int events)" |
1015 | .PD 0 |
1054 | .PD 0 |
… | |
… | |
1499 | \& ev_stat_start (loop, &passwd); |
1538 | \& ev_stat_start (loop, &passwd); |
1500 | .Ve |
1539 | .Ve |
1501 | .ie n .Sh """ev_idle"" \- when you've got nothing better to do..." |
1540 | .ie n .Sh """ev_idle"" \- when you've got nothing better to do..." |
1502 | .el .Sh "\f(CWev_idle\fP \- when you've got nothing better to do..." |
1541 | .el .Sh "\f(CWev_idle\fP \- when you've got nothing better to do..." |
1503 | .IX Subsection "ev_idle - when you've got nothing better to do..." |
1542 | .IX Subsection "ev_idle - when you've got nothing better to do..." |
1504 | Idle watchers trigger events when there are no other events are pending |
1543 | Idle watchers trigger events when no other events of the same or higher |
1505 | (prepare, check and other idle watchers do not count). That is, as long |
1544 | priority are pending (prepare, check and other idle watchers do not |
1506 | as your process is busy handling sockets or timeouts (or even signals, |
1545 | count). |
1507 | imagine) it will not be triggered. But when your process is idle all idle |
1546 | .PP |
1508 | watchers are being called again and again, once per event loop iteration \- |
1547 | That is, as long as your process is busy handling sockets or timeouts |
|
|
1548 | (or even signals, imagine) of the same or higher priority it will not be |
|
|
1549 | triggered. But when your process is idle (or only lower-priority watchers |
|
|
1550 | are pending), the idle watchers are being called once per event loop |
1509 | until stopped, that is, or your process receives more events and becomes |
1551 | iteration \- until stopped, that is, or your process receives more events |
1510 | busy. |
1552 | and becomes busy again with higher priority stuff. |
1511 | .PP |
1553 | .PP |
1512 | The most noteworthy effect is that as long as any idle watchers are |
1554 | The most noteworthy effect is that as long as any idle watchers are |
1513 | active, the process will not block when waiting for new events. |
1555 | active, the process will not block when waiting for new events. |
1514 | .PP |
1556 | .PP |
1515 | Apart from keeping your process non-blocking (which is a useful |
1557 | Apart from keeping your process non-blocking (which is a useful |
… | |
… | |
1610 | \& if (revents & EV_READ ) fd->revents |= fd->events & POLLIN; |
1652 | \& if (revents & EV_READ ) fd->revents |= fd->events & POLLIN; |
1611 | \& if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT; |
1653 | \& if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT; |
1612 | \& } |
1654 | \& } |
1613 | .Ve |
1655 | .Ve |
1614 | .PP |
1656 | .PP |
1615 | .Vb 7 |
1657 | .Vb 8 |
1616 | \& // create io watchers for each fd and a timer before blocking |
1658 | \& // create io watchers for each fd and a timer before blocking |
1617 | \& static void |
1659 | \& static void |
1618 | \& adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) |
1660 | \& adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) |
1619 | \& { |
1661 | \& { |
1620 | \& int timeout = 3600000;truct pollfd fds [nfd]; |
1662 | \& int timeout = 3600000; |
|
|
1663 | \& struct pollfd fds [nfd]; |
1621 | \& // actual code will need to loop here and realloc etc. |
1664 | \& // actual code will need to loop here and realloc etc. |
1622 | \& adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); |
1665 | \& adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); |
1623 | .Ve |
1666 | .Ve |
1624 | .PP |
1667 | .PP |
1625 | .Vb 3 |
1668 | .Vb 3 |
… | |
… | |
1952 | \& } |
1995 | \& } |
1953 | .Ve |
1996 | .Ve |
1954 | .SH "MACRO MAGIC" |
1997 | .SH "MACRO MAGIC" |
1955 | .IX Header "MACRO MAGIC" |
1998 | .IX Header "MACRO MAGIC" |
1956 | Libev can be compiled with a variety of options, the most fundemantal is |
1999 | Libev can be compiled with a variety of options, the most fundemantal is |
1957 | \&\f(CW\*(C`EV_MULTIPLICITY\*(C'\fR. This option determines wether (most) functions and |
2000 | \&\f(CW\*(C`EV_MULTIPLICITY\*(C'\fR. This option determines whether (most) functions and |
1958 | callbacks have an initial \f(CW\*(C`struct ev_loop *\*(C'\fR argument. |
2001 | callbacks have an initial \f(CW\*(C`struct ev_loop *\*(C'\fR argument. |
1959 | .PP |
2002 | .PP |
1960 | To make it easier to write programs that cope with either variant, the |
2003 | To make it easier to write programs that cope with either variant, the |
1961 | following macros are defined: |
2004 | following macros are defined: |
1962 | .ie n .IP """EV_A""\fR, \f(CW""EV_A_""" 4 |
2005 | .ie n .IP """EV_A""\fR, \f(CW""EV_A_""" 4 |
… | |
… | |
1998 | .IX Item "EV_DEFAULT, EV_DEFAULT_" |
2041 | .IX Item "EV_DEFAULT, EV_DEFAULT_" |
1999 | Similar to the other two macros, this gives you the value of the default |
2042 | Similar to the other two macros, this gives you the value of the default |
2000 | loop, if multiple loops are supported (\*(L"ev loop default\*(R"). |
2043 | loop, if multiple loops are supported (\*(L"ev loop default\*(R"). |
2001 | .PP |
2044 | .PP |
2002 | Example: Declare and initialise a check watcher, utilising the above |
2045 | Example: Declare and initialise a check watcher, utilising the above |
2003 | macros so it will work regardless of wether multiple loops are supported |
2046 | macros so it will work regardless of whether multiple loops are supported |
2004 | or not. |
2047 | or not. |
2005 | .PP |
2048 | .PP |
2006 | .Vb 5 |
2049 | .Vb 5 |
2007 | \& static void |
2050 | \& static void |
2008 | \& check_cb (EV_P_ ev_timer *w, int revents) |
2051 | \& check_cb (EV_P_ ev_timer *w, int revents) |
… | |
… | |
2235 | If undefined or defined to \f(CW1\fR, then all event-loop-specific functions |
2278 | If undefined or defined to \f(CW1\fR, then all event-loop-specific functions |
2236 | will have the \f(CW\*(C`struct ev_loop *\*(C'\fR as first argument, and you can create |
2279 | will have the \f(CW\*(C`struct ev_loop *\*(C'\fR as first argument, and you can create |
2237 | additional independent event loops. Otherwise there will be no support |
2280 | additional independent event loops. Otherwise there will be no support |
2238 | for multiple event loops and there is no first event loop pointer |
2281 | for multiple event loops and there is no first event loop pointer |
2239 | argument. Instead, all functions act on the single default loop. |
2282 | argument. Instead, all functions act on the single default loop. |
|
|
2283 | .IP "\s-1EV_MINPRI\s0" 4 |
|
|
2284 | .IX Item "EV_MINPRI" |
|
|
2285 | .PD 0 |
|
|
2286 | .IP "\s-1EV_MAXPRI\s0" 4 |
|
|
2287 | .IX Item "EV_MAXPRI" |
|
|
2288 | .PD |
|
|
2289 | The range of allowed priorities. \f(CW\*(C`EV_MINPRI\*(C'\fR must be smaller or equal to |
|
|
2290 | \&\f(CW\*(C`EV_MAXPRI\*(C'\fR, but otherwise there are no non-obvious limitations. You can |
|
|
2291 | provide for more priorities by overriding those symbols (usually defined |
|
|
2292 | to be \f(CW\*(C`\-2\*(C'\fR and \f(CW2\fR, respectively). |
|
|
2293 | .Sp |
|
|
2294 | When doing priority-based operations, libev usually has to linearly search |
|
|
2295 | all the priorities, so having many of them (hundreds) uses a lot of space |
|
|
2296 | and time, so using the defaults of five priorities (\-2 .. +2) is usually |
|
|
2297 | fine. |
|
|
2298 | .Sp |
|
|
2299 | If your embedding app does not need any priorities, defining these both to |
|
|
2300 | \&\f(CW0\fR will save some memory and cpu. |
2240 | .IP "\s-1EV_PERIODIC_ENABLE\s0" 4 |
2301 | .IP "\s-1EV_PERIODIC_ENABLE\s0" 4 |
2241 | .IX Item "EV_PERIODIC_ENABLE" |
2302 | .IX Item "EV_PERIODIC_ENABLE" |
2242 | If undefined or defined to be \f(CW1\fR, then periodic timers are supported. If |
2303 | If undefined or defined to be \f(CW1\fR, then periodic timers are supported. If |
|
|
2304 | defined to be \f(CW0\fR, then they are not. Disabling them saves a few kB of |
|
|
2305 | code. |
|
|
2306 | .IP "\s-1EV_IDLE_ENABLE\s0" 4 |
|
|
2307 | .IX Item "EV_IDLE_ENABLE" |
|
|
2308 | If undefined or defined to be \f(CW1\fR, then idle watchers are supported. If |
2243 | defined to be \f(CW0\fR, then they are not. Disabling them saves a few kB of |
2309 | defined to be \f(CW0\fR, then they are not. Disabling them saves a few kB of |
2244 | code. |
2310 | code. |
2245 | .IP "\s-1EV_EMBED_ENABLE\s0" 4 |
2311 | .IP "\s-1EV_EMBED_ENABLE\s0" 4 |
2246 | .IX Item "EV_EMBED_ENABLE" |
2312 | .IX Item "EV_EMBED_ENABLE" |
2247 | If undefined or defined to be \f(CW1\fR, then embed watchers are supported. If |
2313 | If undefined or defined to be \f(CW1\fR, then embed watchers are supported. If |
… | |
… | |
2341 | libev will be explained. For complexity discussions about backends see the |
2407 | libev will be explained. For complexity discussions about backends see the |
2342 | documentation for \f(CW\*(C`ev_default_init\*(C'\fR. |
2408 | documentation for \f(CW\*(C`ev_default_init\*(C'\fR. |
2343 | .RS 4 |
2409 | .RS 4 |
2344 | .IP "Starting and stopping timer/periodic watchers: O(log skipped_other_timers)" 4 |
2410 | .IP "Starting and stopping timer/periodic watchers: O(log skipped_other_timers)" 4 |
2345 | .IX Item "Starting and stopping timer/periodic watchers: O(log skipped_other_timers)" |
2411 | .IX Item "Starting and stopping timer/periodic watchers: O(log skipped_other_timers)" |
2346 | .PD 0 |
2412 | This means that, when you have a watcher that triggers in one hour and |
|
|
2413 | there are 100 watchers that would trigger before that then inserting will |
|
|
2414 | have to skip those 100 watchers. |
2347 | .IP "Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)" 4 |
2415 | .IP "Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)" 4 |
2348 | .IX Item "Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)" |
2416 | .IX Item "Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)" |
|
|
2417 | That means that for changing a timer costs less than removing/adding them |
|
|
2418 | as only the relative motion in the event queue has to be paid for. |
2349 | .IP "Starting io/check/prepare/idle/signal/child watchers: O(1)" 4 |
2419 | .IP "Starting io/check/prepare/idle/signal/child watchers: O(1)" 4 |
2350 | .IX Item "Starting io/check/prepare/idle/signal/child watchers: O(1)" |
2420 | .IX Item "Starting io/check/prepare/idle/signal/child watchers: O(1)" |
|
|
2421 | These just add the watcher into an array or at the head of a list. If |
|
|
2422 | the array needs to be extended libev needs to realloc and move the whole |
|
|
2423 | array, but this happen asymptotically less and less with more watchers, |
|
|
2424 | thus amortised O(1). |
2351 | .IP "Stopping check/prepare/idle watchers: O(1)" 4 |
2425 | .IP "Stopping check/prepare/idle watchers: O(1)" 4 |
2352 | .IX Item "Stopping check/prepare/idle watchers: O(1)" |
2426 | .IX Item "Stopping check/prepare/idle watchers: O(1)" |
|
|
2427 | .PD 0 |
2353 | .IP "Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % \s-1EV_PID_HASHSIZE\s0))" 4 |
2428 | .IP "Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % \s-1EV_PID_HASHSIZE\s0))" 4 |
2354 | .IX Item "Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))" |
2429 | .IX Item "Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))" |
|
|
2430 | .PD |
|
|
2431 | These watchers are stored in lists then need to be walked to find the |
|
|
2432 | correct watcher to remove. The lists are usually short (you don't usually |
|
|
2433 | have many watchers waiting for the same fd or signal). |
2355 | .IP "Finding the next timer per loop iteration: O(1)" 4 |
2434 | .IP "Finding the next timer per loop iteration: O(1)" 4 |
2356 | .IX Item "Finding the next timer per loop iteration: O(1)" |
2435 | .IX Item "Finding the next timer per loop iteration: O(1)" |
|
|
2436 | .PD 0 |
2357 | .IP "Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)" 4 |
2437 | .IP "Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)" 4 |
2358 | .IX Item "Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)" |
2438 | .IX Item "Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)" |
|
|
2439 | .PD |
|
|
2440 | A change means an I/O watcher gets started or stopped, which requires |
|
|
2441 | libev to recalculate its status (and possibly tell the kernel). |
2359 | .IP "Activating one watcher: O(1)" 4 |
2442 | .IP "Activating one watcher: O(1)" 4 |
2360 | .IX Item "Activating one watcher: O(1)" |
2443 | .IX Item "Activating one watcher: O(1)" |
|
|
2444 | .PD 0 |
|
|
2445 | .IP "Priority handling: O(number_of_priorities)" 4 |
|
|
2446 | .IX Item "Priority handling: O(number_of_priorities)" |
|
|
2447 | .PD |
|
|
2448 | Priorities are implemented by allocating some space for each |
|
|
2449 | priority. When doing priority-based operations, libev usually has to |
|
|
2450 | linearly search all the priorities. |
2361 | .RE |
2451 | .RE |
2362 | .RS 4 |
2452 | .RS 4 |
2363 | .PD |
|
|
2364 | .SH "AUTHOR" |
2453 | .SH "AUTHOR" |
2365 | .IX Header "AUTHOR" |
2454 | .IX Header "AUTHOR" |
2366 | Marc Lehmann <libev@schmorp.de>. |
2455 | Marc Lehmann <libev@schmorp.de>. |