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

Comparing libev/ev.pod (file contents):
Revision 1.67 by root, Fri Dec 7 16:44:12 2007 UTC vs.
Revision 1.168 by root, Mon Jun 9 14:31:36 2008 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 #include <ev.h> 7 #include <ev.h>
8 8
9=head1 EXAMPLE PROGRAM 9=head2 EXAMPLE PROGRAM
10 10
11 // a single header file is required
11 #include <ev.h> 12 #include <ev.h>
12 13
14 // every watcher type has its own typedef'd struct
15 // with the name ev_<type>
13 ev_io stdin_watcher; 16 ev_io stdin_watcher;
14 ev_timer timeout_watcher; 17 ev_timer timeout_watcher;
15 18
16 /* called when data readable on stdin */ 19 // all watcher callbacks have a similar signature
20 // this callback is called when data is readable on stdin
17 static void 21 static void
18 stdin_cb (EV_P_ struct ev_io *w, int revents) 22 stdin_cb (EV_P_ struct ev_io *w, int revents)
19 { 23 {
20 /* puts ("stdin ready"); */ 24 puts ("stdin ready");
21 ev_io_stop (EV_A_ w); /* just a syntax example */ 25 // for one-shot events, one must manually stop the watcher
22 ev_unloop (EV_A_ EVUNLOOP_ALL); /* leave all loop calls */ 26 // with its corresponding stop function.
27 ev_io_stop (EV_A_ w);
28
29 // this causes all nested ev_loop's to stop iterating
30 ev_unloop (EV_A_ EVUNLOOP_ALL);
23 } 31 }
24 32
33 // another callback, this time for a time-out
25 static void 34 static void
26 timeout_cb (EV_P_ struct ev_timer *w, int revents) 35 timeout_cb (EV_P_ struct ev_timer *w, int revents)
27 { 36 {
28 /* puts ("timeout"); */ 37 puts ("timeout");
29 ev_unloop (EV_A_ EVUNLOOP_ONE); /* leave one loop call */ 38 // this causes the innermost ev_loop to stop iterating
39 ev_unloop (EV_A_ EVUNLOOP_ONE);
30 } 40 }
31 41
32 int 42 int
33 main (void) 43 main (void)
34 { 44 {
45 // use the default event loop unless you have special needs
35 struct ev_loop *loop = ev_default_loop (0); 46 struct ev_loop *loop = ev_default_loop (0);
36 47
37 /* initialise an io watcher, then start it */ 48 // initialise an io watcher, then start it
49 // this one will watch for stdin to become readable
38 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); 50 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
39 ev_io_start (loop, &stdin_watcher); 51 ev_io_start (loop, &stdin_watcher);
40 52
53 // initialise a timer watcher, then start it
41 /* simple non-repeating 5.5 second timeout */ 54 // simple non-repeating 5.5 second timeout
42 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); 55 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
43 ev_timer_start (loop, &timeout_watcher); 56 ev_timer_start (loop, &timeout_watcher);
44 57
45 /* loop till timeout or data ready */ 58 // now wait for events to arrive
46 ev_loop (loop, 0); 59 ev_loop (loop, 0);
47 60
61 // unloop was called, so exit
48 return 0; 62 return 0;
49 } 63 }
50 64
51=head1 DESCRIPTION 65=head1 DESCRIPTION
52 66
67The newest version of this document is also available as an html-formatted
68web page you might find easier to navigate when reading it for the first
69time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
70
53Libev is an event loop: you register interest in certain events (such as a 71Libev is an event loop: you register interest in certain events (such as a
54file descriptor being readable or a timeout occuring), and it will manage 72file descriptor being readable or a timeout occurring), and it will manage
55these event sources and provide your program with events. 73these event sources and provide your program with events.
56 74
57To do this, it must take more or less complete control over your process 75To do this, it must take more or less complete control over your process
58(or thread) by executing the I<event loop> handler, and will then 76(or thread) by executing the I<event loop> handler, and will then
59communicate events via a callback mechanism. 77communicate events via a callback mechanism.
61You register interest in certain events by registering so-called I<event 79You register interest in certain events by registering so-called I<event
62watchers>, which are relatively small C structures you initialise with the 80watchers>, which are relatively small C structures you initialise with the
63details of the event, and then hand it over to libev by I<starting> the 81details of the event, and then hand it over to libev by I<starting> the
64watcher. 82watcher.
65 83
66=head1 FEATURES 84=head2 FEATURES
67 85
68Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 86Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
69BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 87BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
70for file descriptor events (C<ev_io>), the Linux C<inotify> interface 88for file descriptor events (C<ev_io>), the Linux C<inotify> interface
71(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 89(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
78 96
79It also is quite fast (see this 97It also is quite fast (see this
80L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 98L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
81for example). 99for example).
82 100
83=head1 CONVENTIONS 101=head2 CONVENTIONS
84 102
85Libev is very configurable. In this manual the default configuration will 103Libev is very configurable. In this manual the default (and most common)
86be described, which supports multiple event loops. For more info about 104configuration will be described, which supports multiple event loops. For
87various configuration options please have a look at B<EMBED> section in 105more info about various configuration options please have a look at
88this manual. If libev was configured without support for multiple event 106B<EMBED> section in this manual. If libev was configured without support
89loops, then all functions taking an initial argument of name C<loop> 107for multiple event loops, then all functions taking an initial argument of
90(which is always of type C<struct ev_loop *>) will not have this argument. 108name C<loop> (which is always of type C<struct ev_loop *>) will not have
109this argument.
91 110
92=head1 TIME REPRESENTATION 111=head2 TIME REPRESENTATION
93 112
94Libev represents time as a single floating point number, representing the 113Libev represents time as a single floating point number, representing the
95(fractional) number of seconds since the (POSIX) epoch (somewhere near 114(fractional) number of seconds since the (POSIX) epoch (somewhere near
96the beginning of 1970, details are complicated, don't ask). This type is 115the beginning of 1970, details are complicated, don't ask). This type is
97called C<ev_tstamp>, which is what you should use too. It usually aliases 116called C<ev_tstamp>, which is what you should use too. It usually aliases
98to the C<double> type in C, and when you need to do any calculations on 117to the C<double> type in C, and when you need to do any calculations on
99it, you should treat it as such. 118it, you should treat it as some floating point value. Unlike the name
119component C<stamp> might indicate, it is also used for time differences
120throughout libev.
121
122=head1 ERROR HANDLING
123
124Libev knows three classes of errors: operating system errors, usage errors
125and internal errors (bugs).
126
127When libev catches an operating system error it cannot handle (for example
128a system call indicating a condition libev cannot fix), it calls the callback
129set via C<ev_set_syserr_cb>, which is supposed to fix the problem or
130abort. The default is to print a diagnostic message and to call C<abort
131()>.
132
133When libev detects a usage error such as a negative timer interval, then
134it will print a diagnostic message and abort (via the C<assert> mechanism,
135so C<NDEBUG> will disable this checking): these are programming errors in
136the libev caller and need to be fixed there.
137
138Libev also has a few internal error-checking C<assert>ions, and also has
139extensive consistency checking code. These do not trigger under normal
140circumstances, as they indicate either a bug in libev or worse.
141
100 142
101=head1 GLOBAL FUNCTIONS 143=head1 GLOBAL FUNCTIONS
102 144
103These functions can be called anytime, even before initialising the 145These functions can be called anytime, even before initialising the
104library in any way. 146library in any way.
109 151
110Returns the current time as libev would use it. Please note that the 152Returns the current time as libev would use it. Please note that the
111C<ev_now> function is usually faster and also often returns the timestamp 153C<ev_now> function is usually faster and also often returns the timestamp
112you actually want to know. 154you actually want to know.
113 155
156=item ev_sleep (ev_tstamp interval)
157
158Sleep for the given interval: The current thread will be blocked until
159either it is interrupted or the given time interval has passed. Basically
160this is a sub-second-resolution C<sleep ()>.
161
114=item int ev_version_major () 162=item int ev_version_major ()
115 163
116=item int ev_version_minor () 164=item int ev_version_minor ()
117 165
118You can find out the major and minor version numbers of the library 166You can find out the major and minor ABI version numbers of the library
119you linked against by calling the functions C<ev_version_major> and 167you linked against by calling the functions C<ev_version_major> and
120C<ev_version_minor>. If you want, you can compare against the global 168C<ev_version_minor>. If you want, you can compare against the global
121symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the 169symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
122version of the library your program was compiled against. 170version of the library your program was compiled against.
123 171
172These version numbers refer to the ABI version of the library, not the
173release version.
174
124Usually, it's a good idea to terminate if the major versions mismatch, 175Usually, it's a good idea to terminate if the major versions mismatch,
125as this indicates an incompatible change. Minor versions are usually 176as this indicates an incompatible change. Minor versions are usually
126compatible to older versions, so a larger minor version alone is usually 177compatible to older versions, so a larger minor version alone is usually
127not a problem. 178not a problem.
128 179
129Example: Make sure we haven't accidentally been linked against the wrong 180Example: Make sure we haven't accidentally been linked against the wrong
130version. 181version.
131 182
132 assert (("libev version mismatch", 183 assert (("libev version mismatch",
133 ev_version_major () == EV_VERSION_MAJOR 184 ev_version_major () == EV_VERSION_MAJOR
134 && ev_version_minor () >= EV_VERSION_MINOR)); 185 && ev_version_minor () >= EV_VERSION_MINOR));
135 186
136=item unsigned int ev_supported_backends () 187=item unsigned int ev_supported_backends ()
137 188
138Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*> 189Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
139value) compiled into this binary of libev (independent of their 190value) compiled into this binary of libev (independent of their
141a description of the set values. 192a description of the set values.
142 193
143Example: make sure we have the epoll method, because yeah this is cool and 194Example: make sure we have the epoll method, because yeah this is cool and
144a must have and can we have a torrent of it please!!!11 195a must have and can we have a torrent of it please!!!11
145 196
146 assert (("sorry, no epoll, no sex", 197 assert (("sorry, no epoll, no sex",
147 ev_supported_backends () & EVBACKEND_EPOLL)); 198 ev_supported_backends () & EVBACKEND_EPOLL));
148 199
149=item unsigned int ev_recommended_backends () 200=item unsigned int ev_recommended_backends ()
150 201
151Return the set of all backends compiled into this binary of libev and also 202Return the set of all backends compiled into this binary of libev and also
152recommended for this platform. This set is often smaller than the one 203recommended for this platform. This set is often smaller than the one
153returned by C<ev_supported_backends>, as for example kqueue is broken on 204returned by C<ev_supported_backends>, as for example kqueue is broken on
154most BSDs and will not be autodetected unless you explicitly request it 205most BSDs and will not be auto-detected unless you explicitly request it
155(assuming you know what you are doing). This is the set of backends that 206(assuming you know what you are doing). This is the set of backends that
156libev will probe for if you specify no backends explicitly. 207libev will probe for if you specify no backends explicitly.
157 208
158=item unsigned int ev_embeddable_backends () 209=item unsigned int ev_embeddable_backends ()
159 210
166See the description of C<ev_embed> watchers for more info. 217See the description of C<ev_embed> watchers for more info.
167 218
168=item ev_set_allocator (void *(*cb)(void *ptr, long size)) 219=item ev_set_allocator (void *(*cb)(void *ptr, long size))
169 220
170Sets the allocation function to use (the prototype is similar - the 221Sets the allocation function to use (the prototype is similar - the
171semantics is identical - to the realloc C function). It is used to 222semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
172allocate and free memory (no surprises here). If it returns zero when 223used to allocate and free memory (no surprises here). If it returns zero
173memory needs to be allocated, the library might abort or take some 224when memory needs to be allocated (C<size != 0>), the library might abort
174potentially destructive action. The default is your system realloc 225or take some potentially destructive action.
175function. 226
227Since some systems (at least OpenBSD and Darwin) fail to implement
228correct C<realloc> semantics, libev will use a wrapper around the system
229C<realloc> and C<free> functions by default.
176 230
177You could override this function in high-availability programs to, say, 231You could override this function in high-availability programs to, say,
178free some memory if it cannot allocate memory, to use a special allocator, 232free some memory if it cannot allocate memory, to use a special allocator,
179or even to sleep a while and retry until some memory is available. 233or even to sleep a while and retry until some memory is available.
180 234
181Example: Replace the libev allocator with one that waits a bit and then 235Example: Replace the libev allocator with one that waits a bit and then
182retries). 236retries (example requires a standards-compliant C<realloc>).
183 237
184 static void * 238 static void *
185 persistent_realloc (void *ptr, size_t size) 239 persistent_realloc (void *ptr, size_t size)
186 { 240 {
187 for (;;) 241 for (;;)
198 ... 252 ...
199 ev_set_allocator (persistent_realloc); 253 ev_set_allocator (persistent_realloc);
200 254
201=item ev_set_syserr_cb (void (*cb)(const char *msg)); 255=item ev_set_syserr_cb (void (*cb)(const char *msg));
202 256
203Set the callback function to call on a retryable syscall error (such 257Set the callback function to call on a retryable system call error (such
204as failed select, poll, epoll_wait). The message is a printable string 258as failed select, poll, epoll_wait). The message is a printable string
205indicating the system call or subsystem causing the problem. If this 259indicating the system call or subsystem causing the problem. If this
206callback is set, then libev will expect it to remedy the sitution, no 260callback is set, then libev will expect it to remedy the situation, no
207matter what, when it returns. That is, libev will generally retry the 261matter what, when it returns. That is, libev will generally retry the
208requested operation, or, if the condition doesn't go away, do bad stuff 262requested operation, or, if the condition doesn't go away, do bad stuff
209(such as abort). 263(such as abort).
210 264
211Example: This is basically the same thing that libev does internally, too. 265Example: This is basically the same thing that libev does internally, too.
225=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 279=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
226 280
227An event loop is described by a C<struct ev_loop *>. The library knows two 281An event loop is described by a C<struct ev_loop *>. The library knows two
228types of such loops, the I<default> loop, which supports signals and child 282types of such loops, the I<default> loop, which supports signals and child
229events, and dynamically created loops which do not. 283events, and dynamically created loops which do not.
230
231If you use threads, a common model is to run the default event loop
232in your main thread (or in a separate thread) and for each thread you
233create, you also create another event loop. Libev itself does no locking
234whatsoever, so if you mix calls to the same event loop in different
235threads, make sure you lock (this is usually a bad idea, though, even if
236done correctly, because it's hideous and inefficient).
237 284
238=over 4 285=over 4
239 286
240=item struct ev_loop *ev_default_loop (unsigned int flags) 287=item struct ev_loop *ev_default_loop (unsigned int flags)
241 288
245flags. If that is troubling you, check C<ev_backend ()> afterwards). 292flags. If that is troubling you, check C<ev_backend ()> afterwards).
246 293
247If you don't know what event loop to use, use the one returned from this 294If you don't know what event loop to use, use the one returned from this
248function. 295function.
249 296
297Note that this function is I<not> thread-safe, so if you want to use it
298from multiple threads, you have to lock (note also that this is unlikely,
299as loops cannot bes hared easily between threads anyway).
300
301The default loop is the only loop that can handle C<ev_signal> and
302C<ev_child> watchers, and to do this, it always registers a handler
303for C<SIGCHLD>. If this is a problem for your application you can either
304create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
305can simply overwrite the C<SIGCHLD> signal handler I<after> calling
306C<ev_default_init>.
307
250The flags argument can be used to specify special behaviour or specific 308The flags argument can be used to specify special behaviour or specific
251backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). 309backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
252 310
253The following flags are supported: 311The following flags are supported:
254 312
259The default flags value. Use this if you have no clue (it's the right 317The default flags value. Use this if you have no clue (it's the right
260thing, believe me). 318thing, believe me).
261 319
262=item C<EVFLAG_NOENV> 320=item C<EVFLAG_NOENV>
263 321
264If this flag bit is ored into the flag value (or the program runs setuid 322If this flag bit is or'ed into the flag value (or the program runs setuid
265or setgid) then libev will I<not> look at the environment variable 323or setgid) then libev will I<not> look at the environment variable
266C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 324C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
267override the flags completely if it is found in the environment. This is 325override the flags completely if it is found in the environment. This is
268useful to try out specific backends to test their performance, or to work 326useful to try out specific backends to test their performance, or to work
269around bugs. 327around bugs.
275enabling this flag. 333enabling this flag.
276 334
277This works by calling C<getpid ()> on every iteration of the loop, 335This works by calling C<getpid ()> on every iteration of the loop,
278and thus this might slow down your event loop if you do a lot of loop 336and thus this might slow down your event loop if you do a lot of loop
279iterations and little real work, but is usually not noticeable (on my 337iterations and little real work, but is usually not noticeable (on my
280Linux system for example, C<getpid> is actually a simple 5-insn sequence 338GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
281without a syscall and thus I<very> fast, but my Linux system also has 339without a system call and thus I<very> fast, but my GNU/Linux system also has
282C<pthread_atfork> which is even faster). 340C<pthread_atfork> which is even faster).
283 341
284The big advantage of this flag is that you can forget about fork (and 342The big advantage of this flag is that you can forget about fork (and
285forget about forgetting to tell libev about forking) when you use this 343forget about forgetting to tell libev about forking) when you use this
286flag. 344flag.
287 345
288This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS> 346This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
289environment variable. 347environment variable.
290 348
291=item C<EVBACKEND_SELECT> (value 1, portable select backend) 349=item C<EVBACKEND_SELECT> (value 1, portable select backend)
292 350
293This is your standard select(2) backend. Not I<completely> standard, as 351This is your standard select(2) backend. Not I<completely> standard, as
294libev tries to roll its own fd_set with no limits on the number of fds, 352libev tries to roll its own fd_set with no limits on the number of fds,
295but if that fails, expect a fairly low limit on the number of fds when 353but if that fails, expect a fairly low limit on the number of fds when
296using this backend. It doesn't scale too well (O(highest_fd)), but its usually 354using this backend. It doesn't scale too well (O(highest_fd)), but its
297the fastest backend for a low number of fds. 355usually the fastest backend for a low number of (low-numbered :) fds.
356
357To get good performance out of this backend you need a high amount of
358parallelism (most of the file descriptors should be busy). If you are
359writing a server, you should C<accept ()> in a loop to accept as many
360connections as possible during one iteration. You might also want to have
361a look at C<ev_set_io_collect_interval ()> to increase the amount of
362readiness notifications you get per iteration.
298 363
299=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) 364=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
300 365
301And this is your standard poll(2) backend. It's more complicated than 366And this is your standard poll(2) backend. It's more complicated
302select, but handles sparse fds better and has no artificial limit on the 367than select, but handles sparse fds better and has no artificial
303number of fds you can use (except it will slow down considerably with a 368limit on the number of fds you can use (except it will slow down
304lot of inactive fds). It scales similarly to select, i.e. O(total_fds). 369considerably with a lot of inactive fds). It scales similarly to select,
370i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
371performance tips.
305 372
306=item C<EVBACKEND_EPOLL> (value 4, Linux) 373=item C<EVBACKEND_EPOLL> (value 4, Linux)
307 374
308For few fds, this backend is a bit little slower than poll and select, 375For few fds, this backend is a bit little slower than poll and select,
309but it scales phenomenally better. While poll and select usually scale like 376but it scales phenomenally better. While poll and select usually scale
310O(total_fds) where n is the total number of fds (or the highest fd), epoll scales 377like O(total_fds) where n is the total number of fds (or the highest fd),
311either O(1) or O(active_fds). 378epoll scales either O(1) or O(active_fds). The epoll design has a number
379of shortcomings, such as silently dropping events in some hard-to-detect
380cases and requiring a system call per fd change, no fork support and bad
381support for dup.
312 382
313While stopping and starting an I/O watcher in the same iteration will 383While stopping, setting and starting an I/O watcher in the same iteration
314result in some caching, there is still a syscall per such incident 384will result in some caching, there is still a system call per such incident
315(because the fd could point to a different file description now), so its 385(because the fd could point to a different file description now), so its
316best to avoid that. Also, dup()ed file descriptors might not work very 386best to avoid that. Also, C<dup ()>'ed file descriptors might not work
317well if you register events for both fds. 387very well if you register events for both fds.
318 388
319Please note that epoll sometimes generates spurious notifications, so you 389Please note that epoll sometimes generates spurious notifications, so you
320need to use non-blocking I/O or other means to avoid blocking when no data 390need to use non-blocking I/O or other means to avoid blocking when no data
321(or space) is available. 391(or space) is available.
322 392
393Best performance from this backend is achieved by not unregistering all
394watchers for a file descriptor until it has been closed, if possible, i.e.
395keep at least one watcher active per fd at all times.
396
397While nominally embeddable in other event loops, this feature is broken in
398all kernel versions tested so far.
399
323=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 400=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
324 401
325Kqueue deserves special mention, as at the time of this writing, it 402Kqueue deserves special mention, as at the time of this writing, it
326was broken on all BSDs except NetBSD (usually it doesn't work with 403was broken on all BSDs except NetBSD (usually it doesn't work reliably
327anything but sockets and pipes, except on Darwin, where of course its 404with anything but sockets and pipes, except on Darwin, where of course
328completely useless). For this reason its not being "autodetected" 405it's completely useless). For this reason it's not being "auto-detected"
329unless you explicitly specify it explicitly in the flags (i.e. using 406unless you explicitly specify it explicitly in the flags (i.e. using
330C<EVBACKEND_KQUEUE>). 407C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
408system like NetBSD.
409
410You still can embed kqueue into a normal poll or select backend and use it
411only for sockets (after having made sure that sockets work with kqueue on
412the target platform). See C<ev_embed> watchers for more info.
331 413
332It scales in the same way as the epoll backend, but the interface to the 414It scales in the same way as the epoll backend, but the interface to the
333kernel is more efficient (which says nothing about its actual speed, of 415kernel is more efficient (which says nothing about its actual speed, of
334course). While starting and stopping an I/O watcher does not cause an 416course). While stopping, setting and starting an I/O watcher does never
335extra syscall as with epoll, it still adds up to four event changes per 417cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
336incident, so its best to avoid that. 418two event changes per incident, support for C<fork ()> is very bad and it
419drops fds silently in similarly hard-to-detect cases.
420
421This backend usually performs well under most conditions.
422
423While nominally embeddable in other event loops, this doesn't work
424everywhere, so you might need to test for this. And since it is broken
425almost everywhere, you should only use it when you have a lot of sockets
426(for which it usually works), by embedding it into another event loop
427(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for
428sockets.
337 429
338=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 430=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
339 431
340This is not implemented yet (and might never be). 432This is not implemented yet (and might never be, unless you send me an
433implementation). According to reports, C</dev/poll> only supports sockets
434and is not embeddable, which would limit the usefulness of this backend
435immensely.
341 436
342=item C<EVBACKEND_PORT> (value 32, Solaris 10) 437=item C<EVBACKEND_PORT> (value 32, Solaris 10)
343 438
344This uses the Solaris 10 port mechanism. As with everything on Solaris, 439This uses the Solaris 10 event port mechanism. As with everything on Solaris,
345it's really slow, but it still scales very well (O(active_fds)). 440it's really slow, but it still scales very well (O(active_fds)).
346 441
347Please note that solaris ports can result in a lot of spurious 442Please note that Solaris event ports can deliver a lot of spurious
348notifications, so you need to use non-blocking I/O or other means to avoid 443notifications, so you need to use non-blocking I/O or other means to avoid
349blocking when no data (or space) is available. 444blocking when no data (or space) is available.
445
446While this backend scales well, it requires one system call per active
447file descriptor per loop iteration. For small and medium numbers of file
448descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
449might perform better.
450
451On the positive side, ignoring the spurious readiness notifications, this
452backend actually performed to specification in all tests and is fully
453embeddable, which is a rare feat among the OS-specific backends.
350 454
351=item C<EVBACKEND_ALL> 455=item C<EVBACKEND_ALL>
352 456
353Try all backends (even potentially broken ones that wouldn't be tried 457Try all backends (even potentially broken ones that wouldn't be tried
354with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 458with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
355C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 459C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
356 460
461It is definitely not recommended to use this flag.
462
357=back 463=back
358 464
359If one or more of these are ored into the flags value, then only these 465If one or more of these are or'ed into the flags value, then only these
360backends will be tried (in the reverse order as given here). If none are 466backends will be tried (in the reverse order as listed here). If none are
361specified, most compiled-in backend will be tried, usually in reverse 467specified, all backends in C<ev_recommended_backends ()> will be tried.
362order of their flag values :)
363 468
364The most typical usage is like this: 469The most typical usage is like this:
365 470
366 if (!ev_default_loop (0)) 471 if (!ev_default_loop (0))
367 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 472 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
368 473
369Restrict libev to the select and poll backends, and do not allow 474Restrict libev to the select and poll backends, and do not allow
370environment settings to be taken into account: 475environment settings to be taken into account:
371 476
372 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV); 477 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
373 478
374Use whatever libev has to offer, but make sure that kqueue is used if 479Use whatever libev has to offer, but make sure that kqueue is used if
375available (warning, breaks stuff, best use only with your own private 480available (warning, breaks stuff, best use only with your own private
376event loop and only if you know the OS supports your types of fds): 481event loop and only if you know the OS supports your types of fds):
377 482
378 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); 483 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
379 484
380=item struct ev_loop *ev_loop_new (unsigned int flags) 485=item struct ev_loop *ev_loop_new (unsigned int flags)
381 486
382Similar to C<ev_default_loop>, but always creates a new event loop that is 487Similar to C<ev_default_loop>, but always creates a new event loop that is
383always distinct from the default loop. Unlike the default loop, it cannot 488always distinct from the default loop. Unlike the default loop, it cannot
384handle signal and child watchers, and attempts to do so will be greeted by 489handle signal and child watchers, and attempts to do so will be greeted by
385undefined behaviour (or a failed assertion if assertions are enabled). 490undefined behaviour (or a failed assertion if assertions are enabled).
386 491
492Note that this function I<is> thread-safe, and the recommended way to use
493libev with threads is indeed to create one loop per thread, and using the
494default loop in the "main" or "initial" thread.
495
387Example: Try to create a event loop that uses epoll and nothing else. 496Example: Try to create a event loop that uses epoll and nothing else.
388 497
389 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 498 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
390 if (!epoller) 499 if (!epoller)
391 fatal ("no epoll found here, maybe it hides under your chair"); 500 fatal ("no epoll found here, maybe it hides under your chair");
392 501
393=item ev_default_destroy () 502=item ev_default_destroy ()
394 503
395Destroys the default loop again (frees all memory and kernel state 504Destroys the default loop again (frees all memory and kernel state
396etc.). None of the active event watchers will be stopped in the normal 505etc.). None of the active event watchers will be stopped in the normal
397sense, so e.g. C<ev_is_active> might still return true. It is your 506sense, so e.g. C<ev_is_active> might still return true. It is your
398responsibility to either stop all watchers cleanly yoursef I<before> 507responsibility to either stop all watchers cleanly yourself I<before>
399calling this function, or cope with the fact afterwards (which is usually 508calling this function, or cope with the fact afterwards (which is usually
400the easiest thing, youc na just ignore the watchers and/or C<free ()> them 509the easiest thing, you can just ignore the watchers and/or C<free ()> them
401for example). 510for example).
511
512Note that certain global state, such as signal state, will not be freed by
513this function, and related watchers (such as signal and child watchers)
514would need to be stopped manually.
515
516In general it is not advisable to call this function except in the
517rare occasion where you really need to free e.g. the signal handling
518pipe fds. If you need dynamically allocated loops it is better to use
519C<ev_loop_new> and C<ev_loop_destroy>).
402 520
403=item ev_loop_destroy (loop) 521=item ev_loop_destroy (loop)
404 522
405Like C<ev_default_destroy>, but destroys an event loop created by an 523Like C<ev_default_destroy>, but destroys an event loop created by an
406earlier call to C<ev_loop_new>. 524earlier call to C<ev_loop_new>.
407 525
408=item ev_default_fork () 526=item ev_default_fork ()
409 527
528This function sets a flag that causes subsequent C<ev_loop> iterations
410This function reinitialises the kernel state for backends that have 529to reinitialise the kernel state for backends that have one. Despite the
411one. Despite the name, you can call it anytime, but it makes most sense 530name, you can call it anytime, but it makes most sense after forking, in
412after forking, in either the parent or child process (or both, but that 531the child process (or both child and parent, but that again makes little
413again makes little sense). 532sense). You I<must> call it in the child before using any of the libev
533functions, and it will only take effect at the next C<ev_loop> iteration.
414 534
415You I<must> call this function in the child process after forking if and 535On the other hand, you only need to call this function in the child
416only if you want to use the event library in both processes. If you just 536process if and only if you want to use the event library in the child. If
417fork+exec, you don't have to call it. 537you just fork+exec, you don't have to call it at all.
418 538
419The function itself is quite fast and it's usually not a problem to call 539The function itself is quite fast and it's usually not a problem to call
420it just in case after a fork. To make this easy, the function will fit in 540it just in case after a fork. To make this easy, the function will fit in
421quite nicely into a call to C<pthread_atfork>: 541quite nicely into a call to C<pthread_atfork>:
422 542
423 pthread_atfork (0, 0, ev_default_fork); 543 pthread_atfork (0, 0, ev_default_fork);
424 544
425At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
426without calling this function, so if you force one of those backends you
427do not need to care.
428
429=item ev_loop_fork (loop) 545=item ev_loop_fork (loop)
430 546
431Like C<ev_default_fork>, but acts on an event loop created by 547Like C<ev_default_fork>, but acts on an event loop created by
432C<ev_loop_new>. Yes, you have to call this on every allocated event loop 548C<ev_loop_new>. Yes, you have to call this on every allocated event loop
433after fork, and how you do this is entirely your own problem. 549after fork, and how you do this is entirely your own problem.
550
551=item int ev_is_default_loop (loop)
552
553Returns true when the given loop actually is the default loop, false otherwise.
434 554
435=item unsigned int ev_loop_count (loop) 555=item unsigned int ev_loop_count (loop)
436 556
437Returns the count of loop iterations for the loop, which is identical to 557Returns the count of loop iterations for the loop, which is identical to
438the number of times libev did poll for new events. It starts at C<0> and 558the number of times libev did poll for new events. It starts at C<0> and
451 571
452Returns the current "event loop time", which is the time the event loop 572Returns the current "event loop time", which is the time the event loop
453received events and started processing them. This timestamp does not 573received events and started processing them. This timestamp does not
454change as long as callbacks are being processed, and this is also the base 574change as long as callbacks are being processed, and this is also the base
455time used for relative timers. You can treat it as the timestamp of the 575time used for relative timers. You can treat it as the timestamp of the
456event occuring (or more correctly, libev finding out about it). 576event occurring (or more correctly, libev finding out about it).
457 577
458=item ev_loop (loop, int flags) 578=item ev_loop (loop, int flags)
459 579
460Finally, this is it, the event handler. This function usually is called 580Finally, this is it, the event handler. This function usually is called
461after you initialised all your watchers and you want to start handling 581after you initialised all your watchers and you want to start handling
473A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 593A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
474those events and any outstanding ones, but will not block your process in 594those events and any outstanding ones, but will not block your process in
475case there are no events and will return after one iteration of the loop. 595case there are no events and will return after one iteration of the loop.
476 596
477A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 597A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
478neccessary) and will handle those and any outstanding ones. It will block 598necessary) and will handle those and any outstanding ones. It will block
479your process until at least one new event arrives, and will return after 599your process until at least one new event arrives, and will return after
480one iteration of the loop. This is useful if you are waiting for some 600one iteration of the loop. This is useful if you are waiting for some
481external event in conjunction with something not expressible using other 601external event in conjunction with something not expressible using other
482libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is 602libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
483usually a better approach for this kind of thing. 603usually a better approach for this kind of thing.
484 604
485Here are the gory details of what C<ev_loop> does: 605Here are the gory details of what C<ev_loop> does:
486 606
487 * If there are no active watchers (reference count is zero), return. 607 - Before the first iteration, call any pending watchers.
488 - Queue prepare watchers and then call all outstanding watchers. 608 * If EVFLAG_FORKCHECK was used, check for a fork.
609 - If a fork was detected, queue and call all fork watchers.
610 - Queue and call all prepare watchers.
489 - If we have been forked, recreate the kernel state. 611 - If we have been forked, recreate the kernel state.
490 - Update the kernel state with all outstanding changes. 612 - Update the kernel state with all outstanding changes.
491 - Update the "event loop time". 613 - Update the "event loop time".
492 - Calculate for how long to block. 614 - Calculate for how long to sleep or block, if at all
615 (active idle watchers, EVLOOP_NONBLOCK or not having
616 any active watchers at all will result in not sleeping).
617 - Sleep if the I/O and timer collect interval say so.
493 - Block the process, waiting for any events. 618 - Block the process, waiting for any events.
494 - Queue all outstanding I/O (fd) events. 619 - Queue all outstanding I/O (fd) events.
495 - Update the "event loop time" and do time jump handling. 620 - Update the "event loop time" and do time jump handling.
496 - Queue all outstanding timers. 621 - Queue all outstanding timers.
497 - Queue all outstanding periodics. 622 - Queue all outstanding periodics.
498 - If no events are pending now, queue all idle watchers. 623 - If no events are pending now, queue all idle watchers.
499 - Queue all check watchers. 624 - Queue all check watchers.
500 - Call all queued watchers in reverse order (i.e. check watchers first). 625 - Call all queued watchers in reverse order (i.e. check watchers first).
501 Signals and child watchers are implemented as I/O watchers, and will 626 Signals and child watchers are implemented as I/O watchers, and will
502 be handled here by queueing them when their watcher gets executed. 627 be handled here by queueing them when their watcher gets executed.
503 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 628 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
504 were used, return, otherwise continue with step *. 629 were used, or there are no active watchers, return, otherwise
630 continue with step *.
505 631
506Example: Queue some jobs and then loop until no events are outsanding 632Example: Queue some jobs and then loop until no events are outstanding
507anymore. 633anymore.
508 634
509 ... queue jobs here, make sure they register event watchers as long 635 ... queue jobs here, make sure they register event watchers as long
510 ... as they still have work to do (even an idle watcher will do..) 636 ... as they still have work to do (even an idle watcher will do..)
511 ev_loop (my_loop, 0); 637 ev_loop (my_loop, 0);
515 641
516Can be used to make a call to C<ev_loop> return early (but only after it 642Can be used to make a call to C<ev_loop> return early (but only after it
517has processed all outstanding events). The C<how> argument must be either 643has processed all outstanding events). The C<how> argument must be either
518C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 644C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
519C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 645C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
646
647This "unloop state" will be cleared when entering C<ev_loop> again.
520 648
521=item ev_ref (loop) 649=item ev_ref (loop)
522 650
523=item ev_unref (loop) 651=item ev_unref (loop)
524 652
529returning, ev_unref() after starting, and ev_ref() before stopping it. For 657returning, ev_unref() after starting, and ev_ref() before stopping it. For
530example, libev itself uses this for its internal signal pipe: It is not 658example, libev itself uses this for its internal signal pipe: It is not
531visible to the libev user and should not keep C<ev_loop> from exiting if 659visible to the libev user and should not keep C<ev_loop> from exiting if
532no event watchers registered by it are active. It is also an excellent 660no event watchers registered by it are active. It is also an excellent
533way to do this for generic recurring timers or from within third-party 661way to do this for generic recurring timers or from within third-party
534libraries. Just remember to I<unref after start> and I<ref before stop>. 662libraries. Just remember to I<unref after start> and I<ref before stop>
663(but only if the watcher wasn't active before, or was active before,
664respectively).
535 665
536Example: Create a signal watcher, but keep it from keeping C<ev_loop> 666Example: Create a signal watcher, but keep it from keeping C<ev_loop>
537running when nothing else is active. 667running when nothing else is active.
538 668
539 struct ev_signal exitsig; 669 struct ev_signal exitsig;
540 ev_signal_init (&exitsig, sig_cb, SIGINT); 670 ev_signal_init (&exitsig, sig_cb, SIGINT);
541 ev_signal_start (loop, &exitsig); 671 ev_signal_start (loop, &exitsig);
542 evf_unref (loop); 672 evf_unref (loop);
543 673
544Example: For some weird reason, unregister the above signal handler again. 674Example: For some weird reason, unregister the above signal handler again.
545 675
546 ev_ref (loop); 676 ev_ref (loop);
547 ev_signal_stop (loop, &exitsig); 677 ev_signal_stop (loop, &exitsig);
678
679=item ev_set_io_collect_interval (loop, ev_tstamp interval)
680
681=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
682
683These advanced functions influence the time that libev will spend waiting
684for events. Both are by default C<0>, meaning that libev will try to
685invoke timer/periodic callbacks and I/O callbacks with minimum latency.
686
687Setting these to a higher value (the C<interval> I<must> be >= C<0>)
688allows libev to delay invocation of I/O and timer/periodic callbacks to
689increase efficiency of loop iterations.
690
691The background is that sometimes your program runs just fast enough to
692handle one (or very few) event(s) per loop iteration. While this makes
693the program responsive, it also wastes a lot of CPU time to poll for new
694events, especially with backends like C<select ()> which have a high
695overhead for the actual polling but can deliver many events at once.
696
697By setting a higher I<io collect interval> you allow libev to spend more
698time collecting I/O events, so you can handle more events per iteration,
699at the cost of increasing latency. Timeouts (both C<ev_periodic> and
700C<ev_timer>) will be not affected. Setting this to a non-null value will
701introduce an additional C<ev_sleep ()> call into most loop iterations.
702
703Likewise, by setting a higher I<timeout collect interval> you allow libev
704to spend more time collecting timeouts, at the expense of increased
705latency (the watcher callback will be called later). C<ev_io> watchers
706will not be affected. Setting this to a non-null value will not introduce
707any overhead in libev.
708
709Many (busy) programs can usually benefit by setting the I/O collect
710interval to a value near C<0.1> or so, which is often enough for
711interactive servers (of course not for games), likewise for timeouts. It
712usually doesn't make much sense to set it to a lower value than C<0.01>,
713as this approaches the timing granularity of most systems.
714
715=item ev_loop_verify (loop)
716
717This function only does something when C<EV_VERIFY> support has been
718compiled in. It tries to go through all internal structures and checks
719them for validity. If anything is found to be inconsistent, it will print
720an error message to standard error and call C<abort ()>.
721
722This can be used to catch bugs inside libev itself: under normal
723circumstances, this function will never abort as of course libev keeps its
724data structures consistent.
548 725
549=back 726=back
550 727
551 728
552=head1 ANATOMY OF A WATCHER 729=head1 ANATOMY OF A WATCHER
553 730
554A watcher is a structure that you create and register to record your 731A watcher is a structure that you create and register to record your
555interest in some event. For instance, if you want to wait for STDIN to 732interest in some event. For instance, if you want to wait for STDIN to
556become readable, you would create an C<ev_io> watcher for that: 733become readable, you would create an C<ev_io> watcher for that:
557 734
558 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents) 735 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
559 { 736 {
560 ev_io_stop (w); 737 ev_io_stop (w);
561 ev_unloop (loop, EVUNLOOP_ALL); 738 ev_unloop (loop, EVUNLOOP_ALL);
562 } 739 }
563 740
564 struct ev_loop *loop = ev_default_loop (0); 741 struct ev_loop *loop = ev_default_loop (0);
565 struct ev_io stdin_watcher; 742 struct ev_io stdin_watcher;
566 ev_init (&stdin_watcher, my_cb); 743 ev_init (&stdin_watcher, my_cb);
567 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 744 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
568 ev_io_start (loop, &stdin_watcher); 745 ev_io_start (loop, &stdin_watcher);
569 ev_loop (loop, 0); 746 ev_loop (loop, 0);
570 747
571As you can see, you are responsible for allocating the memory for your 748As you can see, you are responsible for allocating the memory for your
572watcher structures (and it is usually a bad idea to do this on the stack, 749watcher structures (and it is usually a bad idea to do this on the stack,
573although this can sometimes be quite valid). 750although this can sometimes be quite valid).
574 751
575Each watcher structure must be initialised by a call to C<ev_init 752Each watcher structure must be initialised by a call to C<ev_init
576(watcher *, callback)>, which expects a callback to be provided. This 753(watcher *, callback)>, which expects a callback to be provided. This
577callback gets invoked each time the event occurs (or, in the case of io 754callback gets invoked each time the event occurs (or, in the case of I/O
578watchers, each time the event loop detects that the file descriptor given 755watchers, each time the event loop detects that the file descriptor given
579is readable and/or writable). 756is readable and/or writable).
580 757
581Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro 758Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
582with arguments specific to this watcher type. There is also a macro 759with arguments specific to this watcher type. There is also a macro
652=item C<EV_FORK> 829=item C<EV_FORK>
653 830
654The event loop has been resumed in the child process after fork (see 831The event loop has been resumed in the child process after fork (see
655C<ev_fork>). 832C<ev_fork>).
656 833
834=item C<EV_ASYNC>
835
836The given async watcher has been asynchronously notified (see C<ev_async>).
837
657=item C<EV_ERROR> 838=item C<EV_ERROR>
658 839
659An unspecified error has occured, the watcher has been stopped. This might 840An unspecified error has occurred, the watcher has been stopped. This might
660happen because the watcher could not be properly started because libev 841happen because the watcher could not be properly started because libev
661ran out of memory, a file descriptor was found to be closed or any other 842ran out of memory, a file descriptor was found to be closed or any other
662problem. You best act on it by reporting the problem and somehow coping 843problem. You best act on it by reporting the problem and somehow coping
663with the watcher being stopped. 844with the watcher being stopped.
664 845
665Libev will usually signal a few "dummy" events together with an error, 846Libev will usually signal a few "dummy" events together with an error,
666for example it might indicate that a fd is readable or writable, and if 847for example it might indicate that a fd is readable or writable, and if
667your callbacks is well-written it can just attempt the operation and cope 848your callbacks is well-written it can just attempt the operation and cope
668with the error from read() or write(). This will not work in multithreaded 849with the error from read() or write(). This will not work in multi-threaded
669programs, though, so beware. 850programs, though, so beware.
670 851
671=back 852=back
672 853
673=head2 GENERIC WATCHER FUNCTIONS 854=head2 GENERIC WATCHER FUNCTIONS
703Although some watcher types do not have type-specific arguments 884Although some watcher types do not have type-specific arguments
704(e.g. C<ev_prepare>) you still need to call its C<set> macro. 885(e.g. C<ev_prepare>) you still need to call its C<set> macro.
705 886
706=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args]) 887=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
707 888
708This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro 889This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
709calls into a single call. This is the most convinient method to initialise 890calls into a single call. This is the most convenient method to initialise
710a watcher. The same limitations apply, of course. 891a watcher. The same limitations apply, of course.
711 892
712=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 893=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
713 894
714Starts (activates) the given watcher. Only active watchers will receive 895Starts (activates) the given watcher. Only active watchers will receive
732=item bool ev_is_pending (ev_TYPE *watcher) 913=item bool ev_is_pending (ev_TYPE *watcher)
733 914
734Returns a true value iff the watcher is pending, (i.e. it has outstanding 915Returns a true value iff the watcher is pending, (i.e. it has outstanding
735events but its callback has not yet been invoked). As long as a watcher 916events but its callback has not yet been invoked). As long as a watcher
736is pending (but not active) you must not call an init function on it (but 917is pending (but not active) you must not call an init function on it (but
737C<ev_TYPE_set> is safe) and you must make sure the watcher is available to 918C<ev_TYPE_set> is safe), you must not change its priority, and you must
738libev (e.g. you cnanot C<free ()> it). 919make sure the watcher is available to libev (e.g. you cannot C<free ()>
920it).
739 921
740=item callback ev_cb (ev_TYPE *watcher) 922=item callback ev_cb (ev_TYPE *watcher)
741 923
742Returns the callback currently set on the watcher. 924Returns the callback currently set on the watcher.
743 925
762watchers on the same event and make sure one is called first. 944watchers on the same event and make sure one is called first.
763 945
764If you need to suppress invocation when higher priority events are pending 946If you need to suppress invocation when higher priority events are pending
765you need to look at C<ev_idle> watchers, which provide this functionality. 947you need to look at C<ev_idle> watchers, which provide this functionality.
766 948
949You I<must not> change the priority of a watcher as long as it is active or
950pending.
951
767The default priority used by watchers when no priority has been set is 952The default priority used by watchers when no priority has been set is
768always C<0>, which is supposed to not be too high and not be too low :). 953always C<0>, which is supposed to not be too high and not be too low :).
769 954
770Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is 955Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
771fine, as long as you do not mind that the priority value you query might 956fine, as long as you do not mind that the priority value you query might
772or might not have been adjusted to be within valid range. 957or might not have been adjusted to be within valid range.
958
959=item ev_invoke (loop, ev_TYPE *watcher, int revents)
960
961Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
962C<loop> nor C<revents> need to be valid as long as the watcher callback
963can deal with that fact.
964
965=item int ev_clear_pending (loop, ev_TYPE *watcher)
966
967If the watcher is pending, this function returns clears its pending status
968and returns its C<revents> bitset (as if its callback was invoked). If the
969watcher isn't pending it does nothing and returns C<0>.
773 970
774=back 971=back
775 972
776 973
777=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 974=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
781to associate arbitrary data with your watcher. If you need more data and 978to associate arbitrary data with your watcher. If you need more data and
782don't want to allocate memory and store a pointer to it in that data 979don't want to allocate memory and store a pointer to it in that data
783member, you can also "subclass" the watcher type and provide your own 980member, you can also "subclass" the watcher type and provide your own
784data: 981data:
785 982
786 struct my_io 983 struct my_io
787 { 984 {
788 struct ev_io io; 985 struct ev_io io;
789 int otherfd; 986 int otherfd;
790 void *somedata; 987 void *somedata;
791 struct whatever *mostinteresting; 988 struct whatever *mostinteresting;
792 } 989 }
793 990
794And since your callback will be called with a pointer to the watcher, you 991And since your callback will be called with a pointer to the watcher, you
795can cast it back to your own type: 992can cast it back to your own type:
796 993
797 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents) 994 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
798 { 995 {
799 struct my_io *w = (struct my_io *)w_; 996 struct my_io *w = (struct my_io *)w_;
800 ... 997 ...
801 } 998 }
802 999
803More interesting and less C-conformant ways of casting your callback type 1000More interesting and less C-conformant ways of casting your callback type
804instead have been omitted. 1001instead have been omitted.
805 1002
806Another common scenario is having some data structure with multiple 1003Another common scenario is having some data structure with multiple
807watchers: 1004watchers:
808 1005
809 struct my_biggy 1006 struct my_biggy
810 { 1007 {
811 int some_data; 1008 int some_data;
812 ev_timer t1; 1009 ev_timer t1;
813 ev_timer t2; 1010 ev_timer t2;
814 } 1011 }
815 1012
816In this case getting the pointer to C<my_biggy> is a bit more complicated, 1013In this case getting the pointer to C<my_biggy> is a bit more complicated,
817you need to use C<offsetof>: 1014you need to use C<offsetof>:
818 1015
819 #include <stddef.h> 1016 #include <stddef.h>
820 1017
821 static void 1018 static void
822 t1_cb (EV_P_ struct ev_timer *w, int revents) 1019 t1_cb (EV_P_ struct ev_timer *w, int revents)
823 { 1020 {
824 struct my_biggy big = (struct my_biggy * 1021 struct my_biggy big = (struct my_biggy *
825 (((char *)w) - offsetof (struct my_biggy, t1)); 1022 (((char *)w) - offsetof (struct my_biggy, t1));
826 } 1023 }
827 1024
828 static void 1025 static void
829 t2_cb (EV_P_ struct ev_timer *w, int revents) 1026 t2_cb (EV_P_ struct ev_timer *w, int revents)
830 { 1027 {
831 struct my_biggy big = (struct my_biggy * 1028 struct my_biggy big = (struct my_biggy *
832 (((char *)w) - offsetof (struct my_biggy, t2)); 1029 (((char *)w) - offsetof (struct my_biggy, t2));
833 } 1030 }
834 1031
835 1032
836=head1 WATCHER TYPES 1033=head1 WATCHER TYPES
837 1034
838This section describes each watcher in detail, but will not repeat 1035This section describes each watcher in detail, but will not repeat
862In general you can register as many read and/or write event watchers per 1059In general you can register as many read and/or write event watchers per
863fd as you want (as long as you don't confuse yourself). Setting all file 1060fd as you want (as long as you don't confuse yourself). Setting all file
864descriptors to non-blocking mode is also usually a good idea (but not 1061descriptors to non-blocking mode is also usually a good idea (but not
865required if you know what you are doing). 1062required if you know what you are doing).
866 1063
867You have to be careful with dup'ed file descriptors, though. Some backends
868(the linux epoll backend is a notable example) cannot handle dup'ed file
869descriptors correctly if you register interest in two or more fds pointing
870to the same underlying file/socket/etc. description (that is, they share
871the same underlying "file open").
872
873If you must do this, then force the use of a known-to-be-good backend 1064If you must do this, then force the use of a known-to-be-good backend
874(at the time of this writing, this includes only C<EVBACKEND_SELECT> and 1065(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
875C<EVBACKEND_POLL>). 1066C<EVBACKEND_POLL>).
876 1067
877Another thing you have to watch out for is that it is quite easy to 1068Another thing you have to watch out for is that it is quite easy to
878receive "spurious" readyness notifications, that is your callback might 1069receive "spurious" readiness notifications, that is your callback might
879be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1070be called with C<EV_READ> but a subsequent C<read>(2) will actually block
880because there is no data. Not only are some backends known to create a 1071because there is no data. Not only are some backends known to create a
881lot of those (for example solaris ports), it is very easy to get into 1072lot of those (for example Solaris ports), it is very easy to get into
882this situation even with a relatively standard program structure. Thus 1073this situation even with a relatively standard program structure. Thus
883it is best to always use non-blocking I/O: An extra C<read>(2) returning 1074it is best to always use non-blocking I/O: An extra C<read>(2) returning
884C<EAGAIN> is far preferable to a program hanging until some data arrives. 1075C<EAGAIN> is far preferable to a program hanging until some data arrives.
885 1076
886If you cannot run the fd in non-blocking mode (for example you should not 1077If you cannot run the fd in non-blocking mode (for example you should not
887play around with an Xlib connection), then you have to seperately re-test 1078play around with an Xlib connection), then you have to separately re-test
888wether a file descriptor is really ready with a known-to-be good interface 1079whether a file descriptor is really ready with a known-to-be good interface
889such as poll (fortunately in our Xlib example, Xlib already does this on 1080such as poll (fortunately in our Xlib example, Xlib already does this on
890its own, so its quite safe to use). 1081its own, so its quite safe to use).
891 1082
1083=head3 The special problem of disappearing file descriptors
1084
1085Some backends (e.g. kqueue, epoll) need to be told about closing a file
1086descriptor (either by calling C<close> explicitly or by any other means,
1087such as C<dup>). The reason is that you register interest in some file
1088descriptor, but when it goes away, the operating system will silently drop
1089this interest. If another file descriptor with the same number then is
1090registered with libev, there is no efficient way to see that this is, in
1091fact, a different file descriptor.
1092
1093To avoid having to explicitly tell libev about such cases, libev follows
1094the following policy: Each time C<ev_io_set> is being called, libev
1095will assume that this is potentially a new file descriptor, otherwise
1096it is assumed that the file descriptor stays the same. That means that
1097you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
1098descriptor even if the file descriptor number itself did not change.
1099
1100This is how one would do it normally anyway, the important point is that
1101the libev application should not optimise around libev but should leave
1102optimisations to libev.
1103
1104=head3 The special problem of dup'ed file descriptors
1105
1106Some backends (e.g. epoll), cannot register events for file descriptors,
1107but only events for the underlying file descriptions. That means when you
1108have C<dup ()>'ed file descriptors or weirder constellations, and register
1109events for them, only one file descriptor might actually receive events.
1110
1111There is no workaround possible except not registering events
1112for potentially C<dup ()>'ed file descriptors, or to resort to
1113C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1114
1115=head3 The special problem of fork
1116
1117Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1118useless behaviour. Libev fully supports fork, but needs to be told about
1119it in the child.
1120
1121To support fork in your programs, you either have to call
1122C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1123enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1124C<EVBACKEND_POLL>.
1125
1126=head3 The special problem of SIGPIPE
1127
1128While not really specific to libev, it is easy to forget about SIGPIPE:
1129when reading from a pipe whose other end has been closed, your program
1130gets send a SIGPIPE, which, by default, aborts your program. For most
1131programs this is sensible behaviour, for daemons, this is usually
1132undesirable.
1133
1134So when you encounter spurious, unexplained daemon exits, make sure you
1135ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1136somewhere, as that would have given you a big clue).
1137
1138
1139=head3 Watcher-Specific Functions
1140
892=over 4 1141=over 4
893 1142
894=item ev_io_init (ev_io *, callback, int fd, int events) 1143=item ev_io_init (ev_io *, callback, int fd, int events)
895 1144
896=item ev_io_set (ev_io *, int fd, int events) 1145=item ev_io_set (ev_io *, int fd, int events)
897 1146
898Configures an C<ev_io> watcher. The C<fd> is the file descriptor to 1147Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
899rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or 1148receive events for and events is either C<EV_READ>, C<EV_WRITE> or
900C<EV_READ | EV_WRITE> to receive the given events. 1149C<EV_READ | EV_WRITE> to receive the given events.
901 1150
902=item int fd [read-only] 1151=item int fd [read-only]
903 1152
904The file descriptor being watched. 1153The file descriptor being watched.
906=item int events [read-only] 1155=item int events [read-only]
907 1156
908The events being watched. 1157The events being watched.
909 1158
910=back 1159=back
1160
1161=head3 Examples
911 1162
912Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1163Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
913readable, but only once. Since it is likely line-buffered, you could 1164readable, but only once. Since it is likely line-buffered, you could
914attempt to read a whole line in the callback. 1165attempt to read a whole line in the callback.
915 1166
916 static void 1167 static void
917 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1168 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
918 { 1169 {
919 ev_io_stop (loop, w); 1170 ev_io_stop (loop, w);
920 .. read from stdin here (or from w->fd) and haqndle any I/O errors 1171 .. read from stdin here (or from w->fd) and haqndle any I/O errors
921 } 1172 }
922 1173
923 ... 1174 ...
924 struct ev_loop *loop = ev_default_init (0); 1175 struct ev_loop *loop = ev_default_init (0);
925 struct ev_io stdin_readable; 1176 struct ev_io stdin_readable;
926 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1177 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
927 ev_io_start (loop, &stdin_readable); 1178 ev_io_start (loop, &stdin_readable);
928 ev_loop (loop, 0); 1179 ev_loop (loop, 0);
929 1180
930 1181
931=head2 C<ev_timer> - relative and optionally repeating timeouts 1182=head2 C<ev_timer> - relative and optionally repeating timeouts
932 1183
933Timer watchers are simple relative timers that generate an event after a 1184Timer watchers are simple relative timers that generate an event after a
934given time, and optionally repeating in regular intervals after that. 1185given time, and optionally repeating in regular intervals after that.
935 1186
936The timers are based on real time, that is, if you register an event that 1187The timers are based on real time, that is, if you register an event that
937times out after an hour and you reset your system clock to last years 1188times out after an hour and you reset your system clock to January last
938time, it will still time out after (roughly) and hour. "Roughly" because 1189year, it will still time out after (roughly) and hour. "Roughly" because
939detecting time jumps is hard, and some inaccuracies are unavoidable (the 1190detecting time jumps is hard, and some inaccuracies are unavoidable (the
940monotonic clock option helps a lot here). 1191monotonic clock option helps a lot here).
941 1192
942The relative timeouts are calculated relative to the C<ev_now ()> 1193The relative timeouts are calculated relative to the C<ev_now ()>
943time. This is usually the right thing as this timestamp refers to the time 1194time. This is usually the right thing as this timestamp refers to the time
945you suspect event processing to be delayed and you I<need> to base the timeout 1196you suspect event processing to be delayed and you I<need> to base the timeout
946on the current time, use something like this to adjust for this: 1197on the current time, use something like this to adjust for this:
947 1198
948 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1199 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
949 1200
950The callback is guarenteed to be invoked only when its timeout has passed, 1201The callback is guaranteed to be invoked only after its timeout has passed,
951but if multiple timers become ready during the same loop iteration then 1202but if multiple timers become ready during the same loop iteration then
952order of execution is undefined. 1203order of execution is undefined.
953 1204
1205=head3 Watcher-Specific Functions and Data Members
1206
954=over 4 1207=over 4
955 1208
956=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1209=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
957 1210
958=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) 1211=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
959 1212
960Configure the timer to trigger after C<after> seconds. If C<repeat> is 1213Configure the timer to trigger after C<after> seconds. If C<repeat>
961C<0.>, then it will automatically be stopped. If it is positive, then the 1214is C<0.>, then it will automatically be stopped once the timeout is
962timer will automatically be configured to trigger again C<repeat> seconds 1215reached. If it is positive, then the timer will automatically be
963later, again, and again, until stopped manually. 1216configured to trigger again C<repeat> seconds later, again, and again,
1217until stopped manually.
964 1218
965The timer itself will do a best-effort at avoiding drift, that is, if you 1219The timer itself will do a best-effort at avoiding drift, that is, if
966configure a timer to trigger every 10 seconds, then it will trigger at 1220you configure a timer to trigger every 10 seconds, then it will normally
967exactly 10 second intervals. If, however, your program cannot keep up with 1221trigger at exactly 10 second intervals. If, however, your program cannot
968the timer (because it takes longer than those 10 seconds to do stuff) the 1222keep up with the timer (because it takes longer than those 10 seconds to
969timer will not fire more than once per event loop iteration. 1223do stuff) the timer will not fire more than once per event loop iteration.
970 1224
971=item ev_timer_again (loop) 1225=item ev_timer_again (loop, ev_timer *)
972 1226
973This will act as if the timer timed out and restart it again if it is 1227This will act as if the timer timed out and restart it again if it is
974repeating. The exact semantics are: 1228repeating. The exact semantics are:
975 1229
976If the timer is pending, its pending status is cleared. 1230If the timer is pending, its pending status is cleared.
977 1231
978If the timer is started but nonrepeating, stop it (as if it timed out). 1232If the timer is started but non-repeating, stop it (as if it timed out).
979 1233
980If the timer is repeating, either start it if necessary (with the 1234If the timer is repeating, either start it if necessary (with the
981C<repeat> value), or reset the running timer to the C<repeat> value. 1235C<repeat> value), or reset the running timer to the C<repeat> value.
982 1236
983This sounds a bit complicated, but here is a useful and typical 1237This sounds a bit complicated, but here is a useful and typical
984example: Imagine you have a tcp connection and you want a so-called idle 1238example: Imagine you have a TCP connection and you want a so-called idle
985timeout, that is, you want to be called when there have been, say, 60 1239timeout, that is, you want to be called when there have been, say, 60
986seconds of inactivity on the socket. The easiest way to do this is to 1240seconds of inactivity on the socket. The easiest way to do this is to
987configure an C<ev_timer> with a C<repeat> value of C<60> and then call 1241configure an C<ev_timer> with a C<repeat> value of C<60> and then call
988C<ev_timer_again> each time you successfully read or write some data. If 1242C<ev_timer_again> each time you successfully read or write some data. If
989you go into an idle state where you do not expect data to travel on the 1243you go into an idle state where you do not expect data to travel on the
1011or C<ev_timer_again> is called and determines the next timeout (if any), 1265or C<ev_timer_again> is called and determines the next timeout (if any),
1012which is also when any modifications are taken into account. 1266which is also when any modifications are taken into account.
1013 1267
1014=back 1268=back
1015 1269
1270=head3 Examples
1271
1016Example: Create a timer that fires after 60 seconds. 1272Example: Create a timer that fires after 60 seconds.
1017 1273
1018 static void 1274 static void
1019 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1275 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1020 { 1276 {
1021 .. one minute over, w is actually stopped right here 1277 .. one minute over, w is actually stopped right here
1022 } 1278 }
1023 1279
1024 struct ev_timer mytimer; 1280 struct ev_timer mytimer;
1025 ev_timer_init (&mytimer, one_minute_cb, 60., 0.); 1281 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1026 ev_timer_start (loop, &mytimer); 1282 ev_timer_start (loop, &mytimer);
1027 1283
1028Example: Create a timeout timer that times out after 10 seconds of 1284Example: Create a timeout timer that times out after 10 seconds of
1029inactivity. 1285inactivity.
1030 1286
1031 static void 1287 static void
1032 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1288 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1033 { 1289 {
1034 .. ten seconds without any activity 1290 .. ten seconds without any activity
1035 } 1291 }
1036 1292
1037 struct ev_timer mytimer; 1293 struct ev_timer mytimer;
1038 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 1294 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1039 ev_timer_again (&mytimer); /* start timer */ 1295 ev_timer_again (&mytimer); /* start timer */
1040 ev_loop (loop, 0); 1296 ev_loop (loop, 0);
1041 1297
1042 // and in some piece of code that gets executed on any "activity": 1298 // and in some piece of code that gets executed on any "activity":
1043 // reset the timeout to start ticking again at 10 seconds 1299 // reset the timeout to start ticking again at 10 seconds
1044 ev_timer_again (&mytimer); 1300 ev_timer_again (&mytimer);
1045 1301
1046 1302
1047=head2 C<ev_periodic> - to cron or not to cron? 1303=head2 C<ev_periodic> - to cron or not to cron?
1048 1304
1049Periodic watchers are also timers of a kind, but they are very versatile 1305Periodic watchers are also timers of a kind, but they are very versatile
1050(and unfortunately a bit complex). 1306(and unfortunately a bit complex).
1051 1307
1052Unlike C<ev_timer>'s, they are not based on real time (or relative time) 1308Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1053but on wallclock time (absolute time). You can tell a periodic watcher 1309but on wall clock time (absolute time). You can tell a periodic watcher
1054to trigger "at" some specific point in time. For example, if you tell a 1310to trigger after some specific point in time. For example, if you tell a
1055periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () 1311periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now ()
1056+ 10.>) and then reset your system clock to the last year, then it will 1312+ 10.>, that is, an absolute time not a delay) and then reset your system
1313clock to January of the previous year, then it will take more than year
1057take a year to trigger the event (unlike an C<ev_timer>, which would trigger 1314to trigger the event (unlike an C<ev_timer>, which would still trigger
1058roughly 10 seconds later and of course not if you reset your system time 1315roughly 10 seconds later as it uses a relative timeout).
1059again).
1060 1316
1061They can also be used to implement vastly more complex timers, such as 1317C<ev_periodic>s can also be used to implement vastly more complex timers,
1062triggering an event on eahc midnight, local time. 1318such as triggering an event on each "midnight, local time", or other
1319complicated, rules.
1063 1320
1064As with timers, the callback is guarenteed to be invoked only when the 1321As with timers, the callback is guaranteed to be invoked only when the
1065time (C<at>) has been passed, but if multiple periodic timers become ready 1322time (C<at>) has passed, but if multiple periodic timers become ready
1066during the same loop iteration then order of execution is undefined. 1323during the same loop iteration then order of execution is undefined.
1324
1325=head3 Watcher-Specific Functions and Data Members
1067 1326
1068=over 4 1327=over 4
1069 1328
1070=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) 1329=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1071 1330
1074Lots of arguments, lets sort it out... There are basically three modes of 1333Lots of arguments, lets sort it out... There are basically three modes of
1075operation, and we will explain them from simplest to complex: 1334operation, and we will explain them from simplest to complex:
1076 1335
1077=over 4 1336=over 4
1078 1337
1079=item * absolute timer (interval = reschedule_cb = 0) 1338=item * absolute timer (at = time, interval = reschedule_cb = 0)
1080 1339
1081In this configuration the watcher triggers an event at the wallclock time 1340In this configuration the watcher triggers an event after the wall clock
1082C<at> and doesn't repeat. It will not adjust when a time jump occurs, 1341time C<at> has passed and doesn't repeat. It will not adjust when a time
1083that is, if it is to be run at January 1st 2011 then it will run when the 1342jump occurs, that is, if it is to be run at January 1st 2011 then it will
1084system time reaches or surpasses this time. 1343run when the system time reaches or surpasses this time.
1085 1344
1086=item * non-repeating interval timer (interval > 0, reschedule_cb = 0) 1345=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1087 1346
1088In this mode the watcher will always be scheduled to time out at the next 1347In this mode the watcher will always be scheduled to time out at the next
1089C<at + N * interval> time (for some integer N) and then repeat, regardless 1348C<at + N * interval> time (for some integer N, which can also be negative)
1090of any time jumps. 1349and then repeat, regardless of any time jumps.
1091 1350
1092This can be used to create timers that do not drift with respect to system 1351This can be used to create timers that do not drift with respect to system
1093time: 1352time, for example, here is a C<ev_periodic> that triggers each hour, on
1353the hour:
1094 1354
1095 ev_periodic_set (&periodic, 0., 3600., 0); 1355 ev_periodic_set (&periodic, 0., 3600., 0);
1096 1356
1097This doesn't mean there will always be 3600 seconds in between triggers, 1357This doesn't mean there will always be 3600 seconds in between triggers,
1098but only that the the callback will be called when the system time shows a 1358but only that the callback will be called when the system time shows a
1099full hour (UTC), or more correctly, when the system time is evenly divisible 1359full hour (UTC), or more correctly, when the system time is evenly divisible
1100by 3600. 1360by 3600.
1101 1361
1102Another way to think about it (for the mathematically inclined) is that 1362Another way to think about it (for the mathematically inclined) is that
1103C<ev_periodic> will try to run the callback in this mode at the next possible 1363C<ev_periodic> will try to run the callback in this mode at the next possible
1104time where C<time = at (mod interval)>, regardless of any time jumps. 1364time where C<time = at (mod interval)>, regardless of any time jumps.
1105 1365
1366For numerical stability it is preferable that the C<at> value is near
1367C<ev_now ()> (the current time), but there is no range requirement for
1368this value, and in fact is often specified as zero.
1369
1370Note also that there is an upper limit to how often a timer can fire (CPU
1371speed for example), so if C<interval> is very small then timing stability
1372will of course deteriorate. Libev itself tries to be exact to be about one
1373millisecond (if the OS supports it and the machine is fast enough).
1374
1106=item * manual reschedule mode (reschedule_cb = callback) 1375=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1107 1376
1108In this mode the values for C<interval> and C<at> are both being 1377In this mode the values for C<interval> and C<at> are both being
1109ignored. Instead, each time the periodic watcher gets scheduled, the 1378ignored. Instead, each time the periodic watcher gets scheduled, the
1110reschedule callback will be called with the watcher as first, and the 1379reschedule callback will be called with the watcher as first, and the
1111current time as second argument. 1380current time as second argument.
1112 1381
1113NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1382NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1114ever, or make any event loop modifications>. If you need to stop it, 1383ever, or make ANY event loop modifications whatsoever>.
1115return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1116starting a prepare watcher).
1117 1384
1385If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
1386it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
1387only event loop modification you are allowed to do).
1388
1118Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 1389The callback prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic
1119ev_tstamp now)>, e.g.: 1390*w, ev_tstamp now)>, e.g.:
1120 1391
1121 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1392 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1122 { 1393 {
1123 return now + 60.; 1394 return now + 60.;
1124 } 1395 }
1126It must return the next time to trigger, based on the passed time value 1397It must return the next time to trigger, based on the passed time value
1127(that is, the lowest time value larger than to the second argument). It 1398(that is, the lowest time value larger than to the second argument). It
1128will usually be called just before the callback will be triggered, but 1399will usually be called just before the callback will be triggered, but
1129might be called at other times, too. 1400might be called at other times, too.
1130 1401
1131NOTE: I<< This callback must always return a time that is later than the 1402NOTE: I<< This callback must always return a time that is higher than or
1132passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger. 1403equal to the passed C<now> value >>.
1133 1404
1134This can be used to create very complex timers, such as a timer that 1405This can be used to create very complex timers, such as a timer that
1135triggers on each midnight, local time. To do this, you would calculate the 1406triggers on "next midnight, local time". To do this, you would calculate the
1136next midnight after C<now> and return the timestamp value for this. How 1407next midnight after C<now> and return the timestamp value for this. How
1137you do this is, again, up to you (but it is not trivial, which is the main 1408you do this is, again, up to you (but it is not trivial, which is the main
1138reason I omitted it as an example). 1409reason I omitted it as an example).
1139 1410
1140=back 1411=back
1144Simply stops and restarts the periodic watcher again. This is only useful 1415Simply stops and restarts the periodic watcher again. This is only useful
1145when you changed some parameters or the reschedule callback would return 1416when you changed some parameters or the reschedule callback would return
1146a different time than the last time it was called (e.g. in a crond like 1417a different time than the last time it was called (e.g. in a crond like
1147program when the crontabs have changed). 1418program when the crontabs have changed).
1148 1419
1420=item ev_tstamp ev_periodic_at (ev_periodic *)
1421
1422When active, returns the absolute time that the watcher is supposed to
1423trigger next.
1424
1425=item ev_tstamp offset [read-write]
1426
1427When repeating, this contains the offset value, otherwise this is the
1428absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1429
1430Can be modified any time, but changes only take effect when the periodic
1431timer fires or C<ev_periodic_again> is being called.
1432
1149=item ev_tstamp interval [read-write] 1433=item ev_tstamp interval [read-write]
1150 1434
1151The current interval value. Can be modified any time, but changes only 1435The current interval value. Can be modified any time, but changes only
1152take effect when the periodic timer fires or C<ev_periodic_again> is being 1436take effect when the periodic timer fires or C<ev_periodic_again> is being
1153called. 1437called.
1158switched off. Can be changed any time, but changes only take effect when 1442switched off. Can be changed any time, but changes only take effect when
1159the periodic timer fires or C<ev_periodic_again> is being called. 1443the periodic timer fires or C<ev_periodic_again> is being called.
1160 1444
1161=back 1445=back
1162 1446
1447=head3 Examples
1448
1163Example: Call a callback every hour, or, more precisely, whenever the 1449Example: Call a callback every hour, or, more precisely, whenever the
1164system clock is divisible by 3600. The callback invocation times have 1450system clock is divisible by 3600. The callback invocation times have
1165potentially a lot of jittering, but good long-term stability. 1451potentially a lot of jitter, but good long-term stability.
1166 1452
1167 static void 1453 static void
1168 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1454 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1169 { 1455 {
1170 ... its now a full hour (UTC, or TAI or whatever your clock follows) 1456 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1171 } 1457 }
1172 1458
1173 struct ev_periodic hourly_tick; 1459 struct ev_periodic hourly_tick;
1174 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0); 1460 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1175 ev_periodic_start (loop, &hourly_tick); 1461 ev_periodic_start (loop, &hourly_tick);
1176 1462
1177Example: The same as above, but use a reschedule callback to do it: 1463Example: The same as above, but use a reschedule callback to do it:
1178 1464
1179 #include <math.h> 1465 #include <math.h>
1180 1466
1181 static ev_tstamp 1467 static ev_tstamp
1182 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now) 1468 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1183 { 1469 {
1184 return fmod (now, 3600.) + 3600.; 1470 return fmod (now, 3600.) + 3600.;
1185 } 1471 }
1186 1472
1187 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb); 1473 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1188 1474
1189Example: Call a callback every hour, starting now: 1475Example: Call a callback every hour, starting now:
1190 1476
1191 struct ev_periodic hourly_tick; 1477 struct ev_periodic hourly_tick;
1192 ev_periodic_init (&hourly_tick, clock_cb, 1478 ev_periodic_init (&hourly_tick, clock_cb,
1193 fmod (ev_now (loop), 3600.), 3600., 0); 1479 fmod (ev_now (loop), 3600.), 3600., 0);
1194 ev_periodic_start (loop, &hourly_tick); 1480 ev_periodic_start (loop, &hourly_tick);
1195 1481
1196 1482
1197=head2 C<ev_signal> - signal me when a signal gets signalled! 1483=head2 C<ev_signal> - signal me when a signal gets signalled!
1198 1484
1199Signal watchers will trigger an event when the process receives a specific 1485Signal watchers will trigger an event when the process receives a specific
1206with the kernel (thus it coexists with your own signal handlers as long 1492with the kernel (thus it coexists with your own signal handlers as long
1207as you don't register any with libev). Similarly, when the last signal 1493as you don't register any with libev). Similarly, when the last signal
1208watcher for a signal is stopped libev will reset the signal handler to 1494watcher for a signal is stopped libev will reset the signal handler to
1209SIG_DFL (regardless of what it was set to before). 1495SIG_DFL (regardless of what it was set to before).
1210 1496
1497If possible and supported, libev will install its handlers with
1498C<SA_RESTART> behaviour enabled, so system calls should not be unduly
1499interrupted. If you have a problem with system calls getting interrupted by
1500signals you can block all signals in an C<ev_check> watcher and unblock
1501them in an C<ev_prepare> watcher.
1502
1503=head3 Watcher-Specific Functions and Data Members
1504
1211=over 4 1505=over 4
1212 1506
1213=item ev_signal_init (ev_signal *, callback, int signum) 1507=item ev_signal_init (ev_signal *, callback, int signum)
1214 1508
1215=item ev_signal_set (ev_signal *, int signum) 1509=item ev_signal_set (ev_signal *, int signum)
1221 1515
1222The signal the watcher watches out for. 1516The signal the watcher watches out for.
1223 1517
1224=back 1518=back
1225 1519
1520=head3 Examples
1521
1522Example: Try to exit cleanly on SIGINT and SIGTERM.
1523
1524 static void
1525 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1526 {
1527 ev_unloop (loop, EVUNLOOP_ALL);
1528 }
1529
1530 struct ev_signal signal_watcher;
1531 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1532 ev_signal_start (loop, &sigint_cb);
1533
1226 1534
1227=head2 C<ev_child> - watch out for process status changes 1535=head2 C<ev_child> - watch out for process status changes
1228 1536
1229Child watchers trigger when your process receives a SIGCHLD in response to 1537Child watchers trigger when your process receives a SIGCHLD in response to
1230some child status changes (most typically when a child of yours dies). 1538some child status changes (most typically when a child of yours dies). It
1539is permissible to install a child watcher I<after> the child has been
1540forked (which implies it might have already exited), as long as the event
1541loop isn't entered (or is continued from a watcher).
1542
1543Only the default event loop is capable of handling signals, and therefore
1544you can only register child watchers in the default event loop.
1545
1546=head3 Process Interaction
1547
1548Libev grabs C<SIGCHLD> as soon as the default event loop is
1549initialised. This is necessary to guarantee proper behaviour even if
1550the first child watcher is started after the child exits. The occurrence
1551of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1552synchronously as part of the event loop processing. Libev always reaps all
1553children, even ones not watched.
1554
1555=head3 Overriding the Built-In Processing
1556
1557Libev offers no special support for overriding the built-in child
1558processing, but if your application collides with libev's default child
1559handler, you can override it easily by installing your own handler for
1560C<SIGCHLD> after initialising the default loop, and making sure the
1561default loop never gets destroyed. You are encouraged, however, to use an
1562event-based approach to child reaping and thus use libev's support for
1563that, so other libev users can use C<ev_child> watchers freely.
1564
1565=head3 Watcher-Specific Functions and Data Members
1231 1566
1232=over 4 1567=over 4
1233 1568
1234=item ev_child_init (ev_child *, callback, int pid) 1569=item ev_child_init (ev_child *, callback, int pid, int trace)
1235 1570
1236=item ev_child_set (ev_child *, int pid) 1571=item ev_child_set (ev_child *, int pid, int trace)
1237 1572
1238Configures the watcher to wait for status changes of process C<pid> (or 1573Configures the watcher to wait for status changes of process C<pid> (or
1239I<any> process if C<pid> is specified as C<0>). The callback can look 1574I<any> process if C<pid> is specified as C<0>). The callback can look
1240at the C<rstatus> member of the C<ev_child> watcher structure to see 1575at the C<rstatus> member of the C<ev_child> watcher structure to see
1241the status word (use the macros from C<sys/wait.h> and see your systems 1576the status word (use the macros from C<sys/wait.h> and see your systems
1242C<waitpid> documentation). The C<rpid> member contains the pid of the 1577C<waitpid> documentation). The C<rpid> member contains the pid of the
1243process causing the status change. 1578process causing the status change. C<trace> must be either C<0> (only
1579activate the watcher when the process terminates) or C<1> (additionally
1580activate the watcher when the process is stopped or continued).
1244 1581
1245=item int pid [read-only] 1582=item int pid [read-only]
1246 1583
1247The process id this watcher watches out for, or C<0>, meaning any process id. 1584The process id this watcher watches out for, or C<0>, meaning any process id.
1248 1585
1255The process exit/trace status caused by C<rpid> (see your systems 1592The process exit/trace status caused by C<rpid> (see your systems
1256C<waitpid> and C<sys/wait.h> documentation for details). 1593C<waitpid> and C<sys/wait.h> documentation for details).
1257 1594
1258=back 1595=back
1259 1596
1260Example: Try to exit cleanly on SIGINT and SIGTERM. 1597=head3 Examples
1261 1598
1599Example: C<fork()> a new process and install a child handler to wait for
1600its completion.
1601
1602 ev_child cw;
1603
1262 static void 1604 static void
1263 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1605 child_cb (EV_P_ struct ev_child *w, int revents)
1264 { 1606 {
1265 ev_unloop (loop, EVUNLOOP_ALL); 1607 ev_child_stop (EV_A_ w);
1608 printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1266 } 1609 }
1267 1610
1268 struct ev_signal signal_watcher; 1611 pid_t pid = fork ();
1269 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 1612
1270 ev_signal_start (loop, &sigint_cb); 1613 if (pid < 0)
1614 // error
1615 else if (pid == 0)
1616 {
1617 // the forked child executes here
1618 exit (1);
1619 }
1620 else
1621 {
1622 ev_child_init (&cw, child_cb, pid, 0);
1623 ev_child_start (EV_DEFAULT_ &cw);
1624 }
1271 1625
1272 1626
1273=head2 C<ev_stat> - did the file attributes just change? 1627=head2 C<ev_stat> - did the file attributes just change?
1274 1628
1275This watches a filesystem path for attribute changes. That is, it calls 1629This watches a file system path for attribute changes. That is, it calls
1276C<stat> regularly (or when the OS says it changed) and sees if it changed 1630C<stat> regularly (or when the OS says it changed) and sees if it changed
1277compared to the last time, invoking the callback if it did. 1631compared to the last time, invoking the callback if it did.
1278 1632
1279The path does not need to exist: changing from "path exists" to "path does 1633The path does not need to exist: changing from "path exists" to "path does
1280not exist" is a status change like any other. The condition "path does 1634not exist" is a status change like any other. The condition "path does
1298as even with OS-supported change notifications, this can be 1652as even with OS-supported change notifications, this can be
1299resource-intensive. 1653resource-intensive.
1300 1654
1301At the time of this writing, only the Linux inotify interface is 1655At the time of this writing, only the Linux inotify interface is
1302implemented (implementing kqueue support is left as an exercise for the 1656implemented (implementing kqueue support is left as an exercise for the
1657reader, note, however, that the author sees no way of implementing ev_stat
1303reader). Inotify will be used to give hints only and should not change the 1658semantics with kqueue). Inotify will be used to give hints only and should
1304semantics of C<ev_stat> watchers, which means that libev sometimes needs 1659not change the semantics of C<ev_stat> watchers, which means that libev
1305to fall back to regular polling again even with inotify, but changes are 1660sometimes needs to fall back to regular polling again even with inotify,
1306usually detected immediately, and if the file exists there will be no 1661but changes are usually detected immediately, and if the file exists there
1307polling. 1662will be no polling.
1663
1664=head3 ABI Issues (Largefile Support)
1665
1666Libev by default (unless the user overrides this) uses the default
1667compilation environment, which means that on systems with optionally
1668disabled large file support, you get the 32 bit version of the stat
1669structure. When using the library from programs that change the ABI to
1670use 64 bit file offsets the programs will fail. In that case you have to
1671compile libev with the same flags to get binary compatibility. This is
1672obviously the case with any flags that change the ABI, but the problem is
1673most noticeably with ev_stat and large file support.
1674
1675=head3 Inotify
1676
1677When C<inotify (7)> support has been compiled into libev (generally only
1678available on Linux) and present at runtime, it will be used to speed up
1679change detection where possible. The inotify descriptor will be created lazily
1680when the first C<ev_stat> watcher is being started.
1681
1682Inotify presence does not change the semantics of C<ev_stat> watchers
1683except that changes might be detected earlier, and in some cases, to avoid
1684making regular C<stat> calls. Even in the presence of inotify support
1685there are many cases where libev has to resort to regular C<stat> polling.
1686
1687(There is no support for kqueue, as apparently it cannot be used to
1688implement this functionality, due to the requirement of having a file
1689descriptor open on the object at all times).
1690
1691=head3 The special problem of stat time resolution
1692
1693The C<stat ()> system call only supports full-second resolution portably, and
1694even on systems where the resolution is higher, many file systems still
1695only support whole seconds.
1696
1697That means that, if the time is the only thing that changes, you can
1698easily miss updates: on the first update, C<ev_stat> detects a change and
1699calls your callback, which does something. When there is another update
1700within the same second, C<ev_stat> will be unable to detect it as the stat
1701data does not change.
1702
1703The solution to this is to delay acting on a change for slightly more
1704than a second (or till slightly after the next full second boundary), using
1705a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);
1706ev_timer_again (loop, w)>).
1707
1708The C<.02> offset is added to work around small timing inconsistencies
1709of some operating systems (where the second counter of the current time
1710might be be delayed. One such system is the Linux kernel, where a call to
1711C<gettimeofday> might return a timestamp with a full second later than
1712a subsequent C<time> call - if the equivalent of C<time ()> is used to
1713update file times then there will be a small window where the kernel uses
1714the previous second to update file times but libev might already execute
1715the timer callback).
1716
1717=head3 Watcher-Specific Functions and Data Members
1308 1718
1309=over 4 1719=over 4
1310 1720
1311=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) 1721=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1312 1722
1316C<path>. The C<interval> is a hint on how quickly a change is expected to 1726C<path>. The C<interval> is a hint on how quickly a change is expected to
1317be detected and should normally be specified as C<0> to let libev choose 1727be detected and should normally be specified as C<0> to let libev choose
1318a suitable value. The memory pointed to by C<path> must point to the same 1728a suitable value. The memory pointed to by C<path> must point to the same
1319path for as long as the watcher is active. 1729path for as long as the watcher is active.
1320 1730
1321The callback will be receive C<EV_STAT> when a change was detected, 1731The callback will receive C<EV_STAT> when a change was detected, relative
1322relative to the attributes at the time the watcher was started (or the 1732to the attributes at the time the watcher was started (or the last change
1323last change was detected). 1733was detected).
1324 1734
1325=item ev_stat_stat (ev_stat *) 1735=item ev_stat_stat (loop, ev_stat *)
1326 1736
1327Updates the stat buffer immediately with new values. If you change the 1737Updates the stat buffer immediately with new values. If you change the
1328watched path in your callback, you could call this fucntion to avoid 1738watched path in your callback, you could call this function to avoid
1329detecting this change (while introducing a race condition). Can also be 1739detecting this change (while introducing a race condition if you are not
1330useful simply to find out the new values. 1740the only one changing the path). Can also be useful simply to find out the
1741new values.
1331 1742
1332=item ev_statdata attr [read-only] 1743=item ev_statdata attr [read-only]
1333 1744
1334The most-recently detected attributes of the file. Although the type is of 1745The most-recently detected attributes of the file. Although the type is
1335C<ev_statdata>, this is usually the (or one of the) C<struct stat> types 1746C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1336suitable for your system. If the C<st_nlink> member is C<0>, then there 1747suitable for your system, but you can only rely on the POSIX-standardised
1748members to be present. If the C<st_nlink> member is C<0>, then there was
1337was some error while C<stat>ing the file. 1749some error while C<stat>ing the file.
1338 1750
1339=item ev_statdata prev [read-only] 1751=item ev_statdata prev [read-only]
1340 1752
1341The previous attributes of the file. The callback gets invoked whenever 1753The previous attributes of the file. The callback gets invoked whenever
1342C<prev> != C<attr>. 1754C<prev> != C<attr>, or, more precisely, one or more of these members
1755differ: C<st_dev>, C<st_ino>, C<st_mode>, C<st_nlink>, C<st_uid>,
1756C<st_gid>, C<st_rdev>, C<st_size>, C<st_atime>, C<st_mtime>, C<st_ctime>.
1343 1757
1344=item ev_tstamp interval [read-only] 1758=item ev_tstamp interval [read-only]
1345 1759
1346The specified interval. 1760The specified interval.
1347 1761
1348=item const char *path [read-only] 1762=item const char *path [read-only]
1349 1763
1350The filesystem path that is being watched. 1764The file system path that is being watched.
1351 1765
1352=back 1766=back
1353 1767
1768=head3 Examples
1769
1354Example: Watch C</etc/passwd> for attribute changes. 1770Example: Watch C</etc/passwd> for attribute changes.
1355 1771
1356 static void 1772 static void
1357 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) 1773 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1358 { 1774 {
1359 /* /etc/passwd changed in some way */ 1775 /* /etc/passwd changed in some way */
1360 if (w->attr.st_nlink) 1776 if (w->attr.st_nlink)
1361 { 1777 {
1362 printf ("passwd current size %ld\n", (long)w->attr.st_size); 1778 printf ("passwd current size %ld\n", (long)w->attr.st_size);
1363 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime); 1779 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1364 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime); 1780 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1365 } 1781 }
1366 else 1782 else
1367 /* you shalt not abuse printf for puts */ 1783 /* you shalt not abuse printf for puts */
1368 puts ("wow, /etc/passwd is not there, expect problems. " 1784 puts ("wow, /etc/passwd is not there, expect problems. "
1369 "if this is windows, they already arrived\n"); 1785 "if this is windows, they already arrived\n");
1370 } 1786 }
1371 1787
1372 ... 1788 ...
1373 ev_stat passwd; 1789 ev_stat passwd;
1374 1790
1375 ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); 1791 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1376 ev_stat_start (loop, &passwd); 1792 ev_stat_start (loop, &passwd);
1793
1794Example: Like above, but additionally use a one-second delay so we do not
1795miss updates (however, frequent updates will delay processing, too, so
1796one might do the work both on C<ev_stat> callback invocation I<and> on
1797C<ev_timer> callback invocation).
1798
1799 static ev_stat passwd;
1800 static ev_timer timer;
1801
1802 static void
1803 timer_cb (EV_P_ ev_timer *w, int revents)
1804 {
1805 ev_timer_stop (EV_A_ w);
1806
1807 /* now it's one second after the most recent passwd change */
1808 }
1809
1810 static void
1811 stat_cb (EV_P_ ev_stat *w, int revents)
1812 {
1813 /* reset the one-second timer */
1814 ev_timer_again (EV_A_ &timer);
1815 }
1816
1817 ...
1818 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1819 ev_stat_start (loop, &passwd);
1820 ev_timer_init (&timer, timer_cb, 0., 1.02);
1377 1821
1378 1822
1379=head2 C<ev_idle> - when you've got nothing better to do... 1823=head2 C<ev_idle> - when you've got nothing better to do...
1380 1824
1381Idle watchers trigger events when no other events of the same or higher 1825Idle watchers trigger events when no other events of the same or higher
1395Apart from keeping your process non-blocking (which is a useful 1839Apart from keeping your process non-blocking (which is a useful
1396effect on its own sometimes), idle watchers are a good place to do 1840effect on its own sometimes), idle watchers are a good place to do
1397"pseudo-background processing", or delay processing stuff to after the 1841"pseudo-background processing", or delay processing stuff to after the
1398event loop has handled all outstanding events. 1842event loop has handled all outstanding events.
1399 1843
1844=head3 Watcher-Specific Functions and Data Members
1845
1400=over 4 1846=over 4
1401 1847
1402=item ev_idle_init (ev_signal *, callback) 1848=item ev_idle_init (ev_signal *, callback)
1403 1849
1404Initialises and configures the idle watcher - it has no parameters of any 1850Initialises and configures the idle watcher - it has no parameters of any
1405kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, 1851kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1406believe me. 1852believe me.
1407 1853
1408=back 1854=back
1409 1855
1856=head3 Examples
1857
1410Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the 1858Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1411callback, free it. Also, use no error checking, as usual. 1859callback, free it. Also, use no error checking, as usual.
1412 1860
1413 static void 1861 static void
1414 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) 1862 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1415 { 1863 {
1416 free (w); 1864 free (w);
1417 // now do something you wanted to do when the program has 1865 // now do something you wanted to do when the program has
1418 // no longer asnything immediate to do. 1866 // no longer anything immediate to do.
1419 } 1867 }
1420 1868
1421 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); 1869 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1422 ev_idle_init (idle_watcher, idle_cb); 1870 ev_idle_init (idle_watcher, idle_cb);
1423 ev_idle_start (loop, idle_cb); 1871 ev_idle_start (loop, idle_cb);
1424 1872
1425 1873
1426=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 1874=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1427 1875
1428Prepare and check watchers are usually (but not always) used in tandem: 1876Prepare and check watchers are usually (but not always) used in tandem:
1447 1895
1448This is done by examining in each prepare call which file descriptors need 1896This is done by examining in each prepare call which file descriptors need
1449to be watched by the other library, registering C<ev_io> watchers for 1897to be watched by the other library, registering C<ev_io> watchers for
1450them and starting an C<ev_timer> watcher for any timeouts (many libraries 1898them and starting an C<ev_timer> watcher for any timeouts (many libraries
1451provide just this functionality). Then, in the check watcher you check for 1899provide just this functionality). Then, in the check watcher you check for
1452any events that occured (by checking the pending status of all watchers 1900any events that occurred (by checking the pending status of all watchers
1453and stopping them) and call back into the library. The I/O and timer 1901and stopping them) and call back into the library. The I/O and timer
1454callbacks will never actually be called (but must be valid nevertheless, 1902callbacks will never actually be called (but must be valid nevertheless,
1455because you never know, you know?). 1903because you never know, you know?).
1456 1904
1457As another example, the Perl Coro module uses these hooks to integrate 1905As another example, the Perl Coro module uses these hooks to integrate
1461with priority higher than or equal to the event loop and one coroutine 1909with priority higher than or equal to the event loop and one coroutine
1462of lower priority, but only once, using idle watchers to keep the event 1910of lower priority, but only once, using idle watchers to keep the event
1463loop from blocking if lower-priority coroutines are active, thus mapping 1911loop from blocking if lower-priority coroutines are active, thus mapping
1464low-priority coroutines to idle/background tasks). 1912low-priority coroutines to idle/background tasks).
1465 1913
1914It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1915priority, to ensure that they are being run before any other watchers
1916after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1917too) should not activate ("feed") events into libev. While libev fully
1918supports this, they might get executed before other C<ev_check> watchers
1919did their job. As C<ev_check> watchers are often used to embed other
1920(non-libev) event loops those other event loops might be in an unusable
1921state until their C<ev_check> watcher ran (always remind yourself to
1922coexist peacefully with others).
1923
1924=head3 Watcher-Specific Functions and Data Members
1925
1466=over 4 1926=over 4
1467 1927
1468=item ev_prepare_init (ev_prepare *, callback) 1928=item ev_prepare_init (ev_prepare *, callback)
1469 1929
1470=item ev_check_init (ev_check *, callback) 1930=item ev_check_init (ev_check *, callback)
1473parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 1933parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1474macros, but using them is utterly, utterly and completely pointless. 1934macros, but using them is utterly, utterly and completely pointless.
1475 1935
1476=back 1936=back
1477 1937
1478Example: To include a library such as adns, you would add IO watchers 1938=head3 Examples
1479and a timeout watcher in a prepare handler, as required by libadns, and 1939
1940There are a number of principal ways to embed other event loops or modules
1941into libev. Here are some ideas on how to include libadns into libev
1942(there is a Perl module named C<EV::ADNS> that does this, which you could
1943use as a working example. Another Perl module named C<EV::Glib> embeds a
1944Glib main context into libev, and finally, C<Glib::EV> embeds EV into the
1945Glib event loop).
1946
1947Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1480in a check watcher, destroy them and call into libadns. What follows is 1948and in a check watcher, destroy them and call into libadns. What follows
1481pseudo-code only of course: 1949is pseudo-code only of course. This requires you to either use a low
1950priority for the check watcher or use C<ev_clear_pending> explicitly, as
1951the callbacks for the IO/timeout watchers might not have been called yet.
1482 1952
1483 static ev_io iow [nfd]; 1953 static ev_io iow [nfd];
1484 static ev_timer tw; 1954 static ev_timer tw;
1485 1955
1486 static void 1956 static void
1487 io_cb (ev_loop *loop, ev_io *w, int revents) 1957 io_cb (ev_loop *loop, ev_io *w, int revents)
1488 { 1958 {
1489 // set the relevant poll flags
1490 // could also call adns_processreadable etc. here
1491 struct pollfd *fd = (struct pollfd *)w->data;
1492 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1493 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1494 } 1959 }
1495 1960
1496 // create io watchers for each fd and a timer before blocking 1961 // create io watchers for each fd and a timer before blocking
1497 static void 1962 static void
1498 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 1963 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1499 { 1964 {
1500 int timeout = 3600000; 1965 int timeout = 3600000;
1501 struct pollfd fds [nfd]; 1966 struct pollfd fds [nfd];
1502 // actual code will need to loop here and realloc etc. 1967 // actual code will need to loop here and realloc etc.
1503 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 1968 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1504 1969
1505 /* the callback is illegal, but won't be called as we stop during check */ 1970 /* the callback is illegal, but won't be called as we stop during check */
1506 ev_timer_init (&tw, 0, timeout * 1e-3); 1971 ev_timer_init (&tw, 0, timeout * 1e-3);
1507 ev_timer_start (loop, &tw); 1972 ev_timer_start (loop, &tw);
1508 1973
1509 // create on ev_io per pollfd 1974 // create one ev_io per pollfd
1510 for (int i = 0; i < nfd; ++i) 1975 for (int i = 0; i < nfd; ++i)
1511 { 1976 {
1512 ev_io_init (iow + i, io_cb, fds [i].fd, 1977 ev_io_init (iow + i, io_cb, fds [i].fd,
1513 ((fds [i].events & POLLIN ? EV_READ : 0) 1978 ((fds [i].events & POLLIN ? EV_READ : 0)
1514 | (fds [i].events & POLLOUT ? EV_WRITE : 0))); 1979 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1515 1980
1516 fds [i].revents = 0; 1981 fds [i].revents = 0;
1517 iow [i].data = fds + i;
1518 ev_io_start (loop, iow + i); 1982 ev_io_start (loop, iow + i);
1519 } 1983 }
1520 } 1984 }
1521 1985
1522 // stop all watchers after blocking 1986 // stop all watchers after blocking
1523 static void 1987 static void
1524 adns_check_cb (ev_loop *loop, ev_check *w, int revents) 1988 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1525 { 1989 {
1526 ev_timer_stop (loop, &tw); 1990 ev_timer_stop (loop, &tw);
1527 1991
1528 for (int i = 0; i < nfd; ++i) 1992 for (int i = 0; i < nfd; ++i)
1993 {
1994 // set the relevant poll flags
1995 // could also call adns_processreadable etc. here
1996 struct pollfd *fd = fds + i;
1997 int revents = ev_clear_pending (iow + i);
1998 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1999 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
2000
2001 // now stop the watcher
1529 ev_io_stop (loop, iow + i); 2002 ev_io_stop (loop, iow + i);
2003 }
1530 2004
1531 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); 2005 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1532 } 2006 }
2007
2008Method 2: This would be just like method 1, but you run C<adns_afterpoll>
2009in the prepare watcher and would dispose of the check watcher.
2010
2011Method 3: If the module to be embedded supports explicit event
2012notification (libadns does), you can also make use of the actual watcher
2013callbacks, and only destroy/create the watchers in the prepare watcher.
2014
2015 static void
2016 timer_cb (EV_P_ ev_timer *w, int revents)
2017 {
2018 adns_state ads = (adns_state)w->data;
2019 update_now (EV_A);
2020
2021 adns_processtimeouts (ads, &tv_now);
2022 }
2023
2024 static void
2025 io_cb (EV_P_ ev_io *w, int revents)
2026 {
2027 adns_state ads = (adns_state)w->data;
2028 update_now (EV_A);
2029
2030 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
2031 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
2032 }
2033
2034 // do not ever call adns_afterpoll
2035
2036Method 4: Do not use a prepare or check watcher because the module you
2037want to embed is too inflexible to support it. Instead, you can override
2038their poll function. The drawback with this solution is that the main
2039loop is now no longer controllable by EV. The C<Glib::EV> module does
2040this.
2041
2042 static gint
2043 event_poll_func (GPollFD *fds, guint nfds, gint timeout)
2044 {
2045 int got_events = 0;
2046
2047 for (n = 0; n < nfds; ++n)
2048 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
2049
2050 if (timeout >= 0)
2051 // create/start timer
2052
2053 // poll
2054 ev_loop (EV_A_ 0);
2055
2056 // stop timer again
2057 if (timeout >= 0)
2058 ev_timer_stop (EV_A_ &to);
2059
2060 // stop io watchers again - their callbacks should have set
2061 for (n = 0; n < nfds; ++n)
2062 ev_io_stop (EV_A_ iow [n]);
2063
2064 return got_events;
2065 }
1533 2066
1534 2067
1535=head2 C<ev_embed> - when one backend isn't enough... 2068=head2 C<ev_embed> - when one backend isn't enough...
1536 2069
1537This is a rather advanced watcher type that lets you embed one event loop 2070This is a rather advanced watcher type that lets you embed one event loop
1579portable one. 2112portable one.
1580 2113
1581So when you want to use this feature you will always have to be prepared 2114So when you want to use this feature you will always have to be prepared
1582that you cannot get an embeddable loop. The recommended way to get around 2115that you cannot get an embeddable loop. The recommended way to get around
1583this is to have a separate variables for your embeddable loop, try to 2116this is to have a separate variables for your embeddable loop, try to
1584create it, and if that fails, use the normal loop for everything: 2117create it, and if that fails, use the normal loop for everything.
1585 2118
1586 struct ev_loop *loop_hi = ev_default_init (0); 2119=head3 Watcher-Specific Functions and Data Members
1587 struct ev_loop *loop_lo = 0;
1588 struct ev_embed embed;
1589
1590 // see if there is a chance of getting one that works
1591 // (remember that a flags value of 0 means autodetection)
1592 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1593 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1594 : 0;
1595
1596 // if we got one, then embed it, otherwise default to loop_hi
1597 if (loop_lo)
1598 {
1599 ev_embed_init (&embed, 0, loop_lo);
1600 ev_embed_start (loop_hi, &embed);
1601 }
1602 else
1603 loop_lo = loop_hi;
1604 2120
1605=over 4 2121=over 4
1606 2122
1607=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 2123=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1608 2124
1610 2126
1611Configures the watcher to embed the given loop, which must be 2127Configures the watcher to embed the given loop, which must be
1612embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 2128embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1613invoked automatically, otherwise it is the responsibility of the callback 2129invoked automatically, otherwise it is the responsibility of the callback
1614to invoke it (it will continue to be called until the sweep has been done, 2130to invoke it (it will continue to be called until the sweep has been done,
1615if you do not want thta, you need to temporarily stop the embed watcher). 2131if you do not want that, you need to temporarily stop the embed watcher).
1616 2132
1617=item ev_embed_sweep (loop, ev_embed *) 2133=item ev_embed_sweep (loop, ev_embed *)
1618 2134
1619Make a single, non-blocking sweep over the embedded loop. This works 2135Make a single, non-blocking sweep over the embedded loop. This works
1620similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2136similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1621apropriate way for embedded loops. 2137appropriate way for embedded loops.
1622 2138
1623=item struct ev_loop *loop [read-only] 2139=item struct ev_loop *other [read-only]
1624 2140
1625The embedded event loop. 2141The embedded event loop.
1626 2142
1627=back 2143=back
2144
2145=head3 Examples
2146
2147Example: Try to get an embeddable event loop and embed it into the default
2148event loop. If that is not possible, use the default loop. The default
2149loop is stored in C<loop_hi>, while the embeddable loop is stored in
2150C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
2151used).
2152
2153 struct ev_loop *loop_hi = ev_default_init (0);
2154 struct ev_loop *loop_lo = 0;
2155 struct ev_embed embed;
2156
2157 // see if there is a chance of getting one that works
2158 // (remember that a flags value of 0 means autodetection)
2159 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2160 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
2161 : 0;
2162
2163 // if we got one, then embed it, otherwise default to loop_hi
2164 if (loop_lo)
2165 {
2166 ev_embed_init (&embed, 0, loop_lo);
2167 ev_embed_start (loop_hi, &embed);
2168 }
2169 else
2170 loop_lo = loop_hi;
2171
2172Example: Check if kqueue is available but not recommended and create
2173a kqueue backend for use with sockets (which usually work with any
2174kqueue implementation). Store the kqueue/socket-only event loop in
2175C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2176
2177 struct ev_loop *loop = ev_default_init (0);
2178 struct ev_loop *loop_socket = 0;
2179 struct ev_embed embed;
2180
2181 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2182 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2183 {
2184 ev_embed_init (&embed, 0, loop_socket);
2185 ev_embed_start (loop, &embed);
2186 }
2187
2188 if (!loop_socket)
2189 loop_socket = loop;
2190
2191 // now use loop_socket for all sockets, and loop for everything else
1628 2192
1629 2193
1630=head2 C<ev_fork> - the audacity to resume the event loop after a fork 2194=head2 C<ev_fork> - the audacity to resume the event loop after a fork
1631 2195
1632Fork watchers are called when a C<fork ()> was detected (usually because 2196Fork watchers are called when a C<fork ()> was detected (usually because
1635event loop blocks next and before C<ev_check> watchers are being called, 2199event loop blocks next and before C<ev_check> watchers are being called,
1636and only in the child after the fork. If whoever good citizen calling 2200and only in the child after the fork. If whoever good citizen calling
1637C<ev_default_fork> cheats and calls it in the wrong process, the fork 2201C<ev_default_fork> cheats and calls it in the wrong process, the fork
1638handlers will be invoked, too, of course. 2202handlers will be invoked, too, of course.
1639 2203
2204=head3 Watcher-Specific Functions and Data Members
2205
1640=over 4 2206=over 4
1641 2207
1642=item ev_fork_init (ev_signal *, callback) 2208=item ev_fork_init (ev_signal *, callback)
1643 2209
1644Initialises and configures the fork watcher - it has no parameters of any 2210Initialises and configures the fork watcher - it has no parameters of any
1645kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 2211kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
1646believe me. 2212believe me.
2213
2214=back
2215
2216
2217=head2 C<ev_async> - how to wake up another event loop
2218
2219In general, you cannot use an C<ev_loop> from multiple threads or other
2220asynchronous sources such as signal handlers (as opposed to multiple event
2221loops - those are of course safe to use in different threads).
2222
2223Sometimes, however, you need to wake up another event loop you do not
2224control, for example because it belongs to another thread. This is what
2225C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you
2226can signal it by calling C<ev_async_send>, which is thread- and signal
2227safe.
2228
2229This functionality is very similar to C<ev_signal> watchers, as signals,
2230too, are asynchronous in nature, and signals, too, will be compressed
2231(i.e. the number of callback invocations may be less than the number of
2232C<ev_async_sent> calls).
2233
2234Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
2235just the default loop.
2236
2237=head3 Queueing
2238
2239C<ev_async> does not support queueing of data in any way. The reason
2240is that the author does not know of a simple (or any) algorithm for a
2241multiple-writer-single-reader queue that works in all cases and doesn't
2242need elaborate support such as pthreads.
2243
2244That means that if you want to queue data, you have to provide your own
2245queue. But at least I can tell you would implement locking around your
2246queue:
2247
2248=over 4
2249
2250=item queueing from a signal handler context
2251
2252To implement race-free queueing, you simply add to the queue in the signal
2253handler but you block the signal handler in the watcher callback. Here is an example that does that for
2254some fictitious SIGUSR1 handler:
2255
2256 static ev_async mysig;
2257
2258 static void
2259 sigusr1_handler (void)
2260 {
2261 sometype data;
2262
2263 // no locking etc.
2264 queue_put (data);
2265 ev_async_send (EV_DEFAULT_ &mysig);
2266 }
2267
2268 static void
2269 mysig_cb (EV_P_ ev_async *w, int revents)
2270 {
2271 sometype data;
2272 sigset_t block, prev;
2273
2274 sigemptyset (&block);
2275 sigaddset (&block, SIGUSR1);
2276 sigprocmask (SIG_BLOCK, &block, &prev);
2277
2278 while (queue_get (&data))
2279 process (data);
2280
2281 if (sigismember (&prev, SIGUSR1)
2282 sigprocmask (SIG_UNBLOCK, &block, 0);
2283 }
2284
2285(Note: pthreads in theory requires you to use C<pthread_setmask>
2286instead of C<sigprocmask> when you use threads, but libev doesn't do it
2287either...).
2288
2289=item queueing from a thread context
2290
2291The strategy for threads is different, as you cannot (easily) block
2292threads but you can easily preempt them, so to queue safely you need to
2293employ a traditional mutex lock, such as in this pthread example:
2294
2295 static ev_async mysig;
2296 static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER;
2297
2298 static void
2299 otherthread (void)
2300 {
2301 // only need to lock the actual queueing operation
2302 pthread_mutex_lock (&mymutex);
2303 queue_put (data);
2304 pthread_mutex_unlock (&mymutex);
2305
2306 ev_async_send (EV_DEFAULT_ &mysig);
2307 }
2308
2309 static void
2310 mysig_cb (EV_P_ ev_async *w, int revents)
2311 {
2312 pthread_mutex_lock (&mymutex);
2313
2314 while (queue_get (&data))
2315 process (data);
2316
2317 pthread_mutex_unlock (&mymutex);
2318 }
2319
2320=back
2321
2322
2323=head3 Watcher-Specific Functions and Data Members
2324
2325=over 4
2326
2327=item ev_async_init (ev_async *, callback)
2328
2329Initialises and configures the async watcher - it has no parameters of any
2330kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,
2331believe me.
2332
2333=item ev_async_send (loop, ev_async *)
2334
2335Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2336an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2337C<ev_feed_event>, this call is safe to do in other threads, signal or
2338similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2339section below on what exactly this means).
2340
2341This call incurs the overhead of a system call only once per loop iteration,
2342so while the overhead might be noticeable, it doesn't apply to repeated
2343calls to C<ev_async_send>.
2344
2345=item bool = ev_async_pending (ev_async *)
2346
2347Returns a non-zero value when C<ev_async_send> has been called on the
2348watcher but the event has not yet been processed (or even noted) by the
2349event loop.
2350
2351C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
2352the loop iterates next and checks for the watcher to have become active,
2353it will reset the flag again. C<ev_async_pending> can be used to very
2354quickly check whether invoking the loop might be a good idea.
2355
2356Not that this does I<not> check whether the watcher itself is pending, only
2357whether it has been requested to make this watcher pending.
1647 2358
1648=back 2359=back
1649 2360
1650 2361
1651=head1 OTHER FUNCTIONS 2362=head1 OTHER FUNCTIONS
1662or timeout without having to allocate/configure/start/stop/free one or 2373or timeout without having to allocate/configure/start/stop/free one or
1663more watchers yourself. 2374more watchers yourself.
1664 2375
1665If C<fd> is less than 0, then no I/O watcher will be started and events 2376If C<fd> is less than 0, then no I/O watcher will be started and events
1666is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and 2377is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
1667C<events> set will be craeted and started. 2378C<events> set will be created and started.
1668 2379
1669If C<timeout> is less than 0, then no timeout watcher will be 2380If C<timeout> is less than 0, then no timeout watcher will be
1670started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 2381started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
1671repeat = 0) will be started. While C<0> is a valid timeout, it is of 2382repeat = 0) will be started. While C<0> is a valid timeout, it is of
1672dubious value. 2383dubious value.
1674The callback has the type C<void (*cb)(int revents, void *arg)> and gets 2385The callback has the type C<void (*cb)(int revents, void *arg)> and gets
1675passed an C<revents> set like normal event callbacks (a combination of 2386passed an C<revents> set like normal event callbacks (a combination of
1676C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 2387C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
1677value passed to C<ev_once>: 2388value passed to C<ev_once>:
1678 2389
1679 static void stdin_ready (int revents, void *arg) 2390 static void stdin_ready (int revents, void *arg)
1680 { 2391 {
1681 if (revents & EV_TIMEOUT) 2392 if (revents & EV_TIMEOUT)
1682 /* doh, nothing entered */; 2393 /* doh, nothing entered */;
1683 else if (revents & EV_READ) 2394 else if (revents & EV_READ)
1684 /* stdin might have data for us, joy! */; 2395 /* stdin might have data for us, joy! */;
1685 } 2396 }
1686 2397
1687 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 2398 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
1688 2399
1689=item ev_feed_event (ev_loop *, watcher *, int revents) 2400=item ev_feed_event (ev_loop *, watcher *, int revents)
1690 2401
1691Feeds the given event set into the event loop, as if the specified event 2402Feeds the given event set into the event loop, as if the specified event
1692had happened for the specified watcher (which must be a pointer to an 2403had happened for the specified watcher (which must be a pointer to an
1697Feed an event on the given fd, as if a file descriptor backend detected 2408Feed an event on the given fd, as if a file descriptor backend detected
1698the given events it. 2409the given events it.
1699 2410
1700=item ev_feed_signal_event (ev_loop *loop, int signum) 2411=item ev_feed_signal_event (ev_loop *loop, int signum)
1701 2412
1702Feed an event as if the given signal occured (C<loop> must be the default 2413Feed an event as if the given signal occurred (C<loop> must be the default
1703loop!). 2414loop!).
1704 2415
1705=back 2416=back
1706 2417
1707 2418
1723 2434
1724=item * Priorities are not currently supported. Initialising priorities 2435=item * Priorities are not currently supported. Initialising priorities
1725will fail and all watchers will have the same priority, even though there 2436will fail and all watchers will have the same priority, even though there
1726is an ev_pri field. 2437is an ev_pri field.
1727 2438
2439=item * In libevent, the last base created gets the signals, in libev, the
2440first base created (== the default loop) gets the signals.
2441
1728=item * Other members are not supported. 2442=item * Other members are not supported.
1729 2443
1730=item * The libev emulation is I<not> ABI compatible to libevent, you need 2444=item * The libev emulation is I<not> ABI compatible to libevent, you need
1731to use the libev header file and library. 2445to use the libev header file and library.
1732 2446
1733=back 2447=back
1734 2448
1735=head1 C++ SUPPORT 2449=head1 C++ SUPPORT
1736 2450
1737Libev comes with some simplistic wrapper classes for C++ that mainly allow 2451Libev comes with some simplistic wrapper classes for C++ that mainly allow
1738you to use some convinience methods to start/stop watchers and also change 2452you to use some convenience methods to start/stop watchers and also change
1739the callback model to a model using method callbacks on objects. 2453the callback model to a model using method callbacks on objects.
1740 2454
1741To use it, 2455To use it,
1742 2456
1743 #include <ev++.h> 2457 #include <ev++.h>
1744 2458
1745(it is not installed by default). This automatically includes F<ev.h> 2459This automatically includes F<ev.h> and puts all of its definitions (many
1746and puts all of its definitions (many of them macros) into the global 2460of them macros) into the global namespace. All C++ specific things are
1747namespace. All C++ specific things are put into the C<ev> namespace. 2461put into the C<ev> namespace. It should support all the same embedding
2462options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
1748 2463
1749It should support all the same embedding options as F<ev.h>, most notably 2464Care has been taken to keep the overhead low. The only data member the C++
1750C<EV_MULTIPLICITY>. 2465classes add (compared to plain C-style watchers) is the event loop pointer
2466that the watcher is associated with (or no additional members at all if
2467you disable C<EV_MULTIPLICITY> when embedding libev).
2468
2469Currently, functions, and static and non-static member functions can be
2470used as callbacks. Other types should be easy to add as long as they only
2471need one additional pointer for context. If you need support for other
2472types of functors please contact the author (preferably after implementing
2473it).
1751 2474
1752Here is a list of things available in the C<ev> namespace: 2475Here is a list of things available in the C<ev> namespace:
1753 2476
1754=over 4 2477=over 4
1755 2478
1771 2494
1772All of those classes have these methods: 2495All of those classes have these methods:
1773 2496
1774=over 4 2497=over 4
1775 2498
1776=item ev::TYPE::TYPE (object *, object::method *) 2499=item ev::TYPE::TYPE ()
1777 2500
1778=item ev::TYPE::TYPE (object *, object::method *, struct ev_loop *) 2501=item ev::TYPE::TYPE (struct ev_loop *)
1779 2502
1780=item ev::TYPE::~TYPE 2503=item ev::TYPE::~TYPE
1781 2504
1782The constructor takes a pointer to an object and a method pointer to 2505The constructor (optionally) takes an event loop to associate the watcher
1783the event handler callback to call in this class. The constructor calls 2506with. If it is omitted, it will use C<EV_DEFAULT>.
1784C<ev_init> for you, which means you have to call the C<set> method 2507
1785before starting it. If you do not specify a loop then the constructor 2508The constructor calls C<ev_init> for you, which means you have to call the
1786automatically associates the default loop with this watcher. 2509C<set> method before starting it.
2510
2511It will not set a callback, however: You have to call the templated C<set>
2512method to set a callback before you can start the watcher.
2513
2514(The reason why you have to use a method is a limitation in C++ which does
2515not allow explicit template arguments for constructors).
1787 2516
1788The destructor automatically stops the watcher if it is active. 2517The destructor automatically stops the watcher if it is active.
2518
2519=item w->set<class, &class::method> (object *)
2520
2521This method sets the callback method to call. The method has to have a
2522signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
2523first argument and the C<revents> as second. The object must be given as
2524parameter and is stored in the C<data> member of the watcher.
2525
2526This method synthesizes efficient thunking code to call your method from
2527the C callback that libev requires. If your compiler can inline your
2528callback (i.e. it is visible to it at the place of the C<set> call and
2529your compiler is good :), then the method will be fully inlined into the
2530thunking function, making it as fast as a direct C callback.
2531
2532Example: simple class declaration and watcher initialisation
2533
2534 struct myclass
2535 {
2536 void io_cb (ev::io &w, int revents) { }
2537 }
2538
2539 myclass obj;
2540 ev::io iow;
2541 iow.set <myclass, &myclass::io_cb> (&obj);
2542
2543=item w->set<function> (void *data = 0)
2544
2545Also sets a callback, but uses a static method or plain function as
2546callback. The optional C<data> argument will be stored in the watcher's
2547C<data> member and is free for you to use.
2548
2549The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2550
2551See the method-C<set> above for more details.
2552
2553Example:
2554
2555 static void io_cb (ev::io &w, int revents) { }
2556 iow.set <io_cb> ();
1789 2557
1790=item w->set (struct ev_loop *) 2558=item w->set (struct ev_loop *)
1791 2559
1792Associates a different C<struct ev_loop> with this watcher. You can only 2560Associates a different C<struct ev_loop> with this watcher. You can only
1793do this when the watcher is inactive (and not pending either). 2561do this when the watcher is inactive (and not pending either).
1794 2562
1795=item w->set ([args]) 2563=item w->set ([arguments])
1796 2564
1797Basically the same as C<ev_TYPE_set>, with the same args. Must be 2565Basically the same as C<ev_TYPE_set>, with the same arguments. Must be
1798called at least once. Unlike the C counterpart, an active watcher gets 2566called at least once. Unlike the C counterpart, an active watcher gets
1799automatically stopped and restarted. 2567automatically stopped and restarted when reconfiguring it with this
2568method.
1800 2569
1801=item w->start () 2570=item w->start ()
1802 2571
1803Starts the watcher. Note that there is no C<loop> argument as the 2572Starts the watcher. Note that there is no C<loop> argument, as the
1804constructor already takes the loop. 2573constructor already stores the event loop.
1805 2574
1806=item w->stop () 2575=item w->stop ()
1807 2576
1808Stops the watcher if it is active. Again, no C<loop> argument. 2577Stops the watcher if it is active. Again, no C<loop> argument.
1809 2578
1810=item w->again () C<ev::timer>, C<ev::periodic> only 2579=item w->again () (C<ev::timer>, C<ev::periodic> only)
1811 2580
1812For C<ev::timer> and C<ev::periodic>, this invokes the corresponding 2581For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1813C<ev_TYPE_again> function. 2582C<ev_TYPE_again> function.
1814 2583
1815=item w->sweep () C<ev::embed> only 2584=item w->sweep () (C<ev::embed> only)
1816 2585
1817Invokes C<ev_embed_sweep>. 2586Invokes C<ev_embed_sweep>.
1818 2587
1819=item w->update () C<ev::stat> only 2588=item w->update () (C<ev::stat> only)
1820 2589
1821Invokes C<ev_stat_stat>. 2590Invokes C<ev_stat_stat>.
1822 2591
1823=back 2592=back
1824 2593
1825=back 2594=back
1826 2595
1827Example: Define a class with an IO and idle watcher, start one of them in 2596Example: Define a class with an IO and idle watcher, start one of them in
1828the constructor. 2597the constructor.
1829 2598
1830 class myclass 2599 class myclass
1831 { 2600 {
1832 ev_io io; void io_cb (ev::io &w, int revents); 2601 ev::io io; void io_cb (ev::io &w, int revents);
1833 ev_idle idle void idle_cb (ev::idle &w, int revents); 2602 ev:idle idle void idle_cb (ev::idle &w, int revents);
1834 2603
1835 myclass (); 2604 myclass (int fd)
1836 } 2605 {
2606 io .set <myclass, &myclass::io_cb > (this);
2607 idle.set <myclass, &myclass::idle_cb> (this);
1837 2608
1838 myclass::myclass (int fd)
1839 : io (this, &myclass::io_cb),
1840 idle (this, &myclass::idle_cb)
1841 {
1842 io.start (fd, ev::READ); 2609 io.start (fd, ev::READ);
2610 }
1843 } 2611 };
2612
2613
2614=head1 OTHER LANGUAGE BINDINGS
2615
2616Libev does not offer other language bindings itself, but bindings for a
2617number of languages exist in the form of third-party packages. If you know
2618any interesting language binding in addition to the ones listed here, drop
2619me a note.
2620
2621=over 4
2622
2623=item Perl
2624
2625The EV module implements the full libev API and is actually used to test
2626libev. EV is developed together with libev. Apart from the EV core module,
2627there are additional modules that implement libev-compatible interfaces
2628to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the
2629C<libglib> event core (C<Glib::EV> and C<EV::Glib>).
2630
2631It can be found and installed via CPAN, its homepage is at
2632L<http://software.schmorp.de/pkg/EV>.
2633
2634=item Python
2635
2636Python bindings can be found at L<http://code.google.com/p/pyev/>. It
2637seems to be quite complete and well-documented. Note, however, that the
2638patch they require for libev is outright dangerous as it breaks the ABI
2639for everybody else, and therefore, should never be applied in an installed
2640libev (if python requires an incompatible ABI then it needs to embed
2641libev).
2642
2643=item Ruby
2644
2645Tony Arcieri has written a ruby extension that offers access to a subset
2646of the libev API and adds file handle abstractions, asynchronous DNS and
2647more on top of it. It can be found via gem servers. Its homepage is at
2648L<http://rev.rubyforge.org/>.
2649
2650=item D
2651
2652Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2653be found at L<http://git.llucax.com.ar/?p=software/ev.d.git;a=summary>.
2654
2655=back
1844 2656
1845 2657
1846=head1 MACRO MAGIC 2658=head1 MACRO MAGIC
1847 2659
1848Libev can be compiled with a variety of options, the most fundemantal is 2660Libev can be compiled with a variety of options, the most fundamental
1849C<EV_MULTIPLICITY>. This option determines wether (most) functions and 2661of which is C<EV_MULTIPLICITY>. This option determines whether (most)
1850callbacks have an initial C<struct ev_loop *> argument. 2662functions and callbacks have an initial C<struct ev_loop *> argument.
1851 2663
1852To make it easier to write programs that cope with either variant, the 2664To make it easier to write programs that cope with either variant, the
1853following macros are defined: 2665following macros are defined:
1854 2666
1855=over 4 2667=over 4
1858 2670
1859This provides the loop I<argument> for functions, if one is required ("ev 2671This provides the loop I<argument> for functions, if one is required ("ev
1860loop argument"). The C<EV_A> form is used when this is the sole argument, 2672loop argument"). The C<EV_A> form is used when this is the sole argument,
1861C<EV_A_> is used when other arguments are following. Example: 2673C<EV_A_> is used when other arguments are following. Example:
1862 2674
1863 ev_unref (EV_A); 2675 ev_unref (EV_A);
1864 ev_timer_add (EV_A_ watcher); 2676 ev_timer_add (EV_A_ watcher);
1865 ev_loop (EV_A_ 0); 2677 ev_loop (EV_A_ 0);
1866 2678
1867It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 2679It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
1868which is often provided by the following macro. 2680which is often provided by the following macro.
1869 2681
1870=item C<EV_P>, C<EV_P_> 2682=item C<EV_P>, C<EV_P_>
1871 2683
1872This provides the loop I<parameter> for functions, if one is required ("ev 2684This provides the loop I<parameter> for functions, if one is required ("ev
1873loop parameter"). The C<EV_P> form is used when this is the sole parameter, 2685loop parameter"). The C<EV_P> form is used when this is the sole parameter,
1874C<EV_P_> is used when other parameters are following. Example: 2686C<EV_P_> is used when other parameters are following. Example:
1875 2687
1876 // this is how ev_unref is being declared 2688 // this is how ev_unref is being declared
1877 static void ev_unref (EV_P); 2689 static void ev_unref (EV_P);
1878 2690
1879 // this is how you can declare your typical callback 2691 // this is how you can declare your typical callback
1880 static void cb (EV_P_ ev_timer *w, int revents) 2692 static void cb (EV_P_ ev_timer *w, int revents)
1881 2693
1882It declares a parameter C<loop> of type C<struct ev_loop *>, quite 2694It declares a parameter C<loop> of type C<struct ev_loop *>, quite
1883suitable for use with C<EV_A>. 2695suitable for use with C<EV_A>.
1884 2696
1885=item C<EV_DEFAULT>, C<EV_DEFAULT_> 2697=item C<EV_DEFAULT>, C<EV_DEFAULT_>
1886 2698
1887Similar to the other two macros, this gives you the value of the default 2699Similar to the other two macros, this gives you the value of the default
1888loop, if multiple loops are supported ("ev loop default"). 2700loop, if multiple loops are supported ("ev loop default").
1889 2701
2702=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
2703
2704Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
2705default loop has been initialised (C<UC> == unchecked). Their behaviour
2706is undefined when the default loop has not been initialised by a previous
2707execution of C<EV_DEFAULT>, C<EV_DEFAULT_> or C<ev_default_init (...)>.
2708
2709It is often prudent to use C<EV_DEFAULT> when initialising the first
2710watcher in a function but use C<EV_DEFAULT_UC> afterwards.
2711
1890=back 2712=back
1891 2713
1892Example: Declare and initialise a check watcher, utilising the above 2714Example: Declare and initialise a check watcher, utilising the above
1893macros so it will work regardless of wether multiple loops are supported 2715macros so it will work regardless of whether multiple loops are supported
1894or not. 2716or not.
1895 2717
1896 static void 2718 static void
1897 check_cb (EV_P_ ev_timer *w, int revents) 2719 check_cb (EV_P_ ev_timer *w, int revents)
1898 { 2720 {
1899 ev_check_stop (EV_A_ w); 2721 ev_check_stop (EV_A_ w);
1900 } 2722 }
1901 2723
1902 ev_check check; 2724 ev_check check;
1903 ev_check_init (&check, check_cb); 2725 ev_check_init (&check, check_cb);
1904 ev_check_start (EV_DEFAULT_ &check); 2726 ev_check_start (EV_DEFAULT_ &check);
1905 ev_loop (EV_DEFAULT_ 0); 2727 ev_loop (EV_DEFAULT_ 0);
1906 2728
1907=head1 EMBEDDING 2729=head1 EMBEDDING
1908 2730
1909Libev can (and often is) directly embedded into host 2731Libev can (and often is) directly embedded into host
1910applications. Examples of applications that embed it include the Deliantra 2732applications. Examples of applications that embed it include the Deliantra
1911Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2733Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
1912and rxvt-unicode. 2734and rxvt-unicode.
1913 2735
1914The goal is to enable you to just copy the neecssary files into your 2736The goal is to enable you to just copy the necessary files into your
1915source directory without having to change even a single line in them, so 2737source directory without having to change even a single line in them, so
1916you can easily upgrade by simply copying (or having a checked-out copy of 2738you can easily upgrade by simply copying (or having a checked-out copy of
1917libev somewhere in your source tree). 2739libev somewhere in your source tree).
1918 2740
1919=head2 FILESETS 2741=head2 FILESETS
1920 2742
1921Depending on what features you need you need to include one or more sets of files 2743Depending on what features you need you need to include one or more sets of files
1922in your app. 2744in your application.
1923 2745
1924=head3 CORE EVENT LOOP 2746=head3 CORE EVENT LOOP
1925 2747
1926To include only the libev core (all the C<ev_*> functions), with manual 2748To include only the libev core (all the C<ev_*> functions), with manual
1927configuration (no autoconf): 2749configuration (no autoconf):
1928 2750
1929 #define EV_STANDALONE 1 2751 #define EV_STANDALONE 1
1930 #include "ev.c" 2752 #include "ev.c"
1931 2753
1932This will automatically include F<ev.h>, too, and should be done in a 2754This will automatically include F<ev.h>, too, and should be done in a
1933single C source file only to provide the function implementations. To use 2755single C source file only to provide the function implementations. To use
1934it, do the same for F<ev.h> in all files wishing to use this API (best 2756it, do the same for F<ev.h> in all files wishing to use this API (best
1935done by writing a wrapper around F<ev.h> that you can include instead and 2757done by writing a wrapper around F<ev.h> that you can include instead and
1936where you can put other configuration options): 2758where you can put other configuration options):
1937 2759
1938 #define EV_STANDALONE 1 2760 #define EV_STANDALONE 1
1939 #include "ev.h" 2761 #include "ev.h"
1940 2762
1941Both header files and implementation files can be compiled with a C++ 2763Both header files and implementation files can be compiled with a C++
1942compiler (at least, thats a stated goal, and breakage will be treated 2764compiler (at least, thats a stated goal, and breakage will be treated
1943as a bug). 2765as a bug).
1944 2766
1945You need the following files in your source tree, or in a directory 2767You need the following files in your source tree, or in a directory
1946in your include path (e.g. in libev/ when using -Ilibev): 2768in your include path (e.g. in libev/ when using -Ilibev):
1947 2769
1948 ev.h 2770 ev.h
1949 ev.c 2771 ev.c
1950 ev_vars.h 2772 ev_vars.h
1951 ev_wrap.h 2773 ev_wrap.h
1952 2774
1953 ev_win32.c required on win32 platforms only 2775 ev_win32.c required on win32 platforms only
1954 2776
1955 ev_select.c only when select backend is enabled (which is enabled by default) 2777 ev_select.c only when select backend is enabled (which is enabled by default)
1956 ev_poll.c only when poll backend is enabled (disabled by default) 2778 ev_poll.c only when poll backend is enabled (disabled by default)
1957 ev_epoll.c only when the epoll backend is enabled (disabled by default) 2779 ev_epoll.c only when the epoll backend is enabled (disabled by default)
1958 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 2780 ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
1959 ev_port.c only when the solaris port backend is enabled (disabled by default) 2781 ev_port.c only when the solaris port backend is enabled (disabled by default)
1960 2782
1961F<ev.c> includes the backend files directly when enabled, so you only need 2783F<ev.c> includes the backend files directly when enabled, so you only need
1962to compile this single file. 2784to compile this single file.
1963 2785
1964=head3 LIBEVENT COMPATIBILITY API 2786=head3 LIBEVENT COMPATIBILITY API
1965 2787
1966To include the libevent compatibility API, also include: 2788To include the libevent compatibility API, also include:
1967 2789
1968 #include "event.c" 2790 #include "event.c"
1969 2791
1970in the file including F<ev.c>, and: 2792in the file including F<ev.c>, and:
1971 2793
1972 #include "event.h" 2794 #include "event.h"
1973 2795
1974in the files that want to use the libevent API. This also includes F<ev.h>. 2796in the files that want to use the libevent API. This also includes F<ev.h>.
1975 2797
1976You need the following additional files for this: 2798You need the following additional files for this:
1977 2799
1978 event.h 2800 event.h
1979 event.c 2801 event.c
1980 2802
1981=head3 AUTOCONF SUPPORT 2803=head3 AUTOCONF SUPPORT
1982 2804
1983Instead of using C<EV_STANDALONE=1> and providing your config in 2805Instead of using C<EV_STANDALONE=1> and providing your configuration in
1984whatever way you want, you can also C<m4_include([libev.m4])> in your 2806whatever way you want, you can also C<m4_include([libev.m4])> in your
1985F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then 2807F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
1986include F<config.h> and configure itself accordingly. 2808include F<config.h> and configure itself accordingly.
1987 2809
1988For this of course you need the m4 file: 2810For this of course you need the m4 file:
1989 2811
1990 libev.m4 2812 libev.m4
1991 2813
1992=head2 PREPROCESSOR SYMBOLS/MACROS 2814=head2 PREPROCESSOR SYMBOLS/MACROS
1993 2815
1994Libev can be configured via a variety of preprocessor symbols you have to define 2816Libev can be configured via a variety of preprocessor symbols you have to
1995before including any of its files. The default is not to build for multiplicity 2817define before including any of its files. The default in the absence of
1996and only include the select backend. 2818autoconf is noted for every option.
1997 2819
1998=over 4 2820=over 4
1999 2821
2000=item EV_STANDALONE 2822=item EV_STANDALONE
2001 2823
2006F<event.h> that are not directly supported by the libev core alone. 2828F<event.h> that are not directly supported by the libev core alone.
2007 2829
2008=item EV_USE_MONOTONIC 2830=item EV_USE_MONOTONIC
2009 2831
2010If defined to be C<1>, libev will try to detect the availability of the 2832If defined to be C<1>, libev will try to detect the availability of the
2011monotonic clock option at both compiletime and runtime. Otherwise no use 2833monotonic clock option at both compile time and runtime. Otherwise no use
2012of the monotonic clock option will be attempted. If you enable this, you 2834of the monotonic clock option will be attempted. If you enable this, you
2013usually have to link against librt or something similar. Enabling it when 2835usually have to link against librt or something similar. Enabling it when
2014the functionality isn't available is safe, though, althoguh you have 2836the functionality isn't available is safe, though, although you have
2015to make sure you link against any libraries where the C<clock_gettime> 2837to make sure you link against any libraries where the C<clock_gettime>
2016function is hiding in (often F<-lrt>). 2838function is hiding in (often F<-lrt>).
2017 2839
2018=item EV_USE_REALTIME 2840=item EV_USE_REALTIME
2019 2841
2020If defined to be C<1>, libev will try to detect the availability of the 2842If defined to be C<1>, libev will try to detect the availability of the
2021realtime clock option at compiletime (and assume its availability at 2843real-time clock option at compile time (and assume its availability at
2022runtime if successful). Otherwise no use of the realtime clock option will 2844runtime if successful). Otherwise no use of the real-time clock option will
2023be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2845be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2024(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2846(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2025in the description of C<EV_USE_MONOTONIC>, though. 2847note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2848
2849=item EV_USE_NANOSLEEP
2850
2851If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2852and will use it for delays. Otherwise it will use C<select ()>.
2853
2854=item EV_USE_EVENTFD
2855
2856If defined to be C<1>, then libev will assume that C<eventfd ()> is
2857available and will probe for kernel support at runtime. This will improve
2858C<ev_signal> and C<ev_async> performance and reduce resource consumption.
2859If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc
28602.7 or newer, otherwise disabled.
2026 2861
2027=item EV_USE_SELECT 2862=item EV_USE_SELECT
2028 2863
2029If undefined or defined to be C<1>, libev will compile in support for the 2864If undefined or defined to be C<1>, libev will compile in support for the
2030C<select>(2) backend. No attempt at autodetection will be done: if no 2865C<select>(2) backend. No attempt at auto-detection will be done: if no
2031other method takes over, select will be it. Otherwise the select backend 2866other method takes over, select will be it. Otherwise the select backend
2032will not be compiled in. 2867will not be compiled in.
2033 2868
2034=item EV_SELECT_USE_FD_SET 2869=item EV_SELECT_USE_FD_SET
2035 2870
2036If defined to C<1>, then the select backend will use the system C<fd_set> 2871If defined to C<1>, then the select backend will use the system C<fd_set>
2037structure. This is useful if libev doesn't compile due to a missing 2872structure. This is useful if libev doesn't compile due to a missing
2038C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on 2873C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on
2039exotic systems. This usually limits the range of file descriptors to some 2874exotic systems. This usually limits the range of file descriptors to some
2040low limit such as 1024 or might have other limitations (winsocket only 2875low limit such as 1024 or might have other limitations (winsocket only
2041allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might 2876allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2042influence the size of the C<fd_set> used. 2877influence the size of the C<fd_set> used.
2043 2878
2049be used is the winsock select). This means that it will call 2884be used is the winsock select). This means that it will call
2050C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 2885C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2051it is assumed that all these functions actually work on fds, even 2886it is assumed that all these functions actually work on fds, even
2052on win32. Should not be defined on non-win32 platforms. 2887on win32. Should not be defined on non-win32 platforms.
2053 2888
2889=item EV_FD_TO_WIN32_HANDLE
2890
2891If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
2892file descriptors to socket handles. When not defining this symbol (the
2893default), then libev will call C<_get_osfhandle>, which is usually
2894correct. In some cases, programs use their own file descriptor management,
2895in which case they can provide this function to map fds to socket handles.
2896
2054=item EV_USE_POLL 2897=item EV_USE_POLL
2055 2898
2056If defined to be C<1>, libev will compile in support for the C<poll>(2) 2899If defined to be C<1>, libev will compile in support for the C<poll>(2)
2057backend. Otherwise it will be enabled on non-win32 platforms. It 2900backend. Otherwise it will be enabled on non-win32 platforms. It
2058takes precedence over select. 2901takes precedence over select.
2059 2902
2060=item EV_USE_EPOLL 2903=item EV_USE_EPOLL
2061 2904
2062If defined to be C<1>, libev will compile in support for the Linux 2905If defined to be C<1>, libev will compile in support for the Linux
2063C<epoll>(7) backend. Its availability will be detected at runtime, 2906C<epoll>(7) backend. Its availability will be detected at runtime,
2064otherwise another method will be used as fallback. This is the 2907otherwise another method will be used as fallback. This is the preferred
2065preferred backend for GNU/Linux systems. 2908backend for GNU/Linux systems. If undefined, it will be enabled if the
2909headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
2066 2910
2067=item EV_USE_KQUEUE 2911=item EV_USE_KQUEUE
2068 2912
2069If defined to be C<1>, libev will compile in support for the BSD style 2913If defined to be C<1>, libev will compile in support for the BSD style
2070C<kqueue>(2) backend. Its actual availability will be detected at runtime, 2914C<kqueue>(2) backend. Its actual availability will be detected at runtime,
2083otherwise another method will be used as fallback. This is the preferred 2927otherwise another method will be used as fallback. This is the preferred
2084backend for Solaris 10 systems. 2928backend for Solaris 10 systems.
2085 2929
2086=item EV_USE_DEVPOLL 2930=item EV_USE_DEVPOLL
2087 2931
2088reserved for future expansion, works like the USE symbols above. 2932Reserved for future expansion, works like the USE symbols above.
2089 2933
2090=item EV_USE_INOTIFY 2934=item EV_USE_INOTIFY
2091 2935
2092If defined to be C<1>, libev will compile in support for the Linux inotify 2936If defined to be C<1>, libev will compile in support for the Linux inotify
2093interface to speed up C<ev_stat> watchers. Its actual availability will 2937interface to speed up C<ev_stat> watchers. Its actual availability will
2094be detected at runtime. 2938be detected at runtime. If undefined, it will be enabled if the headers
2939indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
2940
2941=item EV_ATOMIC_T
2942
2943Libev requires an integer type (suitable for storing C<0> or C<1>) whose
2944access is atomic with respect to other threads or signal contexts. No such
2945type is easily found in the C language, so you can provide your own type
2946that you know is safe for your purposes. It is used both for signal handler "locking"
2947as well as for signal and thread safety in C<ev_async> watchers.
2948
2949In the absence of this define, libev will use C<sig_atomic_t volatile>
2950(from F<signal.h>), which is usually good enough on most platforms.
2095 2951
2096=item EV_H 2952=item EV_H
2097 2953
2098The name of the F<ev.h> header file used to include it. The default if 2954The name of the F<ev.h> header file used to include it. The default if
2099undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This 2955undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
2100can be used to virtually rename the F<ev.h> header file in case of conflicts. 2956used to virtually rename the F<ev.h> header file in case of conflicts.
2101 2957
2102=item EV_CONFIG_H 2958=item EV_CONFIG_H
2103 2959
2104If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 2960If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2105F<ev.c>'s idea of where to find the F<config.h> file, similarly to 2961F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2106C<EV_H>, above. 2962C<EV_H>, above.
2107 2963
2108=item EV_EVENT_H 2964=item EV_EVENT_H
2109 2965
2110Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 2966Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2111of how the F<event.h> header can be found. 2967of how the F<event.h> header can be found, the default is C<"event.h">.
2112 2968
2113=item EV_PROTOTYPES 2969=item EV_PROTOTYPES
2114 2970
2115If defined to be C<0>, then F<ev.h> will not define any function 2971If defined to be C<0>, then F<ev.h> will not define any function
2116prototypes, but still define all the structs and other symbols. This is 2972prototypes, but still define all the structs and other symbols. This is
2123will have the C<struct ev_loop *> as first argument, and you can create 2979will have the C<struct ev_loop *> as first argument, and you can create
2124additional independent event loops. Otherwise there will be no support 2980additional independent event loops. Otherwise there will be no support
2125for multiple event loops and there is no first event loop pointer 2981for multiple event loops and there is no first event loop pointer
2126argument. Instead, all functions act on the single default loop. 2982argument. Instead, all functions act on the single default loop.
2127 2983
2984=item EV_MINPRI
2985
2986=item EV_MAXPRI
2987
2988The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2989C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2990provide for more priorities by overriding those symbols (usually defined
2991to be C<-2> and C<2>, respectively).
2992
2993When doing priority-based operations, libev usually has to linearly search
2994all the priorities, so having many of them (hundreds) uses a lot of space
2995and time, so using the defaults of five priorities (-2 .. +2) is usually
2996fine.
2997
2998If your embedding application does not need any priorities, defining these both to
2999C<0> will save some memory and CPU.
3000
2128=item EV_PERIODIC_ENABLE 3001=item EV_PERIODIC_ENABLE
2129 3002
2130If undefined or defined to be C<1>, then periodic timers are supported. If 3003If undefined or defined to be C<1>, then periodic timers are supported. If
2131defined to be C<0>, then they are not. Disabling them saves a few kB of 3004defined to be C<0>, then they are not. Disabling them saves a few kB of
2132code. 3005code.
2150=item EV_FORK_ENABLE 3023=item EV_FORK_ENABLE
2151 3024
2152If undefined or defined to be C<1>, then fork watchers are supported. If 3025If undefined or defined to be C<1>, then fork watchers are supported. If
2153defined to be C<0>, then they are not. 3026defined to be C<0>, then they are not.
2154 3027
3028=item EV_ASYNC_ENABLE
3029
3030If undefined or defined to be C<1>, then async watchers are supported. If
3031defined to be C<0>, then they are not.
3032
2155=item EV_MINIMAL 3033=item EV_MINIMAL
2156 3034
2157If you need to shave off some kilobytes of code at the expense of some 3035If you need to shave off some kilobytes of code at the expense of some
2158speed, define this symbol to C<1>. Currently only used for gcc to override 3036speed, define this symbol to C<1>. Currently this is used to override some
2159some inlining decisions, saves roughly 30% codesize of amd64. 3037inlining decisions, saves roughly 30% code size on amd64. It also selects a
3038much smaller 2-heap for timer management over the default 4-heap.
2160 3039
2161=item EV_PID_HASHSIZE 3040=item EV_PID_HASHSIZE
2162 3041
2163C<ev_child> watchers use a small hash table to distribute workload by 3042C<ev_child> watchers use a small hash table to distribute workload by
2164pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 3043pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2165than enough. If you need to manage thousands of children you might want to 3044than enough. If you need to manage thousands of children you might want to
2166increase this value (I<must> be a power of two). 3045increase this value (I<must> be a power of two).
2167 3046
2168=item EV_INOTIFY_HASHSIZE 3047=item EV_INOTIFY_HASHSIZE
2169 3048
2170C<ev_staz> watchers use a small hash table to distribute workload by 3049C<ev_stat> watchers use a small hash table to distribute workload by
2171inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 3050inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2172usually more than enough. If you need to manage thousands of C<ev_stat> 3051usually more than enough. If you need to manage thousands of C<ev_stat>
2173watchers you might want to increase this value (I<must> be a power of 3052watchers you might want to increase this value (I<must> be a power of
2174two). 3053two).
2175 3054
3055=item EV_USE_4HEAP
3056
3057Heaps are not very cache-efficient. To improve the cache-efficiency of the
3058timer and periodics heap, libev uses a 4-heap when this symbol is defined
3059to C<1>. The 4-heap uses more complicated (longer) code but has
3060noticeably faster performance with many (thousands) of watchers.
3061
3062The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3063(disabled).
3064
3065=item EV_HEAP_CACHE_AT
3066
3067Heaps are not very cache-efficient. To improve the cache-efficiency of the
3068timer and periodics heap, libev can cache the timestamp (I<at>) within
3069the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3070which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3071but avoids random read accesses on heap changes. This improves performance
3072noticeably with with many (hundreds) of watchers.
3073
3074The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3075(disabled).
3076
3077=item EV_VERIFY
3078
3079Controls how much internal verification (see C<ev_loop_verify ()>) will
3080be done: If set to C<0>, no internal verification code will be compiled
3081in. If set to C<1>, then verification code will be compiled in, but not
3082called. If set to C<2>, then the internal verification code will be
3083called once per loop, which can slow down libev. If set to C<3>, then the
3084verification code will be called very frequently, which will slow down
3085libev considerably.
3086
3087The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be
3088C<0.>
3089
2176=item EV_COMMON 3090=item EV_COMMON
2177 3091
2178By default, all watchers have a C<void *data> member. By redefining 3092By default, all watchers have a C<void *data> member. By redefining
2179this macro to a something else you can include more and other types of 3093this macro to a something else you can include more and other types of
2180members. You have to define it each time you include one of the files, 3094members. You have to define it each time you include one of the files,
2181though, and it must be identical each time. 3095though, and it must be identical each time.
2182 3096
2183For example, the perl EV module uses something like this: 3097For example, the perl EV module uses something like this:
2184 3098
2185 #define EV_COMMON \ 3099 #define EV_COMMON \
2186 SV *self; /* contains this struct */ \ 3100 SV *self; /* contains this struct */ \
2187 SV *cb_sv, *fh /* note no trailing ";" */ 3101 SV *cb_sv, *fh /* note no trailing ";" */
2188 3102
2189=item EV_CB_DECLARE (type) 3103=item EV_CB_DECLARE (type)
2190 3104
2191=item EV_CB_INVOKE (watcher, revents) 3105=item EV_CB_INVOKE (watcher, revents)
2192 3106
2193=item ev_set_cb (ev, cb) 3107=item ev_set_cb (ev, cb)
2194 3108
2195Can be used to change the callback member declaration in each watcher, 3109Can be used to change the callback member declaration in each watcher,
2196and the way callbacks are invoked and set. Must expand to a struct member 3110and the way callbacks are invoked and set. Must expand to a struct member
2197definition and a statement, respectively. See the F<ev.v> header file for 3111definition and a statement, respectively. See the F<ev.h> header file for
2198their default definitions. One possible use for overriding these is to 3112their default definitions. One possible use for overriding these is to
2199avoid the C<struct ev_loop *> as first argument in all cases, or to use 3113avoid the C<struct ev_loop *> as first argument in all cases, or to use
2200method calls instead of plain function calls in C++. 3114method calls instead of plain function calls in C++.
3115
3116=head2 EXPORTED API SYMBOLS
3117
3118If you need to re-export the API (e.g. via a DLL) and you need a list of
3119exported symbols, you can use the provided F<Symbol.*> files which list
3120all public symbols, one per line:
3121
3122 Symbols.ev for libev proper
3123 Symbols.event for the libevent emulation
3124
3125This can also be used to rename all public symbols to avoid clashes with
3126multiple versions of libev linked together (which is obviously bad in
3127itself, but sometimes it is inconvenient to avoid this).
3128
3129A sed command like this will create wrapper C<#define>'s that you need to
3130include before including F<ev.h>:
3131
3132 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
3133
3134This would create a file F<wrap.h> which essentially looks like this:
3135
3136 #define ev_backend myprefix_ev_backend
3137 #define ev_check_start myprefix_ev_check_start
3138 #define ev_check_stop myprefix_ev_check_stop
3139 ...
2201 3140
2202=head2 EXAMPLES 3141=head2 EXAMPLES
2203 3142
2204For a real-world example of a program the includes libev 3143For a real-world example of a program the includes libev
2205verbatim, you can have a look at the EV perl module 3144verbatim, you can have a look at the EV perl module
2210file. 3149file.
2211 3150
2212The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 3151The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2213that everybody includes and which overrides some configure choices: 3152that everybody includes and which overrides some configure choices:
2214 3153
2215 #define EV_MINIMAL 1 3154 #define EV_MINIMAL 1
2216 #define EV_USE_POLL 0 3155 #define EV_USE_POLL 0
2217 #define EV_MULTIPLICITY 0 3156 #define EV_MULTIPLICITY 0
2218 #define EV_PERIODIC_ENABLE 0 3157 #define EV_PERIODIC_ENABLE 0
2219 #define EV_STAT_ENABLE 0 3158 #define EV_STAT_ENABLE 0
2220 #define EV_FORK_ENABLE 0 3159 #define EV_FORK_ENABLE 0
2221 #define EV_CONFIG_H <config.h> 3160 #define EV_CONFIG_H <config.h>
2222 #define EV_MINPRI 0 3161 #define EV_MINPRI 0
2223 #define EV_MAXPRI 0 3162 #define EV_MAXPRI 0
2224 3163
2225 #include "ev++.h" 3164 #include "ev++.h"
2226 3165
2227And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 3166And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2228 3167
2229 #include "ev_cpp.h" 3168 #include "ev_cpp.h"
2230 #include "ev.c" 3169 #include "ev.c"
3170
3171
3172=head1 THREADS AND COROUTINES
3173
3174=head2 THREADS
3175
3176Libev itself is completely thread-safe, but it uses no locking. This
3177means that you can use as many loops as you want in parallel, as long as
3178only one thread ever calls into one libev function with the same loop
3179parameter.
3180
3181Or put differently: calls with different loop parameters can be done in
3182parallel from multiple threads, calls with the same loop parameter must be
3183done serially (but can be done from different threads, as long as only one
3184thread ever is inside a call at any point in time, e.g. by using a mutex
3185per loop).
3186
3187If you want to know which design is best for your problem, then I cannot
3188help you but by giving some generic advice:
3189
3190=over 4
3191
3192=item * most applications have a main thread: use the default libev loop
3193in that thread, or create a separate thread running only the default loop.
3194
3195This helps integrating other libraries or software modules that use libev
3196themselves and don't care/know about threading.
3197
3198=item * one loop per thread is usually a good model.
3199
3200Doing this is almost never wrong, sometimes a better-performance model
3201exists, but it is always a good start.
3202
3203=item * other models exist, such as the leader/follower pattern, where one
3204loop is handed through multiple threads in a kind of round-robin fashion.
3205
3206Choosing a model is hard - look around, learn, know that usually you can do
3207better than you currently do :-)
3208
3209=item * often you need to talk to some other thread which blocks in the
3210event loop - C<ev_async> watchers can be used to wake them up from other
3211threads safely (or from signal contexts...).
3212
3213=back
3214
3215=head2 COROUTINES
3216
3217Libev is much more accommodating to coroutines ("cooperative threads"):
3218libev fully supports nesting calls to it's functions from different
3219coroutines (e.g. you can call C<ev_loop> on the same loop from two
3220different coroutines and switch freely between both coroutines running the
3221loop, as long as you don't confuse yourself). The only exception is that
3222you must not do this from C<ev_periodic> reschedule callbacks.
3223
3224Care has been invested into making sure that libev does not keep local
3225state inside C<ev_loop>, and other calls do not usually allow coroutine
3226switches.
2231 3227
2232 3228
2233=head1 COMPLEXITIES 3229=head1 COMPLEXITIES
2234 3230
2235In this section the complexities of (many of) the algorithms used inside 3231In this section the complexities of (many of) the algorithms used inside
2236libev will be explained. For complexity discussions about backends see the 3232libev will be explained. For complexity discussions about backends see the
2237documentation for C<ev_default_init>. 3233documentation for C<ev_default_init>.
2238 3234
3235All of the following are about amortised time: If an array needs to be
3236extended, libev needs to realloc and move the whole array, but this
3237happens asymptotically never with higher number of elements, so O(1) might
3238mean it might do a lengthy realloc operation in rare cases, but on average
3239it is much faster and asymptotically approaches constant time.
3240
2239=over 4 3241=over 4
2240 3242
2241=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 3243=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2242 3244
3245This means that, when you have a watcher that triggers in one hour and
3246there are 100 watchers that would trigger before that then inserting will
3247have to skip roughly seven (C<ld 100>) of these watchers.
3248
2243=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 3249=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2244 3250
3251That means that changing a timer costs less than removing/adding them
3252as only the relative motion in the event queue has to be paid for.
3253
2245=item Starting io/check/prepare/idle/signal/child watchers: O(1) 3254=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)
2246 3255
3256These just add the watcher into an array or at the head of a list.
3257
2247=item Stopping check/prepare/idle watchers: O(1) 3258=item Stopping check/prepare/idle/fork/async watchers: O(1)
2248 3259
2249=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 3260=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2250 3261
3262These watchers are stored in lists then need to be walked to find the
3263correct watcher to remove. The lists are usually short (you don't usually
3264have many watchers waiting for the same fd or signal).
3265
2251=item Finding the next timer per loop iteration: O(1) 3266=item Finding the next timer in each loop iteration: O(1)
3267
3268By virtue of using a binary or 4-heap, the next timer is always found at a
3269fixed position in the storage array.
2252 3270
2253=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 3271=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2254 3272
2255=item Activating one watcher: O(1) 3273A change means an I/O watcher gets started or stopped, which requires
3274libev to recalculate its status (and possibly tell the kernel, depending
3275on backend and whether C<ev_io_set> was used).
3276
3277=item Activating one watcher (putting it into the pending state): O(1)
3278
3279=item Priority handling: O(number_of_priorities)
3280
3281Priorities are implemented by allocating some space for each
3282priority. When doing priority-based operations, libev usually has to
3283linearly search all the priorities, but starting/stopping and activating
3284watchers becomes O(1) w.r.t. priority handling.
3285
3286=item Sending an ev_async: O(1)
3287
3288=item Processing ev_async_send: O(number_of_async_watchers)
3289
3290=item Processing signals: O(max_signal_number)
3291
3292Sending involves a system call I<iff> there were no other C<ev_async_send>
3293calls in the current loop iteration. Checking for async and signal events
3294involves iterating over all running async watchers or all signal numbers.
2256 3295
2257=back 3296=back
2258 3297
2259 3298
3299=head1 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
3300
3301Win32 doesn't support any of the standards (e.g. POSIX) that libev
3302requires, and its I/O model is fundamentally incompatible with the POSIX
3303model. Libev still offers limited functionality on this platform in
3304the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3305descriptors. This only applies when using Win32 natively, not when using
3306e.g. cygwin.
3307
3308Lifting these limitations would basically require the full
3309re-implementation of the I/O system. If you are into these kinds of
3310things, then note that glib does exactly that for you in a very portable
3311way (note also that glib is the slowest event library known to man).
3312
3313There is no supported compilation method available on windows except
3314embedding it into other applications.
3315
3316Not a libev limitation but worth mentioning: windows apparently doesn't
3317accept large writes: instead of resulting in a partial write, windows will
3318either accept everything or return C<ENOBUFS> if the buffer is too large,
3319so make sure you only write small amounts into your sockets (less than a
3320megabyte seems safe, but thsi apparently depends on the amount of memory
3321available).
3322
3323Due to the many, low, and arbitrary limits on the win32 platform and
3324the abysmal performance of winsockets, using a large number of sockets
3325is not recommended (and not reasonable). If your program needs to use
3326more than a hundred or so sockets, then likely it needs to use a totally
3327different implementation for windows, as libev offers the POSIX readiness
3328notification model, which cannot be implemented efficiently on windows
3329(Microsoft monopoly games).
3330
3331A typical way to use libev under windows is to embed it (see the embedding
3332section for details) and use the following F<evwrap.h> header file instead
3333of F<ev.h>:
3334
3335 #define EV_STANDALONE /* keeps ev from requiring config.h */
3336 #define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */
3337
3338 #include "ev.h"
3339
3340And compile the following F<evwrap.c> file into your project (make sure
3341you do I<not> compile the F<ev.c> or any other embedded soruce files!):
3342
3343 #include "evwrap.h"
3344 #include "ev.c"
3345
3346=over 4
3347
3348=item The winsocket select function
3349
3350The winsocket C<select> function doesn't follow POSIX in that it
3351requires socket I<handles> and not socket I<file descriptors> (it is
3352also extremely buggy). This makes select very inefficient, and also
3353requires a mapping from file descriptors to socket handles (the Microsoft
3354C runtime provides the function C<_open_osfhandle> for this). See the
3355discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and
3356C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.
3357
3358The configuration for a "naked" win32 using the Microsoft runtime
3359libraries and raw winsocket select is:
3360
3361 #define EV_USE_SELECT 1
3362 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3363
3364Note that winsockets handling of fd sets is O(n), so you can easily get a
3365complexity in the O(n²) range when using win32.
3366
3367=item Limited number of file descriptors
3368
3369Windows has numerous arbitrary (and low) limits on things.
3370
3371Early versions of winsocket's select only supported waiting for a maximum
3372of C<64> handles (probably owning to the fact that all windows kernels
3373can only wait for C<64> things at the same time internally; Microsoft
3374recommends spawning a chain of threads and wait for 63 handles and the
3375previous thread in each. Great).
3376
3377Newer versions support more handles, but you need to define C<FD_SETSIZE>
3378to some high number (e.g. C<2048>) before compiling the winsocket select
3379call (which might be in libev or elsewhere, for example, perl does its own
3380select emulation on windows).
3381
3382Another limit is the number of file descriptors in the Microsoft runtime
3383libraries, which by default is C<64> (there must be a hidden I<64> fetish
3384or something like this inside Microsoft). You can increase this by calling
3385C<_setmaxstdio>, which can increase this limit to C<2048> (another
3386arbitrary limit), but is broken in many versions of the Microsoft runtime
3387libraries.
3388
3389This might get you to about C<512> or C<2048> sockets (depending on
3390windows version and/or the phase of the moon). To get more, you need to
3391wrap all I/O functions and provide your own fd management, but the cost of
3392calling select (O(n²)) will likely make this unworkable.
3393
3394=back
3395
3396
3397=head1 PORTABILITY REQUIREMENTS
3398
3399In addition to a working ISO-C implementation, libev relies on a few
3400additional extensions:
3401
3402=over 4
3403
3404=item C<void (*)(ev_watcher_type *, int revents)> must have compatible
3405calling conventions regardless of C<ev_watcher_type *>.
3406
3407Libev assumes not only that all watcher pointers have the same internal
3408structure (guaranteed by POSIX but not by ISO C for example), but it also
3409assumes that the same (machine) code can be used to call any watcher
3410callback: The watcher callbacks have different type signatures, but libev
3411calls them using an C<ev_watcher *> internally.
3412
3413=item C<sig_atomic_t volatile> must be thread-atomic as well
3414
3415The type C<sig_atomic_t volatile> (or whatever is defined as
3416C<EV_ATOMIC_T>) must be atomic w.r.t. accesses from different
3417threads. This is not part of the specification for C<sig_atomic_t>, but is
3418believed to be sufficiently portable.
3419
3420=item C<sigprocmask> must work in a threaded environment
3421
3422Libev uses C<sigprocmask> to temporarily block signals. This is not
3423allowed in a threaded program (C<pthread_sigmask> has to be used). Typical
3424pthread implementations will either allow C<sigprocmask> in the "main
3425thread" or will block signals process-wide, both behaviours would
3426be compatible with libev. Interaction between C<sigprocmask> and
3427C<pthread_sigmask> could complicate things, however.
3428
3429The most portable way to handle signals is to block signals in all threads
3430except the initial one, and run the default loop in the initial thread as
3431well.
3432
3433=item C<long> must be large enough for common memory allocation sizes
3434
3435To improve portability and simplify using libev, libev uses C<long>
3436internally instead of C<size_t> when allocating its data structures. On
3437non-POSIX systems (Microsoft...) this might be unexpectedly low, but
3438is still at least 31 bits everywhere, which is enough for hundreds of
3439millions of watchers.
3440
3441=item C<double> must hold a time value in seconds with enough accuracy
3442
3443The type C<double> is used to represent timestamps. It is required to
3444have at least 51 bits of mantissa (and 9 bits of exponent), which is good
3445enough for at least into the year 4000. This requirement is fulfilled by
3446implementations implementing IEEE 754 (basically all existing ones).
3447
3448=back
3449
3450If you know of other additional requirements drop me a note.
3451
3452
3453=head1 COMPILER WARNINGS
3454
3455Depending on your compiler and compiler settings, you might get no or a
3456lot of warnings when compiling libev code. Some people are apparently
3457scared by this.
3458
3459However, these are unavoidable for many reasons. For one, each compiler
3460has different warnings, and each user has different tastes regarding
3461warning options. "Warn-free" code therefore cannot be a goal except when
3462targeting a specific compiler and compiler-version.
3463
3464Another reason is that some compiler warnings require elaborate
3465workarounds, or other changes to the code that make it less clear and less
3466maintainable.
3467
3468And of course, some compiler warnings are just plain stupid, or simply
3469wrong (because they don't actually warn about the condition their message
3470seems to warn about).
3471
3472While libev is written to generate as few warnings as possible,
3473"warn-free" code is not a goal, and it is recommended not to build libev
3474with any compiler warnings enabled unless you are prepared to cope with
3475them (e.g. by ignoring them). Remember that warnings are just that:
3476warnings, not errors, or proof of bugs.
3477
3478
3479=head1 VALGRIND
3480
3481Valgrind has a special section here because it is a popular tool that is
3482highly useful, but valgrind reports are very hard to interpret.
3483
3484If you think you found a bug (memory leak, uninitialised data access etc.)
3485in libev, then check twice: If valgrind reports something like:
3486
3487 ==2274== definitely lost: 0 bytes in 0 blocks.
3488 ==2274== possibly lost: 0 bytes in 0 blocks.
3489 ==2274== still reachable: 256 bytes in 1 blocks.
3490
3491Then there is no memory leak. Similarly, under some circumstances,
3492valgrind might report kernel bugs as if it were a bug in libev, or it
3493might be confused (it is a very good tool, but only a tool).
3494
3495If you are unsure about something, feel free to contact the mailing list
3496with the full valgrind report and an explanation on why you think this is
3497a bug in libev. However, don't be annoyed when you get a brisk "this is
3498no bug" answer and take the chance of learning how to interpret valgrind
3499properly.
3500
3501If you need, for some reason, empty reports from valgrind for your project
3502I suggest using suppression lists.
3503
3504
2260=head1 AUTHOR 3505=head1 AUTHOR
2261 3506
2262Marc Lehmann <libev@schmorp.de>. 3507Marc Lehmann <libev@schmorp.de>.
2263 3508

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines