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

Comparing libev/ev.pod (file contents):
Revision 1.53 by root, Tue Nov 27 20:15:02 2007 UTC vs.
Revision 1.74 by root, Sat Dec 8 14:12:08 2007 UTC

2 2
3libev - a high performance full-featured event loop written in C 3libev - a high performance full-featured event loop written in C
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 /* this is the only header you need */
8 #include <ev.h> 7 #include <ev.h>
9 8
10 /* what follows is a fully working example program */ 9=head1 EXAMPLE PROGRAM
10
11 #include <ev.h>
12
11 ev_io stdin_watcher; 13 ev_io stdin_watcher;
12 ev_timer timeout_watcher; 14 ev_timer timeout_watcher;
13 15
14 /* called when data readable on stdin */ 16 /* called when data readable on stdin */
15 static void 17 static void
45 47
46 return 0; 48 return 0;
47 } 49 }
48 50
49=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>.
50 56
51Libev 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
52file descriptor being readable or a timeout occuring), and it will manage 58file descriptor being readable or a timeout occuring), and it will manage
53these event sources and provide your program with events. 59these event sources and provide your program with events.
54 60
61details of the event, and then hand it over to libev by I<starting> the 67details of the event, and then hand it over to libev by I<starting> the
62watcher. 68watcher.
63 69
64=head1 FEATURES 70=head1 FEATURES
65 71
66Libev supports select, poll, the linux-specific epoll and the bsd-specific 72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
67kqueue mechanisms for file descriptor events, relative timers, absolute 73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
68timers with customised rescheduling, signal events, process status change 74for file descriptor events (C<ev_io>), the Linux C<inotify> interface
69events (related to SIGCHLD), and event watchers dealing with the event 75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
70loop mechanism itself (idle, prepare and check watchers). It also is quite 76with customised rescheduling (C<ev_periodic>), synchronous signals
77(C<ev_signal>), process status change events (C<ev_child>), and event
78watchers dealing with the event loop mechanism itself (C<ev_idle>,
79C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as
80file watchers (C<ev_stat>) and even limited support for fork events
81(C<ev_fork>).
82
83It also is quite fast (see this
71fast (see this L<benchmark|http://libev.schmorp.de/bench.html> comparing 84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
72it to libevent for example). 85for example).
73 86
74=head1 CONVENTIONS 87=head1 CONVENTIONS
75 88
76Libev is very configurable. In this manual the default configuration 89Libev is very configurable. In this manual the default configuration will
77will be described, which supports multiple event loops. For more info 90be described, which supports multiple event loops. For more info about
78about various configuration options please have a look at the file 91various configuration options please have a look at B<EMBED> section in
79F<README.embed> in the libev distribution. If libev was configured without 92this manual. If libev was configured without support for multiple event
80support for multiple event loops, then all functions taking an initial 93loops, then all functions taking an initial argument of name C<loop>
81argument of name C<loop> (which is always of type C<struct ev_loop *>) 94(which is always of type C<struct ev_loop *>) will not have this argument.
82will not have this argument.
83 95
84=head1 TIME REPRESENTATION 96=head1 TIME REPRESENTATION
85 97
86Libev represents time as a single floating point number, representing the 98Libev represents time as a single floating point number, representing the
87(fractional) number of seconds since the (POSIX) epoch (somewhere near 99(fractional) number of seconds since the (POSIX) epoch (somewhere near
116Usually, it's a good idea to terminate if the major versions mismatch, 128Usually, it's a good idea to terminate if the major versions mismatch,
117as this indicates an incompatible change. Minor versions are usually 129as this indicates an incompatible change. Minor versions are usually
118compatible to older versions, so a larger minor version alone is usually 130compatible to older versions, so a larger minor version alone is usually
119not a problem. 131not a problem.
120 132
121Example: make sure we haven't accidentally been linked against the wrong 133Example: Make sure we haven't accidentally been linked against the wrong
122version: 134version.
123 135
124 assert (("libev version mismatch", 136 assert (("libev version mismatch",
125 ev_version_major () == EV_VERSION_MAJOR 137 ev_version_major () == EV_VERSION_MAJOR
126 && ev_version_minor () >= EV_VERSION_MINOR)); 138 && ev_version_minor () >= EV_VERSION_MINOR));
127 139
155C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for 167C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
156recommended ones. 168recommended ones.
157 169
158See the description of C<ev_embed> watchers for more info. 170See the description of C<ev_embed> watchers for more info.
159 171
160=item ev_set_allocator (void *(*cb)(void *ptr, size_t size)) 172=item ev_set_allocator (void *(*cb)(void *ptr, long size))
161 173
162Sets the allocation function to use (the prototype and semantics are 174Sets the allocation function to use (the prototype is similar - the
163identical to the realloc C function). It is used to allocate and free 175semantics is identical - to the realloc C function). It is used to
164memory (no surprises here). If it returns zero when memory needs to be 176allocate and free memory (no surprises here). If it returns zero when
165allocated, the library might abort or take some potentially destructive 177memory needs to be allocated, the library might abort or take some
166action. The default is your system realloc function. 178potentially destructive action. The default is your system realloc
179function.
167 180
168You could override this function in high-availability programs to, say, 181You could override this function in high-availability programs to, say,
169free some memory if it cannot allocate memory, to use a special allocator, 182free some memory if it cannot allocate memory, to use a special allocator,
170or even to sleep a while and retry until some memory is available. 183or even to sleep a while and retry until some memory is available.
171 184
172Example: replace the libev allocator with one that waits a bit and then 185Example: Replace the libev allocator with one that waits a bit and then
173retries: better than mine). 186retries).
174 187
175 static void * 188 static void *
176 persistent_realloc (void *ptr, size_t size) 189 persistent_realloc (void *ptr, size_t size)
177 { 190 {
178 for (;;) 191 for (;;)
197callback is set, then libev will expect it to remedy the sitution, no 210callback is set, then libev will expect it to remedy the sitution, no
198matter what, when it returns. That is, libev will generally retry the 211matter what, when it returns. That is, libev will generally retry the
199requested operation, or, if the condition doesn't go away, do bad stuff 212requested operation, or, if the condition doesn't go away, do bad stuff
200(such as abort). 213(such as abort).
201 214
202Example: do the same thing as libev does internally: 215Example: This is basically the same thing that libev does internally, too.
203 216
204 static void 217 static void
205 fatal_error (const char *msg) 218 fatal_error (const char *msg)
206 { 219 {
207 perror (msg); 220 perror (msg);
257C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 270C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
258override 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
259useful 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
260around bugs. 273around bugs.
261 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
262=item C<EVBACKEND_SELECT> (value 1, portable select backend) 295=item C<EVBACKEND_SELECT> (value 1, portable select backend)
263 296
264This is your standard select(2) backend. Not I<completely> standard, as 297This is your standard select(2) backend. Not I<completely> standard, as
265libev 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,
266but 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
353Similar to C<ev_default_loop>, but always creates a new event loop that is 386Similar to C<ev_default_loop>, but always creates a new event loop that is
354always distinct from the default loop. Unlike the default loop, it cannot 387always distinct from the default loop. Unlike the default loop, it cannot
355handle signal and child watchers, and attempts to do so will be greeted by 388handle signal and child watchers, and attempts to do so will be greeted by
356undefined behaviour (or a failed assertion if assertions are enabled). 389undefined behaviour (or a failed assertion if assertions are enabled).
357 390
358Example: try to create a event loop that uses epoll and nothing else. 391Example: Try to create a event loop that uses epoll and nothing else.
359 392
360 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 393 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
361 if (!epoller) 394 if (!epoller)
362 fatal ("no epoll found here, maybe it hides under your chair"); 395 fatal ("no epoll found here, maybe it hides under your chair");
363 396
400=item ev_loop_fork (loop) 433=item ev_loop_fork (loop)
401 434
402Like 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
403C<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
404after 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.
405 448
406=item unsigned int ev_backend (loop) 449=item unsigned int ev_backend (loop)
407 450
408Returns one of the C<EVBACKEND_*> flags indicating the event backend in 451Returns one of the C<EVBACKEND_*> flags indicating the event backend in
409use. 452use.
462 Signals and child watchers are implemented as I/O watchers, and will 505 Signals and child watchers are implemented as I/O watchers, and will
463 be handled here by queueing them when their watcher gets executed. 506 be handled here by queueing them when their watcher gets executed.
464 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 507 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
465 were used, return, otherwise continue with step *. 508 were used, return, otherwise continue with step *.
466 509
467Example: queue some jobs and then loop until no events are outsanding 510Example: Queue some jobs and then loop until no events are outsanding
468anymore. 511anymore.
469 512
470 ... queue jobs here, make sure they register event watchers as long 513 ... queue jobs here, make sure they register event watchers as long
471 ... as they still have work to do (even an idle watcher will do..) 514 ... as they still have work to do (even an idle watcher will do..)
472 ev_loop (my_loop, 0); 515 ev_loop (my_loop, 0);
492visible to the libev user and should not keep C<ev_loop> from exiting if 535visible to the libev user and should not keep C<ev_loop> from exiting if
493no event watchers registered by it are active. It is also an excellent 536no event watchers registered by it are active. It is also an excellent
494way to do this for generic recurring timers or from within third-party 537way to do this for generic recurring timers or from within third-party
495libraries. Just remember to I<unref after start> and I<ref before stop>. 538libraries. Just remember to I<unref after start> and I<ref before stop>.
496 539
497Example: create a signal watcher, but keep it from keeping C<ev_loop> 540Example: Create a signal watcher, but keep it from keeping C<ev_loop>
498running when nothing else is active. 541running when nothing else is active.
499 542
500 struct dv_signal exitsig; 543 struct ev_signal exitsig;
501 ev_signal_init (&exitsig, sig_cb, SIGINT); 544 ev_signal_init (&exitsig, sig_cb, SIGINT);
502 ev_signal_start (myloop, &exitsig); 545 ev_signal_start (loop, &exitsig);
503 evf_unref (myloop); 546 evf_unref (loop);
504 547
505Example: for some weird reason, unregister the above signal handler again. 548Example: For some weird reason, unregister the above signal handler again.
506 549
507 ev_ref (myloop); 550 ev_ref (loop);
508 ev_signal_stop (myloop, &exitsig); 551 ev_signal_stop (loop, &exitsig);
509 552
510=back 553=back
511 554
512 555
513=head1 ANATOMY OF A WATCHER 556=head1 ANATOMY OF A WATCHER
693=item bool ev_is_pending (ev_TYPE *watcher) 736=item bool ev_is_pending (ev_TYPE *watcher)
694 737
695Returns 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
696events 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
697is 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
698C<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
699libev (e.g. you cnanot C<free ()> it). 742make sure the watcher is available to libev (e.g. you cannot C<free ()>
743it).
700 744
701=item callback = ev_cb (ev_TYPE *watcher) 745=item callback ev_cb (ev_TYPE *watcher)
702 746
703Returns the callback currently set on the watcher. 747Returns the callback currently set on the watcher.
704 748
705=item ev_cb_set (ev_TYPE *watcher, callback) 749=item ev_cb_set (ev_TYPE *watcher, callback)
706 750
707Change the callback. You can change the callback at virtually any time 751Change the callback. You can change the callback at virtually any time
708(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>.
709 793
710=back 794=back
711 795
712 796
713=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 797=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
734 { 818 {
735 struct my_io *w = (struct my_io *)w_; 819 struct my_io *w = (struct my_io *)w_;
736 ... 820 ...
737 } 821 }
738 822
739More interesting and less C-conformant ways of catsing your callback type 823More interesting and less C-conformant ways of casting your callback type
740have been omitted.... 824instead have been omitted.
825
826Another common scenario is having some data structure with multiple
827watchers:
828
829 struct my_biggy
830 {
831 int some_data;
832 ev_timer t1;
833 ev_timer t2;
834 }
835
836In this case getting the pointer to C<my_biggy> is a bit more complicated,
837you need to use C<offsetof>:
838
839 #include <stddef.h>
840
841 static void
842 t1_cb (EV_P_ struct ev_timer *w, int revents)
843 {
844 struct my_biggy big = (struct my_biggy *
845 (((char *)w) - offsetof (struct my_biggy, t1));
846 }
847
848 static void
849 t2_cb (EV_P_ struct ev_timer *w, int revents)
850 {
851 struct my_biggy big = (struct my_biggy *
852 (((char *)w) - offsetof (struct my_biggy, t2));
853 }
741 854
742 855
743=head1 WATCHER TYPES 856=head1 WATCHER TYPES
744 857
745This section describes each watcher in detail, but will not repeat 858This section describes each watcher in detail, but will not repeat
790it 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
791C<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.
792 905
793If 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
794play 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
795wether 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
796such 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
797its own, so its quite safe to use). 910its own, so its quite safe to use).
798 911
799=over 4 912=over 4
800 913
814 927
815The events being watched. 928The events being watched.
816 929
817=back 930=back
818 931
819Example: call C<stdin_readable_cb> when STDIN_FILENO has become, well 932Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
820readable, but only once. Since it is likely line-buffered, you could 933readable, but only once. Since it is likely line-buffered, you could
821attempt to read a whole line in the callback: 934attempt to read a whole line in the callback.
822 935
823 static void 936 static void
824 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents) 937 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
825 { 938 {
826 ev_io_stop (loop, w); 939 ev_io_stop (loop, w);
878=item ev_timer_again (loop) 991=item ev_timer_again (loop)
879 992
880This will act as if the timer timed out and restart it again if it is 993This will act as if the timer timed out and restart it again if it is
881repeating. The exact semantics are: 994repeating. The exact semantics are:
882 995
996If the timer is pending, its pending status is cleared.
997
883If the timer is started but nonrepeating, stop it. 998If the timer is started but nonrepeating, stop it (as if it timed out).
884 999
885If the timer is repeating, either start it if necessary (with the repeat 1000If the timer is repeating, either start it if necessary (with the
886value), or reset the running timer to the repeat value. 1001C<repeat> value), or reset the running timer to the C<repeat> value.
887 1002
888This sounds a bit complicated, but here is a useful and typical 1003This sounds a bit complicated, but here is a useful and typical
889example: Imagine you have a tcp connection and you want a so-called 1004example: Imagine you have a tcp connection and you want a so-called idle
890idle timeout, that is, you want to be called when there have been, 1005timeout, that is, you want to be called when there have been, say, 60
891say, 60 seconds of inactivity on the socket. The easiest way to do 1006seconds of inactivity on the socket. The easiest way to do this is to
892this is to configure an C<ev_timer> with C<after>=C<repeat>=C<60> and calling 1007configure an C<ev_timer> with a C<repeat> value of C<60> and then call
893C<ev_timer_again> each time you successfully read or write some data. If 1008C<ev_timer_again> each time you successfully read or write some data. If
894you go into an idle state where you do not expect data to travel on the 1009you go into an idle state where you do not expect data to travel on the
895socket, you can stop the timer, and again will automatically restart it if 1010socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
896need be. 1011automatically restart it if need be.
897 1012
898You can also ignore the C<after> value and C<ev_timer_start> altogether 1013That means you can ignore the C<after> value and C<ev_timer_start>
899and only ever use the C<repeat> value: 1014altogether and only ever use the C<repeat> value and C<ev_timer_again>:
900 1015
901 ev_timer_init (timer, callback, 0., 5.); 1016 ev_timer_init (timer, callback, 0., 5.);
902 ev_timer_again (loop, timer); 1017 ev_timer_again (loop, timer);
903 ... 1018 ...
904 timer->again = 17.; 1019 timer->again = 17.;
905 ev_timer_again (loop, timer); 1020 ev_timer_again (loop, timer);
906 ... 1021 ...
907 timer->again = 10.; 1022 timer->again = 10.;
908 ev_timer_again (loop, timer); 1023 ev_timer_again (loop, timer);
909 1024
910This is more efficient then stopping/starting the timer eahc time you want 1025This is more slightly efficient then stopping/starting the timer each time
911to modify its timeout value. 1026you want to modify its timeout value.
912 1027
913=item ev_tstamp repeat [read-write] 1028=item ev_tstamp repeat [read-write]
914 1029
915The current C<repeat> value. Will be used each time the watcher times out 1030The current C<repeat> value. Will be used each time the watcher times out
916or C<ev_timer_again> is called and determines the next timeout (if any), 1031or C<ev_timer_again> is called and determines the next timeout (if any),
917which is also when any modifications are taken into account. 1032which is also when any modifications are taken into account.
918 1033
919=back 1034=back
920 1035
921Example: create a timer that fires after 60 seconds. 1036Example: Create a timer that fires after 60 seconds.
922 1037
923 static void 1038 static void
924 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1039 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
925 { 1040 {
926 .. one minute over, w is actually stopped right here 1041 .. one minute over, w is actually stopped right here
928 1043
929 struct ev_timer mytimer; 1044 struct ev_timer mytimer;
930 ev_timer_init (&mytimer, one_minute_cb, 60., 0.); 1045 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
931 ev_timer_start (loop, &mytimer); 1046 ev_timer_start (loop, &mytimer);
932 1047
933Example: create a timeout timer that times out after 10 seconds of 1048Example: Create a timeout timer that times out after 10 seconds of
934inactivity. 1049inactivity.
935 1050
936 static void 1051 static void
937 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1052 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
938 { 1053 {
1063switched off. Can be changed any time, but changes only take effect when 1178switched off. Can be changed any time, but changes only take effect when
1064the periodic timer fires or C<ev_periodic_again> is being called. 1179the periodic timer fires or C<ev_periodic_again> is being called.
1065 1180
1066=back 1181=back
1067 1182
1068Example: call a callback every hour, or, more precisely, whenever the 1183Example: Call a callback every hour, or, more precisely, whenever the
1069system clock is divisible by 3600. The callback invocation times have 1184system clock is divisible by 3600. The callback invocation times have
1070potentially a lot of jittering, but good long-term stability. 1185potentially a lot of jittering, but good long-term stability.
1071 1186
1072 static void 1187 static void
1073 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1188 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1077 1192
1078 struct ev_periodic hourly_tick; 1193 struct ev_periodic hourly_tick;
1079 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0); 1194 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1080 ev_periodic_start (loop, &hourly_tick); 1195 ev_periodic_start (loop, &hourly_tick);
1081 1196
1082Example: the same as above, but use a reschedule callback to do it: 1197Example: The same as above, but use a reschedule callback to do it:
1083 1198
1084 #include <math.h> 1199 #include <math.h>
1085 1200
1086 static ev_tstamp 1201 static ev_tstamp
1087 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now) 1202 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1089 return fmod (now, 3600.) + 3600.; 1204 return fmod (now, 3600.) + 3600.;
1090 } 1205 }
1091 1206
1092 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb); 1207 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1093 1208
1094Example: call a callback every hour, starting now: 1209Example: Call a callback every hour, starting now:
1095 1210
1096 struct ev_periodic hourly_tick; 1211 struct ev_periodic hourly_tick;
1097 ev_periodic_init (&hourly_tick, clock_cb, 1212 ev_periodic_init (&hourly_tick, clock_cb,
1098 fmod (ev_now (loop), 3600.), 3600., 0); 1213 fmod (ev_now (loop), 3600.), 3600., 0);
1099 ev_periodic_start (loop, &hourly_tick); 1214 ev_periodic_start (loop, &hourly_tick);
1160The process exit/trace status caused by C<rpid> (see your systems 1275The process exit/trace status caused by C<rpid> (see your systems
1161C<waitpid> and C<sys/wait.h> documentation for details). 1276C<waitpid> and C<sys/wait.h> documentation for details).
1162 1277
1163=back 1278=back
1164 1279
1165Example: try to exit cleanly on SIGINT and SIGTERM. 1280Example: Try to exit cleanly on SIGINT and SIGTERM.
1166 1281
1167 static void 1282 static void
1168 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1283 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1169 { 1284 {
1170 ev_unloop (loop, EVUNLOOP_ALL); 1285 ev_unloop (loop, EVUNLOOP_ALL);
1185not exist" is a status change like any other. The condition "path does 1300not exist" is a status change like any other. The condition "path does
1186not exist" is signified by the C<st_nlink> field being zero (which is 1301not exist" is signified by the C<st_nlink> field being zero (which is
1187otherwise always forced to be at least one) and all the other fields of 1302otherwise always forced to be at least one) and all the other fields of
1188the stat buffer having unspecified contents. 1303the stat buffer having unspecified contents.
1189 1304
1305The path I<should> be absolute and I<must not> end in a slash. If it is
1306relative and your working directory changes, the behaviour is undefined.
1307
1190Since there is no standard to do this, the portable implementation simply 1308Since there is no standard to do this, the portable implementation simply
1191calls C<stat (2)> regulalry on the path to see if it changed somehow. You 1309calls C<stat (2)> regularly on the path to see if it changed somehow. You
1192can specify a recommended polling interval for this case. If you specify 1310can specify a recommended polling interval for this case. If you specify
1193a polling interval of C<0> (highly recommended!) then a I<suitable, 1311a polling interval of C<0> (highly recommended!) then a I<suitable,
1194unspecified default> value will be used (which you can expect to be around 1312unspecified default> value will be used (which you can expect to be around
1195five seconds, although this might change dynamically). Libev will also 1313five seconds, although this might change dynamically). Libev will also
1196impose a minimum interval which is currently around C<0.1>, but thats 1314impose a minimum interval which is currently around C<0.1>, but thats
1198 1316
1199This watcher type is not meant for massive numbers of stat watchers, 1317This watcher type is not meant for massive numbers of stat watchers,
1200as even with OS-supported change notifications, this can be 1318as even with OS-supported change notifications, this can be
1201resource-intensive. 1319resource-intensive.
1202 1320
1203At the time of this writing, no specific OS backends are implemented, but 1321At the time of this writing, only the Linux inotify interface is
1204if demand increases, at least a kqueue and inotify backend will be added. 1322implemented (implementing kqueue support is left as an exercise for the
1323reader). Inotify will be used to give hints only and should not change the
1324semantics of C<ev_stat> watchers, which means that libev sometimes needs
1325to fall back to regular polling again even with inotify, but changes are
1326usually detected immediately, and if the file exists there will be no
1327polling.
1205 1328
1206=over 4 1329=over 4
1207 1330
1208=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) 1331=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1209 1332
1273 ev_stat_start (loop, &passwd); 1396 ev_stat_start (loop, &passwd);
1274 1397
1275 1398
1276=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...
1277 1400
1278Idle watchers trigger events when there are no other events are pending 1401Idle watchers trigger events when no other events of the same or higher
1279(prepare, check and other idle watchers do not count). That is, as long 1402priority are pending (prepare, check and other idle watchers do not
1280as your process is busy handling sockets or timeouts (or even signals, 1403count).
1281imagine) it will not be triggered. But when your process is idle all idle 1404
1282watchers 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
1283until stopped, that is, or your process receives more events and becomes 1409iteration - until stopped, that is, or your process receives more events
1284busy. 1410and becomes busy again with higher priority stuff.
1285 1411
1286The 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
1287active, the process will not block when waiting for new events. 1413active, the process will not block when waiting for new events.
1288 1414
1289Apart from keeping your process non-blocking (which is a useful 1415Apart from keeping your process non-blocking (which is a useful
1299kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, 1425kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1300believe me. 1426believe me.
1301 1427
1302=back 1428=back
1303 1429
1304Example: dynamically allocate an C<ev_idle>, start it, and in the 1430Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1305callback, free it. Alos, use no error checking, as usual. 1431callback, free it. Also, use no error checking, as usual.
1306 1432
1307 static void 1433 static void
1308 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) 1434 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1309 { 1435 {
1310 free (w); 1436 free (w);
1389 1515
1390 // create io watchers for each fd and a timer before blocking 1516 // create io watchers for each fd and a timer before blocking
1391 static void 1517 static void
1392 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 1518 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1393 { 1519 {
1394 int timeout = 3600000;truct pollfd fds [nfd]; 1520 int timeout = 3600000;
1521 struct pollfd fds [nfd];
1395 // actual code will need to loop here and realloc etc. 1522 // actual code will need to loop here and realloc etc.
1396 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 1523 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1397 1524
1398 /* 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 */
1399 ev_timer_init (&tw, 0, timeout * 1e-3); 1526 ev_timer_init (&tw, 0, timeout * 1e-3);
1633 1760
1634To use it, 1761To use it,
1635 1762
1636 #include <ev++.h> 1763 #include <ev++.h>
1637 1764
1638(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
1639and puts all of its definitions (many of them macros) into the global 1766of them macros) into the global namespace. All C++ specific things are
1640namespace. 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>.
1641 1769
1642It 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++
1643C<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).
1644 1780
1645Here is a list of things available in the C<ev> namespace: 1781Here is a list of things available in the C<ev> namespace:
1646 1782
1647=over 4 1783=over 4
1648 1784
1664 1800
1665All of those classes have these methods: 1801All of those classes have these methods:
1666 1802
1667=over 4 1803=over 4
1668 1804
1669=item ev::TYPE::TYPE (object *, object::method *) 1805=item ev::TYPE::TYPE ()
1670 1806
1671=item ev::TYPE::TYPE (object *, object::method *, struct ev_loop *) 1807=item ev::TYPE::TYPE (struct ev_loop *)
1672 1808
1673=item ev::TYPE::~TYPE 1809=item ev::TYPE::~TYPE
1674 1810
1675The constructor takes a pointer to an object and a method pointer to 1811The constructor (optionally) takes an event loop to associate the watcher
1676the event handler callback to call in this class. The constructor calls 1812with. If it is omitted, it will use C<EV_DEFAULT>.
1677C<ev_init> for you, which means you have to call the C<set> method 1813
1678before 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
1679automatically 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).
1680 1822
1681The 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.
1682 1856
1683=item w->set (struct ev_loop *) 1857=item w->set (struct ev_loop *)
1684 1858
1685Associates 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
1686do this when the watcher is inactive (and not pending either). 1860do this when the watcher is inactive (and not pending either).
1687 1861
1688=item w->set ([args]) 1862=item w->set ([args])
1689 1863
1690Basically 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
1691called at least once. Unlike the C counterpart, an active watcher gets 1865called at least once. Unlike the C counterpart, an active watcher gets
1692automatically stopped and restarted. 1866automatically stopped and restarted when reconfiguring it with this
1867method.
1693 1868
1694=item w->start () 1869=item w->start ()
1695 1870
1696Starts 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
1697constructor already takes the loop. 1872constructor already stores the event loop.
1698 1873
1699=item w->stop () 1874=item w->stop ()
1700 1875
1701Stops the watcher if it is active. Again, no C<loop> argument. 1876Stops the watcher if it is active. Again, no C<loop> argument.
1702 1877
1727 1902
1728 myclass (); 1903 myclass ();
1729 } 1904 }
1730 1905
1731 myclass::myclass (int fd) 1906 myclass::myclass (int fd)
1732 : io (this, &myclass::io_cb),
1733 idle (this, &myclass::idle_cb)
1734 { 1907 {
1908 io .set <myclass, &myclass::io_cb > (this);
1909 idle.set <myclass, &myclass::idle_cb> (this);
1910
1735 io.start (fd, ev::READ); 1911 io.start (fd, ev::READ);
1736 } 1912 }
1737 1913
1738 1914
1739=head1 MACRO MAGIC 1915=head1 MACRO MAGIC
1740 1916
1741Libev 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
1742C<EV_MULTIPLICITY>. This option determines wether (most) functions and 1918C<EV_MULTIPLICITY>. This option determines whether (most) functions and
1743callbacks have an initial C<struct ev_loop *> argument. 1919callbacks have an initial C<struct ev_loop *> argument.
1744 1920
1745To 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
1746following macros are defined: 1922following macros are defined:
1747 1923
1780Similar 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
1781loop, if multiple loops are supported ("ev loop default"). 1957loop, if multiple loops are supported ("ev loop default").
1782 1958
1783=back 1959=back
1784 1960
1785Example: Declare and initialise a check watcher, working regardless of 1961Example: Declare and initialise a check watcher, utilising the above
1786wether multiple loops are supported or not. 1962macros so it will work regardless of whether multiple loops are supported
1963or not.
1787 1964
1788 static void 1965 static void
1789 check_cb (EV_P_ ev_timer *w, int revents) 1966 check_cb (EV_P_ ev_timer *w, int revents)
1790 { 1967 {
1791 ev_check_stop (EV_A_ w); 1968 ev_check_stop (EV_A_ w);
1793 1970
1794 ev_check check; 1971 ev_check check;
1795 ev_check_init (&check, check_cb); 1972 ev_check_init (&check, check_cb);
1796 ev_check_start (EV_DEFAULT_ &check); 1973 ev_check_start (EV_DEFAULT_ &check);
1797 ev_loop (EV_DEFAULT_ 0); 1974 ev_loop (EV_DEFAULT_ 0);
1798
1799 1975
1800=head1 EMBEDDING 1976=head1 EMBEDDING
1801 1977
1802Libev can (and often is) directly embedded into host 1978Libev can (and often is) directly embedded into host
1803applications. Examples of applications that embed it include the Deliantra 1979applications. Examples of applications that embed it include the Deliantra
1843 ev_vars.h 2019 ev_vars.h
1844 ev_wrap.h 2020 ev_wrap.h
1845 2021
1846 ev_win32.c required on win32 platforms only 2022 ev_win32.c required on win32 platforms only
1847 2023
1848 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)
1849 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)
1850 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)
1851 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)
1852 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)
1853 2029
1978 2154
1979=item EV_USE_DEVPOLL 2155=item EV_USE_DEVPOLL
1980 2156
1981reserved for future expansion, works like the USE symbols above. 2157reserved for future expansion, works like the USE symbols above.
1982 2158
2159=item EV_USE_INOTIFY
2160
2161If defined to be C<1>, libev will compile in support for the Linux inotify
2162interface to speed up C<ev_stat> watchers. Its actual availability will
2163be detected at runtime.
2164
1983=item EV_H 2165=item EV_H
1984 2166
1985The name of the F<ev.h> header file used to include it. The default if 2167The name of the F<ev.h> header file used to include it. The default if
1986undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This 2168undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This
1987can be used to virtually rename the F<ev.h> header file in case of conflicts. 2169can be used to virtually rename the F<ev.h> header file in case of conflicts.
2010will 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
2011additional independent event loops. Otherwise there will be no support 2193additional independent event loops. Otherwise there will be no support
2012for multiple event loops and there is no first event loop pointer 2194for multiple event loops and there is no first event loop pointer
2013argument. Instead, all functions act on the single default loop. 2195argument. Instead, all functions act on the single default loop.
2014 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
2015=item EV_PERIODIC_ENABLE 2214=item EV_PERIODIC_ENABLE
2016 2215
2017If 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
2018defined to be C<0>, then they are not. Disabling them saves a few kB of 2217defined to be C<0>, then they are not. Disabling them saves a few kB of
2019code. 2218code.
2020 2219
2220=item EV_IDLE_ENABLE
2221
2222If undefined or defined to be C<1>, then idle watchers are supported. If
2223defined to be C<0>, then they are not. Disabling them saves a few kB of
2224code.
2225
2021=item EV_EMBED_ENABLE 2226=item EV_EMBED_ENABLE
2022 2227
2023If undefined or defined to be C<1>, then embed watchers are supported. If 2228If undefined or defined to be C<1>, then embed watchers are supported. If
2024defined to be C<0>, then they are not. 2229defined to be C<0>, then they are not.
2025 2230
2042=item EV_PID_HASHSIZE 2247=item EV_PID_HASHSIZE
2043 2248
2044C<ev_child> watchers use a small hash table to distribute workload by 2249C<ev_child> watchers use a small hash table to distribute workload by
2045pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 2250pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2046than enough. If you need to manage thousands of children you might want to 2251than enough. If you need to manage thousands of children you might want to
2047increase this value. 2252increase this value (I<must> be a power of two).
2253
2254=item EV_INOTIFY_HASHSIZE
2255
2256C<ev_staz> watchers use a small hash table to distribute workload by
2257inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2258usually more than enough. If you need to manage thousands of C<ev_stat>
2259watchers you might want to increase this value (I<must> be a power of
2260two).
2048 2261
2049=item EV_COMMON 2262=item EV_COMMON
2050 2263
2051By default, all watchers have a C<void *data> member. By redefining 2264By default, all watchers have a C<void *data> member. By redefining
2052this macro to a something else you can include more and other types of 2265this macro to a something else you can include more and other types of
2081interface) 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
2082will 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
2083file. 2296file.
2084 2297
2085The 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
2086that everybody includes and which overrides some autoconf choices: 2299that everybody includes and which overrides some configure choices:
2087 2300
2301 #define EV_MINIMAL 1
2088 #define EV_USE_POLL 0 2302 #define EV_USE_POLL 0
2089 #define EV_MULTIPLICITY 0 2303 #define EV_MULTIPLICITY 0
2090 #define EV_PERIODICS 0 2304 #define EV_PERIODIC_ENABLE 0
2305 #define EV_STAT_ENABLE 0
2306 #define EV_FORK_ENABLE 0
2091 #define EV_CONFIG_H <config.h> 2307 #define EV_CONFIG_H <config.h>
2308 #define EV_MINPRI 0
2309 #define EV_MAXPRI 0
2092 2310
2093 #include "ev++.h" 2311 #include "ev++.h"
2094 2312
2095And 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:
2096 2314
2102 2320
2103In this section the complexities of (many of) the algorithms used inside 2321In this section the complexities of (many of) the algorithms used inside
2104libev will be explained. For complexity discussions about backends see the 2322libev will be explained. For complexity discussions about backends see the
2105documentation for C<ev_default_init>. 2323documentation for C<ev_default_init>.
2106 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
2107=over 4 2331=over 4
2108 2332
2109=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)
2110 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
2111=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)
2112 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
2113=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2344=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2114 2345
2346These just add the watcher into an array or at the head of a list.
2115=item Stopping check/prepare/idle watchers: O(1) 2347=item Stopping check/prepare/idle watchers: O(1)
2116 2348
2117=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % 16)) 2349=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
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).
2118 2354
2119=item Finding the next timer per loop iteration: O(1) 2355=item Finding the next timer per loop iteration: O(1)
2120 2356
2121=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)
2122 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
2123=item Activating one watcher: O(1) 2362=item Activating one watcher: O(1)
2124 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
2125=back 2370=back
2126 2371
2127 2372
2128=head1 AUTHOR 2373=head1 AUTHOR
2129 2374

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines