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

Comparing libev/ev.pod (file contents):
Revision 1.286 by root, Tue Mar 16 00:26:41 2010 UTC vs.
Revision 1.354 by root, Tue Jan 11 01:40:25 2011 UTC

26 puts ("stdin ready"); 26 puts ("stdin ready");
27 // for one-shot events, one must manually stop the watcher 27 // for one-shot events, one must manually stop the watcher
28 // with its corresponding stop function. 28 // with its corresponding stop function.
29 ev_io_stop (EV_A_ w); 29 ev_io_stop (EV_A_ w);
30 30
31 // this causes all nested ev_loop's to stop iterating 31 // this causes all nested ev_run's to stop iterating
32 ev_unloop (EV_A_ EVUNLOOP_ALL); 32 ev_break (EV_A_ EVBREAK_ALL);
33 } 33 }
34 34
35 // another callback, this time for a time-out 35 // another callback, this time for a time-out
36 static void 36 static void
37 timeout_cb (EV_P_ ev_timer *w, int revents) 37 timeout_cb (EV_P_ ev_timer *w, int revents)
38 { 38 {
39 puts ("timeout"); 39 puts ("timeout");
40 // this causes the innermost ev_loop to stop iterating 40 // this causes the innermost ev_run to stop iterating
41 ev_unloop (EV_A_ EVUNLOOP_ONE); 41 ev_break (EV_A_ EVBREAK_ONE);
42 } 42 }
43 43
44 int 44 int
45 main (void) 45 main (void)
46 { 46 {
47 // use the default event loop unless you have special needs 47 // use the default event loop unless you have special needs
48 struct ev_loop *loop = ev_default_loop (0); 48 struct ev_loop *loop = EV_DEFAULT;
49 49
50 // initialise an io watcher, then start it 50 // initialise an io watcher, then start it
51 // this one will watch for stdin to become readable 51 // this one will watch for stdin to become readable
52 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); 52 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
53 ev_io_start (loop, &stdin_watcher); 53 ev_io_start (loop, &stdin_watcher);
56 // simple non-repeating 5.5 second timeout 56 // simple non-repeating 5.5 second timeout
57 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); 57 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
58 ev_timer_start (loop, &timeout_watcher); 58 ev_timer_start (loop, &timeout_watcher);
59 59
60 // now wait for events to arrive 60 // now wait for events to arrive
61 ev_loop (loop, 0); 61 ev_run (loop, 0);
62 62
63 // unloop was called, so exit 63 // unloop was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
75While this document tries to be as complete as possible in documenting 75While this document tries to be as complete as possible in documenting
76libev, its usage and the rationale behind its design, it is not a tutorial 76libev, its usage and the rationale behind its design, it is not a tutorial
77on event-based programming, nor will it introduce event-based programming 77on event-based programming, nor will it introduce event-based programming
78with libev. 78with libev.
79 79
80Familarity with event based programming techniques in general is assumed 80Familiarity with event based programming techniques in general is assumed
81throughout this document. 81throughout this document.
82
83=head1 WHAT TO READ WHEN IN A HURRY
84
85This manual tries to be very detailed, but unfortunately, this also makes
86it very long. If you just want to know the basics of libev, I suggest
87reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and
88look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and
89C<ev_timer> sections in L<WATCHER TYPES>.
82 90
83=head1 ABOUT LIBEV 91=head1 ABOUT LIBEV
84 92
85Libev is an event loop: you register interest in certain events (such as a 93Libev is an event loop: you register interest in certain events (such as a
86file descriptor being readable or a timeout occurring), and it will manage 94file descriptor being readable or a timeout occurring), and it will manage
124this argument. 132this argument.
125 133
126=head2 TIME REPRESENTATION 134=head2 TIME REPRESENTATION
127 135
128Libev represents time as a single floating point number, representing 136Libev represents time as a single floating point number, representing
129the (fractional) number of seconds since the (POSIX) epoch (somewhere 137the (fractional) number of seconds since the (POSIX) epoch (in practice
130near the beginning of 1970, details are complicated, don't ask). This 138somewhere near the beginning of 1970, details are complicated, don't
131type is called C<ev_tstamp>, which is what you should use too. It usually 139ask). This type is called C<ev_tstamp>, which is what you should use
132aliases to the C<double> type in C. When you need to do any calculations 140too. It usually aliases to the C<double> type in C. When you need to do
133on it, you should treat it as some floating point value. Unlike the name 141any calculations on it, you should treat it as some floating point value.
142
134component C<stamp> might indicate, it is also used for time differences 143Unlike the name component C<stamp> might indicate, it is also used for
135throughout libev. 144time differences (e.g. delays) throughout libev.
136 145
137=head1 ERROR HANDLING 146=head1 ERROR HANDLING
138 147
139Libev knows three classes of errors: operating system errors, usage errors 148Libev knows three classes of errors: operating system errors, usage errors
140and internal errors (bugs). 149and internal errors (bugs).
164 173
165=item ev_tstamp ev_time () 174=item ev_tstamp ev_time ()
166 175
167Returns the current time as libev would use it. Please note that the 176Returns the current time as libev would use it. Please note that the
168C<ev_now> function is usually faster and also often returns the timestamp 177C<ev_now> function is usually faster and also often returns the timestamp
169you actually want to know. 178you actually want to know. Also interesting is the combination of
179C<ev_update_now> and C<ev_now>.
170 180
171=item ev_sleep (ev_tstamp interval) 181=item ev_sleep (ev_tstamp interval)
172 182
173Sleep for the given interval: The current thread will be blocked until 183Sleep for the given interval: The current thread will be blocked until
174either it is interrupted or the given time interval has passed. Basically 184either it is interrupted or the given time interval has passed. Basically
191as this indicates an incompatible change. Minor versions are usually 201as this indicates an incompatible change. Minor versions are usually
192compatible to older versions, so a larger minor version alone is usually 202compatible to older versions, so a larger minor version alone is usually
193not a problem. 203not a problem.
194 204
195Example: Make sure we haven't accidentally been linked against the wrong 205Example: Make sure we haven't accidentally been linked against the wrong
196version. 206version (note, however, that this will not detect other ABI mismatches,
207such as LFS or reentrancy).
197 208
198 assert (("libev version mismatch", 209 assert (("libev version mismatch",
199 ev_version_major () == EV_VERSION_MAJOR 210 ev_version_major () == EV_VERSION_MAJOR
200 && ev_version_minor () >= EV_VERSION_MINOR)); 211 && ev_version_minor () >= EV_VERSION_MINOR));
201 212
212 assert (("sorry, no epoll, no sex", 223 assert (("sorry, no epoll, no sex",
213 ev_supported_backends () & EVBACKEND_EPOLL)); 224 ev_supported_backends () & EVBACKEND_EPOLL));
214 225
215=item unsigned int ev_recommended_backends () 226=item unsigned int ev_recommended_backends ()
216 227
217Return the set of all backends compiled into this binary of libev and also 228Return the set of all backends compiled into this binary of libev and
218recommended for this platform. This set is often smaller than the one 229also recommended for this platform, meaning it will work for most file
230descriptor types. This set is often smaller than the one returned by
219returned by C<ev_supported_backends>, as for example kqueue is broken on 231C<ev_supported_backends>, as for example kqueue is broken on most BSDs
220most BSDs and will not be auto-detected unless you explicitly request it 232and will not be auto-detected unless you explicitly request it (assuming
221(assuming you know what you are doing). This is the set of backends that 233you know what you are doing). This is the set of backends that libev will
222libev will probe for if you specify no backends explicitly. 234probe for if you specify no backends explicitly.
223 235
224=item unsigned int ev_embeddable_backends () 236=item unsigned int ev_embeddable_backends ()
225 237
226Returns the set of backends that are embeddable in other event loops. This 238Returns the set of backends that are embeddable in other event loops. This
227is the theoretical, all-platform, value. To find which backends 239value is platform-specific but can include backends not available on the
228might be supported on the current system, you would need to look at 240current system. To find which embeddable backends might be supported on
229C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for 241the current system, you would need to look at C<ev_embeddable_backends ()
230recommended ones. 242& ev_supported_backends ()>, likewise for recommended ones.
231 243
232See the description of C<ev_embed> watchers for more info. 244See the description of C<ev_embed> watchers for more info.
233 245
234=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT] 246=item ev_set_allocator (void *(*cb)(void *ptr, long size))
235 247
236Sets the allocation function to use (the prototype is similar - the 248Sets the allocation function to use (the prototype is similar - the
237semantics are identical to the C<realloc> C89/SuS/POSIX function). It is 249semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
238used to allocate and free memory (no surprises here). If it returns zero 250used to allocate and free memory (no surprises here). If it returns zero
239when memory needs to be allocated (C<size != 0>), the library might abort 251when memory needs to be allocated (C<size != 0>), the library might abort
265 } 277 }
266 278
267 ... 279 ...
268 ev_set_allocator (persistent_realloc); 280 ev_set_allocator (persistent_realloc);
269 281
270=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT] 282=item ev_set_syserr_cb (void (*cb)(const char *msg))
271 283
272Set the callback function to call on a retryable system call error (such 284Set the callback function to call on a retryable system call error (such
273as failed select, poll, epoll_wait). The message is a printable string 285as failed select, poll, epoll_wait). The message is a printable string
274indicating the system call or subsystem causing the problem. If this 286indicating the system call or subsystem causing the problem. If this
275callback is set, then libev will expect it to remedy the situation, no 287callback is set, then libev will expect it to remedy the situation, no
287 } 299 }
288 300
289 ... 301 ...
290 ev_set_syserr_cb (fatal_error); 302 ev_set_syserr_cb (fatal_error);
291 303
304=item ev_feed_signal (int signum)
305
306This function can be used to "simulate" a signal receive. It is completely
307safe to call this function at any time, from any context, including signal
308handlers or random threads.
309
310Its main use is to customise signal handling in your process, especially
311in the presence of threads. For example, you could block signals
312by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
313creating any loops), and in one thread, use C<sigwait> or any other
314mechanism to wait for signals, then "deliver" them to libev by calling
315C<ev_feed_signal>.
316
292=back 317=back
293 318
294=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 319=head1 FUNCTIONS CONTROLLING EVENT LOOPS
295 320
296An event loop is described by a C<struct ev_loop *> (the C<struct> 321An event loop is described by a C<struct ev_loop *> (the C<struct> is
297is I<not> optional in this case, as there is also an C<ev_loop> 322I<not> optional in this case unless libev 3 compatibility is disabled, as
298I<function>). 323libev 3 had an C<ev_loop> function colliding with the struct name).
299 324
300The library knows two types of such loops, the I<default> loop, which 325The library knows two types of such loops, the I<default> loop, which
301supports signals and child events, and dynamically created loops which do 326supports child process events, and dynamically created event loops which
302not. 327do not.
303 328
304=over 4 329=over 4
305 330
306=item struct ev_loop *ev_default_loop (unsigned int flags) 331=item struct ev_loop *ev_default_loop (unsigned int flags)
307 332
308This will initialise the default event loop if it hasn't been initialised 333This returns the "default" event loop object, which is what you should
309yet and return it. If the default loop could not be initialised, returns 334normally use when you just need "the event loop". Event loop objects and
310false. If it already was initialised it simply returns it (and ignores the 335the C<flags> parameter are described in more detail in the entry for
311flags. If that is troubling you, check C<ev_backend ()> afterwards). 336C<ev_loop_new>.
337
338If the default loop is already initialised then this function simply
339returns it (and ignores the flags. If that is troubling you, check
340C<ev_backend ()> afterwards). Otherwise it will create it with the given
341flags, which should almost always be C<0>, unless the caller is also the
342one calling C<ev_run> or otherwise qualifies as "the main program".
312 343
313If you don't know what event loop to use, use the one returned from this 344If you don't know what event loop to use, use the one returned from this
314function. 345function (or via the C<EV_DEFAULT> macro).
315 346
316Note that this function is I<not> thread-safe, so if you want to use it 347Note that this function is I<not> thread-safe, so if you want to use it
317from multiple threads, you have to lock (note also that this is unlikely, 348from multiple threads, you have to employ some kind of mutex (note also
318as loops cannot be shared easily between threads anyway). 349that this case is unlikely, as loops cannot be shared easily between
350threads anyway).
319 351
320The default loop is the only loop that can handle C<ev_signal> and 352The default loop is the only loop that can handle C<ev_child> watchers,
321C<ev_child> watchers, and to do this, it always registers a handler 353and to do this, it always registers a handler for C<SIGCHLD>. If this is
322for C<SIGCHLD>. If this is a problem for your application you can either 354a problem for your application you can either create a dynamic loop with
323create a dynamic loop with C<ev_loop_new> that doesn't do that, or you 355C<ev_loop_new> which doesn't do that, or you can simply overwrite the
324can simply overwrite the C<SIGCHLD> signal handler I<after> calling 356C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
325C<ev_default_init>. 357
358Example: This is the most typical usage.
359
360 if (!ev_default_loop (0))
361 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
362
363Example: Restrict libev to the select and poll backends, and do not allow
364environment settings to be taken into account:
365
366 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
367
368=item struct ev_loop *ev_loop_new (unsigned int flags)
369
370This will create and initialise a new event loop object. If the loop
371could not be initialised, returns false.
372
373This function is thread-safe, and one common way to use libev with
374threads is indeed to create one loop per thread, and using the default
375loop in the "main" or "initial" thread.
326 376
327The flags argument can be used to specify special behaviour or specific 377The flags argument can be used to specify special behaviour or specific
328backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). 378backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
329 379
330The following flags are supported: 380The following flags are supported:
345useful to try out specific backends to test their performance, or to work 395useful to try out specific backends to test their performance, or to work
346around bugs. 396around bugs.
347 397
348=item C<EVFLAG_FORKCHECK> 398=item C<EVFLAG_FORKCHECK>
349 399
350Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after 400Instead of calling C<ev_loop_fork> manually after a fork, you can also
351a fork, you can also make libev check for a fork in each iteration by 401make libev check for a fork in each iteration by enabling this flag.
352enabling this flag.
353 402
354This works by calling C<getpid ()> on every iteration of the loop, 403This works by calling C<getpid ()> on every iteration of the loop,
355and thus this might slow down your event loop if you do a lot of loop 404and thus this might slow down your event loop if you do a lot of loop
356iterations and little real work, but is usually not noticeable (on my 405iterations and little real work, but is usually not noticeable (on my
357GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 406GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
366environment variable. 415environment variable.
367 416
368=item C<EVFLAG_NOINOTIFY> 417=item C<EVFLAG_NOINOTIFY>
369 418
370When this flag is specified, then libev will not attempt to use the 419When this flag is specified, then libev will not attempt to use the
371I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and 420I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
372testing, this flag can be useful to conserve inotify file descriptors, as 421testing, this flag can be useful to conserve inotify file descriptors, as
373otherwise each loop using C<ev_stat> watchers consumes one inotify handle. 422otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374 423
375=item C<EVFLAG_SIGNALFD> 424=item C<EVFLAG_SIGNALFD>
376 425
377When this flag is specified, then libev will attempt to use the 426When this flag is specified, then libev will attempt to use the
378I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API 427I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API
379delivers signals synchronously, which makes it both faster and might make 428delivers signals synchronously, which makes it both faster and might make
380it possible to get the queued signal data. It can also simplify signal 429it possible to get the queued signal data. It can also simplify signal
381handling with threads, as long as you properly block signals in your 430handling with threads, as long as you properly block signals in your
382threads that are not interested in handling them. 431threads that are not interested in handling them.
383 432
384Signalfd will not be used by default as this changes your signal mask, and 433Signalfd will not be used by default as this changes your signal mask, and
385there are a lot of shoddy libraries and programs (glib's threadpool for 434there are a lot of shoddy libraries and programs (glib's threadpool for
386example) that can't properly initialise their signal masks. 435example) that can't properly initialise their signal masks.
436
437=item C<EVFLAG_NOSIGMASK>
438
439When this flag is specified, then libev will avoid to modify the signal
440mask. Specifically, this means you ahve to make sure signals are unblocked
441when you want to receive them.
442
443This behaviour is useful when you want to do your own signal handling, or
444want to handle signals only in specific threads and want to avoid libev
445unblocking the signals.
446
447This flag's behaviour will become the default in future versions of libev.
387 448
388=item C<EVBACKEND_SELECT> (value 1, portable select backend) 449=item C<EVBACKEND_SELECT> (value 1, portable select backend)
389 450
390This is your standard select(2) backend. Not I<completely> standard, as 451This is your standard select(2) backend. Not I<completely> standard, as
391libev tries to roll its own fd_set with no limits on the number of fds, 452libev tries to roll its own fd_set with no limits on the number of fds,
427epoll scales either O(1) or O(active_fds). 488epoll scales either O(1) or O(active_fds).
428 489
429The epoll mechanism deserves honorable mention as the most misdesigned 490The epoll mechanism deserves honorable mention as the most misdesigned
430of the more advanced event mechanisms: mere annoyances include silently 491of the more advanced event mechanisms: mere annoyances include silently
431dropping file descriptors, requiring a system call per change per file 492dropping file descriptors, requiring a system call per change per file
432descriptor (and unnecessary guessing of parameters), problems with dup and 493descriptor (and unnecessary guessing of parameters), problems with dup,
494returning before the timeout value, resulting in additional iterations
495(and only giving 5ms accuracy while select on the same platform gives
433so on. The biggest issue is fork races, however - if a program forks then 4960.1ms) and so on. The biggest issue is fork races, however - if a program
434I<both> parent and child process have to recreate the epoll set, which can 497forks then I<both> parent and child process have to recreate the epoll
435take considerable time (one syscall per file descriptor) and is of course 498set, which can take considerable time (one syscall per file descriptor)
436hard to detect. 499and is of course hard to detect.
437 500
438Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 501Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
439of course I<doesn't>, and epoll just loves to report events for totally 502of course I<doesn't>, and epoll just loves to report events for totally
440I<different> file descriptors (even already closed ones, so one cannot 503I<different> file descriptors (even already closed ones, so one cannot
441even remove them from the set) than registered in the set (especially 504even remove them from the set) than registered in the set (especially
442on SMP systems). Libev tries to counter these spurious notifications by 505on SMP systems). Libev tries to counter these spurious notifications by
443employing an additional generation counter and comparing that against the 506employing an additional generation counter and comparing that against the
444events to filter out spurious ones, recreating the set when required. 507events to filter out spurious ones, recreating the set when required. Last
508not least, it also refuses to work with some file descriptors which work
509perfectly fine with C<select> (files, many character devices...).
510
511Epoll is truly the train wreck analog among event poll mechanisms,
512a frankenpoll, cobbled together in a hurry, no thought to design or
513interaction with others.
445 514
446While stopping, setting and starting an I/O watcher in the same iteration 515While stopping, setting and starting an I/O watcher in the same iteration
447will result in some caching, there is still a system call per such 516will result in some caching, there is still a system call per such
448incident (because the same I<file descriptor> could point to a different 517incident (because the same I<file descriptor> could point to a different
449I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 518I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
515=item C<EVBACKEND_PORT> (value 32, Solaris 10) 584=item C<EVBACKEND_PORT> (value 32, Solaris 10)
516 585
517This uses the Solaris 10 event port mechanism. As with everything on Solaris, 586This uses the Solaris 10 event port mechanism. As with everything on Solaris,
518it's really slow, but it still scales very well (O(active_fds)). 587it's really slow, but it still scales very well (O(active_fds)).
519 588
520Please note that Solaris event ports can deliver a lot of spurious
521notifications, so you need to use non-blocking I/O or other means to avoid
522blocking when no data (or space) is available.
523
524While this backend scales well, it requires one system call per active 589While this backend scales well, it requires one system call per active
525file descriptor per loop iteration. For small and medium numbers of file 590file descriptor per loop iteration. For small and medium numbers of file
526descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 591descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
527might perform better. 592might perform better.
528 593
529On the positive side, with the exception of the spurious readiness 594On the positive side, this backend actually performed fully to
530notifications, this backend actually performed fully to specification
531in all tests and is fully embeddable, which is a rare feat among the 595specification in all tests and is fully embeddable, which is a rare feat
532OS-specific backends (I vastly prefer correctness over speed hacks). 596among the OS-specific backends (I vastly prefer correctness over speed
597hacks).
598
599On the negative side, the interface is I<bizarre> - so bizarre that
600even sun itself gets it wrong in their code examples: The event polling
601function sometimes returning events to the caller even though an error
602occurred, but with no indication whether it has done so or not (yes, it's
603even documented that way) - deadly for edge-triggered interfaces where
604you absolutely have to know whether an event occurred or not because you
605have to re-arm the watcher.
606
607Fortunately libev seems to be able to work around these idiocies.
533 608
534This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 609This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
535C<EVBACKEND_POLL>. 610C<EVBACKEND_POLL>.
536 611
537=item C<EVBACKEND_ALL> 612=item C<EVBACKEND_ALL>
538 613
539Try all backends (even potentially broken ones that wouldn't be tried 614Try all backends (even potentially broken ones that wouldn't be tried
540with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 615with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
541C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 616C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
542 617
543It is definitely not recommended to use this flag. 618It is definitely not recommended to use this flag, use whatever
619C<ev_recommended_backends ()> returns, or simply do not specify a backend
620at all.
621
622=item C<EVBACKEND_MASK>
623
624Not a backend at all, but a mask to select all backend bits from a
625C<flags> value, in case you want to mask out any backends from a flags
626value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
544 627
545=back 628=back
546 629
547If one or more of the backend flags are or'ed into the flags value, 630If one or more of the backend flags are or'ed into the flags value,
548then only these backends will be tried (in the reverse order as listed 631then only these backends will be tried (in the reverse order as listed
549here). If none are specified, all backends in C<ev_recommended_backends 632here). If none are specified, all backends in C<ev_recommended_backends
550()> will be tried. 633()> will be tried.
551 634
552Example: This is the most typical usage.
553
554 if (!ev_default_loop (0))
555 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
556
557Example: Restrict libev to the select and poll backends, and do not allow
558environment settings to be taken into account:
559
560 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
561
562Example: Use whatever libev has to offer, but make sure that kqueue is
563used if available (warning, breaks stuff, best use only with your own
564private event loop and only if you know the OS supports your types of
565fds):
566
567 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
568
569=item struct ev_loop *ev_loop_new (unsigned int flags)
570
571Similar to C<ev_default_loop>, but always creates a new event loop that is
572always distinct from the default loop. Unlike the default loop, it cannot
573handle signal and child watchers, and attempts to do so will be greeted by
574undefined behaviour (or a failed assertion if assertions are enabled).
575
576Note that this function I<is> thread-safe, and the recommended way to use
577libev with threads is indeed to create one loop per thread, and using the
578default loop in the "main" or "initial" thread.
579
580Example: Try to create a event loop that uses epoll and nothing else. 635Example: Try to create a event loop that uses epoll and nothing else.
581 636
582 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 637 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
583 if (!epoller) 638 if (!epoller)
584 fatal ("no epoll found here, maybe it hides under your chair"); 639 fatal ("no epoll found here, maybe it hides under your chair");
585 640
641Example: Use whatever libev has to offer, but make sure that kqueue is
642used if available.
643
644 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
645
586=item ev_default_destroy () 646=item ev_loop_destroy (loop)
587 647
588Destroys the default loop again (frees all memory and kernel state 648Destroys an event loop object (frees all memory and kernel state
589etc.). None of the active event watchers will be stopped in the normal 649etc.). None of the active event watchers will be stopped in the normal
590sense, so e.g. C<ev_is_active> might still return true. It is your 650sense, so e.g. C<ev_is_active> might still return true. It is your
591responsibility to either stop all watchers cleanly yourself I<before> 651responsibility to either stop all watchers cleanly yourself I<before>
592calling this function, or cope with the fact afterwards (which is usually 652calling this function, or cope with the fact afterwards (which is usually
593the easiest thing, you can just ignore the watchers and/or C<free ()> them 653the easiest thing, you can just ignore the watchers and/or C<free ()> them
595 655
596Note that certain global state, such as signal state (and installed signal 656Note that certain global state, such as signal state (and installed signal
597handlers), will not be freed by this function, and related watchers (such 657handlers), will not be freed by this function, and related watchers (such
598as signal and child watchers) would need to be stopped manually. 658as signal and child watchers) would need to be stopped manually.
599 659
600In general it is not advisable to call this function except in the 660This function is normally used on loop objects allocated by
601rare occasion where you really need to free e.g. the signal handling 661C<ev_loop_new>, but it can also be used on the default loop returned by
662C<ev_default_loop>, in which case it is not thread-safe.
663
664Note that it is not advisable to call this function on the default loop
665except in the rare occasion where you really need to free its resources.
602pipe fds. If you need dynamically allocated loops it is better to use 666If you need dynamically allocated loops it is better to use C<ev_loop_new>
603C<ev_loop_new> and C<ev_loop_destroy>. 667and C<ev_loop_destroy>.
604 668
605=item ev_loop_destroy (loop) 669=item ev_loop_fork (loop)
606 670
607Like C<ev_default_destroy>, but destroys an event loop created by an
608earlier call to C<ev_loop_new>.
609
610=item ev_default_fork ()
611
612This function sets a flag that causes subsequent C<ev_loop> iterations 671This function sets a flag that causes subsequent C<ev_run> iterations to
613to reinitialise the kernel state for backends that have one. Despite the 672reinitialise the kernel state for backends that have one. Despite the
614name, you can call it anytime, but it makes most sense after forking, in 673name, you can call it anytime, but it makes most sense after forking, in
615the child process (or both child and parent, but that again makes little 674the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
616sense). You I<must> call it in the child before using any of the libev 675child before resuming or calling C<ev_run>.
617functions, and it will only take effect at the next C<ev_loop> iteration. 676
677Again, you I<have> to call it on I<any> loop that you want to re-use after
678a fork, I<even if you do not plan to use the loop in the parent>. This is
679because some kernel interfaces *cough* I<kqueue> *cough* do funny things
680during fork.
618 681
619On the other hand, you only need to call this function in the child 682On the other hand, you only need to call this function in the child
620process if and only if you want to use the event library in the child. If 683process if and only if you want to use the event loop in the child. If
621you just fork+exec, you don't have to call it at all. 684you just fork+exec or create a new loop in the child, you don't have to
685call it at all (in fact, C<epoll> is so badly broken that it makes a
686difference, but libev will usually detect this case on its own and do a
687costly reset of the backend).
622 688
623The function itself is quite fast and it's usually not a problem to call 689The function itself is quite fast and it's usually not a problem to call
624it just in case after a fork. To make this easy, the function will fit in 690it just in case after a fork.
625quite nicely into a call to C<pthread_atfork>:
626 691
692Example: Automate calling C<ev_loop_fork> on the default loop when
693using pthreads.
694
695 static void
696 post_fork_child (void)
697 {
698 ev_loop_fork (EV_DEFAULT);
699 }
700
701 ...
627 pthread_atfork (0, 0, ev_default_fork); 702 pthread_atfork (0, 0, post_fork_child);
628
629=item ev_loop_fork (loop)
630
631Like C<ev_default_fork>, but acts on an event loop created by
632C<ev_loop_new>. Yes, you have to call this on every allocated event loop
633after fork that you want to re-use in the child, and how you do this is
634entirely your own problem.
635 703
636=item int ev_is_default_loop (loop) 704=item int ev_is_default_loop (loop)
637 705
638Returns true when the given loop is, in fact, the default loop, and false 706Returns true when the given loop is, in fact, the default loop, and false
639otherwise. 707otherwise.
640 708
641=item unsigned int ev_loop_count (loop) 709=item unsigned int ev_iteration (loop)
642 710
643Returns the count of loop iterations for the loop, which is identical to 711Returns the current iteration count for the event loop, which is identical
644the number of times libev did poll for new events. It starts at C<0> and 712to the number of times libev did poll for new events. It starts at C<0>
645happily wraps around with enough iterations. 713and happily wraps around with enough iterations.
646 714
647This value can sometimes be useful as a generation counter of sorts (it 715This value can sometimes be useful as a generation counter of sorts (it
648"ticks" the number of loop iterations), as it roughly corresponds with 716"ticks" the number of loop iterations), as it roughly corresponds with
649C<ev_prepare> and C<ev_check> calls. 717C<ev_prepare> and C<ev_check> calls - and is incremented between the
718prepare and check phases.
650 719
651=item unsigned int ev_loop_depth (loop) 720=item unsigned int ev_depth (loop)
652 721
653Returns the number of times C<ev_loop> was entered minus the number of 722Returns the number of times C<ev_run> was entered minus the number of
654times C<ev_loop> was exited, in other words, the recursion depth. 723times C<ev_run> was exited normally, in other words, the recursion depth.
655 724
656Outside C<ev_loop>, this number is zero. In a callback, this number is 725Outside C<ev_run>, this number is zero. In a callback, this number is
657C<1>, unless C<ev_loop> was invoked recursively (or from another thread), 726C<1>, unless C<ev_run> was invoked recursively (or from another thread),
658in which case it is higher. 727in which case it is higher.
659 728
660Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread 729Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
661etc.), doesn't count as exit. 730throwing an exception etc.), doesn't count as "exit" - consider this
731as a hint to avoid such ungentleman-like behaviour unless it's really
732convenient, in which case it is fully supported.
662 733
663=item unsigned int ev_backend (loop) 734=item unsigned int ev_backend (loop)
664 735
665Returns one of the C<EVBACKEND_*> flags indicating the event backend in 736Returns one of the C<EVBACKEND_*> flags indicating the event backend in
666use. 737use.
675 746
676=item ev_now_update (loop) 747=item ev_now_update (loop)
677 748
678Establishes the current time by querying the kernel, updating the time 749Establishes the current time by querying the kernel, updating the time
679returned by C<ev_now ()> in the progress. This is a costly operation and 750returned by C<ev_now ()> in the progress. This is a costly operation and
680is usually done automatically within C<ev_loop ()>. 751is usually done automatically within C<ev_run ()>.
681 752
682This function is rarely useful, but when some event callback runs for a 753This function is rarely useful, but when some event callback runs for a
683very long time without entering the event loop, updating libev's idea of 754very long time without entering the event loop, updating libev's idea of
684the current time is a good idea. 755the current time is a good idea.
685 756
687 758
688=item ev_suspend (loop) 759=item ev_suspend (loop)
689 760
690=item ev_resume (loop) 761=item ev_resume (loop)
691 762
692These two functions suspend and resume a loop, for use when the loop is 763These two functions suspend and resume an event loop, for use when the
693not used for a while and timeouts should not be processed. 764loop is not used for a while and timeouts should not be processed.
694 765
695A typical use case would be an interactive program such as a game: When 766A typical use case would be an interactive program such as a game: When
696the user presses C<^Z> to suspend the game and resumes it an hour later it 767the user presses C<^Z> to suspend the game and resumes it an hour later it
697would be best to handle timeouts as if no time had actually passed while 768would be best to handle timeouts as if no time had actually passed while
698the program was suspended. This can be achieved by calling C<ev_suspend> 769the program was suspended. This can be achieved by calling C<ev_suspend>
700C<ev_resume> directly afterwards to resume timer processing. 771C<ev_resume> directly afterwards to resume timer processing.
701 772
702Effectively, all C<ev_timer> watchers will be delayed by the time spend 773Effectively, all C<ev_timer> watchers will be delayed by the time spend
703between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers 774between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
704will be rescheduled (that is, they will lose any events that would have 775will be rescheduled (that is, they will lose any events that would have
705occured while suspended). 776occurred while suspended).
706 777
707After calling C<ev_suspend> you B<must not> call I<any> function on the 778After calling C<ev_suspend> you B<must not> call I<any> function on the
708given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> 779given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
709without a previous call to C<ev_suspend>. 780without a previous call to C<ev_suspend>.
710 781
711Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 782Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
712event loop time (see C<ev_now_update>). 783event loop time (see C<ev_now_update>).
713 784
714=item ev_loop (loop, int flags) 785=item ev_run (loop, int flags)
715 786
716Finally, this is it, the event handler. This function usually is called 787Finally, this is it, the event handler. This function usually is called
717after you have initialised all your watchers and you want to start 788after you have initialised all your watchers and you want to start
718handling events. 789handling events. It will ask the operating system for any new events, call
790the watcher callbacks, an then repeat the whole process indefinitely: This
791is why event loops are called I<loops>.
719 792
720If the flags argument is specified as C<0>, it will not return until 793If the flags argument is specified as C<0>, it will keep handling events
721either no event watchers are active anymore or C<ev_unloop> was called. 794until either no event watchers are active anymore or C<ev_break> was
795called.
722 796
723Please note that an explicit C<ev_unloop> is usually better than 797Please note that an explicit C<ev_break> is usually better than
724relying on all watchers to be stopped when deciding when a program has 798relying on all watchers to be stopped when deciding when a program has
725finished (especially in interactive programs), but having a program 799finished (especially in interactive programs), but having a program
726that automatically loops as long as it has to and no longer by virtue 800that automatically loops as long as it has to and no longer by virtue
727of relying on its watchers stopping correctly, that is truly a thing of 801of relying on its watchers stopping correctly, that is truly a thing of
728beauty. 802beauty.
729 803
804This function is also I<mostly> exception-safe - you can break out of
805a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
806exception and so on. This does not decrement the C<ev_depth> value, nor
807will it clear any outstanding C<EVBREAK_ONE> breaks.
808
730A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 809A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
731those events and any already outstanding ones, but will not block your 810those events and any already outstanding ones, but will not wait and
732process in case there are no events and will return after one iteration of 811block your process in case there are no events and will return after one
733the loop. 812iteration of the loop. This is sometimes useful to poll and handle new
813events while doing lengthy calculations, to keep the program responsive.
734 814
735A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 815A flags value of C<EVRUN_ONCE> will look for new events (waiting if
736necessary) and will handle those and any already outstanding ones. It 816necessary) and will handle those and any already outstanding ones. It
737will block your process until at least one new event arrives (which could 817will block your process until at least one new event arrives (which could
738be an event internal to libev itself, so there is no guarantee that a 818be an event internal to libev itself, so there is no guarantee that a
739user-registered callback will be called), and will return after one 819user-registered callback will be called), and will return after one
740iteration of the loop. 820iteration of the loop.
741 821
742This is useful if you are waiting for some external event in conjunction 822This is useful if you are waiting for some external event in conjunction
743with something not expressible using other libev watchers (i.e. "roll your 823with something not expressible using other libev watchers (i.e. "roll your
744own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 824own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
745usually a better approach for this kind of thing. 825usually a better approach for this kind of thing.
746 826
747Here are the gory details of what C<ev_loop> does: 827Here are the gory details of what C<ev_run> does:
748 828
829 - Increment loop depth.
830 - Reset the ev_break status.
749 - Before the first iteration, call any pending watchers. 831 - Before the first iteration, call any pending watchers.
832 LOOP:
750 * If EVFLAG_FORKCHECK was used, check for a fork. 833 - If EVFLAG_FORKCHECK was used, check for a fork.
751 - If a fork was detected (by any means), queue and call all fork watchers. 834 - If a fork was detected (by any means), queue and call all fork watchers.
752 - Queue and call all prepare watchers. 835 - Queue and call all prepare watchers.
836 - If ev_break was called, goto FINISH.
753 - If we have been forked, detach and recreate the kernel state 837 - If we have been forked, detach and recreate the kernel state
754 as to not disturb the other process. 838 as to not disturb the other process.
755 - Update the kernel state with all outstanding changes. 839 - Update the kernel state with all outstanding changes.
756 - Update the "event loop time" (ev_now ()). 840 - Update the "event loop time" (ev_now ()).
757 - Calculate for how long to sleep or block, if at all 841 - Calculate for how long to sleep or block, if at all
758 (active idle watchers, EVLOOP_NONBLOCK or not having 842 (active idle watchers, EVRUN_NOWAIT or not having
759 any active watchers at all will result in not sleeping). 843 any active watchers at all will result in not sleeping).
760 - Sleep if the I/O and timer collect interval say so. 844 - Sleep if the I/O and timer collect interval say so.
845 - Increment loop iteration counter.
761 - Block the process, waiting for any events. 846 - Block the process, waiting for any events.
762 - Queue all outstanding I/O (fd) events. 847 - Queue all outstanding I/O (fd) events.
763 - Update the "event loop time" (ev_now ()), and do time jump adjustments. 848 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
764 - Queue all expired timers. 849 - Queue all expired timers.
765 - Queue all expired periodics. 850 - Queue all expired periodics.
766 - Unless any events are pending now, queue all idle watchers. 851 - Queue all idle watchers with priority higher than that of pending events.
767 - Queue all check watchers. 852 - Queue all check watchers.
768 - Call all queued watchers in reverse order (i.e. check watchers first). 853 - Call all queued watchers in reverse order (i.e. check watchers first).
769 Signals and child watchers are implemented as I/O watchers, and will 854 Signals and child watchers are implemented as I/O watchers, and will
770 be handled here by queueing them when their watcher gets executed. 855 be handled here by queueing them when their watcher gets executed.
771 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 856 - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
772 were used, or there are no active watchers, return, otherwise 857 were used, or there are no active watchers, goto FINISH, otherwise
773 continue with step *. 858 continue with step LOOP.
859 FINISH:
860 - Reset the ev_break status iff it was EVBREAK_ONE.
861 - Decrement the loop depth.
862 - Return.
774 863
775Example: Queue some jobs and then loop until no events are outstanding 864Example: Queue some jobs and then loop until no events are outstanding
776anymore. 865anymore.
777 866
778 ... queue jobs here, make sure they register event watchers as long 867 ... queue jobs here, make sure they register event watchers as long
779 ... as they still have work to do (even an idle watcher will do..) 868 ... as they still have work to do (even an idle watcher will do..)
780 ev_loop (my_loop, 0); 869 ev_run (my_loop, 0);
781 ... jobs done or somebody called unloop. yeah! 870 ... jobs done or somebody called unloop. yeah!
782 871
783=item ev_unloop (loop, how) 872=item ev_break (loop, how)
784 873
785Can be used to make a call to C<ev_loop> return early (but only after it 874Can be used to make a call to C<ev_run> return early (but only after it
786has processed all outstanding events). The C<how> argument must be either 875has processed all outstanding events). The C<how> argument must be either
787C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 876C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
788C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 877C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
789 878
790This "unloop state" will be cleared when entering C<ev_loop> again. 879This "break state" will be cleared on the next call to C<ev_run>.
791 880
792It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. 881It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
882which case it will have no effect.
793 883
794=item ev_ref (loop) 884=item ev_ref (loop)
795 885
796=item ev_unref (loop) 886=item ev_unref (loop)
797 887
798Ref/unref can be used to add or remove a reference count on the event 888Ref/unref can be used to add or remove a reference count on the event
799loop: Every watcher keeps one reference, and as long as the reference 889loop: Every watcher keeps one reference, and as long as the reference
800count is nonzero, C<ev_loop> will not return on its own. 890count is nonzero, C<ev_run> will not return on its own.
801 891
802This is useful when you have a watcher that you never intend to 892This is useful when you have a watcher that you never intend to
803unregister, but that nevertheless should not keep C<ev_loop> from 893unregister, but that nevertheless should not keep C<ev_run> from
804returning. In such a case, call C<ev_unref> after starting, and C<ev_ref> 894returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
805before stopping it. 895before stopping it.
806 896
807As an example, libev itself uses this for its internal signal pipe: It 897As an example, libev itself uses this for its internal signal pipe: It
808is not visible to the libev user and should not keep C<ev_loop> from 898is not visible to the libev user and should not keep C<ev_run> from
809exiting if no event watchers registered by it are active. It is also an 899exiting if no event watchers registered by it are active. It is also an
810excellent way to do this for generic recurring timers or from within 900excellent way to do this for generic recurring timers or from within
811third-party libraries. Just remember to I<unref after start> and I<ref 901third-party libraries. Just remember to I<unref after start> and I<ref
812before stop> (but only if the watcher wasn't active before, or was active 902before stop> (but only if the watcher wasn't active before, or was active
813before, respectively. Note also that libev might stop watchers itself 903before, respectively. Note also that libev might stop watchers itself
814(e.g. non-repeating timers) in which case you have to C<ev_ref> 904(e.g. non-repeating timers) in which case you have to C<ev_ref>
815in the callback). 905in the callback).
816 906
817Example: Create a signal watcher, but keep it from keeping C<ev_loop> 907Example: Create a signal watcher, but keep it from keeping C<ev_run>
818running when nothing else is active. 908running when nothing else is active.
819 909
820 ev_signal exitsig; 910 ev_signal exitsig;
821 ev_signal_init (&exitsig, sig_cb, SIGINT); 911 ev_signal_init (&exitsig, sig_cb, SIGINT);
822 ev_signal_start (loop, &exitsig); 912 ev_signal_start (loop, &exitsig);
823 evf_unref (loop); 913 ev_unref (loop);
824 914
825Example: For some weird reason, unregister the above signal handler again. 915Example: For some weird reason, unregister the above signal handler again.
826 916
827 ev_ref (loop); 917 ev_ref (loop);
828 ev_signal_stop (loop, &exitsig); 918 ev_signal_stop (loop, &exitsig);
867usually doesn't make much sense to set it to a lower value than C<0.01>, 957usually doesn't make much sense to set it to a lower value than C<0.01>,
868as this approaches the timing granularity of most systems. Note that if 958as this approaches the timing granularity of most systems. Note that if
869you do transactions with the outside world and you can't increase the 959you do transactions with the outside world and you can't increase the
870parallelity, then this setting will limit your transaction rate (if you 960parallelity, then this setting will limit your transaction rate (if you
871need to poll once per transaction and the I/O collect interval is 0.01, 961need to poll once per transaction and the I/O collect interval is 0.01,
872then you can't do more than 100 transations per second). 962then you can't do more than 100 transactions per second).
873 963
874Setting the I<timeout collect interval> can improve the opportunity for 964Setting the I<timeout collect interval> can improve the opportunity for
875saving power, as the program will "bundle" timer callback invocations that 965saving power, as the program will "bundle" timer callback invocations that
876are "near" in time together, by delaying some, thus reducing the number of 966are "near" in time together, by delaying some, thus reducing the number of
877times the process sleeps and wakes up again. Another useful technique to 967times the process sleeps and wakes up again. Another useful technique to
885 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); 975 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
886 976
887=item ev_invoke_pending (loop) 977=item ev_invoke_pending (loop)
888 978
889This call will simply invoke all pending watchers while resetting their 979This call will simply invoke all pending watchers while resetting their
890pending state. Normally, C<ev_loop> does this automatically when required, 980pending state. Normally, C<ev_run> does this automatically when required,
891but when overriding the invoke callback this call comes handy. 981but when overriding the invoke callback this call comes handy. This
982function can be invoked from a watcher - this can be useful for example
983when you want to do some lengthy calculation and want to pass further
984event handling to another thread (you still have to make sure only one
985thread executes within C<ev_invoke_pending> or C<ev_run> of course).
892 986
893=item int ev_pending_count (loop) 987=item int ev_pending_count (loop)
894 988
895Returns the number of pending watchers - zero indicates that no watchers 989Returns the number of pending watchers - zero indicates that no watchers
896are pending. 990are pending.
897 991
898=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P)) 992=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
899 993
900This overrides the invoke pending functionality of the loop: Instead of 994This overrides the invoke pending functionality of the loop: Instead of
901invoking all pending watchers when there are any, C<ev_loop> will call 995invoking all pending watchers when there are any, C<ev_run> will call
902this callback instead. This is useful, for example, when you want to 996this callback instead. This is useful, for example, when you want to
903invoke the actual watchers inside another context (another thread etc.). 997invoke the actual watchers inside another context (another thread etc.).
904 998
905If you want to reset the callback, use C<ev_invoke_pending> as new 999If you want to reset the callback, use C<ev_invoke_pending> as new
906callback. 1000callback.
909 1003
910Sometimes you want to share the same loop between multiple threads. This 1004Sometimes you want to share the same loop between multiple threads. This
911can be done relatively simply by putting mutex_lock/unlock calls around 1005can be done relatively simply by putting mutex_lock/unlock calls around
912each call to a libev function. 1006each call to a libev function.
913 1007
914However, C<ev_loop> can run an indefinite time, so it is not feasible to 1008However, C<ev_run> can run an indefinite time, so it is not feasible
915wait for it to return. One way around this is to wake up the loop via 1009to wait for it to return. One way around this is to wake up the event
916C<ev_unloop> and C<av_async_send>, another way is to set these I<release> 1010loop via C<ev_break> and C<av_async_send>, another way is to set these
917and I<acquire> callbacks on the loop. 1011I<release> and I<acquire> callbacks on the loop.
918 1012
919When set, then C<release> will be called just before the thread is 1013When set, then C<release> will be called just before the thread is
920suspended waiting for new events, and C<acquire> is called just 1014suspended waiting for new events, and C<acquire> is called just
921afterwards. 1015afterwards.
922 1016
925 1019
926While event loop modifications are allowed between invocations of 1020While event loop modifications are allowed between invocations of
927C<release> and C<acquire> (that's their only purpose after all), no 1021C<release> and C<acquire> (that's their only purpose after all), no
928modifications done will affect the event loop, i.e. adding watchers will 1022modifications done will affect the event loop, i.e. adding watchers will
929have no effect on the set of file descriptors being watched, or the time 1023have no effect on the set of file descriptors being watched, or the time
930waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it 1024waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
931to take note of any changes you made. 1025to take note of any changes you made.
932 1026
933In theory, threads executing C<ev_loop> will be async-cancel safe between 1027In theory, threads executing C<ev_run> will be async-cancel safe between
934invocations of C<release> and C<acquire>. 1028invocations of C<release> and C<acquire>.
935 1029
936See also the locking example in the C<THREADS> section later in this 1030See also the locking example in the C<THREADS> section later in this
937document. 1031document.
938 1032
939=item ev_set_userdata (loop, void *data) 1033=item ev_set_userdata (loop, void *data)
940 1034
941=item ev_userdata (loop) 1035=item void *ev_userdata (loop)
942 1036
943Set and retrieve a single C<void *> associated with a loop. When 1037Set and retrieve a single C<void *> associated with a loop. When
944C<ev_set_userdata> has never been called, then C<ev_userdata> returns 1038C<ev_set_userdata> has never been called, then C<ev_userdata> returns
945C<0.> 1039C<0>.
946 1040
947These two functions can be used to associate arbitrary data with a loop, 1041These two functions can be used to associate arbitrary data with a loop,
948and are intended solely for the C<invoke_pending_cb>, C<release> and 1042and are intended solely for the C<invoke_pending_cb>, C<release> and
949C<acquire> callbacks described above, but of course can be (ab-)used for 1043C<acquire> callbacks described above, but of course can be (ab-)used for
950any other purpose as well. 1044any other purpose as well.
951 1045
952=item ev_loop_verify (loop) 1046=item ev_verify (loop)
953 1047
954This function only does something when C<EV_VERIFY> support has been 1048This function only does something when C<EV_VERIFY> support has been
955compiled in, which is the default for non-minimal builds. It tries to go 1049compiled in, which is the default for non-minimal builds. It tries to go
956through all internal structures and checks them for validity. If anything 1050through all internal structures and checks them for validity. If anything
957is found to be inconsistent, it will print an error message to standard 1051is found to be inconsistent, it will print an error message to standard
968 1062
969In the following description, uppercase C<TYPE> in names stands for the 1063In the following description, uppercase C<TYPE> in names stands for the
970watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer 1064watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
971watchers and C<ev_io_start> for I/O watchers. 1065watchers and C<ev_io_start> for I/O watchers.
972 1066
973A watcher is a structure that you create and register to record your 1067A watcher is an opaque structure that you allocate and register to record
974interest in some event. For instance, if you want to wait for STDIN to 1068your interest in some event. To make a concrete example, imagine you want
975become readable, you would create an C<ev_io> watcher for that: 1069to wait for STDIN to become readable, you would create an C<ev_io> watcher
1070for that:
976 1071
977 static void my_cb (struct ev_loop *loop, ev_io *w, int revents) 1072 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
978 { 1073 {
979 ev_io_stop (w); 1074 ev_io_stop (w);
980 ev_unloop (loop, EVUNLOOP_ALL); 1075 ev_break (loop, EVBREAK_ALL);
981 } 1076 }
982 1077
983 struct ev_loop *loop = ev_default_loop (0); 1078 struct ev_loop *loop = ev_default_loop (0);
984 1079
985 ev_io stdin_watcher; 1080 ev_io stdin_watcher;
986 1081
987 ev_init (&stdin_watcher, my_cb); 1082 ev_init (&stdin_watcher, my_cb);
988 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 1083 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
989 ev_io_start (loop, &stdin_watcher); 1084 ev_io_start (loop, &stdin_watcher);
990 1085
991 ev_loop (loop, 0); 1086 ev_run (loop, 0);
992 1087
993As you can see, you are responsible for allocating the memory for your 1088As you can see, you are responsible for allocating the memory for your
994watcher structures (and it is I<usually> a bad idea to do this on the 1089watcher structures (and it is I<usually> a bad idea to do this on the
995stack). 1090stack).
996 1091
997Each watcher has an associated watcher structure (called C<struct ev_TYPE> 1092Each watcher has an associated watcher structure (called C<struct ev_TYPE>
998or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). 1093or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
999 1094
1000Each watcher structure must be initialised by a call to C<ev_init 1095Each watcher structure must be initialised by a call to C<ev_init (watcher
1001(watcher *, callback)>, which expects a callback to be provided. This 1096*, callback)>, which expects a callback to be provided. This callback is
1002callback gets invoked each time the event occurs (or, in the case of I/O 1097invoked each time the event occurs (or, in the case of I/O watchers, each
1003watchers, each time the event loop detects that the file descriptor given 1098time the event loop detects that the file descriptor given is readable
1004is readable and/or writable). 1099and/or writable).
1005 1100
1006Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> 1101Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
1007macro to configure it, with arguments specific to the watcher type. There 1102macro to configure it, with arguments specific to the watcher type. There
1008is also a macro to combine initialisation and setting in one call: C<< 1103is also a macro to combine initialisation and setting in one call: C<<
1009ev_TYPE_init (watcher *, callback, ...) >>. 1104ev_TYPE_init (watcher *, callback, ...) >>.
1032=item C<EV_WRITE> 1127=item C<EV_WRITE>
1033 1128
1034The file descriptor in the C<ev_io> watcher has become readable and/or 1129The file descriptor in the C<ev_io> watcher has become readable and/or
1035writable. 1130writable.
1036 1131
1037=item C<EV_TIMEOUT> 1132=item C<EV_TIMER>
1038 1133
1039The C<ev_timer> watcher has timed out. 1134The C<ev_timer> watcher has timed out.
1040 1135
1041=item C<EV_PERIODIC> 1136=item C<EV_PERIODIC>
1042 1137
1060 1155
1061=item C<EV_PREPARE> 1156=item C<EV_PREPARE>
1062 1157
1063=item C<EV_CHECK> 1158=item C<EV_CHECK>
1064 1159
1065All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts 1160All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
1066to gather new events, and all C<ev_check> watchers are invoked just after 1161to gather new events, and all C<ev_check> watchers are invoked just after
1067C<ev_loop> has gathered them, but before it invokes any callbacks for any 1162C<ev_run> has gathered them, but before it invokes any callbacks for any
1068received events. Callbacks of both watcher types can start and stop as 1163received events. Callbacks of both watcher types can start and stop as
1069many watchers as they want, and all of them will be taken into account 1164many watchers as they want, and all of them will be taken into account
1070(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1165(for example, a C<ev_prepare> watcher might start an idle watcher to keep
1071C<ev_loop> from blocking). 1166C<ev_run> from blocking).
1072 1167
1073=item C<EV_EMBED> 1168=item C<EV_EMBED>
1074 1169
1075The embedded event loop specified in the C<ev_embed> watcher needs attention. 1170The embedded event loop specified in the C<ev_embed> watcher needs attention.
1076 1171
1077=item C<EV_FORK> 1172=item C<EV_FORK>
1078 1173
1079The event loop has been resumed in the child process after fork (see 1174The event loop has been resumed in the child process after fork (see
1080C<ev_fork>). 1175C<ev_fork>).
1176
1177=item C<EV_CLEANUP>
1178
1179The event loop is about to be destroyed (see C<ev_cleanup>).
1081 1180
1082=item C<EV_ASYNC> 1181=item C<EV_ASYNC>
1083 1182
1084The given async watcher has been asynchronously notified (see C<ev_async>). 1183The given async watcher has been asynchronously notified (see C<ev_async>).
1085 1184
1257 1356
1258See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1357See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1259functions that do not need a watcher. 1358functions that do not need a watcher.
1260 1359
1261=back 1360=back
1262
1263 1361
1264=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1265 1363
1266Each watcher has, by default, a member C<void *data> that you can change 1364Each watcher has, by default, a member C<void *data> that you can change
1267and read at any time: libev will completely ignore it. This can be used 1365and read at any time: libev will completely ignore it. This can be used
1323 t2_cb (EV_P_ ev_timer *w, int revents) 1421 t2_cb (EV_P_ ev_timer *w, int revents)
1324 { 1422 {
1325 struct my_biggy big = (struct my_biggy *) 1423 struct my_biggy big = (struct my_biggy *)
1326 (((char *)w) - offsetof (struct my_biggy, t2)); 1424 (((char *)w) - offsetof (struct my_biggy, t2));
1327 } 1425 }
1426
1427=head2 WATCHER STATES
1428
1429There are various watcher states mentioned throughout this manual -
1430active, pending and so on. In this section these states and the rules to
1431transition between them will be described in more detail - and while these
1432rules might look complicated, they usually do "the right thing".
1433
1434=over 4
1435
1436=item initialiased
1437
1438Before a watcher can be registered with the event looop it has to be
1439initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1440C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1441
1442In this state it is simply some block of memory that is suitable for use
1443in an event loop. It can be moved around, freed, reused etc. at will.
1444
1445=item started/running/active
1446
1447Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1448property of the event loop, and is actively waiting for events. While in
1449this state it cannot be accessed (except in a few documented ways), moved,
1450freed or anything else - the only legal thing is to keep a pointer to it,
1451and call libev functions on it that are documented to work on active watchers.
1452
1453=item pending
1454
1455If a watcher is active and libev determines that an event it is interested
1456in has occurred (such as a timer expiring), it will become pending. It will
1457stay in this pending state until either it is stopped or its callback is
1458about to be invoked, so it is not normally pending inside the watcher
1459callback.
1460
1461The watcher might or might not be active while it is pending (for example,
1462an expired non-repeating timer can be pending but no longer active). If it
1463is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1464but it is still property of the event loop at this time, so cannot be
1465moved, freed or reused. And if it is active the rules described in the
1466previous item still apply.
1467
1468It is also possible to feed an event on a watcher that is not active (e.g.
1469via C<ev_feed_event>), in which case it becomes pending without being
1470active.
1471
1472=item stopped
1473
1474A watcher can be stopped implicitly by libev (in which case it might still
1475be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1476latter will clear any pending state the watcher might be in, regardless
1477of whether it was active or not, so stopping a watcher explicitly before
1478freeing it is often a good idea.
1479
1480While stopped (and not pending) the watcher is essentially in the
1481initialised state, that is it can be reused, moved, modified in any way
1482you wish.
1483
1484=back
1328 1485
1329=head2 WATCHER PRIORITY MODELS 1486=head2 WATCHER PRIORITY MODELS
1330 1487
1331Many event loops support I<watcher priorities>, which are usually small 1488Many event loops support I<watcher priorities>, which are usually small
1332integers that influence the ordering of event callback invocation 1489integers that influence the ordering of event callback invocation
1375 1532
1376For example, to emulate how many other event libraries handle priorities, 1533For example, to emulate how many other event libraries handle priorities,
1377you can associate an C<ev_idle> watcher to each such watcher, and in 1534you can associate an C<ev_idle> watcher to each such watcher, and in
1378the normal watcher callback, you just start the idle watcher. The real 1535the normal watcher callback, you just start the idle watcher. The real
1379processing is done in the idle watcher callback. This causes libev to 1536processing is done in the idle watcher callback. This causes libev to
1380continously poll and process kernel event data for the watcher, but when 1537continuously poll and process kernel event data for the watcher, but when
1381the lock-out case is known to be rare (which in turn is rare :), this is 1538the lock-out case is known to be rare (which in turn is rare :), this is
1382workable. 1539workable.
1383 1540
1384Usually, however, the lock-out model implemented that way will perform 1541Usually, however, the lock-out model implemented that way will perform
1385miserably under the type of load it was designed to handle. In that case, 1542miserably under the type of load it was designed to handle. In that case,
1399 { 1556 {
1400 // stop the I/O watcher, we received the event, but 1557 // stop the I/O watcher, we received the event, but
1401 // are not yet ready to handle it. 1558 // are not yet ready to handle it.
1402 ev_io_stop (EV_A_ w); 1559 ev_io_stop (EV_A_ w);
1403 1560
1404 // start the idle watcher to ahndle the actual event. 1561 // start the idle watcher to handle the actual event.
1405 // it will not be executed as long as other watchers 1562 // it will not be executed as long as other watchers
1406 // with the default priority are receiving events. 1563 // with the default priority are receiving events.
1407 ev_idle_start (EV_A_ &idle); 1564 ev_idle_start (EV_A_ &idle);
1408 } 1565 }
1409 1566
1459In general you can register as many read and/or write event watchers per 1616In general you can register as many read and/or write event watchers per
1460fd as you want (as long as you don't confuse yourself). Setting all file 1617fd as you want (as long as you don't confuse yourself). Setting all file
1461descriptors to non-blocking mode is also usually a good idea (but not 1618descriptors to non-blocking mode is also usually a good idea (but not
1462required if you know what you are doing). 1619required if you know what you are doing).
1463 1620
1464If you cannot use non-blocking mode, then force the use of a
1465known-to-be-good backend (at the time of this writing, this includes only
1466C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1467descriptors for which non-blocking operation makes no sense (such as
1468files) - libev doesn't guarentee any specific behaviour in that case.
1469
1470Another thing you have to watch out for is that it is quite easy to 1621Another thing you have to watch out for is that it is quite easy to
1471receive "spurious" readiness notifications, that is your callback might 1622receive "spurious" readiness notifications, that is, your callback might
1472be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1623be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1473because there is no data. Not only are some backends known to create a 1624because there is no data. It is very easy to get into this situation even
1474lot of those (for example Solaris ports), it is very easy to get into 1625with a relatively standard program structure. Thus it is best to always
1475this situation even with a relatively standard program structure. Thus 1626use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1476it is best to always use non-blocking I/O: An extra C<read>(2) returning
1477C<EAGAIN> is far preferable to a program hanging until some data arrives. 1627preferable to a program hanging until some data arrives.
1478 1628
1479If you cannot run the fd in non-blocking mode (for example you should 1629If you cannot run the fd in non-blocking mode (for example you should
1480not play around with an Xlib connection), then you have to separately 1630not play around with an Xlib connection), then you have to separately
1481re-test whether a file descriptor is really ready with a known-to-be good 1631re-test whether a file descriptor is really ready with a known-to-be good
1482interface such as poll (fortunately in our Xlib example, Xlib already 1632interface such as poll (fortunately in the case of Xlib, it already does
1483does this on its own, so its quite safe to use). Some people additionally 1633this on its own, so its quite safe to use). Some people additionally
1484use C<SIGALRM> and an interval timer, just to be sure you won't block 1634use C<SIGALRM> and an interval timer, just to be sure you won't block
1485indefinitely. 1635indefinitely.
1486 1636
1487But really, best use non-blocking mode. 1637But really, best use non-blocking mode.
1488 1638
1516 1666
1517There is no workaround possible except not registering events 1667There is no workaround possible except not registering events
1518for potentially C<dup ()>'ed file descriptors, or to resort to 1668for potentially C<dup ()>'ed file descriptors, or to resort to
1519C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1669C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1520 1670
1671=head3 The special problem of files
1672
1673Many people try to use C<select> (or libev) on file descriptors
1674representing files, and expect it to become ready when their program
1675doesn't block on disk accesses (which can take a long time on their own).
1676
1677However, this cannot ever work in the "expected" way - you get a readiness
1678notification as soon as the kernel knows whether and how much data is
1679there, and in the case of open files, that's always the case, so you
1680always get a readiness notification instantly, and your read (or possibly
1681write) will still block on the disk I/O.
1682
1683Another way to view it is that in the case of sockets, pipes, character
1684devices and so on, there is another party (the sender) that delivers data
1685on it's own, but in the case of files, there is no such thing: the disk
1686will not send data on it's own, simply because it doesn't know what you
1687wish to read - you would first have to request some data.
1688
1689Since files are typically not-so-well supported by advanced notification
1690mechanism, libev tries hard to emulate POSIX behaviour with respect
1691to files, even though you should not use it. The reason for this is
1692convenience: sometimes you want to watch STDIN or STDOUT, which is
1693usually a tty, often a pipe, but also sometimes files or special devices
1694(for example, C<epoll> on Linux works with F</dev/random> but not with
1695F</dev/urandom>), and even though the file might better be served with
1696asynchronous I/O instead of with non-blocking I/O, it is still useful when
1697it "just works" instead of freezing.
1698
1699So avoid file descriptors pointing to files when you know it (e.g. use
1700libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
1701when you rarely read from a file instead of from a socket, and want to
1702reuse the same code path.
1703
1521=head3 The special problem of fork 1704=head3 The special problem of fork
1522 1705
1523Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1706Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1524useless behaviour. Libev fully supports fork, but needs to be told about 1707useless behaviour. Libev fully supports fork, but needs to be told about
1525it in the child. 1708it in the child if you want to continue to use it in the child.
1526 1709
1527To support fork in your programs, you either have to call 1710To support fork in your child processes, you have to call C<ev_loop_fork
1528C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1711()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1529enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1712C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1530C<EVBACKEND_POLL>.
1531 1713
1532=head3 The special problem of SIGPIPE 1714=head3 The special problem of SIGPIPE
1533 1715
1534While not really specific to libev, it is easy to forget about C<SIGPIPE>: 1716While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1535when writing to a pipe whose other end has been closed, your program gets 1717when writing to a pipe whose other end has been closed, your program gets
1541somewhere, as that would have given you a big clue). 1723somewhere, as that would have given you a big clue).
1542 1724
1543=head3 The special problem of accept()ing when you can't 1725=head3 The special problem of accept()ing when you can't
1544 1726
1545Many implementations of the POSIX C<accept> function (for example, 1727Many implementations of the POSIX C<accept> function (for example,
1546found in port-2004 Linux) have the peculiar behaviour of not removing a 1728found in post-2004 Linux) have the peculiar behaviour of not removing a
1547connection from the pending queue in all error cases. 1729connection from the pending queue in all error cases.
1548 1730
1549For example, larger servers often run out of file descriptors (because 1731For example, larger servers often run out of file descriptors (because
1550of resource limits), causing C<accept> to fail with C<ENFILE> but not 1732of resource limits), causing C<accept> to fail with C<ENFILE> but not
1551rejecting the connection, leading to libev signalling readiness on 1733rejecting the connection, leading to libev signalling readiness on
1617 ... 1799 ...
1618 struct ev_loop *loop = ev_default_init (0); 1800 struct ev_loop *loop = ev_default_init (0);
1619 ev_io stdin_readable; 1801 ev_io stdin_readable;
1620 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1802 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1621 ev_io_start (loop, &stdin_readable); 1803 ev_io_start (loop, &stdin_readable);
1622 ev_loop (loop, 0); 1804 ev_run (loop, 0);
1623 1805
1624 1806
1625=head2 C<ev_timer> - relative and optionally repeating timeouts 1807=head2 C<ev_timer> - relative and optionally repeating timeouts
1626 1808
1627Timer watchers are simple relative timers that generate an event after a 1809Timer watchers are simple relative timers that generate an event after a
1636The callback is guaranteed to be invoked only I<after> its timeout has 1818The callback is guaranteed to be invoked only I<after> its timeout has
1637passed (not I<at>, so on systems with very low-resolution clocks this 1819passed (not I<at>, so on systems with very low-resolution clocks this
1638might introduce a small delay). If multiple timers become ready during the 1820might introduce a small delay). If multiple timers become ready during the
1639same loop iteration then the ones with earlier time-out values are invoked 1821same loop iteration then the ones with earlier time-out values are invoked
1640before ones of the same priority with later time-out values (but this is 1822before ones of the same priority with later time-out values (but this is
1641no longer true when a callback calls C<ev_loop> recursively). 1823no longer true when a callback calls C<ev_run> recursively).
1642 1824
1643=head3 Be smart about timeouts 1825=head3 Be smart about timeouts
1644 1826
1645Many real-world problems involve some kind of timeout, usually for error 1827Many real-world problems involve some kind of timeout, usually for error
1646recovery. A typical example is an HTTP request - if the other side hangs, 1828recovery. A typical example is an HTTP request - if the other side hangs,
1732 ev_tstamp timeout = last_activity + 60.; 1914 ev_tstamp timeout = last_activity + 60.;
1733 1915
1734 // if last_activity + 60. is older than now, we did time out 1916 // if last_activity + 60. is older than now, we did time out
1735 if (timeout < now) 1917 if (timeout < now)
1736 { 1918 {
1737 // timeout occured, take action 1919 // timeout occurred, take action
1738 } 1920 }
1739 else 1921 else
1740 { 1922 {
1741 // callback was invoked, but there was some activity, re-arm 1923 // callback was invoked, but there was some activity, re-arm
1742 // the watcher to fire in last_activity + 60, which is 1924 // the watcher to fire in last_activity + 60, which is
1764to the current time (meaning we just have some activity :), then call the 1946to the current time (meaning we just have some activity :), then call the
1765callback, which will "do the right thing" and start the timer: 1947callback, which will "do the right thing" and start the timer:
1766 1948
1767 ev_init (timer, callback); 1949 ev_init (timer, callback);
1768 last_activity = ev_now (loop); 1950 last_activity = ev_now (loop);
1769 callback (loop, timer, EV_TIMEOUT); 1951 callback (loop, timer, EV_TIMER);
1770 1952
1771And when there is some activity, simply store the current time in 1953And when there is some activity, simply store the current time in
1772C<last_activity>, no libev calls at all: 1954C<last_activity>, no libev calls at all:
1773 1955
1774 last_actiivty = ev_now (loop); 1956 last_activity = ev_now (loop);
1775 1957
1776This technique is slightly more complex, but in most cases where the 1958This technique is slightly more complex, but in most cases where the
1777time-out is unlikely to be triggered, much more efficient. 1959time-out is unlikely to be triggered, much more efficient.
1778 1960
1779Changing the timeout is trivial as well (if it isn't hard-coded in the 1961Changing the timeout is trivial as well (if it isn't hard-coded in the
1817 1999
1818=head3 The special problem of time updates 2000=head3 The special problem of time updates
1819 2001
1820Establishing the current time is a costly operation (it usually takes at 2002Establishing the current time is a costly operation (it usually takes at
1821least two system calls): EV therefore updates its idea of the current 2003least two system calls): EV therefore updates its idea of the current
1822time only before and after C<ev_loop> collects new events, which causes a 2004time only before and after C<ev_run> collects new events, which causes a
1823growing difference between C<ev_now ()> and C<ev_time ()> when handling 2005growing difference between C<ev_now ()> and C<ev_time ()> when handling
1824lots of events in one iteration. 2006lots of events in one iteration.
1825 2007
1826The relative timeouts are calculated relative to the C<ev_now ()> 2008The relative timeouts are calculated relative to the C<ev_now ()>
1827time. This is usually the right thing as this timestamp refers to the time 2009time. This is usually the right thing as this timestamp refers to the time
1944 } 2126 }
1945 2127
1946 ev_timer mytimer; 2128 ev_timer mytimer;
1947 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2129 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1948 ev_timer_again (&mytimer); /* start timer */ 2130 ev_timer_again (&mytimer); /* start timer */
1949 ev_loop (loop, 0); 2131 ev_run (loop, 0);
1950 2132
1951 // and in some piece of code that gets executed on any "activity": 2133 // and in some piece of code that gets executed on any "activity":
1952 // reset the timeout to start ticking again at 10 seconds 2134 // reset the timeout to start ticking again at 10 seconds
1953 ev_timer_again (&mytimer); 2135 ev_timer_again (&mytimer);
1954 2136
1980 2162
1981As with timers, the callback is guaranteed to be invoked only when the 2163As with timers, the callback is guaranteed to be invoked only when the
1982point in time where it is supposed to trigger has passed. If multiple 2164point in time where it is supposed to trigger has passed. If multiple
1983timers become ready during the same loop iteration then the ones with 2165timers become ready during the same loop iteration then the ones with
1984earlier time-out values are invoked before ones with later time-out values 2166earlier time-out values are invoked before ones with later time-out values
1985(but this is no longer true when a callback calls C<ev_loop> recursively). 2167(but this is no longer true when a callback calls C<ev_run> recursively).
1986 2168
1987=head3 Watcher-Specific Functions and Data Members 2169=head3 Watcher-Specific Functions and Data Members
1988 2170
1989=over 4 2171=over 4
1990 2172
2118Example: Call a callback every hour, or, more precisely, whenever the 2300Example: Call a callback every hour, or, more precisely, whenever the
2119system time is divisible by 3600. The callback invocation times have 2301system time is divisible by 3600. The callback invocation times have
2120potentially a lot of jitter, but good long-term stability. 2302potentially a lot of jitter, but good long-term stability.
2121 2303
2122 static void 2304 static void
2123 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2305 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
2124 { 2306 {
2125 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2307 ... its now a full hour (UTC, or TAI or whatever your clock follows)
2126 } 2308 }
2127 2309
2128 ev_periodic hourly_tick; 2310 ev_periodic hourly_tick;
2151 2333
2152=head2 C<ev_signal> - signal me when a signal gets signalled! 2334=head2 C<ev_signal> - signal me when a signal gets signalled!
2153 2335
2154Signal watchers will trigger an event when the process receives a specific 2336Signal watchers will trigger an event when the process receives a specific
2155signal one or more times. Even though signals are very asynchronous, libev 2337signal one or more times. Even though signals are very asynchronous, libev
2156will try it's best to deliver signals synchronously, i.e. as part of the 2338will try its best to deliver signals synchronously, i.e. as part of the
2157normal event processing, like any other event. 2339normal event processing, like any other event.
2158 2340
2159If you want signals to be delivered truly asynchronously, just use 2341If you want signals to be delivered truly asynchronously, just use
2160C<sigaction> as you would do without libev and forget about sharing 2342C<sigaction> as you would do without libev and forget about sharing
2161the signal. You can even use C<ev_async> from a signal handler to 2343the signal. You can even use C<ev_async> from a signal handler to
2204 2386
2205So I can't stress this enough: I<If you do not reset your signal mask when 2387So I can't stress this enough: I<If you do not reset your signal mask when
2206you expect it to be empty, you have a race condition in your code>. This 2388you expect it to be empty, you have a race condition in your code>. This
2207is not a libev-specific thing, this is true for most event libraries. 2389is not a libev-specific thing, this is true for most event libraries.
2208 2390
2391=head3 The special problem of threads signal handling
2392
2393POSIX threads has problematic signal handling semantics, specifically,
2394a lot of functionality (sigfd, sigwait etc.) only really works if all
2395threads in a process block signals, which is hard to achieve.
2396
2397When you want to use sigwait (or mix libev signal handling with your own
2398for the same signals), you can tackle this problem by globally blocking
2399all signals before creating any threads (or creating them with a fully set
2400sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
2401loops. Then designate one thread as "signal receiver thread" which handles
2402these signals. You can pass on any signals that libev might be interested
2403in by calling C<ev_feed_signal>.
2404
2209=head3 Watcher-Specific Functions and Data Members 2405=head3 Watcher-Specific Functions and Data Members
2210 2406
2211=over 4 2407=over 4
2212 2408
2213=item ev_signal_init (ev_signal *, callback, int signum) 2409=item ev_signal_init (ev_signal *, callback, int signum)
2228Example: Try to exit cleanly on SIGINT. 2424Example: Try to exit cleanly on SIGINT.
2229 2425
2230 static void 2426 static void
2231 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2427 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2232 { 2428 {
2233 ev_unloop (loop, EVUNLOOP_ALL); 2429 ev_break (loop, EVBREAK_ALL);
2234 } 2430 }
2235 2431
2236 ev_signal signal_watcher; 2432 ev_signal signal_watcher;
2237 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2433 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2238 ev_signal_start (loop, &signal_watcher); 2434 ev_signal_start (loop, &signal_watcher);
2624 2820
2625Prepare and check watchers are usually (but not always) used in pairs: 2821Prepare and check watchers are usually (but not always) used in pairs:
2626prepare watchers get invoked before the process blocks and check watchers 2822prepare watchers get invoked before the process blocks and check watchers
2627afterwards. 2823afterwards.
2628 2824
2629You I<must not> call C<ev_loop> or similar functions that enter 2825You I<must not> call C<ev_run> or similar functions that enter
2630the current event loop from either C<ev_prepare> or C<ev_check> 2826the current event loop from either C<ev_prepare> or C<ev_check>
2631watchers. Other loops than the current one are fine, however. The 2827watchers. Other loops than the current one are fine, however. The
2632rationale behind this is that you do not need to check for recursion in 2828rationale behind this is that you do not need to check for recursion in
2633those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2829those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2634C<ev_check> so if you have one watcher of each kind they will always be 2830C<ev_check> so if you have one watcher of each kind they will always be
2802 2998
2803 if (timeout >= 0) 2999 if (timeout >= 0)
2804 // create/start timer 3000 // create/start timer
2805 3001
2806 // poll 3002 // poll
2807 ev_loop (EV_A_ 0); 3003 ev_run (EV_A_ 0);
2808 3004
2809 // stop timer again 3005 // stop timer again
2810 if (timeout >= 0) 3006 if (timeout >= 0)
2811 ev_timer_stop (EV_A_ &to); 3007 ev_timer_stop (EV_A_ &to);
2812 3008
2890if you do not want that, you need to temporarily stop the embed watcher). 3086if you do not want that, you need to temporarily stop the embed watcher).
2891 3087
2892=item ev_embed_sweep (loop, ev_embed *) 3088=item ev_embed_sweep (loop, ev_embed *)
2893 3089
2894Make a single, non-blocking sweep over the embedded loop. This works 3090Make a single, non-blocking sweep over the embedded loop. This works
2895similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 3091similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2896appropriate way for embedded loops. 3092appropriate way for embedded loops.
2897 3093
2898=item struct ev_loop *other [read-only] 3094=item struct ev_loop *other [read-only]
2899 3095
2900The embedded event loop. 3096The embedded event loop.
2960C<ev_default_fork> cheats and calls it in the wrong process, the fork 3156C<ev_default_fork> cheats and calls it in the wrong process, the fork
2961handlers will be invoked, too, of course. 3157handlers will be invoked, too, of course.
2962 3158
2963=head3 The special problem of life after fork - how is it possible? 3159=head3 The special problem of life after fork - how is it possible?
2964 3160
2965Most uses of C<fork()> consist of forking, then some simple calls to ste 3161Most uses of C<fork()> consist of forking, then some simple calls to set
2966up/change the process environment, followed by a call to C<exec()>. This 3162up/change the process environment, followed by a call to C<exec()>. This
2967sequence should be handled by libev without any problems. 3163sequence should be handled by libev without any problems.
2968 3164
2969This changes when the application actually wants to do event handling 3165This changes when the application actually wants to do event handling
2970in the child, or both parent in child, in effect "continuing" after the 3166in the child, or both parent in child, in effect "continuing" after the
2986disadvantage of having to use multiple event loops (which do not support 3182disadvantage of having to use multiple event loops (which do not support
2987signal watchers). 3183signal watchers).
2988 3184
2989When this is not possible, or you want to use the default loop for 3185When this is not possible, or you want to use the default loop for
2990other reasons, then in the process that wants to start "fresh", call 3186other reasons, then in the process that wants to start "fresh", call
2991C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying 3187C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
2992the default loop will "orphan" (not stop) all registered watchers, so you 3188Destroying the default loop will "orphan" (not stop) all registered
2993have to be careful not to execute code that modifies those watchers. Note 3189watchers, so you have to be careful not to execute code that modifies
2994also that in that case, you have to re-register any signal watchers. 3190those watchers. Note also that in that case, you have to re-register any
3191signal watchers.
2995 3192
2996=head3 Watcher-Specific Functions and Data Members 3193=head3 Watcher-Specific Functions and Data Members
2997 3194
2998=over 4 3195=over 4
2999 3196
3000=item ev_fork_init (ev_signal *, callback) 3197=item ev_fork_init (ev_fork *, callback)
3001 3198
3002Initialises and configures the fork watcher - it has no parameters of any 3199Initialises and configures the fork watcher - it has no parameters of any
3003kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 3200kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3004believe me. 3201really.
3005 3202
3006=back 3203=back
3007 3204
3008 3205
3206=head2 C<ev_cleanup> - even the best things end
3207
3208Cleanup watchers are called just before the event loop is being destroyed
3209by a call to C<ev_loop_destroy>.
3210
3211While there is no guarantee that the event loop gets destroyed, cleanup
3212watchers provide a convenient method to install cleanup hooks for your
3213program, worker threads and so on - you just to make sure to destroy the
3214loop when you want them to be invoked.
3215
3216Cleanup watchers are invoked in the same way as any other watcher. Unlike
3217all other watchers, they do not keep a reference to the event loop (which
3218makes a lot of sense if you think about it). Like all other watchers, you
3219can call libev functions in the callback, except C<ev_cleanup_start>.
3220
3221=head3 Watcher-Specific Functions and Data Members
3222
3223=over 4
3224
3225=item ev_cleanup_init (ev_cleanup *, callback)
3226
3227Initialises and configures the cleanup watcher - it has no parameters of
3228any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3229pointless, I assure you.
3230
3231=back
3232
3233Example: Register an atexit handler to destroy the default loop, so any
3234cleanup functions are called.
3235
3236 static void
3237 program_exits (void)
3238 {
3239 ev_loop_destroy (EV_DEFAULT_UC);
3240 }
3241
3242 ...
3243 atexit (program_exits);
3244
3245
3009=head2 C<ev_async> - how to wake up another event loop 3246=head2 C<ev_async> - how to wake up an event loop
3010 3247
3011In general, you cannot use an C<ev_loop> from multiple threads or other 3248In general, you cannot use an C<ev_run> from multiple threads or other
3012asynchronous sources such as signal handlers (as opposed to multiple event 3249asynchronous sources such as signal handlers (as opposed to multiple event
3013loops - those are of course safe to use in different threads). 3250loops - those are of course safe to use in different threads).
3014 3251
3015Sometimes, however, you need to wake up another event loop you do not 3252Sometimes, however, you need to wake up an event loop you do not control,
3016control, for example because it belongs to another thread. This is what 3253for example because it belongs to another thread. This is what C<ev_async>
3017C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3254watchers do: as long as the C<ev_async> watcher is active, you can signal
3018can signal it by calling C<ev_async_send>, which is thread- and signal 3255it by calling C<ev_async_send>, which is thread- and signal safe.
3019safe.
3020 3256
3021This functionality is very similar to C<ev_signal> watchers, as signals, 3257This functionality is very similar to C<ev_signal> watchers, as signals,
3022too, are asynchronous in nature, and signals, too, will be compressed 3258too, are asynchronous in nature, and signals, too, will be compressed
3023(i.e. the number of callback invocations may be less than the number of 3259(i.e. the number of callback invocations may be less than the number of
3024C<ev_async_sent> calls). 3260C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3261of "global async watchers" by using a watcher on an otherwise unused
3262signal, and C<ev_feed_signal> to signal this watcher from another thread,
3263even without knowing which loop owns the signal.
3025 3264
3026Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not 3265Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3027just the default loop. 3266just the default loop.
3028 3267
3029=head3 Queueing 3268=head3 Queueing
3179 3418
3180If C<timeout> is less than 0, then no timeout watcher will be 3419If C<timeout> is less than 0, then no timeout watcher will be
3181started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 3420started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
3182repeat = 0) will be started. C<0> is a valid timeout. 3421repeat = 0) will be started. C<0> is a valid timeout.
3183 3422
3184The callback has the type C<void (*cb)(int revents, void *arg)> and gets 3423The callback has the type C<void (*cb)(int revents, void *arg)> and is
3185passed an C<revents> set like normal event callbacks (a combination of 3424passed an C<revents> set like normal event callbacks (a combination of
3186C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 3425C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
3187value passed to C<ev_once>. Note that it is possible to receive I<both> 3426value passed to C<ev_once>. Note that it is possible to receive I<both>
3188a timeout and an io event at the same time - you probably should give io 3427a timeout and an io event at the same time - you probably should give io
3189events precedence. 3428events precedence.
3190 3429
3191Example: wait up to ten seconds for data to appear on STDIN_FILENO. 3430Example: wait up to ten seconds for data to appear on STDIN_FILENO.
3192 3431
3193 static void stdin_ready (int revents, void *arg) 3432 static void stdin_ready (int revents, void *arg)
3194 { 3433 {
3195 if (revents & EV_READ) 3434 if (revents & EV_READ)
3196 /* stdin might have data for us, joy! */; 3435 /* stdin might have data for us, joy! */;
3197 else if (revents & EV_TIMEOUT) 3436 else if (revents & EV_TIMER)
3198 /* doh, nothing entered */; 3437 /* doh, nothing entered */;
3199 } 3438 }
3200 3439
3201 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3440 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3202 3441
3205Feed an event on the given fd, as if a file descriptor backend detected 3444Feed an event on the given fd, as if a file descriptor backend detected
3206the given events it. 3445the given events it.
3207 3446
3208=item ev_feed_signal_event (loop, int signum) 3447=item ev_feed_signal_event (loop, int signum)
3209 3448
3210Feed an event as if the given signal occurred (C<loop> must be the default 3449Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3211loop!). 3450which is async-safe.
3451
3452=back
3453
3454
3455=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3456
3457This section explains some common idioms that are not immediately
3458obvious. Note that examples are sprinkled over the whole manual, and this
3459section only contains stuff that wouldn't fit anywhere else.
3460
3461=over 4
3462
3463=item Model/nested event loop invocations and exit conditions.
3464
3465Often (especially in GUI toolkits) there are places where you have
3466I<modal> interaction, which is most easily implemented by recursively
3467invoking C<ev_run>.
3468
3469This brings the problem of exiting - a callback might want to finish the
3470main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3471a modal "Are you sure?" dialog is still waiting), or just the nested one
3472and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3473other combination: In these cases, C<ev_break> will not work alone.
3474
3475The solution is to maintain "break this loop" variable for each C<ev_run>
3476invocation, and use a loop around C<ev_run> until the condition is
3477triggered, using C<EVRUN_ONCE>:
3478
3479 // main loop
3480 int exit_main_loop = 0;
3481
3482 while (!exit_main_loop)
3483 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3484
3485 // in a model watcher
3486 int exit_nested_loop = 0;
3487
3488 while (!exit_nested_loop)
3489 ev_run (EV_A_ EVRUN_ONCE);
3490
3491To exit from any of these loops, just set the corresponding exit variable:
3492
3493 // exit modal loop
3494 exit_nested_loop = 1;
3495
3496 // exit main program, after modal loop is finished
3497 exit_main_loop = 1;
3498
3499 // exit both
3500 exit_main_loop = exit_nested_loop = 1;
3501
3502=item Thread locking example
3503
3504Here is a fictitious example of how to run an event loop in a different
3505thread than where callbacks are being invoked and watchers are
3506created/added/removed.
3507
3508For a real-world example, see the C<EV::Loop::Async> perl module,
3509which uses exactly this technique (which is suited for many high-level
3510languages).
3511
3512The example uses a pthread mutex to protect the loop data, a condition
3513variable to wait for callback invocations, an async watcher to notify the
3514event loop thread and an unspecified mechanism to wake up the main thread.
3515
3516First, you need to associate some data with the event loop:
3517
3518 typedef struct {
3519 mutex_t lock; /* global loop lock */
3520 ev_async async_w;
3521 thread_t tid;
3522 cond_t invoke_cv;
3523 } userdata;
3524
3525 void prepare_loop (EV_P)
3526 {
3527 // for simplicity, we use a static userdata struct.
3528 static userdata u;
3529
3530 ev_async_init (&u->async_w, async_cb);
3531 ev_async_start (EV_A_ &u->async_w);
3532
3533 pthread_mutex_init (&u->lock, 0);
3534 pthread_cond_init (&u->invoke_cv, 0);
3535
3536 // now associate this with the loop
3537 ev_set_userdata (EV_A_ u);
3538 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3539 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3540
3541 // then create the thread running ev_loop
3542 pthread_create (&u->tid, 0, l_run, EV_A);
3543 }
3544
3545The callback for the C<ev_async> watcher does nothing: the watcher is used
3546solely to wake up the event loop so it takes notice of any new watchers
3547that might have been added:
3548
3549 static void
3550 async_cb (EV_P_ ev_async *w, int revents)
3551 {
3552 // just used for the side effects
3553 }
3554
3555The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
3556protecting the loop data, respectively.
3557
3558 static void
3559 l_release (EV_P)
3560 {
3561 userdata *u = ev_userdata (EV_A);
3562 pthread_mutex_unlock (&u->lock);
3563 }
3564
3565 static void
3566 l_acquire (EV_P)
3567 {
3568 userdata *u = ev_userdata (EV_A);
3569 pthread_mutex_lock (&u->lock);
3570 }
3571
3572The event loop thread first acquires the mutex, and then jumps straight
3573into C<ev_run>:
3574
3575 void *
3576 l_run (void *thr_arg)
3577 {
3578 struct ev_loop *loop = (struct ev_loop *)thr_arg;
3579
3580 l_acquire (EV_A);
3581 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
3582 ev_run (EV_A_ 0);
3583 l_release (EV_A);
3584
3585 return 0;
3586 }
3587
3588Instead of invoking all pending watchers, the C<l_invoke> callback will
3589signal the main thread via some unspecified mechanism (signals? pipe
3590writes? C<Async::Interrupt>?) and then waits until all pending watchers
3591have been called (in a while loop because a) spurious wakeups are possible
3592and b) skipping inter-thread-communication when there are no pending
3593watchers is very beneficial):
3594
3595 static void
3596 l_invoke (EV_P)
3597 {
3598 userdata *u = ev_userdata (EV_A);
3599
3600 while (ev_pending_count (EV_A))
3601 {
3602 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
3603 pthread_cond_wait (&u->invoke_cv, &u->lock);
3604 }
3605 }
3606
3607Now, whenever the main thread gets told to invoke pending watchers, it
3608will grab the lock, call C<ev_invoke_pending> and then signal the loop
3609thread to continue:
3610
3611 static void
3612 real_invoke_pending (EV_P)
3613 {
3614 userdata *u = ev_userdata (EV_A);
3615
3616 pthread_mutex_lock (&u->lock);
3617 ev_invoke_pending (EV_A);
3618 pthread_cond_signal (&u->invoke_cv);
3619 pthread_mutex_unlock (&u->lock);
3620 }
3621
3622Whenever you want to start/stop a watcher or do other modifications to an
3623event loop, you will now have to lock:
3624
3625 ev_timer timeout_watcher;
3626 userdata *u = ev_userdata (EV_A);
3627
3628 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
3629
3630 pthread_mutex_lock (&u->lock);
3631 ev_timer_start (EV_A_ &timeout_watcher);
3632 ev_async_send (EV_A_ &u->async_w);
3633 pthread_mutex_unlock (&u->lock);
3634
3635Note that sending the C<ev_async> watcher is required because otherwise
3636an event loop currently blocking in the kernel will have no knowledge
3637about the newly added timer. By waking up the loop it will pick up any new
3638watchers in the next event loop iteration.
3212 3639
3213=back 3640=back
3214 3641
3215 3642
3216=head1 LIBEVENT EMULATION 3643=head1 LIBEVENT EMULATION
3217 3644
3218Libev offers a compatibility emulation layer for libevent. It cannot 3645Libev offers a compatibility emulation layer for libevent. It cannot
3219emulate the internals of libevent, so here are some usage hints: 3646emulate the internals of libevent, so here are some usage hints:
3220 3647
3221=over 4 3648=over 4
3649
3650=item * Only the libevent-1.4.1-beta API is being emulated.
3651
3652This was the newest libevent version available when libev was implemented,
3653and is still mostly unchanged in 2010.
3222 3654
3223=item * Use it by including <event.h>, as usual. 3655=item * Use it by including <event.h>, as usual.
3224 3656
3225=item * The following members are fully supported: ev_base, ev_callback, 3657=item * The following members are fully supported: ev_base, ev_callback,
3226ev_arg, ev_fd, ev_res, ev_events. 3658ev_arg, ev_fd, ev_res, ev_events.
3232=item * Priorities are not currently supported. Initialising priorities 3664=item * Priorities are not currently supported. Initialising priorities
3233will fail and all watchers will have the same priority, even though there 3665will fail and all watchers will have the same priority, even though there
3234is an ev_pri field. 3666is an ev_pri field.
3235 3667
3236=item * In libevent, the last base created gets the signals, in libev, the 3668=item * In libevent, the last base created gets the signals, in libev, the
3237first base created (== the default loop) gets the signals. 3669base that registered the signal gets the signals.
3238 3670
3239=item * Other members are not supported. 3671=item * Other members are not supported.
3240 3672
3241=item * The libev emulation is I<not> ABI compatible to libevent, you need 3673=item * The libev emulation is I<not> ABI compatible to libevent, you need
3242to use the libev header file and library. 3674to use the libev header file and library.
3261Care has been taken to keep the overhead low. The only data member the C++ 3693Care has been taken to keep the overhead low. The only data member the C++
3262classes add (compared to plain C-style watchers) is the event loop pointer 3694classes add (compared to plain C-style watchers) is the event loop pointer
3263that the watcher is associated with (or no additional members at all if 3695that the watcher is associated with (or no additional members at all if
3264you disable C<EV_MULTIPLICITY> when embedding libev). 3696you disable C<EV_MULTIPLICITY> when embedding libev).
3265 3697
3266Currently, functions, and static and non-static member functions can be 3698Currently, functions, static and non-static member functions and classes
3267used as callbacks. Other types should be easy to add as long as they only 3699with C<operator ()> can be used as callbacks. Other types should be easy
3268need one additional pointer for context. If you need support for other 3700to add as long as they only need one additional pointer for context. If
3269types of functors please contact the author (preferably after implementing 3701you need support for other types of functors please contact the author
3270it). 3702(preferably after implementing it).
3271 3703
3272Here is a list of things available in the C<ev> namespace: 3704Here is a list of things available in the C<ev> namespace:
3273 3705
3274=over 4 3706=over 4
3275 3707
3336 myclass obj; 3768 myclass obj;
3337 ev::io iow; 3769 ev::io iow;
3338 iow.set <myclass, &myclass::io_cb> (&obj); 3770 iow.set <myclass, &myclass::io_cb> (&obj);
3339 3771
3340=item w->set (object *) 3772=item w->set (object *)
3341
3342This is an B<experimental> feature that might go away in a future version.
3343 3773
3344This is a variation of a method callback - leaving out the method to call 3774This is a variation of a method callback - leaving out the method to call
3345will default the method to C<operator ()>, which makes it possible to use 3775will default the method to C<operator ()>, which makes it possible to use
3346functor objects without having to manually specify the C<operator ()> all 3776functor objects without having to manually specify the C<operator ()> all
3347the time. Incidentally, you can then also leave out the template argument 3777the time. Incidentally, you can then also leave out the template argument
3387Associates a different C<struct ev_loop> with this watcher. You can only 3817Associates a different C<struct ev_loop> with this watcher. You can only
3388do this when the watcher is inactive (and not pending either). 3818do this when the watcher is inactive (and not pending either).
3389 3819
3390=item w->set ([arguments]) 3820=item w->set ([arguments])
3391 3821
3392Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3822Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3393called at least once. Unlike the C counterpart, an active watcher gets 3823method or a suitable start method must be called at least once. Unlike the
3394automatically stopped and restarted when reconfiguring it with this 3824C counterpart, an active watcher gets automatically stopped and restarted
3395method. 3825when reconfiguring it with this method.
3396 3826
3397=item w->start () 3827=item w->start ()
3398 3828
3399Starts the watcher. Note that there is no C<loop> argument, as the 3829Starts the watcher. Note that there is no C<loop> argument, as the
3400constructor already stores the event loop. 3830constructor already stores the event loop.
3401 3831
3832=item w->start ([arguments])
3833
3834Instead of calling C<set> and C<start> methods separately, it is often
3835convenient to wrap them in one call. Uses the same type of arguments as
3836the configure C<set> method of the watcher.
3837
3402=item w->stop () 3838=item w->stop ()
3403 3839
3404Stops the watcher if it is active. Again, no C<loop> argument. 3840Stops the watcher if it is active. Again, no C<loop> argument.
3405 3841
3406=item w->again () (C<ev::timer>, C<ev::periodic> only) 3842=item w->again () (C<ev::timer>, C<ev::periodic> only)
3418 3854
3419=back 3855=back
3420 3856
3421=back 3857=back
3422 3858
3423Example: Define a class with an IO and idle watcher, start one of them in 3859Example: Define a class with two I/O and idle watchers, start the I/O
3424the constructor. 3860watchers in the constructor.
3425 3861
3426 class myclass 3862 class myclass
3427 { 3863 {
3428 ev::io io ; void io_cb (ev::io &w, int revents); 3864 ev::io io ; void io_cb (ev::io &w, int revents);
3865 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3429 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3866 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3430 3867
3431 myclass (int fd) 3868 myclass (int fd)
3432 { 3869 {
3433 io .set <myclass, &myclass::io_cb > (this); 3870 io .set <myclass, &myclass::io_cb > (this);
3871 io2 .set <myclass, &myclass::io2_cb > (this);
3434 idle.set <myclass, &myclass::idle_cb> (this); 3872 idle.set <myclass, &myclass::idle_cb> (this);
3435 3873
3436 io.start (fd, ev::READ); 3874 io.set (fd, ev::WRITE); // configure the watcher
3875 io.start (); // start it whenever convenient
3876
3877 io2.start (fd, ev::READ); // set + start in one call
3437 } 3878 }
3438 }; 3879 };
3439 3880
3440 3881
3441=head1 OTHER LANGUAGE BINDINGS 3882=head1 OTHER LANGUAGE BINDINGS
3515loop argument"). The C<EV_A> form is used when this is the sole argument, 3956loop argument"). The C<EV_A> form is used when this is the sole argument,
3516C<EV_A_> is used when other arguments are following. Example: 3957C<EV_A_> is used when other arguments are following. Example:
3517 3958
3518 ev_unref (EV_A); 3959 ev_unref (EV_A);
3519 ev_timer_add (EV_A_ watcher); 3960 ev_timer_add (EV_A_ watcher);
3520 ev_loop (EV_A_ 0); 3961 ev_run (EV_A_ 0);
3521 3962
3522It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 3963It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3523which is often provided by the following macro. 3964which is often provided by the following macro.
3524 3965
3525=item C<EV_P>, C<EV_P_> 3966=item C<EV_P>, C<EV_P_>
3565 } 4006 }
3566 4007
3567 ev_check check; 4008 ev_check check;
3568 ev_check_init (&check, check_cb); 4009 ev_check_init (&check, check_cb);
3569 ev_check_start (EV_DEFAULT_ &check); 4010 ev_check_start (EV_DEFAULT_ &check);
3570 ev_loop (EV_DEFAULT_ 0); 4011 ev_run (EV_DEFAULT_ 0);
3571 4012
3572=head1 EMBEDDING 4013=head1 EMBEDDING
3573 4014
3574Libev can (and often is) directly embedded into host 4015Libev can (and often is) directly embedded into host
3575applications. Examples of applications that embed it include the Deliantra 4016applications. Examples of applications that embed it include the Deliantra
3660define before including (or compiling) any of its files. The default in 4101define before including (or compiling) any of its files. The default in
3661the absence of autoconf is documented for every option. 4102the absence of autoconf is documented for every option.
3662 4103
3663Symbols marked with "(h)" do not change the ABI, and can have different 4104Symbols marked with "(h)" do not change the ABI, and can have different
3664values when compiling libev vs. including F<ev.h>, so it is permissible 4105values when compiling libev vs. including F<ev.h>, so it is permissible
3665to redefine them before including F<ev.h> without breakign compatibility 4106to redefine them before including F<ev.h> without breaking compatibility
3666to a compiled library. All other symbols change the ABI, which means all 4107to a compiled library. All other symbols change the ABI, which means all
3667users of libev and the libev code itself must be compiled with compatible 4108users of libev and the libev code itself must be compiled with compatible
3668settings. 4109settings.
3669 4110
3670=over 4 4111=over 4
4112
4113=item EV_COMPAT3 (h)
4114
4115Backwards compatibility is a major concern for libev. This is why this
4116release of libev comes with wrappers for the functions and symbols that
4117have been renamed between libev version 3 and 4.
4118
4119You can disable these wrappers (to test compatibility with future
4120versions) by defining C<EV_COMPAT3> to C<0> when compiling your
4121sources. This has the additional advantage that you can drop the C<struct>
4122from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
4123typedef in that case.
4124
4125In some future version, the default for C<EV_COMPAT3> will become C<0>,
4126and in some even more future version the compatibility code will be
4127removed completely.
3671 4128
3672=item EV_STANDALONE (h) 4129=item EV_STANDALONE (h)
3673 4130
3674Must always be C<1> if you do not use autoconf configuration, which 4131Must always be C<1> if you do not use autoconf configuration, which
3675keeps libev from including F<config.h>, and it also defines dummy 4132keeps libev from including F<config.h>, and it also defines dummy
3882EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE, 4339EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3883EV_ASYNC_ENABLE, EV_CHILD_ENABLE. 4340EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3884 4341
3885If undefined or defined to be C<1> (and the platform supports it), then 4342If undefined or defined to be C<1> (and the platform supports it), then
3886the respective watcher type is supported. If defined to be C<0>, then it 4343the respective watcher type is supported. If defined to be C<0>, then it
3887is not. Disabling watcher types mainly saves codesize. 4344is not. Disabling watcher types mainly saves code size.
3888 4345
3889=item EV_FEATURES 4346=item EV_FEATURES
3890 4347
3891If you need to shave off some kilobytes of code at the expense of some 4348If you need to shave off some kilobytes of code at the expense of some
3892speed (but with the full API), you can define this symbol to request 4349speed (but with the full API), you can define this symbol to request
3893certain subsets of functionality. The default is to enable all features 4350certain subsets of functionality. The default is to enable all features
3894that can be enabled on the platform. 4351that can be enabled on the platform.
3895
3896Note that using autoconf will usually override most of the features, so
3897using this symbol makes sense mostly when embedding libev.
3898 4352
3899A typical way to use this symbol is to define it to C<0> (or to a bitset 4353A typical way to use this symbol is to define it to C<0> (or to a bitset
3900with some broad features you want) and then selectively re-enable 4354with some broad features you want) and then selectively re-enable
3901additional parts you want, for example if you want everything minimal, 4355additional parts you want, for example if you want everything minimal,
3902but multiple event loop support, async and child watchers and the poll 4356but multiple event loop support, async and child watchers and the poll
3915 4369
3916=item C<1> - faster/larger code 4370=item C<1> - faster/larger code
3917 4371
3918Use larger code to speed up some operations. 4372Use larger code to speed up some operations.
3919 4373
3920Currently this is used to override some inlining decisions (enlarging the roughly 4374Currently this is used to override some inlining decisions (enlarging the
392130% code size on amd64. 4375code size by roughly 30% on amd64).
3922 4376
3923When optimising for size, use of compiler flags such as C<-Os> with 4377When optimising for size, use of compiler flags such as C<-Os> with
3924gcc recommended, as well as C<-DNDEBUG>, as libev contains a number of 4378gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
3925assertions. 4379assertions.
3926 4380
3927=item C<2> - faster/larger data structures 4381=item C<2> - faster/larger data structures
3928 4382
3929Replaces the small 2-heap for timer management by a faster 4-heap, larger 4383Replaces the small 2-heap for timer management by a faster 4-heap, larger
3930hash table sizes and so on. This will usually further increase codesize 4384hash table sizes and so on. This will usually further increase code size
3931and can additionally have an effect on the size of data structures at 4385and can additionally have an effect on the size of data structures at
3932runtime. 4386runtime.
3933 4387
3934=item C<4> - full API configuration 4388=item C<4> - full API configuration
3935 4389
3936This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and 4390This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
3937enables multiplicity (C<EV_MULTIPLICITY>=1). 4391enables multiplicity (C<EV_MULTIPLICITY>=1).
3938 4392
4393=item C<8> - full API
4394
3939It also enables a lot of the "lesser used" core API functions. See C<ev.h> 4395This enables a lot of the "lesser used" API functions. See C<ev.h> for
3940for details on which parts of the API are still available without this 4396details on which parts of the API are still available without this
3941feature, and do not complain if this subset changes over time. 4397feature, and do not complain if this subset changes over time.
3942 4398
3943=item C<8> - enable all optional watcher types 4399=item C<16> - enable all optional watcher types
3944 4400
3945Enables all optional watcher types. If you want to selectively enable 4401Enables all optional watcher types. If you want to selectively enable
3946only some watcher types other than I/O and timers (e.g. prepare, 4402only some watcher types other than I/O and timers (e.g. prepare,
3947embed, async, child...) you can enable them manually by defining 4403embed, async, child...) you can enable them manually by defining
3948C<EV_watchertype_ENABLE> to C<1> instead. 4404C<EV_watchertype_ENABLE> to C<1> instead.
3949 4405
3950=item C<16> - enable all backends 4406=item C<32> - enable all backends
3951 4407
3952This enables all backends - without this feature, you need to enable at 4408This enables all backends - without this feature, you need to enable at
3953least one backend manually (C<EV_USE_SELECT> is a good choice). 4409least one backend manually (C<EV_USE_SELECT> is a good choice).
3954 4410
3955=item C<32> - enable OS-specific "helper" APIs 4411=item C<64> - enable OS-specific "helper" APIs
3956 4412
3957Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by 4413Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
3958default. 4414default.
3959 4415
3960=back 4416=back
3961 4417
3962Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0> 4418Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
3963reduces the compiled size of libev from 24.7Kb to 6.5Kb on my GNU/Linux 4419reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
3964amd64 system, while still giving you I/O watchers, timers and monotonic 4420code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
3965clock support. 4421watchers, timers and monotonic clock support.
3966 4422
3967With an intelligent-enough linker (gcc+binutils are intelligent enough 4423With an intelligent-enough linker (gcc+binutils are intelligent enough
3968when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by 4424when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
3969your program might be left out as well - a binary starting a timer and an 4425your program might be left out as well - a binary starting a timer and an
3970I/O watcher then might come out at only 5Kb. 4426I/O watcher then might come out at only 5Kb.
3971 4427
3972=item EV_AVOID_STDIO 4428=item EV_AVOID_STDIO
3973 4429
3974If this is set to C<1> at compiletime, then libev will avoid using stdio 4430If this is set to C<1> at compiletime, then libev will avoid using stdio
3975functions (printf, scanf, perror etc.). This will increase the codesize 4431functions (printf, scanf, perror etc.). This will increase the code size
3976somewhat, but if your program doesn't otherwise depend on stdio and your 4432somewhat, but if your program doesn't otherwise depend on stdio and your
3977libc allows it, this avoids linking in the stdio library which is quite 4433libc allows it, this avoids linking in the stdio library which is quite
3978big. 4434big.
3979 4435
3980Note that error messages might become less precise when this option is 4436Note that error messages might become less precise when this option is
3984 4440
3985The highest supported signal number, +1 (or, the number of 4441The highest supported signal number, +1 (or, the number of
3986signals): Normally, libev tries to deduce the maximum number of signals 4442signals): Normally, libev tries to deduce the maximum number of signals
3987automatically, but sometimes this fails, in which case it can be 4443automatically, but sometimes this fails, in which case it can be
3988specified. Also, using a lower number than detected (C<32> should be 4444specified. Also, using a lower number than detected (C<32> should be
3989good for about any system in existance) can save some memory, as libev 4445good for about any system in existence) can save some memory, as libev
3990statically allocates some 12-24 bytes per signal number. 4446statically allocates some 12-24 bytes per signal number.
3991 4447
3992=item EV_PID_HASHSIZE 4448=item EV_PID_HASHSIZE
3993 4449
3994C<ev_child> watchers use a small hash table to distribute workload by 4450C<ev_child> watchers use a small hash table to distribute workload by
4026The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it 4482The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
4027will be C<0>. 4483will be C<0>.
4028 4484
4029=item EV_VERIFY 4485=item EV_VERIFY
4030 4486
4031Controls how much internal verification (see C<ev_loop_verify ()>) will 4487Controls how much internal verification (see C<ev_verify ()>) will
4032be done: If set to C<0>, no internal verification code will be compiled 4488be done: If set to C<0>, no internal verification code will be compiled
4033in. If set to C<1>, then verification code will be compiled in, but not 4489in. If set to C<1>, then verification code will be compiled in, but not
4034called. If set to C<2>, then the internal verification code will be 4490called. If set to C<2>, then the internal verification code will be
4035called once per loop, which can slow down libev. If set to C<3>, then the 4491called once per loop, which can slow down libev. If set to C<3>, then the
4036verification code will be called very frequently, which will slow down 4492verification code will be called very frequently, which will slow down
4040will be C<0>. 4496will be C<0>.
4041 4497
4042=item EV_COMMON 4498=item EV_COMMON
4043 4499
4044By default, all watchers have a C<void *data> member. By redefining 4500By default, all watchers have a C<void *data> member. By redefining
4045this macro to a something else you can include more and other types of 4501this macro to something else you can include more and other types of
4046members. You have to define it each time you include one of the files, 4502members. You have to define it each time you include one of the files,
4047though, and it must be identical each time. 4503though, and it must be identical each time.
4048 4504
4049For example, the perl EV module uses something like this: 4505For example, the perl EV module uses something like this:
4050 4506
4103file. 4559file.
4104 4560
4105The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4561The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
4106that everybody includes and which overrides some configure choices: 4562that everybody includes and which overrides some configure choices:
4107 4563
4108 #define EV_FEATURES 0 4564 #define EV_FEATURES 8
4109 #define EV_USE_SELECT 1 4565 #define EV_USE_SELECT 1
4566 #define EV_PREPARE_ENABLE 1
4567 #define EV_IDLE_ENABLE 1
4568 #define EV_SIGNAL_ENABLE 1
4569 #define EV_CHILD_ENABLE 1
4570 #define EV_USE_STDEXCEPT 0
4110 #define EV_CONFIG_H <config.h> 4571 #define EV_CONFIG_H <config.h>
4111 4572
4112 #include "ev++.h" 4573 #include "ev++.h"
4113 4574
4114And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4575And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4175default loop and triggering an C<ev_async> watcher from the default loop 4636default loop and triggering an C<ev_async> watcher from the default loop
4176watcher callback into the event loop interested in the signal. 4637watcher callback into the event loop interested in the signal.
4177 4638
4178=back 4639=back
4179 4640
4180=head4 THREAD LOCKING EXAMPLE 4641See also L<Thread locking example>.
4181
4182Here is a fictitious example of how to run an event loop in a different
4183thread than where callbacks are being invoked and watchers are
4184created/added/removed.
4185
4186For a real-world example, see the C<EV::Loop::Async> perl module,
4187which uses exactly this technique (which is suited for many high-level
4188languages).
4189
4190The example uses a pthread mutex to protect the loop data, a condition
4191variable to wait for callback invocations, an async watcher to notify the
4192event loop thread and an unspecified mechanism to wake up the main thread.
4193
4194First, you need to associate some data with the event loop:
4195
4196 typedef struct {
4197 mutex_t lock; /* global loop lock */
4198 ev_async async_w;
4199 thread_t tid;
4200 cond_t invoke_cv;
4201 } userdata;
4202
4203 void prepare_loop (EV_P)
4204 {
4205 // for simplicity, we use a static userdata struct.
4206 static userdata u;
4207
4208 ev_async_init (&u->async_w, async_cb);
4209 ev_async_start (EV_A_ &u->async_w);
4210
4211 pthread_mutex_init (&u->lock, 0);
4212 pthread_cond_init (&u->invoke_cv, 0);
4213
4214 // now associate this with the loop
4215 ev_set_userdata (EV_A_ u);
4216 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4217 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4218
4219 // then create the thread running ev_loop
4220 pthread_create (&u->tid, 0, l_run, EV_A);
4221 }
4222
4223The callback for the C<ev_async> watcher does nothing: the watcher is used
4224solely to wake up the event loop so it takes notice of any new watchers
4225that might have been added:
4226
4227 static void
4228 async_cb (EV_P_ ev_async *w, int revents)
4229 {
4230 // just used for the side effects
4231 }
4232
4233The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4234protecting the loop data, respectively.
4235
4236 static void
4237 l_release (EV_P)
4238 {
4239 userdata *u = ev_userdata (EV_A);
4240 pthread_mutex_unlock (&u->lock);
4241 }
4242
4243 static void
4244 l_acquire (EV_P)
4245 {
4246 userdata *u = ev_userdata (EV_A);
4247 pthread_mutex_lock (&u->lock);
4248 }
4249
4250The event loop thread first acquires the mutex, and then jumps straight
4251into C<ev_loop>:
4252
4253 void *
4254 l_run (void *thr_arg)
4255 {
4256 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4257
4258 l_acquire (EV_A);
4259 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4260 ev_loop (EV_A_ 0);
4261 l_release (EV_A);
4262
4263 return 0;
4264 }
4265
4266Instead of invoking all pending watchers, the C<l_invoke> callback will
4267signal the main thread via some unspecified mechanism (signals? pipe
4268writes? C<Async::Interrupt>?) and then waits until all pending watchers
4269have been called (in a while loop because a) spurious wakeups are possible
4270and b) skipping inter-thread-communication when there are no pending
4271watchers is very beneficial):
4272
4273 static void
4274 l_invoke (EV_P)
4275 {
4276 userdata *u = ev_userdata (EV_A);
4277
4278 while (ev_pending_count (EV_A))
4279 {
4280 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4281 pthread_cond_wait (&u->invoke_cv, &u->lock);
4282 }
4283 }
4284
4285Now, whenever the main thread gets told to invoke pending watchers, it
4286will grab the lock, call C<ev_invoke_pending> and then signal the loop
4287thread to continue:
4288
4289 static void
4290 real_invoke_pending (EV_P)
4291 {
4292 userdata *u = ev_userdata (EV_A);
4293
4294 pthread_mutex_lock (&u->lock);
4295 ev_invoke_pending (EV_A);
4296 pthread_cond_signal (&u->invoke_cv);
4297 pthread_mutex_unlock (&u->lock);
4298 }
4299
4300Whenever you want to start/stop a watcher or do other modifications to an
4301event loop, you will now have to lock:
4302
4303 ev_timer timeout_watcher;
4304 userdata *u = ev_userdata (EV_A);
4305
4306 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4307
4308 pthread_mutex_lock (&u->lock);
4309 ev_timer_start (EV_A_ &timeout_watcher);
4310 ev_async_send (EV_A_ &u->async_w);
4311 pthread_mutex_unlock (&u->lock);
4312
4313Note that sending the C<ev_async> watcher is required because otherwise
4314an event loop currently blocking in the kernel will have no knowledge
4315about the newly added timer. By waking up the loop it will pick up any new
4316watchers in the next event loop iteration.
4317 4642
4318=head3 COROUTINES 4643=head3 COROUTINES
4319 4644
4320Libev is very accommodating to coroutines ("cooperative threads"): 4645Libev is very accommodating to coroutines ("cooperative threads"):
4321libev fully supports nesting calls to its functions from different 4646libev fully supports nesting calls to its functions from different
4322coroutines (e.g. you can call C<ev_loop> on the same loop from two 4647coroutines (e.g. you can call C<ev_run> on the same loop from two
4323different coroutines, and switch freely between both coroutines running 4648different coroutines, and switch freely between both coroutines running
4324the loop, as long as you don't confuse yourself). The only exception is 4649the loop, as long as you don't confuse yourself). The only exception is
4325that you must not do this from C<ev_periodic> reschedule callbacks. 4650that you must not do this from C<ev_periodic> reschedule callbacks.
4326 4651
4327Care has been taken to ensure that libev does not keep local state inside 4652Care has been taken to ensure that libev does not keep local state inside
4328C<ev_loop>, and other calls do not usually allow for coroutine switches as 4653C<ev_run>, and other calls do not usually allow for coroutine switches as
4329they do not call any callbacks. 4654they do not call any callbacks.
4330 4655
4331=head2 COMPILER WARNINGS 4656=head2 COMPILER WARNINGS
4332 4657
4333Depending on your compiler and compiler settings, you might get no or a 4658Depending on your compiler and compiler settings, you might get no or a
4344maintainable. 4669maintainable.
4345 4670
4346And of course, some compiler warnings are just plain stupid, or simply 4671And of course, some compiler warnings are just plain stupid, or simply
4347wrong (because they don't actually warn about the condition their message 4672wrong (because they don't actually warn about the condition their message
4348seems to warn about). For example, certain older gcc versions had some 4673seems to warn about). For example, certain older gcc versions had some
4349warnings that resulted an extreme number of false positives. These have 4674warnings that resulted in an extreme number of false positives. These have
4350been fixed, but some people still insist on making code warn-free with 4675been fixed, but some people still insist on making code warn-free with
4351such buggy versions. 4676such buggy versions.
4352 4677
4353While libev is written to generate as few warnings as possible, 4678While libev is written to generate as few warnings as possible,
4354"warn-free" code is not a goal, and it is recommended not to build libev 4679"warn-free" code is not a goal, and it is recommended not to build libev
4390I suggest using suppression lists. 4715I suggest using suppression lists.
4391 4716
4392 4717
4393=head1 PORTABILITY NOTES 4718=head1 PORTABILITY NOTES
4394 4719
4720=head2 GNU/LINUX 32 BIT LIMITATIONS
4721
4722GNU/Linux is the only common platform that supports 64 bit file/large file
4723interfaces but I<disables> them by default.
4724
4725That means that libev compiled in the default environment doesn't support
4726files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4727
4728Unfortunately, many programs try to work around this GNU/Linux issue
4729by enabling the large file API, which makes them incompatible with the
4730standard libev compiled for their system.
4731
4732Likewise, libev cannot enable the large file API itself as this would
4733suddenly make it incompatible to the default compile time environment,
4734i.e. all programs not using special compile switches.
4735
4736=head2 OS/X AND DARWIN BUGS
4737
4738The whole thing is a bug if you ask me - basically any system interface
4739you touch is broken, whether it is locales, poll, kqueue or even the
4740OpenGL drivers.
4741
4742=head3 C<kqueue> is buggy
4743
4744The kqueue syscall is broken in all known versions - most versions support
4745only sockets, many support pipes.
4746
4747Libev tries to work around this by not using C<kqueue> by default on this
4748rotten platform, but of course you can still ask for it when creating a
4749loop - embedding a socket-only kqueue loop into a select-based one is
4750probably going to work well.
4751
4752=head3 C<poll> is buggy
4753
4754Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4755implementation by something calling C<kqueue> internally around the 10.5.6
4756release, so now C<kqueue> I<and> C<poll> are broken.
4757
4758Libev tries to work around this by not using C<poll> by default on
4759this rotten platform, but of course you can still ask for it when creating
4760a loop.
4761
4762=head3 C<select> is buggy
4763
4764All that's left is C<select>, and of course Apple found a way to fuck this
4765one up as well: On OS/X, C<select> actively limits the number of file
4766descriptors you can pass in to 1024 - your program suddenly crashes when
4767you use more.
4768
4769There is an undocumented "workaround" for this - defining
4770C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4771work on OS/X.
4772
4773=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4774
4775=head3 C<errno> reentrancy
4776
4777The default compile environment on Solaris is unfortunately so
4778thread-unsafe that you can't even use components/libraries compiled
4779without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4780defined by default. A valid, if stupid, implementation choice.
4781
4782If you want to use libev in threaded environments you have to make sure
4783it's compiled with C<_REENTRANT> defined.
4784
4785=head3 Event port backend
4786
4787The scalable event interface for Solaris is called "event
4788ports". Unfortunately, this mechanism is very buggy in all major
4789releases. If you run into high CPU usage, your program freezes or you get
4790a large number of spurious wakeups, make sure you have all the relevant
4791and latest kernel patches applied. No, I don't know which ones, but there
4792are multiple ones to apply, and afterwards, event ports actually work
4793great.
4794
4795If you can't get it to work, you can try running the program by setting
4796the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4797C<select> backends.
4798
4799=head2 AIX POLL BUG
4800
4801AIX unfortunately has a broken C<poll.h> header. Libev works around
4802this by trying to avoid the poll backend altogether (i.e. it's not even
4803compiled in), which normally isn't a big problem as C<select> works fine
4804with large bitsets on AIX, and AIX is dead anyway.
4805
4395=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4806=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4807
4808=head3 General issues
4396 4809
4397Win32 doesn't support any of the standards (e.g. POSIX) that libev 4810Win32 doesn't support any of the standards (e.g. POSIX) that libev
4398requires, and its I/O model is fundamentally incompatible with the POSIX 4811requires, and its I/O model is fundamentally incompatible with the POSIX
4399model. Libev still offers limited functionality on this platform in 4812model. Libev still offers limited functionality on this platform in
4400the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4813the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4401descriptors. This only applies when using Win32 natively, not when using 4814descriptors. This only applies when using Win32 natively, not when using
4402e.g. cygwin. 4815e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4816as every compielr comes with a slightly differently broken/incompatible
4817environment.
4403 4818
4404Lifting these limitations would basically require the full 4819Lifting these limitations would basically require the full
4405re-implementation of the I/O system. If you are into these kinds of 4820re-implementation of the I/O system. If you are into this kind of thing,
4406things, then note that glib does exactly that for you in a very portable 4821then note that glib does exactly that for you in a very portable way (note
4407way (note also that glib is the slowest event library known to man). 4822also that glib is the slowest event library known to man).
4408 4823
4409There is no supported compilation method available on windows except 4824There is no supported compilation method available on windows except
4410embedding it into other applications. 4825embedding it into other applications.
4411 4826
4412Sensible signal handling is officially unsupported by Microsoft - libev 4827Sensible signal handling is officially unsupported by Microsoft - libev
4440you do I<not> compile the F<ev.c> or any other embedded source files!): 4855you do I<not> compile the F<ev.c> or any other embedded source files!):
4441 4856
4442 #include "evwrap.h" 4857 #include "evwrap.h"
4443 #include "ev.c" 4858 #include "ev.c"
4444 4859
4445=over 4
4446
4447=item The winsocket select function 4860=head3 The winsocket C<select> function
4448 4861
4449The winsocket C<select> function doesn't follow POSIX in that it 4862The winsocket C<select> function doesn't follow POSIX in that it
4450requires socket I<handles> and not socket I<file descriptors> (it is 4863requires socket I<handles> and not socket I<file descriptors> (it is
4451also extremely buggy). This makes select very inefficient, and also 4864also extremely buggy). This makes select very inefficient, and also
4452requires a mapping from file descriptors to socket handles (the Microsoft 4865requires a mapping from file descriptors to socket handles (the Microsoft
4461 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4874 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4462 4875
4463Note that winsockets handling of fd sets is O(n), so you can easily get a 4876Note that winsockets handling of fd sets is O(n), so you can easily get a
4464complexity in the O(n²) range when using win32. 4877complexity in the O(n²) range when using win32.
4465 4878
4466=item Limited number of file descriptors 4879=head3 Limited number of file descriptors
4467 4880
4468Windows has numerous arbitrary (and low) limits on things. 4881Windows has numerous arbitrary (and low) limits on things.
4469 4882
4470Early versions of winsocket's select only supported waiting for a maximum 4883Early versions of winsocket's select only supported waiting for a maximum
4471of C<64> handles (probably owning to the fact that all windows kernels 4884of C<64> handles (probably owning to the fact that all windows kernels
4486runtime libraries. This might get you to about C<512> or C<2048> sockets 4899runtime libraries. This might get you to about C<512> or C<2048> sockets
4487(depending on windows version and/or the phase of the moon). To get more, 4900(depending on windows version and/or the phase of the moon). To get more,
4488you need to wrap all I/O functions and provide your own fd management, but 4901you need to wrap all I/O functions and provide your own fd management, but
4489the cost of calling select (O(n²)) will likely make this unworkable. 4902the cost of calling select (O(n²)) will likely make this unworkable.
4490 4903
4491=back
4492
4493=head2 PORTABILITY REQUIREMENTS 4904=head2 PORTABILITY REQUIREMENTS
4494 4905
4495In addition to a working ISO-C implementation and of course the 4906In addition to a working ISO-C implementation and of course the
4496backend-specific APIs, libev relies on a few additional extensions: 4907backend-specific APIs, libev relies on a few additional extensions:
4497 4908
4503Libev assumes not only that all watcher pointers have the same internal 4914Libev assumes not only that all watcher pointers have the same internal
4504structure (guaranteed by POSIX but not by ISO C for example), but it also 4915structure (guaranteed by POSIX but not by ISO C for example), but it also
4505assumes that the same (machine) code can be used to call any watcher 4916assumes that the same (machine) code can be used to call any watcher
4506callback: The watcher callbacks have different type signatures, but libev 4917callback: The watcher callbacks have different type signatures, but libev
4507calls them using an C<ev_watcher *> internally. 4918calls them using an C<ev_watcher *> internally.
4919
4920=item pointer accesses must be thread-atomic
4921
4922Accessing a pointer value must be atomic, it must both be readable and
4923writable in one piece - this is the case on all current architectures.
4508 4924
4509=item C<sig_atomic_t volatile> must be thread-atomic as well 4925=item C<sig_atomic_t volatile> must be thread-atomic as well
4510 4926
4511The type C<sig_atomic_t volatile> (or whatever is defined as 4927The type C<sig_atomic_t volatile> (or whatever is defined as
4512C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4928C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4535watchers. 4951watchers.
4536 4952
4537=item C<double> must hold a time value in seconds with enough accuracy 4953=item C<double> must hold a time value in seconds with enough accuracy
4538 4954
4539The type C<double> is used to represent timestamps. It is required to 4955The type C<double> is used to represent timestamps. It is required to
4540have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4956have at least 51 bits of mantissa (and 9 bits of exponent), which is
4541enough for at least into the year 4000. This requirement is fulfilled by 4957good enough for at least into the year 4000 with millisecond accuracy
4958(the design goal for libev). This requirement is overfulfilled by
4542implementations implementing IEEE 754, which is basically all existing 4959implementations using IEEE 754, which is basically all existing ones. With
4543ones. With IEEE 754 doubles, you get microsecond accuracy until at least 4960IEEE 754 doubles, you get microsecond accuracy until at least 2200.
45442200.
4545 4961
4546=back 4962=back
4547 4963
4548If you know of other additional requirements drop me a note. 4964If you know of other additional requirements drop me a note.
4549 4965
4617involves iterating over all running async watchers or all signal numbers. 5033involves iterating over all running async watchers or all signal numbers.
4618 5034
4619=back 5035=back
4620 5036
4621 5037
5038=head1 PORTING FROM LIBEV 3.X TO 4.X
5039
5040The major version 4 introduced some incompatible changes to the API.
5041
5042At the moment, the C<ev.h> header file provides compatibility definitions
5043for all changes, so most programs should still compile. The compatibility
5044layer might be removed in later versions of libev, so better update to the
5045new API early than late.
5046
5047=over 4
5048
5049=item C<EV_COMPAT3> backwards compatibility mechanism
5050
5051The backward compatibility mechanism can be controlled by
5052C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
5053section.
5054
5055=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5056
5057These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5058
5059 ev_loop_destroy (EV_DEFAULT_UC);
5060 ev_loop_fork (EV_DEFAULT);
5061
5062=item function/symbol renames
5063
5064A number of functions and symbols have been renamed:
5065
5066 ev_loop => ev_run
5067 EVLOOP_NONBLOCK => EVRUN_NOWAIT
5068 EVLOOP_ONESHOT => EVRUN_ONCE
5069
5070 ev_unloop => ev_break
5071 EVUNLOOP_CANCEL => EVBREAK_CANCEL
5072 EVUNLOOP_ONE => EVBREAK_ONE
5073 EVUNLOOP_ALL => EVBREAK_ALL
5074
5075 EV_TIMEOUT => EV_TIMER
5076
5077 ev_loop_count => ev_iteration
5078 ev_loop_depth => ev_depth
5079 ev_loop_verify => ev_verify
5080
5081Most functions working on C<struct ev_loop> objects don't have an
5082C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
5083associated constants have been renamed to not collide with the C<struct
5084ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
5085as all other watcher types. Note that C<ev_loop_fork> is still called
5086C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
5087typedef.
5088
5089=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
5090
5091The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
5092mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
5093and work, but the library code will of course be larger.
5094
5095=back
5096
5097
4622=head1 GLOSSARY 5098=head1 GLOSSARY
4623 5099
4624=over 4 5100=over 4
4625 5101
4626=item active 5102=item active
4627 5103
4628A watcher is active as long as it has been started (has been attached to 5104A watcher is active as long as it has been started and not yet stopped.
4629an event loop) but not yet stopped (disassociated from the event loop). 5105See L<WATCHER STATES> for details.
4630 5106
4631=item application 5107=item application
4632 5108
4633In this document, an application is whatever is using libev. 5109In this document, an application is whatever is using libev.
5110
5111=item backend
5112
5113The part of the code dealing with the operating system interfaces.
4634 5114
4635=item callback 5115=item callback
4636 5116
4637The address of a function that is called when some event has been 5117The address of a function that is called when some event has been
4638detected. Callbacks are being passed the event loop, the watcher that 5118detected. Callbacks are being passed the event loop, the watcher that
4639received the event, and the actual event bitset. 5119received the event, and the actual event bitset.
4640 5120
4641=item callback invocation 5121=item callback/watcher invocation
4642 5122
4643The act of calling the callback associated with a watcher. 5123The act of calling the callback associated with a watcher.
4644 5124
4645=item event 5125=item event
4646 5126
4647A change of state of some external event, such as data now being available 5127A change of state of some external event, such as data now being available
4648for reading on a file descriptor, time having passed or simply not having 5128for reading on a file descriptor, time having passed or simply not having
4649any other events happening anymore. 5129any other events happening anymore.
4650 5130
4651In libev, events are represented as single bits (such as C<EV_READ> or 5131In libev, events are represented as single bits (such as C<EV_READ> or
4652C<EV_TIMEOUT>). 5132C<EV_TIMER>).
4653 5133
4654=item event library 5134=item event library
4655 5135
4656A software package implementing an event model and loop. 5136A software package implementing an event model and loop.
4657 5137
4665The model used to describe how an event loop handles and processes 5145The model used to describe how an event loop handles and processes
4666watchers and events. 5146watchers and events.
4667 5147
4668=item pending 5148=item pending
4669 5149
4670A watcher is pending as soon as the corresponding event has been detected, 5150A watcher is pending as soon as the corresponding event has been
4671and stops being pending as soon as the watcher will be invoked or its 5151detected. See L<WATCHER STATES> for details.
4672pending status is explicitly cleared by the application.
4673
4674A watcher can be pending, but not active. Stopping a watcher also clears
4675its pending status.
4676 5152
4677=item real time 5153=item real time
4678 5154
4679The physical time that is observed. It is apparently strictly monotonic :) 5155The physical time that is observed. It is apparently strictly monotonic :)
4680 5156
4687=item watcher 5163=item watcher
4688 5164
4689A data structure that describes interest in certain events. Watchers need 5165A data structure that describes interest in certain events. Watchers need
4690to be started (attached to an event loop) before they can receive events. 5166to be started (attached to an event loop) before they can receive events.
4691 5167
4692=item watcher invocation
4693
4694The act of calling the callback associated with a watcher.
4695
4696=back 5168=back
4697 5169
4698=head1 AUTHOR 5170=head1 AUTHOR
4699 5171
4700Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5172Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5173Magnusson and Emanuele Giaquinta.
4701 5174

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines