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

Comparing libev/ev.pod (file contents):
Revision 1.291 by root, Tue Mar 16 20:32:20 2010 UTC vs.
Revision 1.360 by root, Mon Jan 17 12:11:12 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:
365environment variable. 415environment variable.
366 416
367=item C<EVFLAG_NOINOTIFY> 417=item C<EVFLAG_NOINOTIFY>
368 418
369When 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
370I<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
371testing, this flag can be useful to conserve inotify file descriptors, as 421testing, this flag can be useful to conserve inotify file descriptors, as
372otherwise each loop using C<ev_stat> watchers consumes one inotify handle. 422otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
373 423
374=item C<EVFLAG_SIGNALFD> 424=item C<EVFLAG_SIGNALFD>
375 425
376When this flag is specified, then libev will attempt to use the 426When this flag is specified, then libev will attempt to use the
377I<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
378delivers signals synchronously, which makes it both faster and might make 428delivers signals synchronously, which makes it both faster and might make
379it 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
380handling with threads, as long as you properly block signals in your 430handling with threads, as long as you properly block signals in your
381threads that are not interested in handling them. 431threads that are not interested in handling them.
382 432
383Signalfd 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
384there 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
385example) 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
447It's also required by POSIX in a threaded program, as libev calls
448C<sigprocmask>, whose behaviour is officially unspecified.
449
450This flag's behaviour will become the default in future versions of libev.
386 451
387=item C<EVBACKEND_SELECT> (value 1, portable select backend) 452=item C<EVBACKEND_SELECT> (value 1, portable select backend)
388 453
389This is your standard select(2) backend. Not I<completely> standard, as 454This is your standard select(2) backend. Not I<completely> standard, as
390libev tries to roll its own fd_set with no limits on the number of fds, 455libev tries to roll its own fd_set with no limits on the number of fds,
426epoll scales either O(1) or O(active_fds). 491epoll scales either O(1) or O(active_fds).
427 492
428The epoll mechanism deserves honorable mention as the most misdesigned 493The epoll mechanism deserves honorable mention as the most misdesigned
429of the more advanced event mechanisms: mere annoyances include silently 494of the more advanced event mechanisms: mere annoyances include silently
430dropping file descriptors, requiring a system call per change per file 495dropping file descriptors, requiring a system call per change per file
431descriptor (and unnecessary guessing of parameters), problems with dup and 496descriptor (and unnecessary guessing of parameters), problems with dup,
497returning before the timeout value, resulting in additional iterations
498(and only giving 5ms accuracy while select on the same platform gives
432so on. The biggest issue is fork races, however - if a program forks then 4990.1ms) and so on. The biggest issue is fork races, however - if a program
433I<both> parent and child process have to recreate the epoll set, which can 500forks then I<both> parent and child process have to recreate the epoll
434take considerable time (one syscall per file descriptor) and is of course 501set, which can take considerable time (one syscall per file descriptor)
435hard to detect. 502and is of course hard to detect.
436 503
437Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 504Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
438of course I<doesn't>, and epoll just loves to report events for totally 505of course I<doesn't>, and epoll just loves to report events for totally
439I<different> file descriptors (even already closed ones, so one cannot 506I<different> file descriptors (even already closed ones, so one cannot
440even remove them from the set) than registered in the set (especially 507even remove them from the set) than registered in the set (especially
441on SMP systems). Libev tries to counter these spurious notifications by 508on SMP systems). Libev tries to counter these spurious notifications by
442employing an additional generation counter and comparing that against the 509employing an additional generation counter and comparing that against the
443events to filter out spurious ones, recreating the set when required. 510events to filter out spurious ones, recreating the set when required. Last
511not least, it also refuses to work with some file descriptors which work
512perfectly fine with C<select> (files, many character devices...).
513
514Epoll is truly the train wreck analog among event poll mechanisms,
515a frankenpoll, cobbled together in a hurry, no thought to design or
516interaction with others.
444 517
445While stopping, setting and starting an I/O watcher in the same iteration 518While stopping, setting and starting an I/O watcher in the same iteration
446will result in some caching, there is still a system call per such 519will result in some caching, there is still a system call per such
447incident (because the same I<file descriptor> could point to a different 520incident (because the same I<file descriptor> could point to a different
448I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 521I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
514=item C<EVBACKEND_PORT> (value 32, Solaris 10) 587=item C<EVBACKEND_PORT> (value 32, Solaris 10)
515 588
516This uses the Solaris 10 event port mechanism. As with everything on Solaris, 589This uses the Solaris 10 event port mechanism. As with everything on Solaris,
517it's really slow, but it still scales very well (O(active_fds)). 590it's really slow, but it still scales very well (O(active_fds)).
518 591
519Please note that Solaris event ports can deliver a lot of spurious
520notifications, so you need to use non-blocking I/O or other means to avoid
521blocking when no data (or space) is available.
522
523While this backend scales well, it requires one system call per active 592While this backend scales well, it requires one system call per active
524file descriptor per loop iteration. For small and medium numbers of file 593file descriptor per loop iteration. For small and medium numbers of file
525descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 594descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
526might perform better. 595might perform better.
527 596
528On the positive side, with the exception of the spurious readiness 597On the positive side, this backend actually performed fully to
529notifications, this backend actually performed fully to specification
530in all tests and is fully embeddable, which is a rare feat among the 598specification in all tests and is fully embeddable, which is a rare feat
531OS-specific backends (I vastly prefer correctness over speed hacks). 599among the OS-specific backends (I vastly prefer correctness over speed
600hacks).
601
602On the negative side, the interface is I<bizarre> - so bizarre that
603even sun itself gets it wrong in their code examples: The event polling
604function sometimes returning events to the caller even though an error
605occurred, but with no indication whether it has done so or not (yes, it's
606even documented that way) - deadly for edge-triggered interfaces where
607you absolutely have to know whether an event occurred or not because you
608have to re-arm the watcher.
609
610Fortunately libev seems to be able to work around these idiocies.
532 611
533This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 612This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
534C<EVBACKEND_POLL>. 613C<EVBACKEND_POLL>.
535 614
536=item C<EVBACKEND_ALL> 615=item C<EVBACKEND_ALL>
537 616
538Try all backends (even potentially broken ones that wouldn't be tried 617Try all backends (even potentially broken ones that wouldn't be tried
539with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 618with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
540C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 619C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
541 620
542It is definitely not recommended to use this flag. 621It is definitely not recommended to use this flag, use whatever
622C<ev_recommended_backends ()> returns, or simply do not specify a backend
623at all.
624
625=item C<EVBACKEND_MASK>
626
627Not a backend at all, but a mask to select all backend bits from a
628C<flags> value, in case you want to mask out any backends from a flags
629value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
543 630
544=back 631=back
545 632
546If one or more of the backend flags are or'ed into the flags value, 633If one or more of the backend flags are or'ed into the flags value,
547then only these backends will be tried (in the reverse order as listed 634then only these backends will be tried (in the reverse order as listed
548here). If none are specified, all backends in C<ev_recommended_backends 635here). If none are specified, all backends in C<ev_recommended_backends
549()> will be tried. 636()> will be tried.
550 637
551Example: This is the most typical usage.
552
553 if (!ev_default_loop (0))
554 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
555
556Example: Restrict libev to the select and poll backends, and do not allow
557environment settings to be taken into account:
558
559 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
560
561Example: Use whatever libev has to offer, but make sure that kqueue is
562used if available (warning, breaks stuff, best use only with your own
563private event loop and only if you know the OS supports your types of
564fds):
565
566 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
567
568=item struct ev_loop *ev_loop_new (unsigned int flags)
569
570Similar to C<ev_default_loop>, but always creates a new event loop that is
571always distinct from the default loop.
572
573Note that this function I<is> thread-safe, and one common way to use
574libev with threads is indeed to create one loop per thread, and using the
575default loop in the "main" or "initial" thread.
576
577Example: Try to create a event loop that uses epoll and nothing else. 638Example: Try to create a event loop that uses epoll and nothing else.
578 639
579 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 640 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
580 if (!epoller) 641 if (!epoller)
581 fatal ("no epoll found here, maybe it hides under your chair"); 642 fatal ("no epoll found here, maybe it hides under your chair");
582 643
644Example: Use whatever libev has to offer, but make sure that kqueue is
645used if available.
646
647 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
648
583=item ev_default_destroy () 649=item ev_loop_destroy (loop)
584 650
585Destroys the default loop (frees all memory and kernel state etc.). None 651Destroys an event loop object (frees all memory and kernel state
586of the active event watchers will be stopped in the normal sense, so 652etc.). None of the active event watchers will be stopped in the normal
587e.g. C<ev_is_active> might still return true. It is your responsibility to 653sense, so e.g. C<ev_is_active> might still return true. It is your
588either stop all watchers cleanly yourself I<before> calling this function, 654responsibility to either stop all watchers cleanly yourself I<before>
589or cope with the fact afterwards (which is usually the easiest thing, you 655calling this function, or cope with the fact afterwards (which is usually
590can just ignore the watchers and/or C<free ()> them for example). 656the easiest thing, you can just ignore the watchers and/or C<free ()> them
657for example).
591 658
592Note that certain global state, such as signal state (and installed signal 659Note that certain global state, such as signal state (and installed signal
593handlers), will not be freed by this function, and related watchers (such 660handlers), will not be freed by this function, and related watchers (such
594as signal and child watchers) would need to be stopped manually. 661as signal and child watchers) would need to be stopped manually.
595 662
596In general it is not advisable to call this function except in the 663This function is normally used on loop objects allocated by
597rare occasion where you really need to free e.g. the signal handling 664C<ev_loop_new>, but it can also be used on the default loop returned by
665C<ev_default_loop>, in which case it is not thread-safe.
666
667Note that it is not advisable to call this function on the default loop
668except in the rare occasion where you really need to free its resources.
598pipe fds. If you need dynamically allocated loops it is better to use 669If you need dynamically allocated loops it is better to use C<ev_loop_new>
599C<ev_loop_new> and C<ev_loop_destroy>. 670and C<ev_loop_destroy>.
600 671
601=item ev_loop_destroy (loop) 672=item ev_loop_fork (loop)
602 673
603Like C<ev_default_destroy>, but destroys an event loop created by an
604earlier call to C<ev_loop_new>.
605
606=item ev_default_fork ()
607
608This function sets a flag that causes subsequent C<ev_loop> iterations 674This function sets a flag that causes subsequent C<ev_run> iterations to
609to reinitialise the kernel state for backends that have one. Despite the 675reinitialise the kernel state for backends that have one. Despite the
610name, you can call it anytime, but it makes most sense after forking, in 676name, you can call it anytime, but it makes most sense after forking, in
611the child process (or both child and parent, but that again makes little 677the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
612sense). You I<must> call it in the child before using any of the libev 678child before resuming or calling C<ev_run>.
613functions, and it will only take effect at the next C<ev_loop> iteration.
614 679
615Again, you I<have> to call it on I<any> loop that you want to re-use after 680Again, you I<have> to call it on I<any> loop that you want to re-use after
616a fork, I<even if you do not plan to use the loop in the parent>. This is 681a fork, I<even if you do not plan to use the loop in the parent>. This is
617because some kernel interfaces *cough* I<kqueue> *cough* do funny things 682because some kernel interfaces *cough* I<kqueue> *cough* do funny things
618during fork. 683during fork.
619 684
620On the other hand, you only need to call this function in the child 685On the other hand, you only need to call this function in the child
621process if and only if you want to use the event loop in the child. If you 686process if and only if you want to use the event loop in the child. If
622just fork+exec or create a new loop in the child, you don't have to call 687you just fork+exec or create a new loop in the child, you don't have to
623it at all. 688call it at all (in fact, C<epoll> is so badly broken that it makes a
689difference, but libev will usually detect this case on its own and do a
690costly reset of the backend).
624 691
625The function itself is quite fast and it's usually not a problem to call 692The function itself is quite fast and it's usually not a problem to call
626it just in case after a fork. To make this easy, the function will fit in 693it just in case after a fork.
627quite nicely into a call to C<pthread_atfork>:
628 694
695Example: Automate calling C<ev_loop_fork> on the default loop when
696using pthreads.
697
698 static void
699 post_fork_child (void)
700 {
701 ev_loop_fork (EV_DEFAULT);
702 }
703
704 ...
629 pthread_atfork (0, 0, ev_default_fork); 705 pthread_atfork (0, 0, post_fork_child);
630
631=item ev_loop_fork (loop)
632
633Like C<ev_default_fork>, but acts on an event loop created by
634C<ev_loop_new>. Yes, you have to call this on every allocated event loop
635after fork that you want to re-use in the child, and how you keep track of
636them is entirely your own problem.
637 706
638=item int ev_is_default_loop (loop) 707=item int ev_is_default_loop (loop)
639 708
640Returns true when the given loop is, in fact, the default loop, and false 709Returns true when the given loop is, in fact, the default loop, and false
641otherwise. 710otherwise.
642 711
643=item unsigned int ev_iteration (loop) 712=item unsigned int ev_iteration (loop)
644 713
645Returns the current iteration count for the loop, which is identical to 714Returns the current iteration count for the event loop, which is identical
646the number of times libev did poll for new events. It starts at C<0> and 715to the number of times libev did poll for new events. It starts at C<0>
647happily wraps around with enough iterations. 716and happily wraps around with enough iterations.
648 717
649This value can sometimes be useful as a generation counter of sorts (it 718This value can sometimes be useful as a generation counter of sorts (it
650"ticks" the number of loop iterations), as it roughly corresponds with 719"ticks" the number of loop iterations), as it roughly corresponds with
651C<ev_prepare> and C<ev_check> calls - and is incremented between the 720C<ev_prepare> and C<ev_check> calls - and is incremented between the
652prepare and check phases. 721prepare and check phases.
653 722
654=item unsigned int ev_depth (loop) 723=item unsigned int ev_depth (loop)
655 724
656Returns the number of times C<ev_loop> was entered minus the number of 725Returns the number of times C<ev_run> was entered minus the number of
657times C<ev_loop> was exited, in other words, the recursion depth. 726times C<ev_run> was exited normally, in other words, the recursion depth.
658 727
659Outside C<ev_loop>, this number is zero. In a callback, this number is 728Outside C<ev_run>, this number is zero. In a callback, this number is
660C<1>, unless C<ev_loop> was invoked recursively (or from another thread), 729C<1>, unless C<ev_run> was invoked recursively (or from another thread),
661in which case it is higher. 730in which case it is higher.
662 731
663Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread 732Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
664etc.), doesn't count as "exit" - consider this as a hint to avoid such 733throwing an exception etc.), doesn't count as "exit" - consider this
665ungentleman behaviour unless it's really convenient. 734as a hint to avoid such ungentleman-like behaviour unless it's really
735convenient, in which case it is fully supported.
666 736
667=item unsigned int ev_backend (loop) 737=item unsigned int ev_backend (loop)
668 738
669Returns one of the C<EVBACKEND_*> flags indicating the event backend in 739Returns one of the C<EVBACKEND_*> flags indicating the event backend in
670use. 740use.
679 749
680=item ev_now_update (loop) 750=item ev_now_update (loop)
681 751
682Establishes the current time by querying the kernel, updating the time 752Establishes the current time by querying the kernel, updating the time
683returned by C<ev_now ()> in the progress. This is a costly operation and 753returned by C<ev_now ()> in the progress. This is a costly operation and
684is usually done automatically within C<ev_loop ()>. 754is usually done automatically within C<ev_run ()>.
685 755
686This function is rarely useful, but when some event callback runs for a 756This function is rarely useful, but when some event callback runs for a
687very long time without entering the event loop, updating libev's idea of 757very long time without entering the event loop, updating libev's idea of
688the current time is a good idea. 758the current time is a good idea.
689 759
691 761
692=item ev_suspend (loop) 762=item ev_suspend (loop)
693 763
694=item ev_resume (loop) 764=item ev_resume (loop)
695 765
696These two functions suspend and resume a loop, for use when the loop is 766These two functions suspend and resume an event loop, for use when the
697not used for a while and timeouts should not be processed. 767loop is not used for a while and timeouts should not be processed.
698 768
699A typical use case would be an interactive program such as a game: When 769A typical use case would be an interactive program such as a game: When
700the user presses C<^Z> to suspend the game and resumes it an hour later it 770the user presses C<^Z> to suspend the game and resumes it an hour later it
701would be best to handle timeouts as if no time had actually passed while 771would be best to handle timeouts as if no time had actually passed while
702the program was suspended. This can be achieved by calling C<ev_suspend> 772the program was suspended. This can be achieved by calling C<ev_suspend>
704C<ev_resume> directly afterwards to resume timer processing. 774C<ev_resume> directly afterwards to resume timer processing.
705 775
706Effectively, all C<ev_timer> watchers will be delayed by the time spend 776Effectively, all C<ev_timer> watchers will be delayed by the time spend
707between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers 777between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
708will be rescheduled (that is, they will lose any events that would have 778will be rescheduled (that is, they will lose any events that would have
709occured while suspended). 779occurred while suspended).
710 780
711After calling C<ev_suspend> you B<must not> call I<any> function on the 781After calling C<ev_suspend> you B<must not> call I<any> function on the
712given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> 782given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
713without a previous call to C<ev_suspend>. 783without a previous call to C<ev_suspend>.
714 784
715Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 785Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
716event loop time (see C<ev_now_update>). 786event loop time (see C<ev_now_update>).
717 787
718=item ev_loop (loop, int flags) 788=item ev_run (loop, int flags)
719 789
720Finally, this is it, the event handler. This function usually is called 790Finally, this is it, the event handler. This function usually is called
721after you have initialised all your watchers and you want to start 791after you have initialised all your watchers and you want to start
722handling events. 792handling events. It will ask the operating system for any new events, call
793the watcher callbacks, an then repeat the whole process indefinitely: This
794is why event loops are called I<loops>.
723 795
724If the flags argument is specified as C<0>, it will not return until 796If the flags argument is specified as C<0>, it will keep handling events
725either no event watchers are active anymore or C<ev_unloop> was called. 797until either no event watchers are active anymore or C<ev_break> was
798called.
726 799
727Please note that an explicit C<ev_unloop> is usually better than 800Please note that an explicit C<ev_break> is usually better than
728relying on all watchers to be stopped when deciding when a program has 801relying on all watchers to be stopped when deciding when a program has
729finished (especially in interactive programs), but having a program 802finished (especially in interactive programs), but having a program
730that automatically loops as long as it has to and no longer by virtue 803that automatically loops as long as it has to and no longer by virtue
731of relying on its watchers stopping correctly, that is truly a thing of 804of relying on its watchers stopping correctly, that is truly a thing of
732beauty. 805beauty.
733 806
807This function is also I<mostly> exception-safe - you can break out of
808a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
809exception and so on. This does not decrement the C<ev_depth> value, nor
810will it clear any outstanding C<EVBREAK_ONE> breaks.
811
734A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 812A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
735those events and any already outstanding ones, but will not block your 813those events and any already outstanding ones, but will not wait and
736process in case there are no events and will return after one iteration of 814block your process in case there are no events and will return after one
737the loop. 815iteration of the loop. This is sometimes useful to poll and handle new
816events while doing lengthy calculations, to keep the program responsive.
738 817
739A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 818A flags value of C<EVRUN_ONCE> will look for new events (waiting if
740necessary) and will handle those and any already outstanding ones. It 819necessary) and will handle those and any already outstanding ones. It
741will block your process until at least one new event arrives (which could 820will block your process until at least one new event arrives (which could
742be an event internal to libev itself, so there is no guarantee that a 821be an event internal to libev itself, so there is no guarantee that a
743user-registered callback will be called), and will return after one 822user-registered callback will be called), and will return after one
744iteration of the loop. 823iteration of the loop.
745 824
746This is useful if you are waiting for some external event in conjunction 825This is useful if you are waiting for some external event in conjunction
747with something not expressible using other libev watchers (i.e. "roll your 826with something not expressible using other libev watchers (i.e. "roll your
748own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 827own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
749usually a better approach for this kind of thing. 828usually a better approach for this kind of thing.
750 829
751Here are the gory details of what C<ev_loop> does: 830Here are the gory details of what C<ev_run> does:
752 831
832 - Increment loop depth.
833 - Reset the ev_break status.
753 - Before the first iteration, call any pending watchers. 834 - Before the first iteration, call any pending watchers.
835 LOOP:
754 * If EVFLAG_FORKCHECK was used, check for a fork. 836 - If EVFLAG_FORKCHECK was used, check for a fork.
755 - If a fork was detected (by any means), queue and call all fork watchers. 837 - If a fork was detected (by any means), queue and call all fork watchers.
756 - Queue and call all prepare watchers. 838 - Queue and call all prepare watchers.
839 - If ev_break was called, goto FINISH.
757 - If we have been forked, detach and recreate the kernel state 840 - If we have been forked, detach and recreate the kernel state
758 as to not disturb the other process. 841 as to not disturb the other process.
759 - Update the kernel state with all outstanding changes. 842 - Update the kernel state with all outstanding changes.
760 - Update the "event loop time" (ev_now ()). 843 - Update the "event loop time" (ev_now ()).
761 - Calculate for how long to sleep or block, if at all 844 - Calculate for how long to sleep or block, if at all
762 (active idle watchers, EVLOOP_NONBLOCK or not having 845 (active idle watchers, EVRUN_NOWAIT or not having
763 any active watchers at all will result in not sleeping). 846 any active watchers at all will result in not sleeping).
764 - Sleep if the I/O and timer collect interval say so. 847 - Sleep if the I/O and timer collect interval say so.
848 - Increment loop iteration counter.
765 - Block the process, waiting for any events. 849 - Block the process, waiting for any events.
766 - Queue all outstanding I/O (fd) events. 850 - Queue all outstanding I/O (fd) events.
767 - Update the "event loop time" (ev_now ()), and do time jump adjustments. 851 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
768 - Queue all expired timers. 852 - Queue all expired timers.
769 - Queue all expired periodics. 853 - Queue all expired periodics.
770 - Unless any events are pending now, queue all idle watchers. 854 - Queue all idle watchers with priority higher than that of pending events.
771 - Queue all check watchers. 855 - Queue all check watchers.
772 - Call all queued watchers in reverse order (i.e. check watchers first). 856 - Call all queued watchers in reverse order (i.e. check watchers first).
773 Signals and child watchers are implemented as I/O watchers, and will 857 Signals and child watchers are implemented as I/O watchers, and will
774 be handled here by queueing them when their watcher gets executed. 858 be handled here by queueing them when their watcher gets executed.
775 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 859 - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
776 were used, or there are no active watchers, return, otherwise 860 were used, or there are no active watchers, goto FINISH, otherwise
777 continue with step *. 861 continue with step LOOP.
862 FINISH:
863 - Reset the ev_break status iff it was EVBREAK_ONE.
864 - Decrement the loop depth.
865 - Return.
778 866
779Example: Queue some jobs and then loop until no events are outstanding 867Example: Queue some jobs and then loop until no events are outstanding
780anymore. 868anymore.
781 869
782 ... queue jobs here, make sure they register event watchers as long 870 ... queue jobs here, make sure they register event watchers as long
783 ... as they still have work to do (even an idle watcher will do..) 871 ... as they still have work to do (even an idle watcher will do..)
784 ev_loop (my_loop, 0); 872 ev_run (my_loop, 0);
785 ... jobs done or somebody called unloop. yeah! 873 ... jobs done or somebody called unloop. yeah!
786 874
787=item ev_unloop (loop, how) 875=item ev_break (loop, how)
788 876
789Can be used to make a call to C<ev_loop> return early (but only after it 877Can be used to make a call to C<ev_run> return early (but only after it
790has processed all outstanding events). The C<how> argument must be either 878has processed all outstanding events). The C<how> argument must be either
791C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 879C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
792C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 880C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
793 881
794This "unloop state" will be cleared when entering C<ev_loop> again. 882This "break state" will be cleared on the next call to C<ev_run>.
795 883
796It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. 884It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
885which case it will have no effect.
797 886
798=item ev_ref (loop) 887=item ev_ref (loop)
799 888
800=item ev_unref (loop) 889=item ev_unref (loop)
801 890
802Ref/unref can be used to add or remove a reference count on the event 891Ref/unref can be used to add or remove a reference count on the event
803loop: Every watcher keeps one reference, and as long as the reference 892loop: Every watcher keeps one reference, and as long as the reference
804count is nonzero, C<ev_loop> will not return on its own. 893count is nonzero, C<ev_run> will not return on its own.
805 894
806This is useful when you have a watcher that you never intend to 895This is useful when you have a watcher that you never intend to
807unregister, but that nevertheless should not keep C<ev_loop> from 896unregister, but that nevertheless should not keep C<ev_run> from
808returning. In such a case, call C<ev_unref> after starting, and C<ev_ref> 897returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
809before stopping it. 898before stopping it.
810 899
811As an example, libev itself uses this for its internal signal pipe: It 900As an example, libev itself uses this for its internal signal pipe: It
812is not visible to the libev user and should not keep C<ev_loop> from 901is not visible to the libev user and should not keep C<ev_run> from
813exiting if no event watchers registered by it are active. It is also an 902exiting if no event watchers registered by it are active. It is also an
814excellent way to do this for generic recurring timers or from within 903excellent way to do this for generic recurring timers or from within
815third-party libraries. Just remember to I<unref after start> and I<ref 904third-party libraries. Just remember to I<unref after start> and I<ref
816before stop> (but only if the watcher wasn't active before, or was active 905before stop> (but only if the watcher wasn't active before, or was active
817before, respectively. Note also that libev might stop watchers itself 906before, respectively. Note also that libev might stop watchers itself
818(e.g. non-repeating timers) in which case you have to C<ev_ref> 907(e.g. non-repeating timers) in which case you have to C<ev_ref>
819in the callback). 908in the callback).
820 909
821Example: Create a signal watcher, but keep it from keeping C<ev_loop> 910Example: Create a signal watcher, but keep it from keeping C<ev_run>
822running when nothing else is active. 911running when nothing else is active.
823 912
824 ev_signal exitsig; 913 ev_signal exitsig;
825 ev_signal_init (&exitsig, sig_cb, SIGINT); 914 ev_signal_init (&exitsig, sig_cb, SIGINT);
826 ev_signal_start (loop, &exitsig); 915 ev_signal_start (loop, &exitsig);
827 evf_unref (loop); 916 ev_unref (loop);
828 917
829Example: For some weird reason, unregister the above signal handler again. 918Example: For some weird reason, unregister the above signal handler again.
830 919
831 ev_ref (loop); 920 ev_ref (loop);
832 ev_signal_stop (loop, &exitsig); 921 ev_signal_stop (loop, &exitsig);
871usually doesn't make much sense to set it to a lower value than C<0.01>, 960usually doesn't make much sense to set it to a lower value than C<0.01>,
872as this approaches the timing granularity of most systems. Note that if 961as this approaches the timing granularity of most systems. Note that if
873you do transactions with the outside world and you can't increase the 962you do transactions with the outside world and you can't increase the
874parallelity, then this setting will limit your transaction rate (if you 963parallelity, then this setting will limit your transaction rate (if you
875need to poll once per transaction and the I/O collect interval is 0.01, 964need to poll once per transaction and the I/O collect interval is 0.01,
876then you can't do more than 100 transations per second). 965then you can't do more than 100 transactions per second).
877 966
878Setting the I<timeout collect interval> can improve the opportunity for 967Setting the I<timeout collect interval> can improve the opportunity for
879saving power, as the program will "bundle" timer callback invocations that 968saving power, as the program will "bundle" timer callback invocations that
880are "near" in time together, by delaying some, thus reducing the number of 969are "near" in time together, by delaying some, thus reducing the number of
881times the process sleeps and wakes up again. Another useful technique to 970times the process sleeps and wakes up again. Another useful technique to
889 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); 978 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
890 979
891=item ev_invoke_pending (loop) 980=item ev_invoke_pending (loop)
892 981
893This call will simply invoke all pending watchers while resetting their 982This call will simply invoke all pending watchers while resetting their
894pending state. Normally, C<ev_loop> does this automatically when required, 983pending state. Normally, C<ev_run> does this automatically when required,
895but when overriding the invoke callback this call comes handy. 984but when overriding the invoke callback this call comes handy. This
985function can be invoked from a watcher - this can be useful for example
986when you want to do some lengthy calculation and want to pass further
987event handling to another thread (you still have to make sure only one
988thread executes within C<ev_invoke_pending> or C<ev_run> of course).
896 989
897=item int ev_pending_count (loop) 990=item int ev_pending_count (loop)
898 991
899Returns the number of pending watchers - zero indicates that no watchers 992Returns the number of pending watchers - zero indicates that no watchers
900are pending. 993are pending.
901 994
902=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P)) 995=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
903 996
904This overrides the invoke pending functionality of the loop: Instead of 997This overrides the invoke pending functionality of the loop: Instead of
905invoking all pending watchers when there are any, C<ev_loop> will call 998invoking all pending watchers when there are any, C<ev_run> will call
906this callback instead. This is useful, for example, when you want to 999this callback instead. This is useful, for example, when you want to
907invoke the actual watchers inside another context (another thread etc.). 1000invoke the actual watchers inside another context (another thread etc.).
908 1001
909If you want to reset the callback, use C<ev_invoke_pending> as new 1002If you want to reset the callback, use C<ev_invoke_pending> as new
910callback. 1003callback.
913 1006
914Sometimes you want to share the same loop between multiple threads. This 1007Sometimes you want to share the same loop between multiple threads. This
915can be done relatively simply by putting mutex_lock/unlock calls around 1008can be done relatively simply by putting mutex_lock/unlock calls around
916each call to a libev function. 1009each call to a libev function.
917 1010
918However, C<ev_loop> can run an indefinite time, so it is not feasible to 1011However, C<ev_run> can run an indefinite time, so it is not feasible
919wait for it to return. One way around this is to wake up the loop via 1012to wait for it to return. One way around this is to wake up the event
920C<ev_unloop> and C<av_async_send>, another way is to set these I<release> 1013loop via C<ev_break> and C<av_async_send>, another way is to set these
921and I<acquire> callbacks on the loop. 1014I<release> and I<acquire> callbacks on the loop.
922 1015
923When set, then C<release> will be called just before the thread is 1016When set, then C<release> will be called just before the thread is
924suspended waiting for new events, and C<acquire> is called just 1017suspended waiting for new events, and C<acquire> is called just
925afterwards. 1018afterwards.
926 1019
929 1022
930While event loop modifications are allowed between invocations of 1023While event loop modifications are allowed between invocations of
931C<release> and C<acquire> (that's their only purpose after all), no 1024C<release> and C<acquire> (that's their only purpose after all), no
932modifications done will affect the event loop, i.e. adding watchers will 1025modifications done will affect the event loop, i.e. adding watchers will
933have no effect on the set of file descriptors being watched, or the time 1026have no effect on the set of file descriptors being watched, or the time
934waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it 1027waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
935to take note of any changes you made. 1028to take note of any changes you made.
936 1029
937In theory, threads executing C<ev_loop> will be async-cancel safe between 1030In theory, threads executing C<ev_run> will be async-cancel safe between
938invocations of C<release> and C<acquire>. 1031invocations of C<release> and C<acquire>.
939 1032
940See also the locking example in the C<THREADS> section later in this 1033See also the locking example in the C<THREADS> section later in this
941document. 1034document.
942 1035
943=item ev_set_userdata (loop, void *data) 1036=item ev_set_userdata (loop, void *data)
944 1037
945=item ev_userdata (loop) 1038=item void *ev_userdata (loop)
946 1039
947Set and retrieve a single C<void *> associated with a loop. When 1040Set and retrieve a single C<void *> associated with a loop. When
948C<ev_set_userdata> has never been called, then C<ev_userdata> returns 1041C<ev_set_userdata> has never been called, then C<ev_userdata> returns
949C<0.> 1042C<0>.
950 1043
951These two functions can be used to associate arbitrary data with a loop, 1044These two functions can be used to associate arbitrary data with a loop,
952and are intended solely for the C<invoke_pending_cb>, C<release> and 1045and are intended solely for the C<invoke_pending_cb>, C<release> and
953C<acquire> callbacks described above, but of course can be (ab-)used for 1046C<acquire> callbacks described above, but of course can be (ab-)used for
954any other purpose as well. 1047any other purpose as well.
955 1048
956=item ev_loop_verify (loop) 1049=item ev_verify (loop)
957 1050
958This function only does something when C<EV_VERIFY> support has been 1051This function only does something when C<EV_VERIFY> support has been
959compiled in, which is the default for non-minimal builds. It tries to go 1052compiled in, which is the default for non-minimal builds. It tries to go
960through all internal structures and checks them for validity. If anything 1053through all internal structures and checks them for validity. If anything
961is found to be inconsistent, it will print an error message to standard 1054is found to be inconsistent, it will print an error message to standard
972 1065
973In the following description, uppercase C<TYPE> in names stands for the 1066In the following description, uppercase C<TYPE> in names stands for the
974watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer 1067watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
975watchers and C<ev_io_start> for I/O watchers. 1068watchers and C<ev_io_start> for I/O watchers.
976 1069
977A watcher is a structure that you create and register to record your 1070A watcher is an opaque structure that you allocate and register to record
978interest in some event. For instance, if you want to wait for STDIN to 1071your interest in some event. To make a concrete example, imagine you want
979become readable, you would create an C<ev_io> watcher for that: 1072to wait for STDIN to become readable, you would create an C<ev_io> watcher
1073for that:
980 1074
981 static void my_cb (struct ev_loop *loop, ev_io *w, int revents) 1075 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
982 { 1076 {
983 ev_io_stop (w); 1077 ev_io_stop (w);
984 ev_unloop (loop, EVUNLOOP_ALL); 1078 ev_break (loop, EVBREAK_ALL);
985 } 1079 }
986 1080
987 struct ev_loop *loop = ev_default_loop (0); 1081 struct ev_loop *loop = ev_default_loop (0);
988 1082
989 ev_io stdin_watcher; 1083 ev_io stdin_watcher;
990 1084
991 ev_init (&stdin_watcher, my_cb); 1085 ev_init (&stdin_watcher, my_cb);
992 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 1086 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
993 ev_io_start (loop, &stdin_watcher); 1087 ev_io_start (loop, &stdin_watcher);
994 1088
995 ev_loop (loop, 0); 1089 ev_run (loop, 0);
996 1090
997As you can see, you are responsible for allocating the memory for your 1091As you can see, you are responsible for allocating the memory for your
998watcher structures (and it is I<usually> a bad idea to do this on the 1092watcher structures (and it is I<usually> a bad idea to do this on the
999stack). 1093stack).
1000 1094
1001Each watcher has an associated watcher structure (called C<struct ev_TYPE> 1095Each watcher has an associated watcher structure (called C<struct ev_TYPE>
1002or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). 1096or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
1003 1097
1004Each watcher structure must be initialised by a call to C<ev_init 1098Each watcher structure must be initialised by a call to C<ev_init (watcher
1005(watcher *, callback)>, which expects a callback to be provided. This 1099*, callback)>, which expects a callback to be provided. This callback is
1006callback gets invoked each time the event occurs (or, in the case of I/O 1100invoked each time the event occurs (or, in the case of I/O watchers, each
1007watchers, each time the event loop detects that the file descriptor given 1101time the event loop detects that the file descriptor given is readable
1008is readable and/or writable). 1102and/or writable).
1009 1103
1010Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> 1104Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
1011macro to configure it, with arguments specific to the watcher type. There 1105macro to configure it, with arguments specific to the watcher type. There
1012is also a macro to combine initialisation and setting in one call: C<< 1106is also a macro to combine initialisation and setting in one call: C<<
1013ev_TYPE_init (watcher *, callback, ...) >>. 1107ev_TYPE_init (watcher *, callback, ...) >>.
1064 1158
1065=item C<EV_PREPARE> 1159=item C<EV_PREPARE>
1066 1160
1067=item C<EV_CHECK> 1161=item C<EV_CHECK>
1068 1162
1069All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts 1163All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
1070to gather new events, and all C<ev_check> watchers are invoked just after 1164to gather new events, and all C<ev_check> watchers are invoked just after
1071C<ev_loop> has gathered them, but before it invokes any callbacks for any 1165C<ev_run> has gathered them, but before it invokes any callbacks for any
1072received events. Callbacks of both watcher types can start and stop as 1166received events. Callbacks of both watcher types can start and stop as
1073many watchers as they want, and all of them will be taken into account 1167many watchers as they want, and all of them will be taken into account
1074(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1168(for example, a C<ev_prepare> watcher might start an idle watcher to keep
1075C<ev_loop> from blocking). 1169C<ev_run> from blocking).
1076 1170
1077=item C<EV_EMBED> 1171=item C<EV_EMBED>
1078 1172
1079The embedded event loop specified in the C<ev_embed> watcher needs attention. 1173The embedded event loop specified in the C<ev_embed> watcher needs attention.
1080 1174
1081=item C<EV_FORK> 1175=item C<EV_FORK>
1082 1176
1083The event loop has been resumed in the child process after fork (see 1177The event loop has been resumed in the child process after fork (see
1084C<ev_fork>). 1178C<ev_fork>).
1179
1180=item C<EV_CLEANUP>
1181
1182The event loop is about to be destroyed (see C<ev_cleanup>).
1085 1183
1086=item C<EV_ASYNC> 1184=item C<EV_ASYNC>
1087 1185
1088The given async watcher has been asynchronously notified (see C<ev_async>). 1186The given async watcher has been asynchronously notified (see C<ev_async>).
1089 1187
1262See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1360See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1263functions that do not need a watcher. 1361functions that do not need a watcher.
1264 1362
1265=back 1363=back
1266 1364
1365See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1366OWN COMPOSITE WATCHERS> idioms.
1267 1367
1268=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1368=head2 WATCHER STATES
1269 1369
1270Each watcher has, by default, a member C<void *data> that you can change 1370There are various watcher states mentioned throughout this manual -
1271and read at any time: libev will completely ignore it. This can be used 1371active, pending and so on. In this section these states and the rules to
1272to associate arbitrary data with your watcher. If you need more data and 1372transition between them will be described in more detail - and while these
1273don't want to allocate memory and store a pointer to it in that data 1373rules might look complicated, they usually do "the right thing".
1274member, you can also "subclass" the watcher type and provide your own
1275data:
1276 1374
1277 struct my_io 1375=over 4
1278 {
1279 ev_io io;
1280 int otherfd;
1281 void *somedata;
1282 struct whatever *mostinteresting;
1283 };
1284 1376
1285 ... 1377=item initialiased
1286 struct my_io w;
1287 ev_io_init (&w.io, my_cb, fd, EV_READ);
1288 1378
1289And since your callback will be called with a pointer to the watcher, you 1379Before a watcher can be registered with the event looop it has to be
1290can cast it back to your own type: 1380initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1381C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1291 1382
1292 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents) 1383In this state it is simply some block of memory that is suitable for use
1293 { 1384in an event loop. It can be moved around, freed, reused etc. at will.
1294 struct my_io *w = (struct my_io *)w_;
1295 ...
1296 }
1297 1385
1298More interesting and less C-conformant ways of casting your callback type 1386=item started/running/active
1299instead have been omitted.
1300 1387
1301Another common scenario is to use some data structure with multiple 1388Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1302embedded watchers: 1389property of the event loop, and is actively waiting for events. While in
1390this state it cannot be accessed (except in a few documented ways), moved,
1391freed or anything else - the only legal thing is to keep a pointer to it,
1392and call libev functions on it that are documented to work on active watchers.
1303 1393
1304 struct my_biggy 1394=item pending
1305 {
1306 int some_data;
1307 ev_timer t1;
1308 ev_timer t2;
1309 }
1310 1395
1311In this case getting the pointer to C<my_biggy> is a bit more 1396If a watcher is active and libev determines that an event it is interested
1312complicated: Either you store the address of your C<my_biggy> struct 1397in has occurred (such as a timer expiring), it will become pending. It will
1313in the C<data> member of the watcher (for woozies), or you need to use 1398stay in this pending state until either it is stopped or its callback is
1314some pointer arithmetic using C<offsetof> inside your watchers (for real 1399about to be invoked, so it is not normally pending inside the watcher
1315programmers): 1400callback.
1316 1401
1317 #include <stddef.h> 1402The watcher might or might not be active while it is pending (for example,
1403an expired non-repeating timer can be pending but no longer active). If it
1404is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1405but it is still property of the event loop at this time, so cannot be
1406moved, freed or reused. And if it is active the rules described in the
1407previous item still apply.
1318 1408
1319 static void 1409It is also possible to feed an event on a watcher that is not active (e.g.
1320 t1_cb (EV_P_ ev_timer *w, int revents) 1410via C<ev_feed_event>), in which case it becomes pending without being
1321 { 1411active.
1322 struct my_biggy big = (struct my_biggy *)
1323 (((char *)w) - offsetof (struct my_biggy, t1));
1324 }
1325 1412
1326 static void 1413=item stopped
1327 t2_cb (EV_P_ ev_timer *w, int revents) 1414
1328 { 1415A watcher can be stopped implicitly by libev (in which case it might still
1329 struct my_biggy big = (struct my_biggy *) 1416be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1330 (((char *)w) - offsetof (struct my_biggy, t2)); 1417latter will clear any pending state the watcher might be in, regardless
1331 } 1418of whether it was active or not, so stopping a watcher explicitly before
1419freeing it is often a good idea.
1420
1421While stopped (and not pending) the watcher is essentially in the
1422initialised state, that is it can be reused, moved, modified in any way
1423you wish.
1424
1425=back
1332 1426
1333=head2 WATCHER PRIORITY MODELS 1427=head2 WATCHER PRIORITY MODELS
1334 1428
1335Many event loops support I<watcher priorities>, which are usually small 1429Many event loops support I<watcher priorities>, which are usually small
1336integers that influence the ordering of event callback invocation 1430integers that influence the ordering of event callback invocation
1379 1473
1380For example, to emulate how many other event libraries handle priorities, 1474For example, to emulate how many other event libraries handle priorities,
1381you can associate an C<ev_idle> watcher to each such watcher, and in 1475you can associate an C<ev_idle> watcher to each such watcher, and in
1382the normal watcher callback, you just start the idle watcher. The real 1476the normal watcher callback, you just start the idle watcher. The real
1383processing is done in the idle watcher callback. This causes libev to 1477processing is done in the idle watcher callback. This causes libev to
1384continously poll and process kernel event data for the watcher, but when 1478continuously poll and process kernel event data for the watcher, but when
1385the lock-out case is known to be rare (which in turn is rare :), this is 1479the lock-out case is known to be rare (which in turn is rare :), this is
1386workable. 1480workable.
1387 1481
1388Usually, however, the lock-out model implemented that way will perform 1482Usually, however, the lock-out model implemented that way will perform
1389miserably under the type of load it was designed to handle. In that case, 1483miserably under the type of load it was designed to handle. In that case,
1403 { 1497 {
1404 // stop the I/O watcher, we received the event, but 1498 // stop the I/O watcher, we received the event, but
1405 // are not yet ready to handle it. 1499 // are not yet ready to handle it.
1406 ev_io_stop (EV_A_ w); 1500 ev_io_stop (EV_A_ w);
1407 1501
1408 // start the idle watcher to ahndle the actual event. 1502 // start the idle watcher to handle the actual event.
1409 // it will not be executed as long as other watchers 1503 // it will not be executed as long as other watchers
1410 // with the default priority are receiving events. 1504 // with the default priority are receiving events.
1411 ev_idle_start (EV_A_ &idle); 1505 ev_idle_start (EV_A_ &idle);
1412 } 1506 }
1413 1507
1463In general you can register as many read and/or write event watchers per 1557In general you can register as many read and/or write event watchers per
1464fd as you want (as long as you don't confuse yourself). Setting all file 1558fd as you want (as long as you don't confuse yourself). Setting all file
1465descriptors to non-blocking mode is also usually a good idea (but not 1559descriptors to non-blocking mode is also usually a good idea (but not
1466required if you know what you are doing). 1560required if you know what you are doing).
1467 1561
1468If you cannot use non-blocking mode, then force the use of a
1469known-to-be-good backend (at the time of this writing, this includes only
1470C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1471descriptors for which non-blocking operation makes no sense (such as
1472files) - libev doesn't guarentee any specific behaviour in that case.
1473
1474Another thing you have to watch out for is that it is quite easy to 1562Another thing you have to watch out for is that it is quite easy to
1475receive "spurious" readiness notifications, that is your callback might 1563receive "spurious" readiness notifications, that is, your callback might
1476be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1564be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1477because there is no data. Not only are some backends known to create a 1565because there is no data. It is very easy to get into this situation even
1478lot of those (for example Solaris ports), it is very easy to get into 1566with a relatively standard program structure. Thus it is best to always
1479this situation even with a relatively standard program structure. Thus 1567use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1480it is best to always use non-blocking I/O: An extra C<read>(2) returning
1481C<EAGAIN> is far preferable to a program hanging until some data arrives. 1568preferable to a program hanging until some data arrives.
1482 1569
1483If you cannot run the fd in non-blocking mode (for example you should 1570If you cannot run the fd in non-blocking mode (for example you should
1484not play around with an Xlib connection), then you have to separately 1571not play around with an Xlib connection), then you have to separately
1485re-test whether a file descriptor is really ready with a known-to-be good 1572re-test whether a file descriptor is really ready with a known-to-be good
1486interface such as poll (fortunately in our Xlib example, Xlib already 1573interface such as poll (fortunately in the case of Xlib, it already does
1487does this on its own, so its quite safe to use). Some people additionally 1574this on its own, so its quite safe to use). Some people additionally
1488use C<SIGALRM> and an interval timer, just to be sure you won't block 1575use C<SIGALRM> and an interval timer, just to be sure you won't block
1489indefinitely. 1576indefinitely.
1490 1577
1491But really, best use non-blocking mode. 1578But really, best use non-blocking mode.
1492 1579
1520 1607
1521There is no workaround possible except not registering events 1608There is no workaround possible except not registering events
1522for potentially C<dup ()>'ed file descriptors, or to resort to 1609for potentially C<dup ()>'ed file descriptors, or to resort to
1523C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1610C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1524 1611
1612=head3 The special problem of files
1613
1614Many people try to use C<select> (or libev) on file descriptors
1615representing files, and expect it to become ready when their program
1616doesn't block on disk accesses (which can take a long time on their own).
1617
1618However, this cannot ever work in the "expected" way - you get a readiness
1619notification as soon as the kernel knows whether and how much data is
1620there, and in the case of open files, that's always the case, so you
1621always get a readiness notification instantly, and your read (or possibly
1622write) will still block on the disk I/O.
1623
1624Another way to view it is that in the case of sockets, pipes, character
1625devices and so on, there is another party (the sender) that delivers data
1626on its own, but in the case of files, there is no such thing: the disk
1627will not send data on its own, simply because it doesn't know what you
1628wish to read - you would first have to request some data.
1629
1630Since files are typically not-so-well supported by advanced notification
1631mechanism, libev tries hard to emulate POSIX behaviour with respect
1632to files, even though you should not use it. The reason for this is
1633convenience: sometimes you want to watch STDIN or STDOUT, which is
1634usually a tty, often a pipe, but also sometimes files or special devices
1635(for example, C<epoll> on Linux works with F</dev/random> but not with
1636F</dev/urandom>), and even though the file might better be served with
1637asynchronous I/O instead of with non-blocking I/O, it is still useful when
1638it "just works" instead of freezing.
1639
1640So avoid file descriptors pointing to files when you know it (e.g. use
1641libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
1642when you rarely read from a file instead of from a socket, and want to
1643reuse the same code path.
1644
1525=head3 The special problem of fork 1645=head3 The special problem of fork
1526 1646
1527Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1647Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1528useless behaviour. Libev fully supports fork, but needs to be told about 1648useless behaviour. Libev fully supports fork, but needs to be told about
1529it in the child. 1649it in the child if you want to continue to use it in the child.
1530 1650
1531To support fork in your programs, you either have to call 1651To support fork in your child processes, you have to call C<ev_loop_fork
1532C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1652()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1533enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1653C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1534C<EVBACKEND_POLL>.
1535 1654
1536=head3 The special problem of SIGPIPE 1655=head3 The special problem of SIGPIPE
1537 1656
1538While not really specific to libev, it is easy to forget about C<SIGPIPE>: 1657While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1539when writing to a pipe whose other end has been closed, your program gets 1658when writing to a pipe whose other end has been closed, your program gets
1545somewhere, as that would have given you a big clue). 1664somewhere, as that would have given you a big clue).
1546 1665
1547=head3 The special problem of accept()ing when you can't 1666=head3 The special problem of accept()ing when you can't
1548 1667
1549Many implementations of the POSIX C<accept> function (for example, 1668Many implementations of the POSIX C<accept> function (for example,
1550found in port-2004 Linux) have the peculiar behaviour of not removing a 1669found in post-2004 Linux) have the peculiar behaviour of not removing a
1551connection from the pending queue in all error cases. 1670connection from the pending queue in all error cases.
1552 1671
1553For example, larger servers often run out of file descriptors (because 1672For example, larger servers often run out of file descriptors (because
1554of resource limits), causing C<accept> to fail with C<ENFILE> but not 1673of resource limits), causing C<accept> to fail with C<ENFILE> but not
1555rejecting the connection, leading to libev signalling readiness on 1674rejecting the connection, leading to libev signalling readiness on
1621 ... 1740 ...
1622 struct ev_loop *loop = ev_default_init (0); 1741 struct ev_loop *loop = ev_default_init (0);
1623 ev_io stdin_readable; 1742 ev_io stdin_readable;
1624 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1743 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1625 ev_io_start (loop, &stdin_readable); 1744 ev_io_start (loop, &stdin_readable);
1626 ev_loop (loop, 0); 1745 ev_run (loop, 0);
1627 1746
1628 1747
1629=head2 C<ev_timer> - relative and optionally repeating timeouts 1748=head2 C<ev_timer> - relative and optionally repeating timeouts
1630 1749
1631Timer watchers are simple relative timers that generate an event after a 1750Timer watchers are simple relative timers that generate an event after a
1640The callback is guaranteed to be invoked only I<after> its timeout has 1759The callback is guaranteed to be invoked only I<after> its timeout has
1641passed (not I<at>, so on systems with very low-resolution clocks this 1760passed (not I<at>, so on systems with very low-resolution clocks this
1642might introduce a small delay). If multiple timers become ready during the 1761might introduce a small delay). If multiple timers become ready during the
1643same loop iteration then the ones with earlier time-out values are invoked 1762same loop iteration then the ones with earlier time-out values are invoked
1644before ones of the same priority with later time-out values (but this is 1763before ones of the same priority with later time-out values (but this is
1645no longer true when a callback calls C<ev_loop> recursively). 1764no longer true when a callback calls C<ev_run> recursively).
1646 1765
1647=head3 Be smart about timeouts 1766=head3 Be smart about timeouts
1648 1767
1649Many real-world problems involve some kind of timeout, usually for error 1768Many real-world problems involve some kind of timeout, usually for error
1650recovery. A typical example is an HTTP request - if the other side hangs, 1769recovery. A typical example is an HTTP request - if the other side hangs,
1736 ev_tstamp timeout = last_activity + 60.; 1855 ev_tstamp timeout = last_activity + 60.;
1737 1856
1738 // if last_activity + 60. is older than now, we did time out 1857 // if last_activity + 60. is older than now, we did time out
1739 if (timeout < now) 1858 if (timeout < now)
1740 { 1859 {
1741 // timeout occured, take action 1860 // timeout occurred, take action
1742 } 1861 }
1743 else 1862 else
1744 { 1863 {
1745 // callback was invoked, but there was some activity, re-arm 1864 // callback was invoked, but there was some activity, re-arm
1746 // the watcher to fire in last_activity + 60, which is 1865 // the watcher to fire in last_activity + 60, which is
1773 callback (loop, timer, EV_TIMER); 1892 callback (loop, timer, EV_TIMER);
1774 1893
1775And when there is some activity, simply store the current time in 1894And when there is some activity, simply store the current time in
1776C<last_activity>, no libev calls at all: 1895C<last_activity>, no libev calls at all:
1777 1896
1778 last_actiivty = ev_now (loop); 1897 last_activity = ev_now (loop);
1779 1898
1780This technique is slightly more complex, but in most cases where the 1899This technique is slightly more complex, but in most cases where the
1781time-out is unlikely to be triggered, much more efficient. 1900time-out is unlikely to be triggered, much more efficient.
1782 1901
1783Changing the timeout is trivial as well (if it isn't hard-coded in the 1902Changing the timeout is trivial as well (if it isn't hard-coded in the
1821 1940
1822=head3 The special problem of time updates 1941=head3 The special problem of time updates
1823 1942
1824Establishing the current time is a costly operation (it usually takes at 1943Establishing the current time is a costly operation (it usually takes at
1825least two system calls): EV therefore updates its idea of the current 1944least two system calls): EV therefore updates its idea of the current
1826time only before and after C<ev_loop> collects new events, which causes a 1945time only before and after C<ev_run> collects new events, which causes a
1827growing difference between C<ev_now ()> and C<ev_time ()> when handling 1946growing difference between C<ev_now ()> and C<ev_time ()> when handling
1828lots of events in one iteration. 1947lots of events in one iteration.
1829 1948
1830The relative timeouts are calculated relative to the C<ev_now ()> 1949The relative timeouts are calculated relative to the C<ev_now ()>
1831time. This is usually the right thing as this timestamp refers to the time 1950time. This is usually the right thing as this timestamp refers to the time
1948 } 2067 }
1949 2068
1950 ev_timer mytimer; 2069 ev_timer mytimer;
1951 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2070 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1952 ev_timer_again (&mytimer); /* start timer */ 2071 ev_timer_again (&mytimer); /* start timer */
1953 ev_loop (loop, 0); 2072 ev_run (loop, 0);
1954 2073
1955 // and in some piece of code that gets executed on any "activity": 2074 // and in some piece of code that gets executed on any "activity":
1956 // reset the timeout to start ticking again at 10 seconds 2075 // reset the timeout to start ticking again at 10 seconds
1957 ev_timer_again (&mytimer); 2076 ev_timer_again (&mytimer);
1958 2077
1984 2103
1985As with timers, the callback is guaranteed to be invoked only when the 2104As with timers, the callback is guaranteed to be invoked only when the
1986point in time where it is supposed to trigger has passed. If multiple 2105point in time where it is supposed to trigger has passed. If multiple
1987timers become ready during the same loop iteration then the ones with 2106timers become ready during the same loop iteration then the ones with
1988earlier time-out values are invoked before ones with later time-out values 2107earlier time-out values are invoked before ones with later time-out values
1989(but this is no longer true when a callback calls C<ev_loop> recursively). 2108(but this is no longer true when a callback calls C<ev_run> recursively).
1990 2109
1991=head3 Watcher-Specific Functions and Data Members 2110=head3 Watcher-Specific Functions and Data Members
1992 2111
1993=over 4 2112=over 4
1994 2113
2122Example: Call a callback every hour, or, more precisely, whenever the 2241Example: Call a callback every hour, or, more precisely, whenever the
2123system time is divisible by 3600. The callback invocation times have 2242system time is divisible by 3600. The callback invocation times have
2124potentially a lot of jitter, but good long-term stability. 2243potentially a lot of jitter, but good long-term stability.
2125 2244
2126 static void 2245 static void
2127 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2246 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
2128 { 2247 {
2129 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2248 ... its now a full hour (UTC, or TAI or whatever your clock follows)
2130 } 2249 }
2131 2250
2132 ev_periodic hourly_tick; 2251 ev_periodic hourly_tick;
2155 2274
2156=head2 C<ev_signal> - signal me when a signal gets signalled! 2275=head2 C<ev_signal> - signal me when a signal gets signalled!
2157 2276
2158Signal watchers will trigger an event when the process receives a specific 2277Signal watchers will trigger an event when the process receives a specific
2159signal one or more times. Even though signals are very asynchronous, libev 2278signal one or more times. Even though signals are very asynchronous, libev
2160will try it's best to deliver signals synchronously, i.e. as part of the 2279will try its best to deliver signals synchronously, i.e. as part of the
2161normal event processing, like any other event. 2280normal event processing, like any other event.
2162 2281
2163If you want signals to be delivered truly asynchronously, just use 2282If you want signals to be delivered truly asynchronously, just use
2164C<sigaction> as you would do without libev and forget about sharing 2283C<sigaction> as you would do without libev and forget about sharing
2165the signal. You can even use C<ev_async> from a signal handler to 2284the signal. You can even use C<ev_async> from a signal handler to
2184=head3 The special problem of inheritance over fork/execve/pthread_create 2303=head3 The special problem of inheritance over fork/execve/pthread_create
2185 2304
2186Both the signal mask (C<sigprocmask>) and the signal disposition 2305Both the signal mask (C<sigprocmask>) and the signal disposition
2187(C<sigaction>) are unspecified after starting a signal watcher (and after 2306(C<sigaction>) are unspecified after starting a signal watcher (and after
2188stopping it again), that is, libev might or might not block the signal, 2307stopping it again), that is, libev might or might not block the signal,
2189and might or might not set or restore the installed signal handler. 2308and might or might not set or restore the installed signal handler (but
2309see C<EVFLAG_NOSIGMASK>).
2190 2310
2191While this does not matter for the signal disposition (libev never 2311While this does not matter for the signal disposition (libev never
2192sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on 2312sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2193C<execve>), this matters for the signal mask: many programs do not expect 2313C<execve>), this matters for the signal mask: many programs do not expect
2194certain signals to be blocked. 2314certain signals to be blocked.
2208 2328
2209So I can't stress this enough: I<If you do not reset your signal mask when 2329So I can't stress this enough: I<If you do not reset your signal mask when
2210you expect it to be empty, you have a race condition in your code>. This 2330you expect it to be empty, you have a race condition in your code>. This
2211is not a libev-specific thing, this is true for most event libraries. 2331is not a libev-specific thing, this is true for most event libraries.
2212 2332
2333=head3 The special problem of threads signal handling
2334
2335POSIX threads has problematic signal handling semantics, specifically,
2336a lot of functionality (sigfd, sigwait etc.) only really works if all
2337threads in a process block signals, which is hard to achieve.
2338
2339When you want to use sigwait (or mix libev signal handling with your own
2340for the same signals), you can tackle this problem by globally blocking
2341all signals before creating any threads (or creating them with a fully set
2342sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
2343loops. Then designate one thread as "signal receiver thread" which handles
2344these signals. You can pass on any signals that libev might be interested
2345in by calling C<ev_feed_signal>.
2346
2213=head3 Watcher-Specific Functions and Data Members 2347=head3 Watcher-Specific Functions and Data Members
2214 2348
2215=over 4 2349=over 4
2216 2350
2217=item ev_signal_init (ev_signal *, callback, int signum) 2351=item ev_signal_init (ev_signal *, callback, int signum)
2232Example: Try to exit cleanly on SIGINT. 2366Example: Try to exit cleanly on SIGINT.
2233 2367
2234 static void 2368 static void
2235 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2369 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2236 { 2370 {
2237 ev_unloop (loop, EVUNLOOP_ALL); 2371 ev_break (loop, EVBREAK_ALL);
2238 } 2372 }
2239 2373
2240 ev_signal signal_watcher; 2374 ev_signal signal_watcher;
2241 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2375 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2242 ev_signal_start (loop, &signal_watcher); 2376 ev_signal_start (loop, &signal_watcher);
2628 2762
2629Prepare and check watchers are usually (but not always) used in pairs: 2763Prepare and check watchers are usually (but not always) used in pairs:
2630prepare watchers get invoked before the process blocks and check watchers 2764prepare watchers get invoked before the process blocks and check watchers
2631afterwards. 2765afterwards.
2632 2766
2633You I<must not> call C<ev_loop> or similar functions that enter 2767You I<must not> call C<ev_run> or similar functions that enter
2634the current event loop from either C<ev_prepare> or C<ev_check> 2768the current event loop from either C<ev_prepare> or C<ev_check>
2635watchers. Other loops than the current one are fine, however. The 2769watchers. Other loops than the current one are fine, however. The
2636rationale behind this is that you do not need to check for recursion in 2770rationale behind this is that you do not need to check for recursion in
2637those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2771those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2638C<ev_check> so if you have one watcher of each kind they will always be 2772C<ev_check> so if you have one watcher of each kind they will always be
2806 2940
2807 if (timeout >= 0) 2941 if (timeout >= 0)
2808 // create/start timer 2942 // create/start timer
2809 2943
2810 // poll 2944 // poll
2811 ev_loop (EV_A_ 0); 2945 ev_run (EV_A_ 0);
2812 2946
2813 // stop timer again 2947 // stop timer again
2814 if (timeout >= 0) 2948 if (timeout >= 0)
2815 ev_timer_stop (EV_A_ &to); 2949 ev_timer_stop (EV_A_ &to);
2816 2950
2894if you do not want that, you need to temporarily stop the embed watcher). 3028if you do not want that, you need to temporarily stop the embed watcher).
2895 3029
2896=item ev_embed_sweep (loop, ev_embed *) 3030=item ev_embed_sweep (loop, ev_embed *)
2897 3031
2898Make a single, non-blocking sweep over the embedded loop. This works 3032Make a single, non-blocking sweep over the embedded loop. This works
2899similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 3033similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2900appropriate way for embedded loops. 3034appropriate way for embedded loops.
2901 3035
2902=item struct ev_loop *other [read-only] 3036=item struct ev_loop *other [read-only]
2903 3037
2904The embedded event loop. 3038The embedded event loop.
2964C<ev_default_fork> cheats and calls it in the wrong process, the fork 3098C<ev_default_fork> cheats and calls it in the wrong process, the fork
2965handlers will be invoked, too, of course. 3099handlers will be invoked, too, of course.
2966 3100
2967=head3 The special problem of life after fork - how is it possible? 3101=head3 The special problem of life after fork - how is it possible?
2968 3102
2969Most uses of C<fork()> consist of forking, then some simple calls to ste 3103Most uses of C<fork()> consist of forking, then some simple calls to set
2970up/change the process environment, followed by a call to C<exec()>. This 3104up/change the process environment, followed by a call to C<exec()>. This
2971sequence should be handled by libev without any problems. 3105sequence should be handled by libev without any problems.
2972 3106
2973This changes when the application actually wants to do event handling 3107This changes when the application actually wants to do event handling
2974in the child, or both parent in child, in effect "continuing" after the 3108in the child, or both parent in child, in effect "continuing" after the
2990disadvantage of having to use multiple event loops (which do not support 3124disadvantage of having to use multiple event loops (which do not support
2991signal watchers). 3125signal watchers).
2992 3126
2993When this is not possible, or you want to use the default loop for 3127When this is not possible, or you want to use the default loop for
2994other reasons, then in the process that wants to start "fresh", call 3128other reasons, then in the process that wants to start "fresh", call
2995C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying 3129C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
2996the default loop will "orphan" (not stop) all registered watchers, so you 3130Destroying the default loop will "orphan" (not stop) all registered
2997have to be careful not to execute code that modifies those watchers. Note 3131watchers, so you have to be careful not to execute code that modifies
2998also that in that case, you have to re-register any signal watchers. 3132those watchers. Note also that in that case, you have to re-register any
3133signal watchers.
2999 3134
3000=head3 Watcher-Specific Functions and Data Members 3135=head3 Watcher-Specific Functions and Data Members
3001 3136
3002=over 4 3137=over 4
3003 3138
3004=item ev_fork_init (ev_signal *, callback) 3139=item ev_fork_init (ev_fork *, callback)
3005 3140
3006Initialises and configures the fork watcher - it has no parameters of any 3141Initialises and configures the fork watcher - it has no parameters of any
3007kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 3142kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3008believe me. 3143really.
3009 3144
3010=back 3145=back
3011 3146
3012 3147
3148=head2 C<ev_cleanup> - even the best things end
3149
3150Cleanup watchers are called just before the event loop is being destroyed
3151by a call to C<ev_loop_destroy>.
3152
3153While there is no guarantee that the event loop gets destroyed, cleanup
3154watchers provide a convenient method to install cleanup hooks for your
3155program, worker threads and so on - you just to make sure to destroy the
3156loop when you want them to be invoked.
3157
3158Cleanup watchers are invoked in the same way as any other watcher. Unlike
3159all other watchers, they do not keep a reference to the event loop (which
3160makes a lot of sense if you think about it). Like all other watchers, you
3161can call libev functions in the callback, except C<ev_cleanup_start>.
3162
3163=head3 Watcher-Specific Functions and Data Members
3164
3165=over 4
3166
3167=item ev_cleanup_init (ev_cleanup *, callback)
3168
3169Initialises and configures the cleanup watcher - it has no parameters of
3170any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3171pointless, I assure you.
3172
3173=back
3174
3175Example: Register an atexit handler to destroy the default loop, so any
3176cleanup functions are called.
3177
3178 static void
3179 program_exits (void)
3180 {
3181 ev_loop_destroy (EV_DEFAULT_UC);
3182 }
3183
3184 ...
3185 atexit (program_exits);
3186
3187
3013=head2 C<ev_async> - how to wake up another event loop 3188=head2 C<ev_async> - how to wake up an event loop
3014 3189
3015In general, you cannot use an C<ev_loop> from multiple threads or other 3190In general, you cannot use an C<ev_run> from multiple threads or other
3016asynchronous sources such as signal handlers (as opposed to multiple event 3191asynchronous sources such as signal handlers (as opposed to multiple event
3017loops - those are of course safe to use in different threads). 3192loops - those are of course safe to use in different threads).
3018 3193
3019Sometimes, however, you need to wake up another event loop you do not 3194Sometimes, however, you need to wake up an event loop you do not control,
3020control, for example because it belongs to another thread. This is what 3195for example because it belongs to another thread. This is what C<ev_async>
3021C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3196watchers do: as long as the C<ev_async> watcher is active, you can signal
3022can signal it by calling C<ev_async_send>, which is thread- and signal 3197it by calling C<ev_async_send>, which is thread- and signal safe.
3023safe.
3024 3198
3025This functionality is very similar to C<ev_signal> watchers, as signals, 3199This functionality is very similar to C<ev_signal> watchers, as signals,
3026too, are asynchronous in nature, and signals, too, will be compressed 3200too, are asynchronous in nature, and signals, too, will be compressed
3027(i.e. the number of callback invocations may be less than the number of 3201(i.e. the number of callback invocations may be less than the number of
3028C<ev_async_sent> calls). 3202C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3203of "global async watchers" by using a watcher on an otherwise unused
3204signal, and C<ev_feed_signal> to signal this watcher from another thread,
3205even without knowing which loop owns the signal.
3029 3206
3030Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not 3207Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3031just the default loop. 3208just the default loop.
3032 3209
3033=head3 Queueing 3210=head3 Queueing
3209Feed an event on the given fd, as if a file descriptor backend detected 3386Feed an event on the given fd, as if a file descriptor backend detected
3210the given events it. 3387the given events it.
3211 3388
3212=item ev_feed_signal_event (loop, int signum) 3389=item ev_feed_signal_event (loop, int signum)
3213 3390
3214Feed an event as if the given signal occurred (C<loop> must be the default 3391Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3215loop!). 3392which is async-safe.
3216 3393
3217=back 3394=back
3395
3396
3397=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3398
3399This section explains some common idioms that are not immediately
3400obvious. Note that examples are sprinkled over the whole manual, and this
3401section only contains stuff that wouldn't fit anywhere else.
3402
3403=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3404
3405Each watcher has, by default, a C<void *data> member that you can read
3406or modify at any time: libev will completely ignore it. This can be used
3407to associate arbitrary data with your watcher. If you need more data and
3408don't want to allocate memory separately and store a pointer to it in that
3409data member, you can also "subclass" the watcher type and provide your own
3410data:
3411
3412 struct my_io
3413 {
3414 ev_io io;
3415 int otherfd;
3416 void *somedata;
3417 struct whatever *mostinteresting;
3418 };
3419
3420 ...
3421 struct my_io w;
3422 ev_io_init (&w.io, my_cb, fd, EV_READ);
3423
3424And since your callback will be called with a pointer to the watcher, you
3425can cast it back to your own type:
3426
3427 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
3428 {
3429 struct my_io *w = (struct my_io *)w_;
3430 ...
3431 }
3432
3433More interesting and less C-conformant ways of casting your callback
3434function type instead have been omitted.
3435
3436=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
3437
3438Another common scenario is to use some data structure with multiple
3439embedded watchers, in effect creating your own watcher that combines
3440multiple libev event sources into one "super-watcher":
3441
3442 struct my_biggy
3443 {
3444 int some_data;
3445 ev_timer t1;
3446 ev_timer t2;
3447 }
3448
3449In this case getting the pointer to C<my_biggy> is a bit more
3450complicated: Either you store the address of your C<my_biggy> struct in
3451the C<data> member of the watcher (for woozies or C++ coders), or you need
3452to use some pointer arithmetic using C<offsetof> inside your watchers (for
3453real programmers):
3454
3455 #include <stddef.h>
3456
3457 static void
3458 t1_cb (EV_P_ ev_timer *w, int revents)
3459 {
3460 struct my_biggy big = (struct my_biggy *)
3461 (((char *)w) - offsetof (struct my_biggy, t1));
3462 }
3463
3464 static void
3465 t2_cb (EV_P_ ev_timer *w, int revents)
3466 {
3467 struct my_biggy big = (struct my_biggy *)
3468 (((char *)w) - offsetof (struct my_biggy, t2));
3469 }
3470
3471=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3472
3473Often (especially in GUI toolkits) there are places where you have
3474I<modal> interaction, which is most easily implemented by recursively
3475invoking C<ev_run>.
3476
3477This brings the problem of exiting - a callback might want to finish the
3478main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3479a modal "Are you sure?" dialog is still waiting), or just the nested one
3480and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3481other combination: In these cases, C<ev_break> will not work alone.
3482
3483The solution is to maintain "break this loop" variable for each C<ev_run>
3484invocation, and use a loop around C<ev_run> until the condition is
3485triggered, using C<EVRUN_ONCE>:
3486
3487 // main loop
3488 int exit_main_loop = 0;
3489
3490 while (!exit_main_loop)
3491 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3492
3493 // in a model watcher
3494 int exit_nested_loop = 0;
3495
3496 while (!exit_nested_loop)
3497 ev_run (EV_A_ EVRUN_ONCE);
3498
3499To exit from any of these loops, just set the corresponding exit variable:
3500
3501 // exit modal loop
3502 exit_nested_loop = 1;
3503
3504 // exit main program, after modal loop is finished
3505 exit_main_loop = 1;
3506
3507 // exit both
3508 exit_main_loop = exit_nested_loop = 1;
3509
3510=head2 THREAD LOCKING EXAMPLE
3511
3512Here is a fictitious example of how to run an event loop in a different
3513thread from where callbacks are being invoked and watchers are
3514created/added/removed.
3515
3516For a real-world example, see the C<EV::Loop::Async> perl module,
3517which uses exactly this technique (which is suited for many high-level
3518languages).
3519
3520The example uses a pthread mutex to protect the loop data, a condition
3521variable to wait for callback invocations, an async watcher to notify the
3522event loop thread and an unspecified mechanism to wake up the main thread.
3523
3524First, you need to associate some data with the event loop:
3525
3526 typedef struct {
3527 mutex_t lock; /* global loop lock */
3528 ev_async async_w;
3529 thread_t tid;
3530 cond_t invoke_cv;
3531 } userdata;
3532
3533 void prepare_loop (EV_P)
3534 {
3535 // for simplicity, we use a static userdata struct.
3536 static userdata u;
3537
3538 ev_async_init (&u->async_w, async_cb);
3539 ev_async_start (EV_A_ &u->async_w);
3540
3541 pthread_mutex_init (&u->lock, 0);
3542 pthread_cond_init (&u->invoke_cv, 0);
3543
3544 // now associate this with the loop
3545 ev_set_userdata (EV_A_ u);
3546 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3547 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3548
3549 // then create the thread running ev_loop
3550 pthread_create (&u->tid, 0, l_run, EV_A);
3551 }
3552
3553The callback for the C<ev_async> watcher does nothing: the watcher is used
3554solely to wake up the event loop so it takes notice of any new watchers
3555that might have been added:
3556
3557 static void
3558 async_cb (EV_P_ ev_async *w, int revents)
3559 {
3560 // just used for the side effects
3561 }
3562
3563The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
3564protecting the loop data, respectively.
3565
3566 static void
3567 l_release (EV_P)
3568 {
3569 userdata *u = ev_userdata (EV_A);
3570 pthread_mutex_unlock (&u->lock);
3571 }
3572
3573 static void
3574 l_acquire (EV_P)
3575 {
3576 userdata *u = ev_userdata (EV_A);
3577 pthread_mutex_lock (&u->lock);
3578 }
3579
3580The event loop thread first acquires the mutex, and then jumps straight
3581into C<ev_run>:
3582
3583 void *
3584 l_run (void *thr_arg)
3585 {
3586 struct ev_loop *loop = (struct ev_loop *)thr_arg;
3587
3588 l_acquire (EV_A);
3589 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
3590 ev_run (EV_A_ 0);
3591 l_release (EV_A);
3592
3593 return 0;
3594 }
3595
3596Instead of invoking all pending watchers, the C<l_invoke> callback will
3597signal the main thread via some unspecified mechanism (signals? pipe
3598writes? C<Async::Interrupt>?) and then waits until all pending watchers
3599have been called (in a while loop because a) spurious wakeups are possible
3600and b) skipping inter-thread-communication when there are no pending
3601watchers is very beneficial):
3602
3603 static void
3604 l_invoke (EV_P)
3605 {
3606 userdata *u = ev_userdata (EV_A);
3607
3608 while (ev_pending_count (EV_A))
3609 {
3610 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
3611 pthread_cond_wait (&u->invoke_cv, &u->lock);
3612 }
3613 }
3614
3615Now, whenever the main thread gets told to invoke pending watchers, it
3616will grab the lock, call C<ev_invoke_pending> and then signal the loop
3617thread to continue:
3618
3619 static void
3620 real_invoke_pending (EV_P)
3621 {
3622 userdata *u = ev_userdata (EV_A);
3623
3624 pthread_mutex_lock (&u->lock);
3625 ev_invoke_pending (EV_A);
3626 pthread_cond_signal (&u->invoke_cv);
3627 pthread_mutex_unlock (&u->lock);
3628 }
3629
3630Whenever you want to start/stop a watcher or do other modifications to an
3631event loop, you will now have to lock:
3632
3633 ev_timer timeout_watcher;
3634 userdata *u = ev_userdata (EV_A);
3635
3636 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
3637
3638 pthread_mutex_lock (&u->lock);
3639 ev_timer_start (EV_A_ &timeout_watcher);
3640 ev_async_send (EV_A_ &u->async_w);
3641 pthread_mutex_unlock (&u->lock);
3642
3643Note that sending the C<ev_async> watcher is required because otherwise
3644an event loop currently blocking in the kernel will have no knowledge
3645about the newly added timer. By waking up the loop it will pick up any new
3646watchers in the next event loop iteration.
3647
3648=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
3649
3650While the overhead of a callback that e.g. schedules a thread is small, it
3651is still an overhead. If you embed libev, and your main usage is with some
3652kind of threads or coroutines, you might want to customise libev so that
3653doesn't need callbacks anymore.
3654
3655Imagine you have coroutines that you can switch to using a function
3656C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
3657and that due to some magic, the currently active coroutine is stored in a
3658global called C<current_coro>. Then you can build your own "wait for libev
3659event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
3660the differing C<;> conventions):
3661
3662 #define EV_CB_DECLARE(type) struct my_coro *cb;
3663 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3664
3665That means instead of having a C callback function, you store the
3666coroutine to switch to in each watcher, and instead of having libev call
3667your callback, you instead have it switch to that coroutine.
3668
3669A coroutine might now wait for an event with a function called
3670C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
3671matter when, or whether the watcher is active or not when this function is
3672called):
3673
3674 void
3675 wait_for_event (ev_watcher *w)
3676 {
3677 ev_cb_set (w) = current_coro;
3678 switch_to (libev_coro);
3679 }
3680
3681That basically suspends the coroutine inside C<wait_for_event> and
3682continues the libev coroutine, which, when appropriate, switches back to
3683this or any other coroutine. I am sure if you sue this your own :)
3684
3685You can do similar tricks if you have, say, threads with an event queue -
3686instead of storing a coroutine, you store the queue object and instead of
3687switching to a coroutine, you push the watcher onto the queue and notify
3688any waiters.
3689
3690To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
3691files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3692
3693 // my_ev.h
3694 #define EV_CB_DECLARE(type) struct my_coro *cb;
3695 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3696 #include "../libev/ev.h"
3697
3698 // my_ev.c
3699 #define EV_H "my_ev.h"
3700 #include "../libev/ev.c"
3701
3702And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
3703F<my_ev.c> into your project. When properly specifying include paths, you
3704can even use F<ev.h> as header file name directly.
3218 3705
3219 3706
3220=head1 LIBEVENT EMULATION 3707=head1 LIBEVENT EMULATION
3221 3708
3222Libev offers a compatibility emulation layer for libevent. It cannot 3709Libev offers a compatibility emulation layer for libevent. It cannot
3223emulate the internals of libevent, so here are some usage hints: 3710emulate the internals of libevent, so here are some usage hints:
3224 3711
3225=over 4 3712=over 4
3713
3714=item * Only the libevent-1.4.1-beta API is being emulated.
3715
3716This was the newest libevent version available when libev was implemented,
3717and is still mostly unchanged in 2010.
3226 3718
3227=item * Use it by including <event.h>, as usual. 3719=item * Use it by including <event.h>, as usual.
3228 3720
3229=item * The following members are fully supported: ev_base, ev_callback, 3721=item * The following members are fully supported: ev_base, ev_callback,
3230ev_arg, ev_fd, ev_res, ev_events. 3722ev_arg, ev_fd, ev_res, ev_events.
3236=item * Priorities are not currently supported. Initialising priorities 3728=item * Priorities are not currently supported. Initialising priorities
3237will fail and all watchers will have the same priority, even though there 3729will fail and all watchers will have the same priority, even though there
3238is an ev_pri field. 3730is an ev_pri field.
3239 3731
3240=item * In libevent, the last base created gets the signals, in libev, the 3732=item * In libevent, the last base created gets the signals, in libev, the
3241first base created (== the default loop) gets the signals. 3733base that registered the signal gets the signals.
3242 3734
3243=item * Other members are not supported. 3735=item * Other members are not supported.
3244 3736
3245=item * The libev emulation is I<not> ABI compatible to libevent, you need 3737=item * The libev emulation is I<not> ABI compatible to libevent, you need
3246to use the libev header file and library. 3738to use the libev header file and library.
3265Care has been taken to keep the overhead low. The only data member the C++ 3757Care has been taken to keep the overhead low. The only data member the C++
3266classes add (compared to plain C-style watchers) is the event loop pointer 3758classes add (compared to plain C-style watchers) is the event loop pointer
3267that the watcher is associated with (or no additional members at all if 3759that the watcher is associated with (or no additional members at all if
3268you disable C<EV_MULTIPLICITY> when embedding libev). 3760you disable C<EV_MULTIPLICITY> when embedding libev).
3269 3761
3270Currently, functions, and static and non-static member functions can be 3762Currently, functions, static and non-static member functions and classes
3271used as callbacks. Other types should be easy to add as long as they only 3763with C<operator ()> can be used as callbacks. Other types should be easy
3272need one additional pointer for context. If you need support for other 3764to add as long as they only need one additional pointer for context. If
3273types of functors please contact the author (preferably after implementing 3765you need support for other types of functors please contact the author
3274it). 3766(preferably after implementing it).
3275 3767
3276Here is a list of things available in the C<ev> namespace: 3768Here is a list of things available in the C<ev> namespace:
3277 3769
3278=over 4 3770=over 4
3279 3771
3340 myclass obj; 3832 myclass obj;
3341 ev::io iow; 3833 ev::io iow;
3342 iow.set <myclass, &myclass::io_cb> (&obj); 3834 iow.set <myclass, &myclass::io_cb> (&obj);
3343 3835
3344=item w->set (object *) 3836=item w->set (object *)
3345
3346This is an B<experimental> feature that might go away in a future version.
3347 3837
3348This is a variation of a method callback - leaving out the method to call 3838This is a variation of a method callback - leaving out the method to call
3349will default the method to C<operator ()>, which makes it possible to use 3839will default the method to C<operator ()>, which makes it possible to use
3350functor objects without having to manually specify the C<operator ()> all 3840functor objects without having to manually specify the C<operator ()> all
3351the time. Incidentally, you can then also leave out the template argument 3841the time. Incidentally, you can then also leave out the template argument
3391Associates a different C<struct ev_loop> with this watcher. You can only 3881Associates a different C<struct ev_loop> with this watcher. You can only
3392do this when the watcher is inactive (and not pending either). 3882do this when the watcher is inactive (and not pending either).
3393 3883
3394=item w->set ([arguments]) 3884=item w->set ([arguments])
3395 3885
3396Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3886Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3397called at least once. Unlike the C counterpart, an active watcher gets 3887method or a suitable start method must be called at least once. Unlike the
3398automatically stopped and restarted when reconfiguring it with this 3888C counterpart, an active watcher gets automatically stopped and restarted
3399method. 3889when reconfiguring it with this method.
3400 3890
3401=item w->start () 3891=item w->start ()
3402 3892
3403Starts the watcher. Note that there is no C<loop> argument, as the 3893Starts the watcher. Note that there is no C<loop> argument, as the
3404constructor already stores the event loop. 3894constructor already stores the event loop.
3405 3895
3896=item w->start ([arguments])
3897
3898Instead of calling C<set> and C<start> methods separately, it is often
3899convenient to wrap them in one call. Uses the same type of arguments as
3900the configure C<set> method of the watcher.
3901
3406=item w->stop () 3902=item w->stop ()
3407 3903
3408Stops the watcher if it is active. Again, no C<loop> argument. 3904Stops the watcher if it is active. Again, no C<loop> argument.
3409 3905
3410=item w->again () (C<ev::timer>, C<ev::periodic> only) 3906=item w->again () (C<ev::timer>, C<ev::periodic> only)
3422 3918
3423=back 3919=back
3424 3920
3425=back 3921=back
3426 3922
3427Example: Define a class with an IO and idle watcher, start one of them in 3923Example: Define a class with two I/O and idle watchers, start the I/O
3428the constructor. 3924watchers in the constructor.
3429 3925
3430 class myclass 3926 class myclass
3431 { 3927 {
3432 ev::io io ; void io_cb (ev::io &w, int revents); 3928 ev::io io ; void io_cb (ev::io &w, int revents);
3929 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3433 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3930 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3434 3931
3435 myclass (int fd) 3932 myclass (int fd)
3436 { 3933 {
3437 io .set <myclass, &myclass::io_cb > (this); 3934 io .set <myclass, &myclass::io_cb > (this);
3935 io2 .set <myclass, &myclass::io2_cb > (this);
3438 idle.set <myclass, &myclass::idle_cb> (this); 3936 idle.set <myclass, &myclass::idle_cb> (this);
3439 3937
3440 io.start (fd, ev::READ); 3938 io.set (fd, ev::WRITE); // configure the watcher
3939 io.start (); // start it whenever convenient
3940
3941 io2.start (fd, ev::READ); // set + start in one call
3441 } 3942 }
3442 }; 3943 };
3443 3944
3444 3945
3445=head1 OTHER LANGUAGE BINDINGS 3946=head1 OTHER LANGUAGE BINDINGS
3519loop argument"). The C<EV_A> form is used when this is the sole argument, 4020loop argument"). The C<EV_A> form is used when this is the sole argument,
3520C<EV_A_> is used when other arguments are following. Example: 4021C<EV_A_> is used when other arguments are following. Example:
3521 4022
3522 ev_unref (EV_A); 4023 ev_unref (EV_A);
3523 ev_timer_add (EV_A_ watcher); 4024 ev_timer_add (EV_A_ watcher);
3524 ev_loop (EV_A_ 0); 4025 ev_run (EV_A_ 0);
3525 4026
3526It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 4027It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3527which is often provided by the following macro. 4028which is often provided by the following macro.
3528 4029
3529=item C<EV_P>, C<EV_P_> 4030=item C<EV_P>, C<EV_P_>
3569 } 4070 }
3570 4071
3571 ev_check check; 4072 ev_check check;
3572 ev_check_init (&check, check_cb); 4073 ev_check_init (&check, check_cb);
3573 ev_check_start (EV_DEFAULT_ &check); 4074 ev_check_start (EV_DEFAULT_ &check);
3574 ev_loop (EV_DEFAULT_ 0); 4075 ev_run (EV_DEFAULT_ 0);
3575 4076
3576=head1 EMBEDDING 4077=head1 EMBEDDING
3577 4078
3578Libev can (and often is) directly embedded into host 4079Libev can (and often is) directly embedded into host
3579applications. Examples of applications that embed it include the Deliantra 4080applications. Examples of applications that embed it include the Deliantra
3664define before including (or compiling) any of its files. The default in 4165define before including (or compiling) any of its files. The default in
3665the absence of autoconf is documented for every option. 4166the absence of autoconf is documented for every option.
3666 4167
3667Symbols marked with "(h)" do not change the ABI, and can have different 4168Symbols marked with "(h)" do not change the ABI, and can have different
3668values when compiling libev vs. including F<ev.h>, so it is permissible 4169values when compiling libev vs. including F<ev.h>, so it is permissible
3669to redefine them before including F<ev.h> without breakign compatibility 4170to redefine them before including F<ev.h> without breaking compatibility
3670to a compiled library. All other symbols change the ABI, which means all 4171to a compiled library. All other symbols change the ABI, which means all
3671users of libev and the libev code itself must be compiled with compatible 4172users of libev and the libev code itself must be compiled with compatible
3672settings. 4173settings.
3673 4174
3674=over 4 4175=over 4
4176
4177=item EV_COMPAT3 (h)
4178
4179Backwards compatibility is a major concern for libev. This is why this
4180release of libev comes with wrappers for the functions and symbols that
4181have been renamed between libev version 3 and 4.
4182
4183You can disable these wrappers (to test compatibility with future
4184versions) by defining C<EV_COMPAT3> to C<0> when compiling your
4185sources. This has the additional advantage that you can drop the C<struct>
4186from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
4187typedef in that case.
4188
4189In some future version, the default for C<EV_COMPAT3> will become C<0>,
4190and in some even more future version the compatibility code will be
4191removed completely.
3675 4192
3676=item EV_STANDALONE (h) 4193=item EV_STANDALONE (h)
3677 4194
3678Must always be C<1> if you do not use autoconf configuration, which 4195Must always be C<1> if you do not use autoconf configuration, which
3679keeps libev from including F<config.h>, and it also defines dummy 4196keeps libev from including F<config.h>, and it also defines dummy
3886EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE, 4403EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3887EV_ASYNC_ENABLE, EV_CHILD_ENABLE. 4404EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3888 4405
3889If undefined or defined to be C<1> (and the platform supports it), then 4406If undefined or defined to be C<1> (and the platform supports it), then
3890the respective watcher type is supported. If defined to be C<0>, then it 4407the respective watcher type is supported. If defined to be C<0>, then it
3891is not. Disabling watcher types mainly saves codesize. 4408is not. Disabling watcher types mainly saves code size.
3892 4409
3893=item EV_FEATURES 4410=item EV_FEATURES
3894 4411
3895If you need to shave off some kilobytes of code at the expense of some 4412If you need to shave off some kilobytes of code at the expense of some
3896speed (but with the full API), you can define this symbol to request 4413speed (but with the full API), you can define this symbol to request
3916 4433
3917=item C<1> - faster/larger code 4434=item C<1> - faster/larger code
3918 4435
3919Use larger code to speed up some operations. 4436Use larger code to speed up some operations.
3920 4437
3921Currently this is used to override some inlining decisions (enlarging the roughly 4438Currently this is used to override some inlining decisions (enlarging the
392230% code size on amd64. 4439code size by roughly 30% on amd64).
3923 4440
3924When optimising for size, use of compiler flags such as C<-Os> with 4441When optimising for size, use of compiler flags such as C<-Os> with
3925gcc recommended, as well as C<-DNDEBUG>, as libev contains a number of 4442gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
3926assertions. 4443assertions.
3927 4444
3928=item C<2> - faster/larger data structures 4445=item C<2> - faster/larger data structures
3929 4446
3930Replaces the small 2-heap for timer management by a faster 4-heap, larger 4447Replaces the small 2-heap for timer management by a faster 4-heap, larger
3931hash table sizes and so on. This will usually further increase codesize 4448hash table sizes and so on. This will usually further increase code size
3932and can additionally have an effect on the size of data structures at 4449and can additionally have an effect on the size of data structures at
3933runtime. 4450runtime.
3934 4451
3935=item C<4> - full API configuration 4452=item C<4> - full API configuration
3936 4453
3973I/O watcher then might come out at only 5Kb. 4490I/O watcher then might come out at only 5Kb.
3974 4491
3975=item EV_AVOID_STDIO 4492=item EV_AVOID_STDIO
3976 4493
3977If this is set to C<1> at compiletime, then libev will avoid using stdio 4494If this is set to C<1> at compiletime, then libev will avoid using stdio
3978functions (printf, scanf, perror etc.). This will increase the codesize 4495functions (printf, scanf, perror etc.). This will increase the code size
3979somewhat, but if your program doesn't otherwise depend on stdio and your 4496somewhat, but if your program doesn't otherwise depend on stdio and your
3980libc allows it, this avoids linking in the stdio library which is quite 4497libc allows it, this avoids linking in the stdio library which is quite
3981big. 4498big.
3982 4499
3983Note that error messages might become less precise when this option is 4500Note that error messages might become less precise when this option is
3987 4504
3988The highest supported signal number, +1 (or, the number of 4505The highest supported signal number, +1 (or, the number of
3989signals): Normally, libev tries to deduce the maximum number of signals 4506signals): Normally, libev tries to deduce the maximum number of signals
3990automatically, but sometimes this fails, in which case it can be 4507automatically, but sometimes this fails, in which case it can be
3991specified. Also, using a lower number than detected (C<32> should be 4508specified. Also, using a lower number than detected (C<32> should be
3992good for about any system in existance) can save some memory, as libev 4509good for about any system in existence) can save some memory, as libev
3993statically allocates some 12-24 bytes per signal number. 4510statically allocates some 12-24 bytes per signal number.
3994 4511
3995=item EV_PID_HASHSIZE 4512=item EV_PID_HASHSIZE
3996 4513
3997C<ev_child> watchers use a small hash table to distribute workload by 4514C<ev_child> watchers use a small hash table to distribute workload by
4029The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it 4546The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
4030will be C<0>. 4547will be C<0>.
4031 4548
4032=item EV_VERIFY 4549=item EV_VERIFY
4033 4550
4034Controls how much internal verification (see C<ev_loop_verify ()>) will 4551Controls how much internal verification (see C<ev_verify ()>) will
4035be done: If set to C<0>, no internal verification code will be compiled 4552be done: If set to C<0>, no internal verification code will be compiled
4036in. If set to C<1>, then verification code will be compiled in, but not 4553in. If set to C<1>, then verification code will be compiled in, but not
4037called. If set to C<2>, then the internal verification code will be 4554called. If set to C<2>, then the internal verification code will be
4038called once per loop, which can slow down libev. If set to C<3>, then the 4555called once per loop, which can slow down libev. If set to C<3>, then the
4039verification code will be called very frequently, which will slow down 4556verification code will be called very frequently, which will slow down
4043will be C<0>. 4560will be C<0>.
4044 4561
4045=item EV_COMMON 4562=item EV_COMMON
4046 4563
4047By default, all watchers have a C<void *data> member. By redefining 4564By default, all watchers have a C<void *data> member. By redefining
4048this macro to a something else you can include more and other types of 4565this macro to something else you can include more and other types of
4049members. You have to define it each time you include one of the files, 4566members. You have to define it each time you include one of the files,
4050though, and it must be identical each time. 4567though, and it must be identical each time.
4051 4568
4052For example, the perl EV module uses something like this: 4569For example, the perl EV module uses something like this:
4053 4570
4122And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4639And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4123 4640
4124 #include "ev_cpp.h" 4641 #include "ev_cpp.h"
4125 #include "ev.c" 4642 #include "ev.c"
4126 4643
4127=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4644=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4128 4645
4129=head2 THREADS AND COROUTINES 4646=head2 THREADS AND COROUTINES
4130 4647
4131=head3 THREADS 4648=head3 THREADS
4132 4649
4183default loop and triggering an C<ev_async> watcher from the default loop 4700default loop and triggering an C<ev_async> watcher from the default loop
4184watcher callback into the event loop interested in the signal. 4701watcher callback into the event loop interested in the signal.
4185 4702
4186=back 4703=back
4187 4704
4188=head4 THREAD LOCKING EXAMPLE 4705See also L<THREAD LOCKING EXAMPLE>.
4189
4190Here is a fictitious example of how to run an event loop in a different
4191thread than where callbacks are being invoked and watchers are
4192created/added/removed.
4193
4194For a real-world example, see the C<EV::Loop::Async> perl module,
4195which uses exactly this technique (which is suited for many high-level
4196languages).
4197
4198The example uses a pthread mutex to protect the loop data, a condition
4199variable to wait for callback invocations, an async watcher to notify the
4200event loop thread and an unspecified mechanism to wake up the main thread.
4201
4202First, you need to associate some data with the event loop:
4203
4204 typedef struct {
4205 mutex_t lock; /* global loop lock */
4206 ev_async async_w;
4207 thread_t tid;
4208 cond_t invoke_cv;
4209 } userdata;
4210
4211 void prepare_loop (EV_P)
4212 {
4213 // for simplicity, we use a static userdata struct.
4214 static userdata u;
4215
4216 ev_async_init (&u->async_w, async_cb);
4217 ev_async_start (EV_A_ &u->async_w);
4218
4219 pthread_mutex_init (&u->lock, 0);
4220 pthread_cond_init (&u->invoke_cv, 0);
4221
4222 // now associate this with the loop
4223 ev_set_userdata (EV_A_ u);
4224 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4225 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4226
4227 // then create the thread running ev_loop
4228 pthread_create (&u->tid, 0, l_run, EV_A);
4229 }
4230
4231The callback for the C<ev_async> watcher does nothing: the watcher is used
4232solely to wake up the event loop so it takes notice of any new watchers
4233that might have been added:
4234
4235 static void
4236 async_cb (EV_P_ ev_async *w, int revents)
4237 {
4238 // just used for the side effects
4239 }
4240
4241The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4242protecting the loop data, respectively.
4243
4244 static void
4245 l_release (EV_P)
4246 {
4247 userdata *u = ev_userdata (EV_A);
4248 pthread_mutex_unlock (&u->lock);
4249 }
4250
4251 static void
4252 l_acquire (EV_P)
4253 {
4254 userdata *u = ev_userdata (EV_A);
4255 pthread_mutex_lock (&u->lock);
4256 }
4257
4258The event loop thread first acquires the mutex, and then jumps straight
4259into C<ev_loop>:
4260
4261 void *
4262 l_run (void *thr_arg)
4263 {
4264 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4265
4266 l_acquire (EV_A);
4267 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4268 ev_loop (EV_A_ 0);
4269 l_release (EV_A);
4270
4271 return 0;
4272 }
4273
4274Instead of invoking all pending watchers, the C<l_invoke> callback will
4275signal the main thread via some unspecified mechanism (signals? pipe
4276writes? C<Async::Interrupt>?) and then waits until all pending watchers
4277have been called (in a while loop because a) spurious wakeups are possible
4278and b) skipping inter-thread-communication when there are no pending
4279watchers is very beneficial):
4280
4281 static void
4282 l_invoke (EV_P)
4283 {
4284 userdata *u = ev_userdata (EV_A);
4285
4286 while (ev_pending_count (EV_A))
4287 {
4288 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4289 pthread_cond_wait (&u->invoke_cv, &u->lock);
4290 }
4291 }
4292
4293Now, whenever the main thread gets told to invoke pending watchers, it
4294will grab the lock, call C<ev_invoke_pending> and then signal the loop
4295thread to continue:
4296
4297 static void
4298 real_invoke_pending (EV_P)
4299 {
4300 userdata *u = ev_userdata (EV_A);
4301
4302 pthread_mutex_lock (&u->lock);
4303 ev_invoke_pending (EV_A);
4304 pthread_cond_signal (&u->invoke_cv);
4305 pthread_mutex_unlock (&u->lock);
4306 }
4307
4308Whenever you want to start/stop a watcher or do other modifications to an
4309event loop, you will now have to lock:
4310
4311 ev_timer timeout_watcher;
4312 userdata *u = ev_userdata (EV_A);
4313
4314 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4315
4316 pthread_mutex_lock (&u->lock);
4317 ev_timer_start (EV_A_ &timeout_watcher);
4318 ev_async_send (EV_A_ &u->async_w);
4319 pthread_mutex_unlock (&u->lock);
4320
4321Note that sending the C<ev_async> watcher is required because otherwise
4322an event loop currently blocking in the kernel will have no knowledge
4323about the newly added timer. By waking up the loop it will pick up any new
4324watchers in the next event loop iteration.
4325 4706
4326=head3 COROUTINES 4707=head3 COROUTINES
4327 4708
4328Libev is very accommodating to coroutines ("cooperative threads"): 4709Libev is very accommodating to coroutines ("cooperative threads"):
4329libev fully supports nesting calls to its functions from different 4710libev fully supports nesting calls to its functions from different
4330coroutines (e.g. you can call C<ev_loop> on the same loop from two 4711coroutines (e.g. you can call C<ev_run> on the same loop from two
4331different coroutines, and switch freely between both coroutines running 4712different coroutines, and switch freely between both coroutines running
4332the loop, as long as you don't confuse yourself). The only exception is 4713the loop, as long as you don't confuse yourself). The only exception is
4333that you must not do this from C<ev_periodic> reschedule callbacks. 4714that you must not do this from C<ev_periodic> reschedule callbacks.
4334 4715
4335Care has been taken to ensure that libev does not keep local state inside 4716Care has been taken to ensure that libev does not keep local state inside
4336C<ev_loop>, and other calls do not usually allow for coroutine switches as 4717C<ev_run>, and other calls do not usually allow for coroutine switches as
4337they do not call any callbacks. 4718they do not call any callbacks.
4338 4719
4339=head2 COMPILER WARNINGS 4720=head2 COMPILER WARNINGS
4340 4721
4341Depending on your compiler and compiler settings, you might get no or a 4722Depending on your compiler and compiler settings, you might get no or a
4352maintainable. 4733maintainable.
4353 4734
4354And of course, some compiler warnings are just plain stupid, or simply 4735And of course, some compiler warnings are just plain stupid, or simply
4355wrong (because they don't actually warn about the condition their message 4736wrong (because they don't actually warn about the condition their message
4356seems to warn about). For example, certain older gcc versions had some 4737seems to warn about). For example, certain older gcc versions had some
4357warnings that resulted an extreme number of false positives. These have 4738warnings that resulted in an extreme number of false positives. These have
4358been fixed, but some people still insist on making code warn-free with 4739been fixed, but some people still insist on making code warn-free with
4359such buggy versions. 4740such buggy versions.
4360 4741
4361While libev is written to generate as few warnings as possible, 4742While libev is written to generate as few warnings as possible,
4362"warn-free" code is not a goal, and it is recommended not to build libev 4743"warn-free" code is not a goal, and it is recommended not to build libev
4398I suggest using suppression lists. 4779I suggest using suppression lists.
4399 4780
4400 4781
4401=head1 PORTABILITY NOTES 4782=head1 PORTABILITY NOTES
4402 4783
4784=head2 GNU/LINUX 32 BIT LIMITATIONS
4785
4786GNU/Linux is the only common platform that supports 64 bit file/large file
4787interfaces but I<disables> them by default.
4788
4789That means that libev compiled in the default environment doesn't support
4790files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4791
4792Unfortunately, many programs try to work around this GNU/Linux issue
4793by enabling the large file API, which makes them incompatible with the
4794standard libev compiled for their system.
4795
4796Likewise, libev cannot enable the large file API itself as this would
4797suddenly make it incompatible to the default compile time environment,
4798i.e. all programs not using special compile switches.
4799
4800=head2 OS/X AND DARWIN BUGS
4801
4802The whole thing is a bug if you ask me - basically any system interface
4803you touch is broken, whether it is locales, poll, kqueue or even the
4804OpenGL drivers.
4805
4806=head3 C<kqueue> is buggy
4807
4808The kqueue syscall is broken in all known versions - most versions support
4809only sockets, many support pipes.
4810
4811Libev tries to work around this by not using C<kqueue> by default on this
4812rotten platform, but of course you can still ask for it when creating a
4813loop - embedding a socket-only kqueue loop into a select-based one is
4814probably going to work well.
4815
4816=head3 C<poll> is buggy
4817
4818Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4819implementation by something calling C<kqueue> internally around the 10.5.6
4820release, so now C<kqueue> I<and> C<poll> are broken.
4821
4822Libev tries to work around this by not using C<poll> by default on
4823this rotten platform, but of course you can still ask for it when creating
4824a loop.
4825
4826=head3 C<select> is buggy
4827
4828All that's left is C<select>, and of course Apple found a way to fuck this
4829one up as well: On OS/X, C<select> actively limits the number of file
4830descriptors you can pass in to 1024 - your program suddenly crashes when
4831you use more.
4832
4833There is an undocumented "workaround" for this - defining
4834C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4835work on OS/X.
4836
4837=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4838
4839=head3 C<errno> reentrancy
4840
4841The default compile environment on Solaris is unfortunately so
4842thread-unsafe that you can't even use components/libraries compiled
4843without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4844defined by default. A valid, if stupid, implementation choice.
4845
4846If you want to use libev in threaded environments you have to make sure
4847it's compiled with C<_REENTRANT> defined.
4848
4849=head3 Event port backend
4850
4851The scalable event interface for Solaris is called "event
4852ports". Unfortunately, this mechanism is very buggy in all major
4853releases. If you run into high CPU usage, your program freezes or you get
4854a large number of spurious wakeups, make sure you have all the relevant
4855and latest kernel patches applied. No, I don't know which ones, but there
4856are multiple ones to apply, and afterwards, event ports actually work
4857great.
4858
4859If you can't get it to work, you can try running the program by setting
4860the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4861C<select> backends.
4862
4863=head2 AIX POLL BUG
4864
4865AIX unfortunately has a broken C<poll.h> header. Libev works around
4866this by trying to avoid the poll backend altogether (i.e. it's not even
4867compiled in), which normally isn't a big problem as C<select> works fine
4868with large bitsets on AIX, and AIX is dead anyway.
4869
4403=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4870=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4871
4872=head3 General issues
4404 4873
4405Win32 doesn't support any of the standards (e.g. POSIX) that libev 4874Win32 doesn't support any of the standards (e.g. POSIX) that libev
4406requires, and its I/O model is fundamentally incompatible with the POSIX 4875requires, and its I/O model is fundamentally incompatible with the POSIX
4407model. Libev still offers limited functionality on this platform in 4876model. Libev still offers limited functionality on this platform in
4408the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4877the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4409descriptors. This only applies when using Win32 natively, not when using 4878descriptors. This only applies when using Win32 natively, not when using
4410e.g. cygwin. 4879e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4880as every compielr comes with a slightly differently broken/incompatible
4881environment.
4411 4882
4412Lifting these limitations would basically require the full 4883Lifting these limitations would basically require the full
4413re-implementation of the I/O system. If you are into these kinds of 4884re-implementation of the I/O system. If you are into this kind of thing,
4414things, then note that glib does exactly that for you in a very portable 4885then note that glib does exactly that for you in a very portable way (note
4415way (note also that glib is the slowest event library known to man). 4886also that glib is the slowest event library known to man).
4416 4887
4417There is no supported compilation method available on windows except 4888There is no supported compilation method available on windows except
4418embedding it into other applications. 4889embedding it into other applications.
4419 4890
4420Sensible signal handling is officially unsupported by Microsoft - libev 4891Sensible signal handling is officially unsupported by Microsoft - libev
4448you do I<not> compile the F<ev.c> or any other embedded source files!): 4919you do I<not> compile the F<ev.c> or any other embedded source files!):
4449 4920
4450 #include "evwrap.h" 4921 #include "evwrap.h"
4451 #include "ev.c" 4922 #include "ev.c"
4452 4923
4453=over 4
4454
4455=item The winsocket select function 4924=head3 The winsocket C<select> function
4456 4925
4457The winsocket C<select> function doesn't follow POSIX in that it 4926The winsocket C<select> function doesn't follow POSIX in that it
4458requires socket I<handles> and not socket I<file descriptors> (it is 4927requires socket I<handles> and not socket I<file descriptors> (it is
4459also extremely buggy). This makes select very inefficient, and also 4928also extremely buggy). This makes select very inefficient, and also
4460requires a mapping from file descriptors to socket handles (the Microsoft 4929requires a mapping from file descriptors to socket handles (the Microsoft
4469 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4938 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4470 4939
4471Note that winsockets handling of fd sets is O(n), so you can easily get a 4940Note that winsockets handling of fd sets is O(n), so you can easily get a
4472complexity in the O(n²) range when using win32. 4941complexity in the O(n²) range when using win32.
4473 4942
4474=item Limited number of file descriptors 4943=head3 Limited number of file descriptors
4475 4944
4476Windows has numerous arbitrary (and low) limits on things. 4945Windows has numerous arbitrary (and low) limits on things.
4477 4946
4478Early versions of winsocket's select only supported waiting for a maximum 4947Early versions of winsocket's select only supported waiting for a maximum
4479of C<64> handles (probably owning to the fact that all windows kernels 4948of C<64> handles (probably owning to the fact that all windows kernels
4494runtime libraries. This might get you to about C<512> or C<2048> sockets 4963runtime libraries. This might get you to about C<512> or C<2048> sockets
4495(depending on windows version and/or the phase of the moon). To get more, 4964(depending on windows version and/or the phase of the moon). To get more,
4496you need to wrap all I/O functions and provide your own fd management, but 4965you need to wrap all I/O functions and provide your own fd management, but
4497the cost of calling select (O(n²)) will likely make this unworkable. 4966the cost of calling select (O(n²)) will likely make this unworkable.
4498 4967
4499=back
4500
4501=head2 PORTABILITY REQUIREMENTS 4968=head2 PORTABILITY REQUIREMENTS
4502 4969
4503In addition to a working ISO-C implementation and of course the 4970In addition to a working ISO-C implementation and of course the
4504backend-specific APIs, libev relies on a few additional extensions: 4971backend-specific APIs, libev relies on a few additional extensions:
4505 4972
4511Libev assumes not only that all watcher pointers have the same internal 4978Libev assumes not only that all watcher pointers have the same internal
4512structure (guaranteed by POSIX but not by ISO C for example), but it also 4979structure (guaranteed by POSIX but not by ISO C for example), but it also
4513assumes that the same (machine) code can be used to call any watcher 4980assumes that the same (machine) code can be used to call any watcher
4514callback: The watcher callbacks have different type signatures, but libev 4981callback: The watcher callbacks have different type signatures, but libev
4515calls them using an C<ev_watcher *> internally. 4982calls them using an C<ev_watcher *> internally.
4983
4984=item pointer accesses must be thread-atomic
4985
4986Accessing a pointer value must be atomic, it must both be readable and
4987writable in one piece - this is the case on all current architectures.
4516 4988
4517=item C<sig_atomic_t volatile> must be thread-atomic as well 4989=item C<sig_atomic_t volatile> must be thread-atomic as well
4518 4990
4519The type C<sig_atomic_t volatile> (or whatever is defined as 4991The type C<sig_atomic_t volatile> (or whatever is defined as
4520C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4992C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4543watchers. 5015watchers.
4544 5016
4545=item C<double> must hold a time value in seconds with enough accuracy 5017=item C<double> must hold a time value in seconds with enough accuracy
4546 5018
4547The type C<double> is used to represent timestamps. It is required to 5019The type C<double> is used to represent timestamps. It is required to
4548have at least 51 bits of mantissa (and 9 bits of exponent), which is good 5020have at least 51 bits of mantissa (and 9 bits of exponent), which is
4549enough for at least into the year 4000. This requirement is fulfilled by 5021good enough for at least into the year 4000 with millisecond accuracy
5022(the design goal for libev). This requirement is overfulfilled by
4550implementations implementing IEEE 754, which is basically all existing 5023implementations using IEEE 754, which is basically all existing ones. With
4551ones. With IEEE 754 doubles, you get microsecond accuracy until at least 5024IEEE 754 doubles, you get microsecond accuracy until at least 2200.
45522200.
4553 5025
4554=back 5026=back
4555 5027
4556If you know of other additional requirements drop me a note. 5028If you know of other additional requirements drop me a note.
4557 5029
4627=back 5099=back
4628 5100
4629 5101
4630=head1 PORTING FROM LIBEV 3.X TO 4.X 5102=head1 PORTING FROM LIBEV 3.X TO 4.X
4631 5103
4632The major version 4 introduced some minor incompatible changes to the API. 5104The major version 4 introduced some incompatible changes to the API.
4633 5105
4634At the moment, the C<ev.h> header file tries to implement superficial 5106At the moment, the C<ev.h> header file provides compatibility definitions
4635compatibility, so most programs should still compile. Those might be 5107for all changes, so most programs should still compile. The compatibility
4636removed in later versions of libev, so better update early than late. 5108layer might be removed in later versions of libev, so better update to the
5109new API early than late.
4637 5110
4638=over 4 5111=over 4
4639 5112
4640=item C<ev_loop_count> renamed to C<ev_iteration> 5113=item C<EV_COMPAT3> backwards compatibility mechanism
4641 5114
4642=item C<ev_loop_depth> renamed to C<ev_depth> 5115The backward compatibility mechanism can be controlled by
5116C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
5117section.
4643 5118
4644=item C<ev_loop_verify> renamed to C<ev_verify> 5119=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5120
5121These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5122
5123 ev_loop_destroy (EV_DEFAULT_UC);
5124 ev_loop_fork (EV_DEFAULT);
5125
5126=item function/symbol renames
5127
5128A number of functions and symbols have been renamed:
5129
5130 ev_loop => ev_run
5131 EVLOOP_NONBLOCK => EVRUN_NOWAIT
5132 EVLOOP_ONESHOT => EVRUN_ONCE
5133
5134 ev_unloop => ev_break
5135 EVUNLOOP_CANCEL => EVBREAK_CANCEL
5136 EVUNLOOP_ONE => EVBREAK_ONE
5137 EVUNLOOP_ALL => EVBREAK_ALL
5138
5139 EV_TIMEOUT => EV_TIMER
5140
5141 ev_loop_count => ev_iteration
5142 ev_loop_depth => ev_depth
5143 ev_loop_verify => ev_verify
4645 5144
4646Most functions working on C<struct ev_loop> objects don't have an 5145Most functions working on C<struct ev_loop> objects don't have an
4647C<ev_loop_> prefix, so it was removed. Note that C<ev_loop_fork> is 5146C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
5147associated constants have been renamed to not collide with the C<struct
5148ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
5149as all other watcher types. Note that C<ev_loop_fork> is still called
4648still called C<ev_loop_fork> because it would otherwise clash with the 5150C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4649C<ev_frok> typedef. 5151typedef.
4650
4651=item C<EV_TIMEOUT> renamed to C<EV_TIMER> in C<revents>
4652
4653This is a simple rename - all other watcher types use their name
4654as revents flag, and now C<ev_timer> does, too.
4655
4656Both C<EV_TIMER> and C<EV_TIMEOUT> symbols were present in 3.x versions
4657and continue to be present for the forseeable future, so this is mostly a
4658documentation change.
4659 5152
4660=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 5153=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4661 5154
4662The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 5155The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4663mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 5156mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4670 5163
4671=over 4 5164=over 4
4672 5165
4673=item active 5166=item active
4674 5167
4675A watcher is active as long as it has been started (has been attached to 5168A watcher is active as long as it has been started and not yet stopped.
4676an event loop) but not yet stopped (disassociated from the event loop). 5169See L<WATCHER STATES> for details.
4677 5170
4678=item application 5171=item application
4679 5172
4680In this document, an application is whatever is using libev. 5173In this document, an application is whatever is using libev.
5174
5175=item backend
5176
5177The part of the code dealing with the operating system interfaces.
4681 5178
4682=item callback 5179=item callback
4683 5180
4684The address of a function that is called when some event has been 5181The address of a function that is called when some event has been
4685detected. Callbacks are being passed the event loop, the watcher that 5182detected. Callbacks are being passed the event loop, the watcher that
4686received the event, and the actual event bitset. 5183received the event, and the actual event bitset.
4687 5184
4688=item callback invocation 5185=item callback/watcher invocation
4689 5186
4690The act of calling the callback associated with a watcher. 5187The act of calling the callback associated with a watcher.
4691 5188
4692=item event 5189=item event
4693 5190
4712The model used to describe how an event loop handles and processes 5209The model used to describe how an event loop handles and processes
4713watchers and events. 5210watchers and events.
4714 5211
4715=item pending 5212=item pending
4716 5213
4717A watcher is pending as soon as the corresponding event has been detected, 5214A watcher is pending as soon as the corresponding event has been
4718and stops being pending as soon as the watcher will be invoked or its 5215detected. See L<WATCHER STATES> for details.
4719pending status is explicitly cleared by the application.
4720
4721A watcher can be pending, but not active. Stopping a watcher also clears
4722its pending status.
4723 5216
4724=item real time 5217=item real time
4725 5218
4726The physical time that is observed. It is apparently strictly monotonic :) 5219The physical time that is observed. It is apparently strictly monotonic :)
4727 5220
4734=item watcher 5227=item watcher
4735 5228
4736A data structure that describes interest in certain events. Watchers need 5229A data structure that describes interest in certain events. Watchers need
4737to be started (attached to an event loop) before they can receive events. 5230to be started (attached to an event loop) before they can receive events.
4738 5231
4739=item watcher invocation
4740
4741The act of calling the callback associated with a watcher.
4742
4743=back 5232=back
4744 5233
4745=head1 AUTHOR 5234=head1 AUTHOR
4746 5235
4747Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5236Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5237Magnusson and Emanuele Giaquinta.
4748 5238

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines