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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines