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

Comparing libev/ev.pod (file contents):
Revision 1.80 by root, Sun Dec 9 19:47:30 2007 UTC vs.
Revision 1.172 by root, Wed Aug 6 07:01:25 2008 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines