X-Git-Url: https://git.llucax.com/software/libev.git/blobdiff_plain/554d51b833eb2ed17c9d07a8362c2dcd565139f9..4734f7dfe409379a2ef18b13e44a487387023c66:/ev.html diff --git a/ev.html b/ev.html index f51a10a..31b2769 100644 --- a/ev.html +++ b/ev.html @@ -6,7 +6,7 @@ - +
@@ -121,6 +121,9 @@The newest version of this document is also available as a html-formatted +web page you might find easier to navigate when reading it for the first +time: http://cvs.schmorp.de/libev/ev.html.
Libev is an event loop: you register interest in certain events (such as a file descriptor being readable or a timeout occuring), and it will manage these event sources and provide your program with events.
@@ -768,8 +771,9 @@ it.Returns a true value iff the watcher is pending, (i.e. it has outstanding
events but its callback has not yet been invoked). As long as a watcher
is pending (but not active) you must not call an init function on it (but
-ev_TYPE_set
is safe) and you must make sure the watcher is available to
-libev (e.g. you cnanot free ()
it).
ev_TYPE_set
is safe), you must not change its priority, and you must
+make sure the watcher is available to libev (e.g. you cannot free ()
+it).
If you need to suppress invocation when higher priority events are pending
you need to look at ev_idle
watchers, which provide this functionality.
You must not change the priority of a watcher as long as it is active or +pending.
The default priority used by watchers when no priority has been set is
always 0
, which is supposed to not be too high and not be too low :).
Setting a priority outside the range of EV_MINPRI
to EV_MAXPRI
is
fine, as long as you do not mind that the priority value you query might
or might not have been adjusted to be within valid range.
Invoke the watcher
with the given loop
and revents
. Neither
+loop
nor revents
need to be valid as long as the watcher callback
+can deal with that fact.
If the watcher is pending, this function returns clears its pending status
+and returns its revents
bitset (as if its callback was invoked). If the
+watcher isn't pending it does nothing and returns 0
.
#include <ev++.h>-
(it is not installed by default). This automatically includes ev.h
-and puts all of its definitions (many of them macros) into the global
-namespace. All C++ specific things are put into the ev
namespace.
It should support all the same embedding options as ev.h, most notably
-EV_MULTIPLICITY
.
This automatically includes ev.h and puts all of its definitions (many
+of them macros) into the global namespace. All C++ specific things are
+put into the ev
namespace. It should support all the same embedding
+options as ev.h, most notably EV_MULTIPLICITY
.
Care has been taken to keep the overhead low. The only data member the C++
+classes add (compared to plain C-style watchers) is the event loop pointer
+that the watcher is associated with (or no additional members at all if
+you disable EV_MULTIPLICITY
when embedding libev).
Currently, functions, and static and non-static member functions can be +used as callbacks. Other types should be easy to add as long as they only +need one additional pointer for context. If you need support for other +types of functors please contact the author (preferably after implementing +it).
Here is a list of things available in the ev
namespace:
ev::READ
, ev::WRITE
etc.All of those classes have these methods:
The constructor takes a pointer to an object and a method pointer to
-the event handler callback to call in this class. The constructor calls
-ev_init
for you, which means you have to call the set
method
-before starting it. If you do not specify a loop then the constructor
-automatically associates the default loop with this watcher.
The constructor (optionally) takes an event loop to associate the watcher
+with. If it is omitted, it will use EV_DEFAULT
.
The constructor calls ev_init
for you, which means you have to call the
+set
method before starting it.
It will not set a callback, however: You have to call the templated set
+method to set a callback before you can start the watcher.
(The reason why you have to use a method is a limitation in C++ which does +not allow explicit template arguments for constructors).
The destructor automatically stops the watcher if it is active.
This method sets the callback method to call. The method has to have a
+signature of void (*)(ev_TYPE &, int)
, it receives the watcher as
+first argument and the revents
as second. The object must be given as
+parameter and is stored in the data
member of the watcher.
This method synthesizes efficient thunking code to call your method from
+the C callback that libev requires. If your compiler can inline your
+callback (i.e. it is visible to it at the place of the set
call and
+your compiler is good :), then the method will be fully inlined into the
+thunking function, making it as fast as a direct C callback.
Example: simple class declaration and watcher initialisation
+struct myclass + { + void io_cb (ev::io &w, int revents) { } + } + + myclass obj; + ev::io iow; + iow.set <myclass, &myclass::io_cb> (&obj); + ++
Also sets a callback, but uses a static method or plain function as
+callback. The optional data
argument will be stored in the watcher's
+data
member and is free for you to use.
The prototype of the function
must be void (*)(ev::TYPE &w, int)
.
See the method-set
above for more details.
Example:
+static void io_cb (ev::io &w, int revents) { } + iow.set <io_cb> (); + ++
Associates a different struct ev_loop
with this watcher. You can only
@@ -1779,13 +1844,14 @@ do this when the watcher is inactive (and not pending either).
Basically the same as ev_TYPE_set
, with the same args. Must be
-called at least once. Unlike the C counterpart, an active watcher gets
-automatically stopped and restarted.
Starts the watcher. Note that there is no loop
argument as the
-constructor already takes the loop.
Starts the watcher. Note that there is no loop
argument, as the
+constructor already stores the event loop.
struct ev_loop *
as first argument, and you can creat
additional independent event loops. Otherwise there will be no support
for multiple event loops and there is no first event loop pointer
argument. Instead, all functions act on the single default loop.
+ The range of allowed priorities. EV_MINPRI
must be smaller or equal to
+EV_MAXPRI
, but otherwise there are no non-obvious limitations. You can
+provide for more priorities by overriding those symbols (usually defined
+to be -2
and 2
, respectively).
When doing priority-based operations, libev usually has to linearly search +all the priorities, so having many of them (hundreds) uses a lot of space +and time, so using the defaults of five priorities (-2 .. +2) is usually +fine.
+If your embedding app does not need any priorities, defining these both to
+0
will save some memory and cpu.
In this section the complexities of (many of) the algorithms used inside
libev will be explained. For complexity discussions about backends see the
documentation for ev_default_init
.
All of the following are about amortised time: If an array needs to be +extended, libev needs to realloc and move the whole array, but this +happens asymptotically never with higher number of elements, so O(1) might +mean it might do a lengthy realloc operation in rare cases, but on average +it is much faster and asymptotically approaches constant time.
This means that, when you have a watcher that triggers in one hour and +there are 100 watchers that would trigger before that then inserting will +have to skip those 100 watchers.
+That means that for changing a timer costs less than removing/adding them +as only the relative motion in the event queue has to be paid for.
+These just add the watcher into an array or at the head of a list. +=item Stopping check/prepare/idle watchers: O(1)
+These watchers are stored in lists then need to be walked to find the +correct watcher to remove. The lists are usually short (you don't usually +have many watchers waiting for the same fd or signal).
+A change means an I/O watcher gets started or stopped, which requires +libev to recalculate its status (and possibly tell the kernel).
+Priorities are implemented by allocating some space for each +priority. When doing priority-based operations, libev usually has to +linearly search all the priorities.
+