2007-11-12 07:58:13 +00:00
|
|
|
=head1 NAME
|
|
|
|
|
|
|
|
libev - a high performance full-featured event loop written in C
|
|
|
|
|
|
|
|
=head1 SYNOPSIS
|
|
|
|
|
|
|
|
#include <ev.h>
|
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
=head1 EXAMPLE PROGRAM
|
|
|
|
|
|
|
|
#include <ev.h>
|
|
|
|
|
2007-11-27 20:15:01 +00:00
|
|
|
ev_io stdin_watcher;
|
|
|
|
ev_timer timeout_watcher;
|
|
|
|
|
|
|
|
/* called when data readable on stdin */
|
|
|
|
static void
|
|
|
|
stdin_cb (EV_P_ struct ev_io *w, int revents)
|
|
|
|
{
|
|
|
|
/* puts ("stdin ready"); */
|
|
|
|
ev_io_stop (EV_A_ w); /* just a syntax example */
|
|
|
|
ev_unloop (EV_A_ EVUNLOOP_ALL); /* leave all loop calls */
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
timeout_cb (EV_P_ struct ev_timer *w, int revents)
|
|
|
|
{
|
|
|
|
/* puts ("timeout"); */
|
|
|
|
ev_unloop (EV_A_ EVUNLOOP_ONE); /* leave one loop call */
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
main (void)
|
|
|
|
{
|
|
|
|
struct ev_loop *loop = ev_default_loop (0);
|
|
|
|
|
|
|
|
/* initialise an io watcher, then start it */
|
|
|
|
ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
|
|
|
|
ev_io_start (loop, &stdin_watcher);
|
|
|
|
|
|
|
|
/* simple non-repeating 5.5 second timeout */
|
|
|
|
ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
|
|
|
|
ev_timer_start (loop, &timeout_watcher);
|
|
|
|
|
|
|
|
/* loop till timeout or data ready */
|
|
|
|
ev_loop (loop, 0);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=head1 DESCRIPTION
|
|
|
|
|
2007-12-07 19:15:39 +00:00
|
|
|
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: L<http://cvs.schmorp.de/libev/ev.html>.
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
Libev is an event loop: you register interest in certain events (such as a
|
2007-12-21 01:26:04 +00:00
|
|
|
file descriptor being readable or a timeout occurring), and it will manage
|
2007-11-12 08:11:01 +00:00
|
|
|
these event sources and provide your program with events.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
To do this, it must take more or less complete control over your process
|
|
|
|
(or thread) by executing the I<event loop> handler, and will then
|
|
|
|
communicate events via a callback mechanism.
|
|
|
|
|
|
|
|
You register interest in certain events by registering so-called I<event
|
|
|
|
watchers>, which are relatively small C structures you initialise with the
|
|
|
|
details of the event, and then hand it over to libev by I<starting> the
|
|
|
|
watcher.
|
|
|
|
|
|
|
|
=head1 FEATURES
|
|
|
|
|
2007-11-28 11:27:29 +00:00
|
|
|
Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
|
|
|
|
BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
|
|
|
|
for file descriptor events (C<ev_io>), the Linux C<inotify> interface
|
|
|
|
(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
|
|
|
|
with customised rescheduling (C<ev_periodic>), synchronous signals
|
|
|
|
(C<ev_signal>), process status change events (C<ev_child>), and event
|
|
|
|
watchers dealing with the event loop mechanism itself (C<ev_idle>,
|
2007-11-27 20:26:50 +00:00
|
|
|
C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as
|
|
|
|
file watchers (C<ev_stat>) and even limited support for fork events
|
|
|
|
(C<ev_fork>).
|
|
|
|
|
|
|
|
It also is quite fast (see this
|
|
|
|
L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
|
|
|
|
for example).
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
=head1 CONVENTIONS
|
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Libev is very configurable. In this manual the default configuration will
|
|
|
|
be described, which supports multiple event loops. For more info about
|
|
|
|
various configuration options please have a look at B<EMBED> section in
|
|
|
|
this manual. If libev was configured without support for multiple event
|
|
|
|
loops, then all functions taking an initial argument of name C<loop>
|
|
|
|
(which is always of type C<struct ev_loop *>) will not have this argument.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:57:03 +00:00
|
|
|
=head1 TIME REPRESENTATION
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
Libev represents time as a single floating point number, representing the
|
|
|
|
(fractional) number of seconds since the (POSIX) epoch (somewhere near
|
|
|
|
the beginning of 1970, details are complicated, don't ask). This type is
|
2007-11-12 07:58:13 +00:00
|
|
|
called C<ev_tstamp>, which is what you should use too. It usually aliases
|
2007-11-23 16:17:12 +00:00
|
|
|
to the C<double> type in C, and when you need to do any calculations on
|
2007-12-18 01:20:33 +00:00
|
|
|
it, you should treat it as some floatingpoint value. Unlike the name
|
|
|
|
component C<stamp> might indicate, it is also used for time differences
|
|
|
|
throughout libev.
|
2007-11-23 16:17:12 +00:00
|
|
|
|
2007-11-12 08:57:03 +00:00
|
|
|
=head1 GLOBAL FUNCTIONS
|
|
|
|
|
2007-11-12 08:57:03 +00:00
|
|
|
These functions can be called anytime, even before initialising the
|
|
|
|
library in any way.
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=over 4
|
|
|
|
|
|
|
|
=item ev_tstamp ev_time ()
|
|
|
|
|
2007-11-13 03:11:57 +00:00
|
|
|
Returns the current time as libev would use it. Please note that the
|
|
|
|
C<ev_now> function is usually faster and also often returns the timestamp
|
|
|
|
you actually want to know.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
=item int ev_version_major ()
|
|
|
|
|
|
|
|
=item int ev_version_minor ()
|
|
|
|
|
2007-12-09 19:42:57 +00:00
|
|
|
You can find out the major and minor ABI version numbers of the library
|
2007-11-12 07:58:13 +00:00
|
|
|
you linked against by calling the functions C<ev_version_major> and
|
|
|
|
C<ev_version_minor>. If you want, you can compare against the global
|
|
|
|
symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
|
|
|
|
version of the library your program was compiled against.
|
|
|
|
|
2007-12-09 19:42:57 +00:00
|
|
|
These version numbers refer to the ABI version of the library, not the
|
|
|
|
release version.
|
2007-12-09 19:42:57 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
Usually, it's a good idea to terminate if the major versions mismatch,
|
2007-12-09 19:42:57 +00:00
|
|
|
as this indicates an incompatible change. Minor versions are usually
|
2007-11-12 07:58:13 +00:00
|
|
|
compatible to older versions, so a larger minor version alone is usually
|
|
|
|
not a problem.
|
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Example: Make sure we haven't accidentally been linked against the wrong
|
|
|
|
version.
|
2007-11-23 16:17:12 +00:00
|
|
|
|
|
|
|
assert (("libev version mismatch",
|
|
|
|
ev_version_major () == EV_VERSION_MAJOR
|
|
|
|
&& ev_version_minor () >= EV_VERSION_MINOR));
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item unsigned int ev_supported_backends ()
|
|
|
|
|
|
|
|
Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
|
|
|
|
value) compiled into this binary of libev (independent of their
|
|
|
|
availability on the system you are running on). See C<ev_default_loop> for
|
|
|
|
a description of the set values.
|
|
|
|
|
2007-11-23 16:17:12 +00:00
|
|
|
Example: make sure we have the epoll method, because yeah this is cool and
|
|
|
|
a must have and can we have a torrent of it please!!!11
|
|
|
|
|
|
|
|
assert (("sorry, no epoll, no sex",
|
|
|
|
ev_supported_backends () & EVBACKEND_EPOLL));
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item unsigned int ev_recommended_backends ()
|
|
|
|
|
|
|
|
Return the set of all backends compiled into this binary of libev and also
|
|
|
|
recommended for this platform. This set is often smaller than the one
|
|
|
|
returned by C<ev_supported_backends>, as for example kqueue is broken on
|
|
|
|
most BSDs and will not be autodetected unless you explicitly request it
|
|
|
|
(assuming you know what you are doing). This is the set of backends that
|
2007-11-23 15:26:08 +00:00
|
|
|
libev will probe for if you specify no backends explicitly.
|
2007-11-23 05:00:44 +00:00
|
|
|
|
2007-11-23 19:35:09 +00:00
|
|
|
=item unsigned int ev_embeddable_backends ()
|
|
|
|
|
|
|
|
Returns the set of backends that are embeddable in other event loops. This
|
|
|
|
is the theoretical, all-platform, value. To find which backends
|
|
|
|
might be supported on the current system, you would need to look at
|
|
|
|
C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
|
|
|
|
recommended ones.
|
|
|
|
|
|
|
|
See the description of C<ev_embed> watchers for more info.
|
|
|
|
|
2007-11-28 17:32:24 +00:00
|
|
|
=item ev_set_allocator (void *(*cb)(void *ptr, long size))
|
|
|
|
|
|
|
|
Sets the allocation function to use (the prototype is similar - the
|
|
|
|
semantics is identical - to the realloc C function). It is used to
|
|
|
|
allocate and free memory (no surprises here). If it returns zero when
|
|
|
|
memory needs to be allocated, the library might abort or take some
|
|
|
|
potentially destructive action. The default is your system realloc
|
|
|
|
function.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
You could override this function in high-availability programs to, say,
|
|
|
|
free some memory if it cannot allocate memory, to use a special allocator,
|
|
|
|
or even to sleep a while and retry until some memory is available.
|
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Example: Replace the libev allocator with one that waits a bit and then
|
|
|
|
retries).
|
2007-11-23 16:17:12 +00:00
|
|
|
|
|
|
|
static void *
|
2007-11-27 19:41:52 +00:00
|
|
|
persistent_realloc (void *ptr, size_t size)
|
2007-11-23 16:17:12 +00:00
|
|
|
{
|
|
|
|
for (;;)
|
|
|
|
{
|
|
|
|
void *newptr = realloc (ptr, size);
|
|
|
|
|
|
|
|
if (newptr)
|
|
|
|
return newptr;
|
|
|
|
|
|
|
|
sleep (60);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
...
|
|
|
|
ev_set_allocator (persistent_realloc);
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=item ev_set_syserr_cb (void (*cb)(const char *msg));
|
|
|
|
|
|
|
|
Set the callback function to call on a retryable syscall error (such
|
|
|
|
as failed select, poll, epoll_wait). The message is a printable string
|
|
|
|
indicating the system call or subsystem causing the problem. If this
|
|
|
|
callback is set, then libev will expect it to remedy the sitution, no
|
2007-11-12 08:16:02 +00:00
|
|
|
matter what, when it returns. That is, libev will generally retry the
|
2007-11-12 07:58:13 +00:00
|
|
|
requested operation, or, if the condition doesn't go away, do bad stuff
|
|
|
|
(such as abort).
|
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Example: This is basically the same thing that libev does internally, too.
|
2007-11-23 16:17:12 +00:00
|
|
|
|
|
|
|
static void
|
|
|
|
fatal_error (const char *msg)
|
|
|
|
{
|
|
|
|
perror (msg);
|
|
|
|
abort ();
|
|
|
|
}
|
|
|
|
|
|
|
|
...
|
|
|
|
ev_set_syserr_cb (fatal_error);
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=back
|
|
|
|
|
|
|
|
=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
|
|
|
|
|
|
|
|
An event loop is described by a C<struct ev_loop *>. The library knows two
|
|
|
|
types of such loops, the I<default> loop, which supports signals and child
|
|
|
|
events, and dynamically created loops which do not.
|
|
|
|
|
|
|
|
If you use threads, a common model is to run the default event loop
|
2007-11-12 08:57:03 +00:00
|
|
|
in your main thread (or in a separate thread) and for each thread you
|
2007-11-12 08:16:02 +00:00
|
|
|
create, you also create another event loop. Libev itself does no locking
|
|
|
|
whatsoever, so if you mix calls to the same event loop in different
|
|
|
|
threads, make sure you lock (this is usually a bad idea, though, even if
|
2007-11-12 08:29:11 +00:00
|
|
|
done correctly, because it's hideous and inefficient).
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
=over 4
|
|
|
|
|
|
|
|
=item struct ev_loop *ev_default_loop (unsigned int flags)
|
|
|
|
|
|
|
|
This will initialise the default event loop if it hasn't been initialised
|
|
|
|
yet and return it. If the default loop could not be initialised, returns
|
|
|
|
false. If it already was initialised it simply returns it (and ignores the
|
2007-11-23 05:00:44 +00:00
|
|
|
flags. If that is troubling you, check C<ev_backend ()> afterwards).
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
If you don't know what event loop to use, use the one returned from this
|
|
|
|
function.
|
|
|
|
|
|
|
|
The flags argument can be used to specify special behaviour or specific
|
2007-11-23 15:26:08 +00:00
|
|
|
backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-23 15:26:08 +00:00
|
|
|
The following flags are supported:
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
=over 4
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EVFLAG_AUTO>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
The default flags value. Use this if you have no clue (it's the right
|
2007-11-12 07:58:13 +00:00
|
|
|
thing, believe me).
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EVFLAG_NOENV>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:16:02 +00:00
|
|
|
If this flag bit is ored into the flag value (or the program runs setuid
|
|
|
|
or setgid) then libev will I<not> look at the environment variable
|
|
|
|
C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
|
|
|
|
override the flags completely if it is found in the environment. This is
|
|
|
|
useful to try out specific backends to test their performance, or to work
|
|
|
|
around bugs.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-29 17:28:13 +00:00
|
|
|
=item C<EVFLAG_FORKCHECK>
|
|
|
|
|
|
|
|
Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
|
|
|
|
a fork, you can also make libev check for a fork in each iteration by
|
|
|
|
enabling this flag.
|
|
|
|
|
|
|
|
This works by calling C<getpid ()> on every iteration of the loop,
|
|
|
|
and thus this might slow down your event loop if you do a lot of loop
|
2007-12-01 15:38:54 +00:00
|
|
|
iterations and little real work, but is usually not noticeable (on my
|
2007-11-29 17:28:13 +00:00
|
|
|
Linux system for example, C<getpid> is actually a simple 5-insn sequence
|
|
|
|
without a syscall and thus I<very> fast, but my Linux system also has
|
|
|
|
C<pthread_atfork> which is even faster).
|
|
|
|
|
|
|
|
The big advantage of this flag is that you can forget about fork (and
|
|
|
|
forget about forgetting to tell libev about forking) when you use this
|
|
|
|
flag.
|
|
|
|
|
|
|
|
This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
|
|
|
|
environment variable.
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item C<EVBACKEND_SELECT> (value 1, portable select backend)
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-22 12:28:27 +00:00
|
|
|
This is your standard select(2) backend. Not I<completely> standard, as
|
|
|
|
libev tries to roll its own fd_set with no limits on the number of fds,
|
|
|
|
but if that fails, expect a fairly low limit on the number of fds when
|
|
|
|
using this backend. It doesn't scale too well (O(highest_fd)), but its usually
|
|
|
|
the fastest backend for a low number of fds.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-22 12:28:27 +00:00
|
|
|
And this is your standard poll(2) backend. It's more complicated than
|
|
|
|
select, but handles sparse fds better and has no artificial limit on the
|
|
|
|
number of fds you can use (except it will slow down considerably with a
|
|
|
|
lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item C<EVBACKEND_EPOLL> (value 4, Linux)
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-22 12:28:27 +00:00
|
|
|
For few fds, this backend is a bit little slower than poll and select,
|
|
|
|
but it scales phenomenally better. While poll and select usually scale like
|
|
|
|
O(total_fds) where n is the total number of fds (or the highest fd), epoll scales
|
|
|
|
either O(1) or O(active_fds).
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-22 12:28:27 +00:00
|
|
|
While stopping and starting an I/O watcher in the same iteration will
|
|
|
|
result in some caching, there is still a syscall per such incident
|
|
|
|
(because the fd could point to a different file description now), so its
|
|
|
|
best to avoid that. Also, dup()ed file descriptors might not work very
|
|
|
|
well if you register events for both fds.
|
|
|
|
|
2007-11-23 08:36:35 +00:00
|
|
|
Please note that epoll sometimes generates spurious notifications, so you
|
|
|
|
need to use non-blocking I/O or other means to avoid blocking when no data
|
|
|
|
(or space) is available.
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
|
2007-11-22 12:28:27 +00:00
|
|
|
|
|
|
|
Kqueue deserves special mention, as at the time of this writing, it
|
|
|
|
was broken on all BSDs except NetBSD (usually it doesn't work with
|
2007-12-20 01:18:37 +00:00
|
|
|
anything but sockets and pipes, except on Darwin, where of course it's
|
|
|
|
completely useless). For this reason it's not being "autodetected"
|
2007-11-23 15:26:08 +00:00
|
|
|
unless you explicitly specify it explicitly in the flags (i.e. using
|
|
|
|
C<EVBACKEND_KQUEUE>).
|
2007-11-22 12:28:27 +00:00
|
|
|
|
|
|
|
It scales in the same way as the epoll backend, but the interface to the
|
|
|
|
kernel is more efficient (which says nothing about its actual speed, of
|
|
|
|
course). While starting and stopping an I/O watcher does not cause an
|
|
|
|
extra syscall as with epoll, it still adds up to four event changes per
|
|
|
|
incident, so its best to avoid that.
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
|
2007-11-22 12:28:27 +00:00
|
|
|
|
|
|
|
This is not implemented yet (and might never be).
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item C<EVBACKEND_PORT> (value 32, Solaris 10)
|
2007-11-22 12:28:27 +00:00
|
|
|
|
|
|
|
This uses the Solaris 10 port mechanism. As with everything on Solaris,
|
|
|
|
it's really slow, but it still scales very well (O(active_fds)).
|
|
|
|
|
2007-11-23 08:36:35 +00:00
|
|
|
Please note that solaris ports can result in a lot of spurious
|
|
|
|
notifications, so you need to use non-blocking I/O or other means to avoid
|
|
|
|
blocking when no data (or space) is available.
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item C<EVBACKEND_ALL>
|
2007-11-22 12:28:27 +00:00
|
|
|
|
|
|
|
Try all backends (even potentially broken ones that wouldn't be tried
|
|
|
|
with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
|
2007-11-23 05:00:44 +00:00
|
|
|
C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
=back
|
|
|
|
|
2007-11-22 12:28:27 +00:00
|
|
|
If one or more of these are ored into the flags value, then only these
|
|
|
|
backends will be tried (in the reverse order as given here). If none are
|
|
|
|
specified, most compiled-in backend will be tried, usually in reverse
|
|
|
|
order of their flag values :)
|
|
|
|
|
2007-11-23 15:26:08 +00:00
|
|
|
The most typical usage is like this:
|
|
|
|
|
|
|
|
if (!ev_default_loop (0))
|
|
|
|
fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
|
|
|
|
|
|
|
|
Restrict libev to the select and poll backends, and do not allow
|
|
|
|
environment settings to be taken into account:
|
|
|
|
|
|
|
|
ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
|
|
|
|
|
|
|
|
Use whatever libev has to offer, but make sure that kqueue is used if
|
|
|
|
available (warning, breaks stuff, best use only with your own private
|
|
|
|
event loop and only if you know the OS supports your types of fds):
|
|
|
|
|
|
|
|
ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=item struct ev_loop *ev_loop_new (unsigned int flags)
|
|
|
|
|
|
|
|
Similar to C<ev_default_loop>, but always creates a new event loop that is
|
|
|
|
always distinct from the default loop. Unlike the default loop, it cannot
|
|
|
|
handle signal and child watchers, and attempts to do so will be greeted by
|
|
|
|
undefined behaviour (or a failed assertion if assertions are enabled).
|
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Example: Try to create a event loop that uses epoll and nothing else.
|
2007-11-23 16:17:12 +00:00
|
|
|
|
|
|
|
struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
|
|
|
|
if (!epoller)
|
|
|
|
fatal ("no epoll found here, maybe it hides under your chair");
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=item ev_default_destroy ()
|
|
|
|
|
|
|
|
Destroys the default loop again (frees all memory and kernel state
|
2007-11-24 07:20:42 +00:00
|
|
|
etc.). None of the active event watchers will be stopped in the normal
|
|
|
|
sense, so e.g. C<ev_is_active> might still return true. It is your
|
|
|
|
responsibility to either stop all watchers cleanly yoursef I<before>
|
|
|
|
calling this function, or cope with the fact afterwards (which is usually
|
2007-12-18 01:37:46 +00:00
|
|
|
the easiest thing, you can just ignore the watchers and/or C<free ()> them
|
2007-11-24 07:20:42 +00:00
|
|
|
for example).
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-12-18 13:06:18 +00:00
|
|
|
Note that certain global state, such as signal state, will not be freed by
|
2007-12-18 01:37:46 +00:00
|
|
|
this function, and related watchers (such as signal and child watchers)
|
|
|
|
would need to be stopped manually.
|
|
|
|
|
|
|
|
In general it is not advisable to call this function except in the
|
|
|
|
rare occasion where you really need to free e.g. the signal handling
|
|
|
|
pipe fds. If you need dynamically allocated loops it is better to use
|
|
|
|
C<ev_loop_new> and C<ev_loop_destroy>).
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=item ev_loop_destroy (loop)
|
|
|
|
|
|
|
|
Like C<ev_default_destroy>, but destroys an event loop created by an
|
|
|
|
earlier call to C<ev_loop_new>.
|
|
|
|
|
|
|
|
=item ev_default_fork ()
|
|
|
|
|
|
|
|
This function reinitialises the kernel state for backends that have
|
|
|
|
one. Despite the name, you can call it anytime, but it makes most sense
|
|
|
|
after forking, in either the parent or child process (or both, but that
|
|
|
|
again makes little sense).
|
|
|
|
|
2007-11-23 04:36:03 +00:00
|
|
|
You I<must> call this function in the child process after forking if and
|
|
|
|
only if you want to use the event library in both processes. If you just
|
|
|
|
fork+exec, you don't have to call it.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
The function itself is quite fast and it's usually not a problem to call
|
2007-11-12 07:58:13 +00:00
|
|
|
it just in case after a fork. To make this easy, the function will fit in
|
|
|
|
quite nicely into a call to C<pthread_atfork>:
|
|
|
|
|
|
|
|
pthread_atfork (0, 0, ev_default_fork);
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
|
|
|
|
without calling this function, so if you force one of those backends you
|
|
|
|
do not need to care.
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=item ev_loop_fork (loop)
|
|
|
|
|
|
|
|
Like C<ev_default_fork>, but acts on an event loop created by
|
|
|
|
C<ev_loop_new>. Yes, you have to call this on every allocated event loop
|
|
|
|
after fork, and how you do this is entirely your own problem.
|
|
|
|
|
2007-12-03 13:41:24 +00:00
|
|
|
=item unsigned int ev_loop_count (loop)
|
|
|
|
|
|
|
|
Returns the count of loop iterations for the loop, which is identical to
|
|
|
|
the number of times libev did poll for new events. It starts at C<0> and
|
|
|
|
happily wraps around with enough iterations.
|
|
|
|
|
|
|
|
This value can sometimes be useful as a generation counter of sorts (it
|
|
|
|
"ticks" the number of loop iterations), as it roughly corresponds with
|
|
|
|
C<ev_prepare> and C<ev_check> calls.
|
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
=item unsigned int ev_backend (loop)
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-23 05:00:44 +00:00
|
|
|
Returns one of the C<EVBACKEND_*> flags indicating the event backend in
|
2007-11-12 07:58:13 +00:00
|
|
|
use.
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item ev_tstamp ev_now (loop)
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
Returns the current "event loop time", which is the time the event loop
|
2007-11-23 16:17:12 +00:00
|
|
|
received events and started processing them. This timestamp does not
|
|
|
|
change as long as callbacks are being processed, and this is also the base
|
|
|
|
time used for relative timers. You can treat it as the timestamp of the
|
2007-12-21 01:26:04 +00:00
|
|
|
event occurring (or more correctly, libev finding out about it).
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
=item ev_loop (loop, int flags)
|
|
|
|
|
|
|
|
Finally, this is it, the event handler. This function usually is called
|
|
|
|
after you initialised all your watchers and you want to start handling
|
|
|
|
events.
|
|
|
|
|
2007-11-23 15:26:08 +00:00
|
|
|
If the flags argument is specified as C<0>, it will not return until
|
|
|
|
either no event watchers are active anymore or C<ev_unloop> was called.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-23 16:17:12 +00:00
|
|
|
Please note that an explicit C<ev_unloop> is usually better than
|
|
|
|
relying on all watchers to be stopped when deciding when a program has
|
|
|
|
finished (especially in interactive programs), but having a program that
|
|
|
|
automatically loops as long as it has to and no longer by virtue of
|
|
|
|
relying on its watchers stopping correctly is a thing of beauty.
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
|
|
|
|
those events and any outstanding ones, but will not block your process in
|
2007-11-12 08:29:11 +00:00
|
|
|
case there are no events and will return after one iteration of the loop.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
|
|
|
|
neccessary) and will handle those and any outstanding ones. It will block
|
2007-11-12 08:29:11 +00:00
|
|
|
your process until at least one new event arrives, and will return after
|
2007-11-23 15:26:08 +00:00
|
|
|
one iteration of the loop. This is useful if you are waiting for some
|
|
|
|
external event in conjunction with something not expressible using other
|
|
|
|
libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
|
|
|
|
usually a better approach for this kind of thing.
|
|
|
|
|
|
|
|
Here are the gory details of what C<ev_loop> does:
|
|
|
|
|
2007-12-08 22:11:14 +00:00
|
|
|
- Before the first iteration, call any pending watchers.
|
2007-11-23 15:26:08 +00:00
|
|
|
* If there are no active watchers (reference count is zero), return.
|
2007-12-08 22:11:14 +00:00
|
|
|
- Queue all prepare watchers and then call all outstanding watchers.
|
2007-11-23 15:26:08 +00:00
|
|
|
- If we have been forked, recreate the kernel state.
|
|
|
|
- Update the kernel state with all outstanding changes.
|
|
|
|
- Update the "event loop time".
|
|
|
|
- Calculate for how long to block.
|
|
|
|
- Block the process, waiting for any events.
|
|
|
|
- Queue all outstanding I/O (fd) events.
|
|
|
|
- Update the "event loop time" and do time jump handling.
|
|
|
|
- Queue all outstanding timers.
|
|
|
|
- Queue all outstanding periodics.
|
|
|
|
- If no events are pending now, queue all idle watchers.
|
|
|
|
- Queue all check watchers.
|
|
|
|
- Call all queued watchers in reverse order (i.e. check watchers first).
|
|
|
|
Signals and child watchers are implemented as I/O watchers, and will
|
|
|
|
be handled here by queueing them when their watcher gets executed.
|
|
|
|
- If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
|
|
|
|
were used, return, otherwise continue with step *.
|
2007-11-14 05:02:07 +00:00
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Example: Queue some jobs and then loop until no events are outsanding
|
2007-11-23 16:17:12 +00:00
|
|
|
anymore.
|
|
|
|
|
|
|
|
... queue jobs here, make sure they register event watchers as long
|
|
|
|
... as they still have work to do (even an idle watcher will do..)
|
|
|
|
ev_loop (my_loop, 0);
|
|
|
|
... jobs done. yeah!
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=item ev_unloop (loop, how)
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
Can be used to make a call to C<ev_loop> return early (but only after it
|
|
|
|
has processed all outstanding events). The C<how> argument must be either
|
2007-11-12 21:51:14 +00:00
|
|
|
C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
|
2007-11-12 08:29:11 +00:00
|
|
|
C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
=item ev_ref (loop)
|
|
|
|
|
|
|
|
=item ev_unref (loop)
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
Ref/unref can be used to add or remove a reference count on the event
|
|
|
|
loop: Every watcher keeps one reference, and as long as the reference
|
|
|
|
count is nonzero, C<ev_loop> will not return on its own. If you have
|
|
|
|
a watcher you never unregister that should not keep C<ev_loop> from
|
|
|
|
returning, ev_unref() after starting, and ev_ref() before stopping it. For
|
|
|
|
example, libev itself uses this for its internal signal pipe: It is not
|
|
|
|
visible to the libev user and should not keep C<ev_loop> from exiting if
|
|
|
|
no event watchers registered by it are active. It is also an excellent
|
|
|
|
way to do this for generic recurring timers or from within third-party
|
|
|
|
libraries. Just remember to I<unref after start> and I<ref before stop>.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Example: Create a signal watcher, but keep it from keeping C<ev_loop>
|
2007-11-23 16:17:12 +00:00
|
|
|
running when nothing else is active.
|
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
struct ev_signal exitsig;
|
2007-11-23 16:17:12 +00:00
|
|
|
ev_signal_init (&exitsig, sig_cb, SIGINT);
|
2007-11-27 20:26:50 +00:00
|
|
|
ev_signal_start (loop, &exitsig);
|
|
|
|
evf_unref (loop);
|
2007-11-23 16:17:12 +00:00
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Example: For some weird reason, unregister the above signal handler again.
|
2007-11-23 16:17:12 +00:00
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
ev_ref (loop);
|
|
|
|
ev_signal_stop (loop, &exitsig);
|
2007-11-23 16:17:12 +00:00
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=back
|
|
|
|
|
2007-11-24 16:31:45 +00:00
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=head1 ANATOMY OF A WATCHER
|
|
|
|
|
|
|
|
A watcher is a structure that you create and register to record your
|
|
|
|
interest in some event. For instance, if you want to wait for STDIN to
|
2007-11-12 08:29:11 +00:00
|
|
|
become readable, you would create an C<ev_io> watcher for that:
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
|
|
|
|
{
|
|
|
|
ev_io_stop (w);
|
|
|
|
ev_unloop (loop, EVUNLOOP_ALL);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct ev_loop *loop = ev_default_loop (0);
|
|
|
|
struct ev_io stdin_watcher;
|
|
|
|
ev_init (&stdin_watcher, my_cb);
|
|
|
|
ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
|
|
|
|
ev_io_start (loop, &stdin_watcher);
|
|
|
|
ev_loop (loop, 0);
|
|
|
|
|
|
|
|
As you can see, you are responsible for allocating the memory for your
|
|
|
|
watcher structures (and it is usually a bad idea to do this on the stack,
|
|
|
|
although this can sometimes be quite valid).
|
|
|
|
|
|
|
|
Each watcher structure must be initialised by a call to C<ev_init
|
|
|
|
(watcher *, callback)>, which expects a callback to be provided. This
|
|
|
|
callback gets invoked each time the event occurs (or, in the case of io
|
|
|
|
watchers, each time the event loop detects that the file descriptor given
|
|
|
|
is readable and/or writable).
|
|
|
|
|
|
|
|
Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
|
|
|
|
with arguments specific to this watcher type. There is also a macro
|
|
|
|
to combine initialisation and setting in one call: C<< ev_<type>_init
|
|
|
|
(watcher *, callback, ...) >>.
|
|
|
|
|
|
|
|
To make the watcher actually watch out for events, you have to start it
|
|
|
|
with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
|
|
|
|
*) >>), and you can stop watching for events at any time by calling the
|
|
|
|
corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
|
|
|
|
|
|
|
|
As long as your watcher is active (has been started but not stopped) you
|
|
|
|
must not touch the values stored in it. Most specifically you must never
|
2007-11-24 07:14:26 +00:00
|
|
|
reinitialise it or call its C<set> macro.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
Each and every callback receives the event loop pointer as first, the
|
|
|
|
registered watcher structure as second, and a bitset of received events as
|
|
|
|
third argument.
|
|
|
|
|
2007-11-12 08:45:49 +00:00
|
|
|
The received events usually include a single bit per event type received
|
2007-11-12 07:58:13 +00:00
|
|
|
(you can receive multiple events at the same time). The possible bit masks
|
|
|
|
are:
|
|
|
|
|
|
|
|
=over 4
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_READ>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_WRITE>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
The file descriptor in the C<ev_io> watcher has become readable and/or
|
2007-11-12 07:58:13 +00:00
|
|
|
writable.
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_TIMEOUT>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
The C<ev_timer> watcher has timed out.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_PERIODIC>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
The C<ev_periodic> watcher has timed out.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_SIGNAL>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
The signal specified in the C<ev_signal> watcher has been received by a thread.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_CHILD>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
The pid specified in the C<ev_child> watcher has received a status change.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-27 08:11:52 +00:00
|
|
|
=item C<EV_STAT>
|
|
|
|
|
|
|
|
The path specified in the C<ev_stat> watcher changed its attributes somehow.
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_IDLE>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
The C<ev_idle> watcher has determined that you have nothing better to do.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_PREPARE>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_CHECK>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
|
|
|
|
to gather new events, and all C<ev_check> watchers are invoked just after
|
2007-11-12 07:58:13 +00:00
|
|
|
C<ev_loop> has gathered them, but before it invokes any callbacks for any
|
|
|
|
received events. Callbacks of both watcher types can start and stop as
|
|
|
|
many watchers as they want, and all of them will be taken into account
|
2007-11-12 08:29:11 +00:00
|
|
|
(for example, a C<ev_prepare> watcher might start an idle watcher to keep
|
2007-11-12 07:58:13 +00:00
|
|
|
C<ev_loop> from blocking).
|
|
|
|
|
2007-11-27 10:59:10 +00:00
|
|
|
=item C<EV_EMBED>
|
|
|
|
|
|
|
|
The embedded event loop specified in the C<ev_embed> watcher needs attention.
|
|
|
|
|
|
|
|
=item C<EV_FORK>
|
|
|
|
|
|
|
|
The event loop has been resumed in the child process after fork (see
|
|
|
|
C<ev_fork>).
|
|
|
|
|
2007-11-12 08:29:11 +00:00
|
|
|
=item C<EV_ERROR>
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
An unspecified error has occured, the watcher has been stopped. This might
|
|
|
|
happen because the watcher could not be properly started because libev
|
|
|
|
ran out of memory, a file descriptor was found to be closed or any other
|
|
|
|
problem. You best act on it by reporting the problem and somehow coping
|
|
|
|
with the watcher being stopped.
|
|
|
|
|
|
|
|
Libev will usually signal a few "dummy" events together with an error,
|
|
|
|
for example it might indicate that a fd is readable or writable, and if
|
|
|
|
your callbacks is well-written it can just attempt the operation and cope
|
|
|
|
with the error from read() or write(). This will not work in multithreaded
|
|
|
|
programs, though, so beware.
|
|
|
|
|
|
|
|
=back
|
|
|
|
|
2007-11-24 16:31:45 +00:00
|
|
|
=head2 GENERIC WATCHER FUNCTIONS
|
2007-11-24 07:14:26 +00:00
|
|
|
|
|
|
|
In the following description, C<TYPE> stands for the watcher type,
|
|
|
|
e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
|
|
|
|
|
|
|
|
=over 4
|
|
|
|
|
|
|
|
=item C<ev_init> (ev_TYPE *watcher, callback)
|
|
|
|
|
|
|
|
This macro initialises the generic portion of a watcher. The contents
|
|
|
|
of the watcher object can be arbitrary (so C<malloc> will do). Only
|
|
|
|
the generic parts of the watcher are initialised, you I<need> to call
|
|
|
|
the type-specific C<ev_TYPE_set> macro afterwards to initialise the
|
|
|
|
type-specific parts. For each type there is also a C<ev_TYPE_init> macro
|
|
|
|
which rolls both calls into one.
|
|
|
|
|
|
|
|
You can reinitialise a watcher at any time as long as it has been stopped
|
|
|
|
(or never started) and there are no pending events outstanding.
|
|
|
|
|
2007-11-24 16:31:45 +00:00
|
|
|
The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,
|
2007-11-24 07:14:26 +00:00
|
|
|
int revents)>.
|
|
|
|
|
|
|
|
=item C<ev_TYPE_set> (ev_TYPE *, [args])
|
|
|
|
|
|
|
|
This macro initialises the type-specific parts of a watcher. You need to
|
|
|
|
call C<ev_init> at least once before you call this macro, but you can
|
|
|
|
call C<ev_TYPE_set> any number of times. You must not, however, call this
|
|
|
|
macro on a watcher that is active (it can be pending, however, which is a
|
|
|
|
difference to the C<ev_init> macro).
|
|
|
|
|
|
|
|
Although some watcher types do not have type-specific arguments
|
|
|
|
(e.g. C<ev_prepare>) you still need to call its C<set> macro.
|
|
|
|
|
|
|
|
=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
|
|
|
|
|
|
|
|
This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
|
|
|
|
calls into a single call. This is the most convinient method to initialise
|
|
|
|
a watcher. The same limitations apply, of course.
|
|
|
|
|
|
|
|
=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
|
|
|
|
|
|
|
|
Starts (activates) the given watcher. Only active watchers will receive
|
|
|
|
events. If the watcher is already active nothing will happen.
|
|
|
|
|
|
|
|
=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
|
|
|
|
|
|
|
|
Stops the given watcher again (if active) and clears the pending
|
|
|
|
status. It is possible that stopped watchers are pending (for example,
|
|
|
|
non-repeating timers are being stopped when they become pending), but
|
|
|
|
C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If
|
|
|
|
you want to free or reuse the memory used by the watcher it is therefore a
|
|
|
|
good idea to always call its C<ev_TYPE_stop> function.
|
|
|
|
|
|
|
|
=item bool ev_is_active (ev_TYPE *watcher)
|
|
|
|
|
|
|
|
Returns a true value iff the watcher is active (i.e. it has been started
|
|
|
|
and not yet been stopped). As long as a watcher is active you must not modify
|
|
|
|
it.
|
|
|
|
|
|
|
|
=item bool ev_is_pending (ev_TYPE *watcher)
|
|
|
|
|
|
|
|
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
|
2007-12-08 03:53:36 +00:00
|
|
|
C<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 C<free ()>
|
|
|
|
it).
|
2007-11-24 07:14:26 +00:00
|
|
|
|
2007-11-27 20:38:07 +00:00
|
|
|
=item callback ev_cb (ev_TYPE *watcher)
|
2007-11-24 07:14:26 +00:00
|
|
|
|
|
|
|
Returns the callback currently set on the watcher.
|
|
|
|
|
|
|
|
=item ev_cb_set (ev_TYPE *watcher, callback)
|
|
|
|
|
|
|
|
Change the callback. You can change the callback at virtually any time
|
|
|
|
(modulo threads).
|
|
|
|
|
2007-12-07 16:44:10 +00:00
|
|
|
=item ev_set_priority (ev_TYPE *watcher, priority)
|
|
|
|
|
|
|
|
=item int ev_priority (ev_TYPE *watcher)
|
|
|
|
|
|
|
|
Set and query the priority of the watcher. The priority is a small
|
|
|
|
integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
|
|
|
|
(default: C<-2>). Pending watchers with higher priority will be invoked
|
|
|
|
before watchers with lower priority, but priority will not keep watchers
|
|
|
|
from being executed (except for C<ev_idle> watchers).
|
|
|
|
|
|
|
|
This means that priorities are I<only> used for ordering callback
|
|
|
|
invocation after new events have been received. This is useful, for
|
|
|
|
example, to reduce latency after idling, or more often, to bind two
|
|
|
|
watchers on the same event and make sure one is called first.
|
|
|
|
|
|
|
|
If you need to suppress invocation when higher priority events are pending
|
|
|
|
you need to look at C<ev_idle> watchers, which provide this functionality.
|
|
|
|
|
2007-12-08 03:53:36 +00:00
|
|
|
You I<must not> change the priority of a watcher as long as it is active or
|
|
|
|
pending.
|
|
|
|
|
2007-12-07 16:44:10 +00:00
|
|
|
The default priority used by watchers when no priority has been set is
|
|
|
|
always C<0>, which is supposed to not be too high and not be too low :).
|
|
|
|
|
|
|
|
Setting a priority outside the range of C<EV_MINPRI> to C<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.
|
|
|
|
|
2007-12-08 14:12:07 +00:00
|
|
|
=item ev_invoke (loop, ev_TYPE *watcher, int revents)
|
|
|
|
|
|
|
|
Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
|
|
|
|
C<loop> nor C<revents> need to be valid as long as the watcher callback
|
|
|
|
can deal with that fact.
|
|
|
|
|
|
|
|
=item int ev_clear_pending (loop, ev_TYPE *watcher)
|
|
|
|
|
|
|
|
If the watcher is pending, this function returns clears its pending status
|
|
|
|
and returns its C<revents> bitset (as if its callback was invoked). If the
|
|
|
|
watcher isn't pending it does nothing and returns C<0>.
|
|
|
|
|
2007-11-24 07:14:26 +00:00
|
|
|
=back
|
|
|
|
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
|
|
|
|
|
|
|
|
Each watcher has, by default, a member C<void *data> that you can change
|
2007-11-12 08:45:49 +00:00
|
|
|
and read at any time, libev will completely ignore it. This can be used
|
2007-11-12 07:58:13 +00:00
|
|
|
to associate arbitrary data with your watcher. If you need more data and
|
|
|
|
don't want to allocate memory and store a pointer to it in that data
|
|
|
|
member, you can also "subclass" the watcher type and provide your own
|
|
|
|
data:
|
|
|
|
|
|
|
|
struct my_io
|
|
|
|
{
|
|
|
|
struct ev_io io;
|
|
|
|
int otherfd;
|
|
|
|
void *somedata;
|
|
|
|
struct whatever *mostinteresting;
|
|
|
|
}
|
|
|
|
|
|
|
|
And since your callback will be called with a pointer to the watcher, you
|
|
|
|
can cast it back to your own type:
|
|
|
|
|
|
|
|
static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
|
|
|
|
{
|
|
|
|
struct my_io *w = (struct my_io *)w_;
|
|
|
|
...
|
|
|
|
}
|
|
|
|
|
2007-11-27 20:38:07 +00:00
|
|
|
More interesting and less C-conformant ways of casting your callback type
|
|
|
|
instead have been omitted.
|
|
|
|
|
|
|
|
Another common scenario is having some data structure with multiple
|
|
|
|
watchers:
|
|
|
|
|
|
|
|
struct my_biggy
|
|
|
|
{
|
|
|
|
int some_data;
|
|
|
|
ev_timer t1;
|
|
|
|
ev_timer t2;
|
|
|
|
}
|
|
|
|
|
|
|
|
In this case getting the pointer to C<my_biggy> is a bit more complicated,
|
|
|
|
you need to use C<offsetof>:
|
|
|
|
|
|
|
|
#include <stddef.h>
|
|
|
|
|
|
|
|
static void
|
|
|
|
t1_cb (EV_P_ struct ev_timer *w, int revents)
|
|
|
|
{
|
|
|
|
struct my_biggy big = (struct my_biggy *
|
|
|
|
(((char *)w) - offsetof (struct my_biggy, t1));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
t2_cb (EV_P_ struct ev_timer *w, int revents)
|
|
|
|
{
|
|
|
|
struct my_biggy big = (struct my_biggy *
|
|
|
|
(((char *)w) - offsetof (struct my_biggy, t2));
|
|
|
|
}
|
2007-11-12 07:58:13 +00:00
|
|
|
|
|
|
|
|
|
|
|
=head1 WATCHER TYPES
|
|
|
|
|
|
|
|
This section describes each watcher in detail, but will not repeat
|
2007-11-27 08:11:52 +00:00
|
|
|
information given in the last section. Any initialisation/set macros,
|
|
|
|
functions and members specific to the watcher type are explained.
|
|
|
|
|
|
|
|
Members are additionally marked with either I<[read-only]>, meaning that,
|
|
|
|
while the watcher is active, you can look at the member and expect some
|
|
|
|
sensible content, but you must not modify it (you can modify it while the
|
|
|
|
watcher is stopped to your hearts content), or I<[read-write]>, which
|
|
|
|
means you can expect it to have some sensible content while the watcher
|
|
|
|
is active, but you can also modify it. Modifying it may not do something
|
|
|
|
sensible or take immediate effect (or do anything at all), but libev will
|
|
|
|
not crash or malfunction in any way.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-23 16:17:12 +00:00
|
|
|
|
2007-11-24 16:31:45 +00:00
|
|
|
=head2 C<ev_io> - is this file descriptor readable or writable?
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 08:11:01 +00:00
|
|
|
I/O watchers check whether a file descriptor is readable or writable
|
2007-11-24 16:31:45 +00:00
|
|
|
in each iteration of the event loop, or, more precisely, when reading
|
|
|
|
would not block the process and writing would at least be able to write
|
|
|
|
some data. This behaviour is called level-triggering because you keep
|
|
|
|
receiving events as long as the condition persists. Remember you can stop
|
|
|
|
the watcher if you don't want to act on the event and neither want to
|
|
|
|
receive future events.
|
2007-11-12 07:58:13 +00:00
|
|
|
|
2007-11-12 18:40:21 +00:00
|
|
|
In general you can register as many read and/or write event watchers per
|
2007-11-12 08:16:02 +00:00
|
|
|
fd as you want (as long as you don't confuse yourself). Setting all file
|
|
|
|
descriptors to non-blocking mode is also usually a good idea (but not
|
|
|
|
required if you know what you are doing).
|
|
|
|
|
|
|
|
You have to be careful with dup'ed file descriptors, though. Some backends
|
|
|
|
(the linux epoll backend is a notable example) cannot handle dup'ed file
|
|
|
|
descriptors correctly if you register interest in two or more fds pointing
|
2007-11-24 16:31:45 +00:00
|
|
|
to the same underlying file/socket/etc. description (that is, they share
|
2007-11-12 19:20:05 +00:00
|
|
|
the same underlying "file open").
|
2007-11-12 08:16:02 +00:00
|
|
|
|
|
|
|
If you must do this, then force the use of a known-to-be-good backend
|
2007-11-23 05:00:44 +00:00
|
|
|
(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
|
|
|
|
C<EVBACKEND_POLL>).
|
2007-11-12 08:16:02 +00:00
|
|
|
|
2007-11-24 16:31:45 +00:00
|
|
|
Another thing you have to watch out for is that it is quite easy to
|
|
|
|
receive "spurious" readyness notifications, that is your callback might
|
|
|
|
be called with C<EV_READ> but a subsequent C<read>(2) will actually block
|
|
|
|
because there is no data. Not only are some backends known to create a
|
|
|
|
lot of those (for example solaris ports), it is very easy to get into
|
|
|
|
this situation even with a relatively standard program structure. Thus
|
|
|
|
it is best to always use non-blocking I/O: An extra C<read>(2) returning
|
|
|
|
C<EAGAIN> is far preferable to a program hanging until some data arrives.
|
|
|
|
|
|
|
|
If you cannot run the fd in non-blocking mode (for example you should not
|
|
|
|
play around with an Xlib connection), then you have to seperately re-test
|
2007-12-07 18:09:38 +00:00
|
|
|
whether a file descriptor is really ready with a known-to-be good interface
|
2007-11-24 16:31:45 +00:00
|
|
|
such as poll (fortunately in our Xlib example, Xlib already does this on
|
|
|
|
its own, so its quite safe to use).
|
|
|
|
|
2007-12-12 04:53:58 +00:00
|
|
|
=head3 The special problem of disappearing file descriptors
|
|
|
|
|
|
|
|
Some backends (e.g kqueue, epoll) need to be told about closing a file
|
|
|
|
descriptor (either by calling C<close> explicitly or by any other means,
|
|
|
|
such as C<dup>). The reason is that you register interest in some file
|
|
|
|
descriptor, but when it goes away, the operating system will silently drop
|
|
|
|
this interest. If another file descriptor with the same number then is
|
|
|
|
registered with libev, there is no efficient way to see that this is, in
|
|
|
|
fact, a different file descriptor.
|
|
|
|
|
|
|
|
To avoid having to explicitly tell libev about such cases, libev follows
|
|
|
|
the following policy: Each time C<ev_io_set> is being called, libev
|
|
|
|
will assume that this is potentially a new file descriptor, otherwise
|
|
|
|
it is assumed that the file descriptor stays the same. That means that
|
|
|
|
you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
|
|
|
|
descriptor even if the file descriptor number itself did not change.
|
|
|
|
|
|
|
|
This is how one would do it normally anyway, the important point is that
|
|
|
|
the libev application should not optimise around libev but should leave
|
|
|
|
optimisations to libev.
|
|
|
|
|
|
|
|
|
2007-12-12 17:55:05 +00:00
|
|
|
=head3 Watcher-Specific Functions
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=over 4
|
|
|
|
|
|
|
|
=item ev_io_init (ev_io *, callback, int fd, int events)
|
|
|
|
|
|
|
|
=item ev_io_set (ev_io *, int fd, int events)
|
|
|
|
|
2007-11-24 16:31:45 +00:00
|
|
|
Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
|
|
|
|
rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or
|
|
|
|
C<EV_READ | EV_WRITE> to receive the given events.
|
2007-11-23 08:36:35 +00:00
|
|
|
|
2007-11-27 08:11:52 +00:00
|
|
|
=item int fd [read-only]
|
|
|
|
|
|
|
|
The file descriptor being watched.
|
|
|
|
|
|
|
|
=item int events [read-only]
|
|
|
|
|
|
|
|
The events being watched.
|
|
|
|
|
2007-11-12 07:58:13 +00:00
|
|
|
=back
|
|
|
|
|
2007-11-27 20:26:50 +00:00
|
|
|
Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
|
2007-11-23 16:17:12 +00:00
|
|
|
readable, but only once. Since it is likely line-buffered, you could
|
2007-11-27 20:26:50 +00:00
|
|
|
attempt to read a whole line in the callback.
|
2007-11-23 16:17:12 +00:00
|
|
|
|
|
|
|
static void
|
|
|
|
stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
|
|
|
|
{
|
|
|
|
ev_io_stop (loop, w);
|
|
|
|
.. read from stdin here (or from w->fd) and haqndle any I/O errors
|
|
|
|
}
|
|
|
|
|
|
|
|
...
|
|
|
|
struct ev_loop *loop = ev_default_init (0);
|
|
|
|
struct ev_io stdin_readable;
|
|
|
|
ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
|
|
|
|
ev_io_start (loop, &stdin_readable);
|
|
|
|
ev_loop (loop, 0);
|
|
|
|
|
|
|
|
|
2007-11-24 16:31:45 +00:00
|