These functions can be called anytime, even before initialising the +library in any way.

ev_tstamp ev_time ()

Returns the current time as libev would use it.

Returns the current time as libev would use it. Please note that the +ev_now function is usually faster and also often returns the timestamp +you actually want to know.

int ev_version_major ()

int ev_version_minor ()

EVMETHOD_SELECT (portable select backend)

EVMETHOD_POLL (poll backend, available everywhere except on windows)

EVMETHOD_EPOLL (linux only)

EVMETHOD_KQUEUE (some bsds only)

EVMETHOD_DEVPOLL (solaris 8 only)

EVMETHOD_PORT (solaris 10 only)

EVMETHOD_SELECT (value 1, portable select backend)

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 one are -specified, any backend will do.

This is your standard select(2) backend. Not 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.

EVMETHOD_POLL (value 2, poll backend, available everywhere except on windows)

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).

EVMETHOD_EPOLL (value 4, Linux)

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).

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.

EVMETHOD_KQUEUE (value 8, most BSD clones)

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 +anything but sockets and pipes, except on Darwin, where of course its +completely useless). For this reason its not being "autodetected" unless +you explicitly specify the flags (i.e. you don't use EVFLAG_AUTO).

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.

EVMETHOD_DEVPOLL (value 16, Solaris 8)

This is not implemented yet (and might never be).

EVMETHOD_PORT (value 32, Solaris 10)

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)).

EVMETHOD_ALL

Try all backends (even potentially broken ones). Since this is a mask, you +can do stuff like EVMETHOD_ALL & ~EVMETHOD_KQUEUE.

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 :)

struct ev_loop *ev_loop_new (unsigned int flags)

@@ -266,12 +319,30 @@ one iteration of the loop.

This flags value could be used to implement alternative looping constructs, but the prepare and check watchers provide a better and more generic mechanism.

Here are the gory details of what ev_loop does:

   1. If there are no active watchers (reference count is zero), return.
+   2. Queue and immediately call all prepare watchers.
+   3. If we have been forked, recreate the kernel state.
+   4. Update the kernel state with all outstanding changes.
+   5. Update the "event loop time".
+   6. Calculate for how long to block.
+   7. Block the process, waiting for events.
+   8. Update the "event loop time" and do time jump handling.
+   9. Queue all outstanding timers.
+  10. Queue all outstanding periodics.
+  11. If no events are pending now, queue all idle watchers.
+  12. Queue all check watchers.
+  13. Call all queued watchers in reverse order (i.e. check watchers first).
+  14. If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
+      was used, return, otherwise continue with step #1.
+
+

ev_unloop (loop, how)

Can be used to make a call to ev_loop return early (but only after it has processed all outstanding events). The how argument must be either -EVUNLOOP_ONCE, which will make the innermost ev_loop call return, or +EVUNLOOP_ONE, which will make the innermost ev_loop call return, or EVUNLOOP_ALL, which will make all nested ev_loop calls return.

ev_ref (loop)

@@ -440,14 +511,15 @@ in each iteration of the event loop (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).

In general you can register as many read and/or write event watchers oer +

In general you can register as many read and/or write event watchers per 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 -to the same file/socket etc. description.

+to the same underlying file/socket etc. description (that is, they share +the same underlying "file open").

If you must do this, then force the use of a known-to-be-good backend (at the time of this writing, this includes only EVMETHOD_SELECT and EVMETHOD_POLL).

@@ -467,18 +539,21 @@ EV_WRITE to receive the given events.

Timer watchers are simple relative timers that generate an event after a given time, and optionally repeating in regular intervals after that.

The timers are based on real time, that is, if you register an event that -times out after an hour and youreset your system clock to last years +times out after an hour and you reset your system clock to last years time, it will still time out after (roughly) and hour. "Roughly" because -detecting time jumps is hard, and soem inaccuracies are unavoidable (the +detecting time jumps is hard, and some inaccuracies are unavoidable (the monotonic clock option helps a lot here).

The relative timeouts are calculated relative to the ev_now () time. This is usually the right thing as this timestamp refers to the time -of the event triggering whatever timeout you are modifying/starting. If -you suspect event processing to be delayed and you *need* to base the timeout -ion the current time, use something like this to adjust for this:

+of the event triggering whatever timeout you are modifying/starting. If +you suspect event processing to be delayed and you need to base the timeout +on the current time, use something like this to adjust for this:

   ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);

The callback is guarenteed to be invoked only when its timeout has passed, +but if multiple timers become ready during the same loop iteration then +order of execution is undefined.

ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
ev_timer_again (loop)

GLOBAL FUNCTIONS

`ev_prepare` and `ev_check` - customise your event loop

LIBEVENT EMULATION

C++ SUPPORT

AUTHOR

GLOBAL FUNCTIONS

ev_prepare and ev_check - customise your event loop

LIBEVENT EMULATION

C++ SUPPORT

AUTHOR

`ev_prepare` and `ev_check` - customise your event loop