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

Comparing libev/ev.pod (file contents):
Revision 1.327 by root, Sun Oct 24 20:05:43 2010 UTC vs.
Revision 1.370 by root, Thu Jun 2 23:42:40 2011 UTC

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_run (loop, 0); 61 ev_run (loop, 0);
62 62
63 // unloop was called, so exit 63 // break was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
67=head1 ABOUT THIS DOCUMENT 67=head1 ABOUT THIS DOCUMENT
68 68
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
80Familiarity 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
233the current system, you would need to look at C<ev_embeddable_backends () 241the current system, you would need to look at C<ev_embeddable_backends ()
234& ev_supported_backends ()>, likewise for recommended ones. 242& ev_supported_backends ()>, likewise for recommended ones.
235 243
236See the description of C<ev_embed> watchers for more info. 244See the description of C<ev_embed> watchers for more info.
237 245
238=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT] 246=item ev_set_allocator (void *(*cb)(void *ptr, long size))
239 247
240Sets the allocation function to use (the prototype is similar - the 248Sets the allocation function to use (the prototype is similar - the
241semantics 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
242used 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
243when 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
269 } 277 }
270 278
271 ... 279 ...
272 ev_set_allocator (persistent_realloc); 280 ev_set_allocator (persistent_realloc);
273 281
274=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT] 282=item ev_set_syserr_cb (void (*cb)(const char *msg))
275 283
276Set 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
277as failed select, poll, epoll_wait). The message is a printable string 285as failed select, poll, epoll_wait). The message is a printable string
278indicating the system call or subsystem causing the problem. If this 286indicating the system call or subsystem causing the problem. If this
279callback 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
291 } 299 }
292 300
293 ... 301 ...
294 ev_set_syserr_cb (fatal_error); 302 ev_set_syserr_cb (fatal_error);
295 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
296=back 317=back
297 318
298=head1 FUNCTIONS CONTROLLING EVENT LOOPS 319=head1 FUNCTIONS CONTROLLING EVENT LOOPS
299 320
300An event loop is described by a C<struct ev_loop *> (the C<struct> is 321An event loop is described by a C<struct ev_loop *> (the C<struct> is
301I<not> optional in this case unless libev 3 compatibility is disabled, as 322I<not> optional in this case unless libev 3 compatibility is disabled, as
302libev 3 had an C<ev_loop> function colliding with the struct name). 323libev 3 had an C<ev_loop> function colliding with the struct name).
303 324
304The 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
305supports signals and child events, and dynamically created event loops 326supports child process events, and dynamically created event loops which
306which do not. 327do not.
307 328
308=over 4 329=over 4
309 330
310=item struct ev_loop *ev_default_loop (unsigned int flags) 331=item struct ev_loop *ev_default_loop (unsigned int flags)
311 332
347=item struct ev_loop *ev_loop_new (unsigned int flags) 368=item struct ev_loop *ev_loop_new (unsigned int flags)
348 369
349This will create and initialise a new event loop object. If the loop 370This will create and initialise a new event loop object. If the loop
350could not be initialised, returns false. 371could not be initialised, returns false.
351 372
352Note that this function I<is> thread-safe, and one common way to use 373This function is thread-safe, and one common way to use libev with
353libev with threads is indeed to create one loop per thread, and using the 374threads is indeed to create one loop per thread, and using the default
354default loop in the "main" or "initial" thread. 375loop in the "main" or "initial" thread.
355 376
356The flags argument can be used to specify special behaviour or specific 377The flags argument can be used to specify special behaviour or specific
357backends 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>).
358 379
359The following flags are supported: 380The following flags are supported:
394environment variable. 415environment variable.
395 416
396=item C<EVFLAG_NOINOTIFY> 417=item C<EVFLAG_NOINOTIFY>
397 418
398When 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
399I<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
400testing, this flag can be useful to conserve inotify file descriptors, as 421testing, this flag can be useful to conserve inotify file descriptors, as
401otherwise each loop using C<ev_stat> watchers consumes one inotify handle. 422otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
402 423
403=item C<EVFLAG_SIGNALFD> 424=item C<EVFLAG_SIGNALFD>
404 425
405When this flag is specified, then libev will attempt to use the 426When this flag is specified, then libev will attempt to use the
406I<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
407delivers signals synchronously, which makes it both faster and might make 428delivers signals synchronously, which makes it both faster and might make
408it 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
409handling with threads, as long as you properly block signals in your 430handling with threads, as long as you properly block signals in your
410threads that are not interested in handling them. 431threads that are not interested in handling them.
411 432
412Signalfd 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
413there 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
414example) 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.
415 451
416=item C<EVBACKEND_SELECT> (value 1, portable select backend) 452=item C<EVBACKEND_SELECT> (value 1, portable select backend)
417 453
418This is your standard select(2) backend. Not I<completely> standard, as 454This is your standard select(2) backend. Not I<completely> standard, as
419libev 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,
447=item C<EVBACKEND_EPOLL> (value 4, Linux) 483=item C<EVBACKEND_EPOLL> (value 4, Linux)
448 484
449Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9 485Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
450kernels). 486kernels).
451 487
452For few fds, this backend is a bit little slower than poll and select, 488For few fds, this backend is a bit little slower than poll and select, but
453but it scales phenomenally better. While poll and select usually scale 489it scales phenomenally better. While poll and select usually scale like
454like O(total_fds) where n is the total number of fds (or the highest fd), 490O(total_fds) where total_fds is the total number of fds (or the highest
455epoll scales either O(1) or O(active_fds). 491fd), epoll scales either O(1) or O(active_fds).
456 492
457The epoll mechanism deserves honorable mention as the most misdesigned 493The epoll mechanism deserves honorable mention as the most misdesigned
458of the more advanced event mechanisms: mere annoyances include silently 494of the more advanced event mechanisms: mere annoyances include silently
459dropping file descriptors, requiring a system call per change per file 495dropping file descriptors, requiring a system call per change per file
460descriptor (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
461so 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
462I<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
463take considerable time (one syscall per file descriptor) and is of course 501set, which can take considerable time (one syscall per file descriptor)
464hard to detect. 502and is of course hard to detect.
465 503
466Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 504Epoll is also notoriously buggy - embedding epoll fds I<should> work,
467of course I<doesn't>, and epoll just loves to report events for totally 505but of course I<doesn't>, and epoll just loves to report events for
468I<different> file descriptors (even already closed ones, so one cannot 506totally I<different> file descriptors (even already closed ones, so
469even remove them from the set) than registered in the set (especially 507one cannot even remove them from the set) than registered in the set
470on SMP systems). Libev tries to counter these spurious notifications by 508(especially on SMP systems). Libev tries to counter these spurious
471employing an additional generation counter and comparing that against the 509notifications by employing an additional generation counter and comparing
472events to filter out spurious ones, recreating the set when required. Last 510that against the events to filter out spurious ones, recreating the set
511when required. Epoll also errornously rounds down timeouts, but gives you
512no way to know when and by how much, so sometimes you have to busy-wait
513because epoll returns immediately despite a nonzero timeout. And last
473not least, it also refuses to work with some file descriptors which work 514not least, it also refuses to work with some file descriptors which work
474perfectly fine with C<select> (files, many character devices...). 515perfectly fine with C<select> (files, many character devices...).
516
517Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
518cobbled together in a hurry, no thought to design or interaction with
519others. Oh, the pain, will it ever stop...
475 520
476While stopping, setting and starting an I/O watcher in the same iteration 521While stopping, setting and starting an I/O watcher in the same iteration
477will result in some caching, there is still a system call per such 522will result in some caching, there is still a system call per such
478incident (because the same I<file descriptor> could point to a different 523incident (because the same I<file descriptor> could point to a different
479I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 524I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
545=item C<EVBACKEND_PORT> (value 32, Solaris 10) 590=item C<EVBACKEND_PORT> (value 32, Solaris 10)
546 591
547This uses the Solaris 10 event port mechanism. As with everything on Solaris, 592This uses the Solaris 10 event port mechanism. As with everything on Solaris,
548it's really slow, but it still scales very well (O(active_fds)). 593it's really slow, but it still scales very well (O(active_fds)).
549 594
550Please note that Solaris event ports can deliver a lot of spurious
551notifications, so you need to use non-blocking I/O or other means to avoid
552blocking when no data (or space) is available.
553
554While this backend scales well, it requires one system call per active 595While this backend scales well, it requires one system call per active
555file descriptor per loop iteration. For small and medium numbers of file 596file descriptor per loop iteration. For small and medium numbers of file
556descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 597descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
557might perform better. 598might perform better.
558 599
559On the positive side, with the exception of the spurious readiness 600On the positive side, this backend actually performed fully to
560notifications, this backend actually performed fully to specification
561in all tests and is fully embeddable, which is a rare feat among the 601specification in all tests and is fully embeddable, which is a rare feat
562OS-specific backends (I vastly prefer correctness over speed hacks). 602among the OS-specific backends (I vastly prefer correctness over speed
603hacks).
604
605On the negative side, the interface is I<bizarre> - so bizarre that
606even sun itself gets it wrong in their code examples: The event polling
607function sometimes returning events to the caller even though an error
608occurred, but with no indication whether it has done so or not (yes, it's
609even documented that way) - deadly for edge-triggered interfaces where
610you absolutely have to know whether an event occurred or not because you
611have to re-arm the watcher.
612
613Fortunately libev seems to be able to work around these idiocies.
563 614
564This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 615This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
565C<EVBACKEND_POLL>. 616C<EVBACKEND_POLL>.
566 617
567=item C<EVBACKEND_ALL> 618=item C<EVBACKEND_ALL>
568 619
569Try all backends (even potentially broken ones that wouldn't be tried 620Try all backends (even potentially broken ones that wouldn't be tried
570with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 621with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
571C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 622C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
572 623
573It is definitely not recommended to use this flag. 624It is definitely not recommended to use this flag, use whatever
625C<ev_recommended_backends ()> returns, or simply do not specify a backend
626at all.
627
628=item C<EVBACKEND_MASK>
629
630Not a backend at all, but a mask to select all backend bits from a
631C<flags> value, in case you want to mask out any backends from a flags
632value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
574 633
575=back 634=back
576 635
577If one or more of the backend flags are or'ed into the flags value, 636If one or more of the backend flags are or'ed into the flags value,
578then only these backends will be tried (in the reverse order as listed 637then only these backends will be tried (in the reverse order as listed
607This function is normally used on loop objects allocated by 666This function is normally used on loop objects allocated by
608C<ev_loop_new>, but it can also be used on the default loop returned by 667C<ev_loop_new>, but it can also be used on the default loop returned by
609C<ev_default_loop>, in which case it is not thread-safe. 668C<ev_default_loop>, in which case it is not thread-safe.
610 669
611Note that it is not advisable to call this function on the default loop 670Note that it is not advisable to call this function on the default loop
612except in the rare occasion where you really need to free it's resources. 671except in the rare occasion where you really need to free its resources.
613If you need dynamically allocated loops it is better to use C<ev_loop_new> 672If you need dynamically allocated loops it is better to use C<ev_loop_new>
614and C<ev_loop_destroy>. 673and C<ev_loop_destroy>.
615 674
616=item ev_loop_fork (loop) 675=item ev_loop_fork (loop)
617 676
665prepare and check phases. 724prepare and check phases.
666 725
667=item unsigned int ev_depth (loop) 726=item unsigned int ev_depth (loop)
668 727
669Returns the number of times C<ev_run> was entered minus the number of 728Returns the number of times C<ev_run> was entered minus the number of
670times C<ev_run> was exited, in other words, the recursion depth. 729times C<ev_run> was exited normally, in other words, the recursion depth.
671 730
672Outside C<ev_run>, this number is zero. In a callback, this number is 731Outside C<ev_run>, this number is zero. In a callback, this number is
673C<1>, unless C<ev_run> was invoked recursively (or from another thread), 732C<1>, unless C<ev_run> was invoked recursively (or from another thread),
674in which case it is higher. 733in which case it is higher.
675 734
676Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 735Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
677etc.), doesn't count as "exit" - consider this as a hint to avoid such 736throwing an exception etc.), doesn't count as "exit" - consider this
678ungentleman-like behaviour unless it's really convenient. 737as a hint to avoid such ungentleman-like behaviour unless it's really
738convenient, in which case it is fully supported.
679 739
680=item unsigned int ev_backend (loop) 740=item unsigned int ev_backend (loop)
681 741
682Returns one of the C<EVBACKEND_*> flags indicating the event backend in 742Returns one of the C<EVBACKEND_*> flags indicating the event backend in
683use. 743use.
745finished (especially in interactive programs), but having a program 805finished (especially in interactive programs), but having a program
746that automatically loops as long as it has to and no longer by virtue 806that automatically loops as long as it has to and no longer by virtue
747of relying on its watchers stopping correctly, that is truly a thing of 807of relying on its watchers stopping correctly, that is truly a thing of
748beauty. 808beauty.
749 809
810This function is also I<mostly> exception-safe - you can break out of
811a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
812exception and so on. This does not decrement the C<ev_depth> value, nor
813will it clear any outstanding C<EVBREAK_ONE> breaks.
814
750A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 815A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
751those events and any already outstanding ones, but will not wait and 816those events and any already outstanding ones, but will not wait and
752block your process in case there are no events and will return after one 817block your process in case there are no events and will return after one
753iteration of the loop. This is sometimes useful to poll and handle new 818iteration of the loop. This is sometimes useful to poll and handle new
754events while doing lengthy calculations, to keep the program responsive. 819events while doing lengthy calculations, to keep the program responsive.
763This is useful if you are waiting for some external event in conjunction 828This is useful if you are waiting for some external event in conjunction
764with something not expressible using other libev watchers (i.e. "roll your 829with something not expressible using other libev watchers (i.e. "roll your
765own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 830own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
766usually a better approach for this kind of thing. 831usually a better approach for this kind of thing.
767 832
768Here are the gory details of what C<ev_run> does: 833Here are the gory details of what C<ev_run> does (this is for your
834understanding, not a guarantee that things will work exactly like this in
835future versions):
769 836
770 - Increment loop depth. 837 - Increment loop depth.
771 - Reset the ev_break status. 838 - Reset the ev_break status.
772 - Before the first iteration, call any pending watchers. 839 - Before the first iteration, call any pending watchers.
773 LOOP: 840 LOOP:
806anymore. 873anymore.
807 874
808 ... queue jobs here, make sure they register event watchers as long 875 ... queue jobs here, make sure they register event watchers as long
809 ... as they still have work to do (even an idle watcher will do..) 876 ... as they still have work to do (even an idle watcher will do..)
810 ev_run (my_loop, 0); 877 ev_run (my_loop, 0);
811 ... jobs done or somebody called unloop. yeah! 878 ... jobs done or somebody called break. yeah!
812 879
813=item ev_break (loop, how) 880=item ev_break (loop, how)
814 881
815Can be used to make a call to C<ev_run> return early (but only after it 882Can be used to make a call to C<ev_run> return early (but only after it
816has processed all outstanding events). The C<how> argument must be either 883has processed all outstanding events). The C<how> argument must be either
817C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or 884C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
818C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return. 885C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
819 886
820This "unloop state" will be cleared when entering C<ev_run> again. 887This "break state" will be cleared on the next call to C<ev_run>.
821 888
822It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## 889It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
890which case it will have no effect.
823 891
824=item ev_ref (loop) 892=item ev_ref (loop)
825 893
826=item ev_unref (loop) 894=item ev_unref (loop)
827 895
848running when nothing else is active. 916running when nothing else is active.
849 917
850 ev_signal exitsig; 918 ev_signal exitsig;
851 ev_signal_init (&exitsig, sig_cb, SIGINT); 919 ev_signal_init (&exitsig, sig_cb, SIGINT);
852 ev_signal_start (loop, &exitsig); 920 ev_signal_start (loop, &exitsig);
853 evf_unref (loop); 921 ev_unref (loop);
854 922
855Example: For some weird reason, unregister the above signal handler again. 923Example: For some weird reason, unregister the above signal handler again.
856 924
857 ev_ref (loop); 925 ev_ref (loop);
858 ev_signal_stop (loop, &exitsig); 926 ev_signal_stop (loop, &exitsig);
970See also the locking example in the C<THREADS> section later in this 1038See also the locking example in the C<THREADS> section later in this
971document. 1039document.
972 1040
973=item ev_set_userdata (loop, void *data) 1041=item ev_set_userdata (loop, void *data)
974 1042
975=item ev_userdata (loop) 1043=item void *ev_userdata (loop)
976 1044
977Set and retrieve a single C<void *> associated with a loop. When 1045Set and retrieve a single C<void *> associated with a loop. When
978C<ev_set_userdata> has never been called, then C<ev_userdata> returns 1046C<ev_set_userdata> has never been called, then C<ev_userdata> returns
979C<0.> 1047C<0>.
980 1048
981These two functions can be used to associate arbitrary data with a loop, 1049These two functions can be used to associate arbitrary data with a loop,
982and are intended solely for the C<invoke_pending_cb>, C<release> and 1050and are intended solely for the C<invoke_pending_cb>, C<release> and
983C<acquire> callbacks described above, but of course can be (ab-)used for 1051C<acquire> callbacks described above, but of course can be (ab-)used for
984any other purpose as well. 1052any other purpose as well.
1114The event loop has been resumed in the child process after fork (see 1182The event loop has been resumed in the child process after fork (see
1115C<ev_fork>). 1183C<ev_fork>).
1116 1184
1117=item C<EV_CLEANUP> 1185=item C<EV_CLEANUP>
1118 1186
1119The event loop is abotu to be destroyed (see C<ev_cleanup>). 1187The event loop is about to be destroyed (see C<ev_cleanup>).
1120 1188
1121=item C<EV_ASYNC> 1189=item C<EV_ASYNC>
1122 1190
1123The given async watcher has been asynchronously notified (see C<ev_async>). 1191The given async watcher has been asynchronously notified (see C<ev_async>).
1124 1192
1146programs, though, as the fd could already be closed and reused for another 1214programs, though, as the fd could already be closed and reused for another
1147thing, so beware. 1215thing, so beware.
1148 1216
1149=back 1217=back
1150 1218
1219=head2 GENERIC WATCHER FUNCTIONS
1220
1221=over 4
1222
1223=item C<ev_init> (ev_TYPE *watcher, callback)
1224
1225This macro initialises the generic portion of a watcher. The contents
1226of the watcher object can be arbitrary (so C<malloc> will do). Only
1227the generic parts of the watcher are initialised, you I<need> to call
1228the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1229type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1230which rolls both calls into one.
1231
1232You can reinitialise a watcher at any time as long as it has been stopped
1233(or never started) and there are no pending events outstanding.
1234
1235The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1236int revents)>.
1237
1238Example: Initialise an C<ev_io> watcher in two steps.
1239
1240 ev_io w;
1241 ev_init (&w, my_cb);
1242 ev_io_set (&w, STDIN_FILENO, EV_READ);
1243
1244=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1245
1246This macro initialises the type-specific parts of a watcher. You need to
1247call C<ev_init> at least once before you call this macro, but you can
1248call C<ev_TYPE_set> any number of times. You must not, however, call this
1249macro on a watcher that is active (it can be pending, however, which is a
1250difference to the C<ev_init> macro).
1251
1252Although some watcher types do not have type-specific arguments
1253(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1254
1255See C<ev_init>, above, for an example.
1256
1257=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1258
1259This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1260calls into a single call. This is the most convenient method to initialise
1261a watcher. The same limitations apply, of course.
1262
1263Example: Initialise and set an C<ev_io> watcher in one step.
1264
1265 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1266
1267=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1268
1269Starts (activates) the given watcher. Only active watchers will receive
1270events. If the watcher is already active nothing will happen.
1271
1272Example: Start the C<ev_io> watcher that is being abused as example in this
1273whole section.
1274
1275 ev_io_start (EV_DEFAULT_UC, &w);
1276
1277=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1278
1279Stops the given watcher if active, and clears the pending status (whether
1280the watcher was active or not).
1281
1282It is possible that stopped watchers are pending - for example,
1283non-repeating timers are being stopped when they become pending - but
1284calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1285pending. If you want to free or reuse the memory used by the watcher it is
1286therefore a good idea to always call its C<ev_TYPE_stop> function.
1287
1288=item bool ev_is_active (ev_TYPE *watcher)
1289
1290Returns a true value iff the watcher is active (i.e. it has been started
1291and not yet been stopped). As long as a watcher is active you must not modify
1292it.
1293
1294=item bool ev_is_pending (ev_TYPE *watcher)
1295
1296Returns a true value iff the watcher is pending, (i.e. it has outstanding
1297events but its callback has not yet been invoked). As long as a watcher
1298is pending (but not active) you must not call an init function on it (but
1299C<ev_TYPE_set> is safe), you must not change its priority, and you must
1300make sure the watcher is available to libev (e.g. you cannot C<free ()>
1301it).
1302
1303=item callback ev_cb (ev_TYPE *watcher)
1304
1305Returns the callback currently set on the watcher.
1306
1307=item ev_cb_set (ev_TYPE *watcher, callback)
1308
1309Change the callback. You can change the callback at virtually any time
1310(modulo threads).
1311
1312=item ev_set_priority (ev_TYPE *watcher, int priority)
1313
1314=item int ev_priority (ev_TYPE *watcher)
1315
1316Set and query the priority of the watcher. The priority is a small
1317integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1318(default: C<-2>). Pending watchers with higher priority will be invoked
1319before watchers with lower priority, but priority will not keep watchers
1320from being executed (except for C<ev_idle> watchers).
1321
1322If you need to suppress invocation when higher priority events are pending
1323you need to look at C<ev_idle> watchers, which provide this functionality.
1324
1325You I<must not> change the priority of a watcher as long as it is active or
1326pending.
1327
1328Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1329fine, as long as you do not mind that the priority value you query might
1330or might not have been clamped to the valid range.
1331
1332The default priority used by watchers when no priority has been set is
1333always C<0>, which is supposed to not be too high and not be too low :).
1334
1335See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1336priorities.
1337
1338=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1339
1340Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1341C<loop> nor C<revents> need to be valid as long as the watcher callback
1342can deal with that fact, as both are simply passed through to the
1343callback.
1344
1345=item int ev_clear_pending (loop, ev_TYPE *watcher)
1346
1347If the watcher is pending, this function clears its pending status and
1348returns its C<revents> bitset (as if its callback was invoked). If the
1349watcher isn't pending it does nothing and returns C<0>.
1350
1351Sometimes it can be useful to "poll" a watcher instead of waiting for its
1352callback to be invoked, which can be accomplished with this function.
1353
1354=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1355
1356Feeds the given event set into the event loop, as if the specified event
1357had happened for the specified watcher (which must be a pointer to an
1358initialised but not necessarily started event watcher). Obviously you must
1359not free the watcher as long as it has pending events.
1360
1361Stopping the watcher, letting libev invoke it, or calling
1362C<ev_clear_pending> will clear the pending event, even if the watcher was
1363not started in the first place.
1364
1365See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1366functions that do not need a watcher.
1367
1368=back
1369
1370See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1371OWN COMPOSITE WATCHERS> idioms.
1372
1151=head2 WATCHER STATES 1373=head2 WATCHER STATES
1152 1374
1153There are various watcher states mentioned throughout this manual - 1375There are various watcher states mentioned throughout this manual -
1154active, pending and so on. In this section these states and the rules to 1376active, pending and so on. In this section these states and the rules to
1155transition between them will be described in more detail - and while these 1377transition between them will be described in more detail - and while these
1161 1383
1162Before a watcher can be registered with the event looop it has to be 1384Before a watcher can be registered with the event looop it has to be
1163initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1385initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1164C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1386C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1165 1387
1166In this state it is simply some block of memory that is suitable for use 1388In this state it is simply some block of memory that is suitable for
1167in an event loop. It can be moved around, freed, reused etc. at will. 1389use in an event loop. It can be moved around, freed, reused etc. at
1390will - as long as you either keep the memory contents intact, or call
1391C<ev_TYPE_init> again.
1168 1392
1169=item started/running/active 1393=item started/running/active
1170 1394
1171Once a watcher has been started with a call to C<ev_TYPE_start> it becomes 1395Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1172property of the event loop, and is actively waiting for events. While in 1396property of the event loop, and is actively waiting for events. While in
1200latter will clear any pending state the watcher might be in, regardless 1424latter will clear any pending state the watcher might be in, regardless
1201of whether it was active or not, so stopping a watcher explicitly before 1425of whether it was active or not, so stopping a watcher explicitly before
1202freeing it is often a good idea. 1426freeing it is often a good idea.
1203 1427
1204While stopped (and not pending) the watcher is essentially in the 1428While stopped (and not pending) the watcher is essentially in the
1205initialised state, that is it can be reused, moved, modified in any way 1429initialised state, that is, it can be reused, moved, modified in any way
1206you wish. 1430you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
1431it again).
1207 1432
1208=back 1433=back
1209
1210=head2 GENERIC WATCHER FUNCTIONS
1211
1212=over 4
1213
1214=item C<ev_init> (ev_TYPE *watcher, callback)
1215
1216This macro initialises the generic portion of a watcher. The contents
1217of the watcher object can be arbitrary (so C<malloc> will do). Only
1218the generic parts of the watcher are initialised, you I<need> to call
1219the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1220type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1221which rolls both calls into one.
1222
1223You can reinitialise a watcher at any time as long as it has been stopped
1224(or never started) and there are no pending events outstanding.
1225
1226The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1227int revents)>.
1228
1229Example: Initialise an C<ev_io> watcher in two steps.
1230
1231 ev_io w;
1232 ev_init (&w, my_cb);
1233 ev_io_set (&w, STDIN_FILENO, EV_READ);
1234
1235=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1236
1237This macro initialises the type-specific parts of a watcher. You need to
1238call C<ev_init> at least once before you call this macro, but you can
1239call C<ev_TYPE_set> any number of times. You must not, however, call this
1240macro on a watcher that is active (it can be pending, however, which is a
1241difference to the C<ev_init> macro).
1242
1243Although some watcher types do not have type-specific arguments
1244(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1245
1246See C<ev_init>, above, for an example.
1247
1248=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1249
1250This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1251calls into a single call. This is the most convenient method to initialise
1252a watcher. The same limitations apply, of course.
1253
1254Example: Initialise and set an C<ev_io> watcher in one step.
1255
1256 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1257
1258=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1259
1260Starts (activates) the given watcher. Only active watchers will receive
1261events. If the watcher is already active nothing will happen.
1262
1263Example: Start the C<ev_io> watcher that is being abused as example in this
1264whole section.
1265
1266 ev_io_start (EV_DEFAULT_UC, &w);
1267
1268=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1269
1270Stops the given watcher if active, and clears the pending status (whether
1271the watcher was active or not).
1272
1273It is possible that stopped watchers are pending - for example,
1274non-repeating timers are being stopped when they become pending - but
1275calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1276pending. If you want to free or reuse the memory used by the watcher it is
1277therefore a good idea to always call its C<ev_TYPE_stop> function.
1278
1279=item bool ev_is_active (ev_TYPE *watcher)
1280
1281Returns a true value iff the watcher is active (i.e. it has been started
1282and not yet been stopped). As long as a watcher is active you must not modify
1283it.
1284
1285=item bool ev_is_pending (ev_TYPE *watcher)
1286
1287Returns a true value iff the watcher is pending, (i.e. it has outstanding
1288events but its callback has not yet been invoked). As long as a watcher
1289is pending (but not active) you must not call an init function on it (but
1290C<ev_TYPE_set> is safe), you must not change its priority, and you must
1291make sure the watcher is available to libev (e.g. you cannot C<free ()>
1292it).
1293
1294=item callback ev_cb (ev_TYPE *watcher)
1295
1296Returns the callback currently set on the watcher.
1297
1298=item ev_cb_set (ev_TYPE *watcher, callback)
1299
1300Change the callback. You can change the callback at virtually any time
1301(modulo threads).
1302
1303=item ev_set_priority (ev_TYPE *watcher, int priority)
1304
1305=item int ev_priority (ev_TYPE *watcher)
1306
1307Set and query the priority of the watcher. The priority is a small
1308integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1309(default: C<-2>). Pending watchers with higher priority will be invoked
1310before watchers with lower priority, but priority will not keep watchers
1311from being executed (except for C<ev_idle> watchers).
1312
1313If you need to suppress invocation when higher priority events are pending
1314you need to look at C<ev_idle> watchers, which provide this functionality.
1315
1316You I<must not> change the priority of a watcher as long as it is active or
1317pending.
1318
1319Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1320fine, as long as you do not mind that the priority value you query might
1321or might not have been clamped to the valid range.
1322
1323The default priority used by watchers when no priority has been set is
1324always C<0>, which is supposed to not be too high and not be too low :).
1325
1326See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1327priorities.
1328
1329=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1330
1331Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1332C<loop> nor C<revents> need to be valid as long as the watcher callback
1333can deal with that fact, as both are simply passed through to the
1334callback.
1335
1336=item int ev_clear_pending (loop, ev_TYPE *watcher)
1337
1338If the watcher is pending, this function clears its pending status and
1339returns its C<revents> bitset (as if its callback was invoked). If the
1340watcher isn't pending it does nothing and returns C<0>.
1341
1342Sometimes it can be useful to "poll" a watcher instead of waiting for its
1343callback to be invoked, which can be accomplished with this function.
1344
1345=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1346
1347Feeds the given event set into the event loop, as if the specified event
1348had happened for the specified watcher (which must be a pointer to an
1349initialised but not necessarily started event watcher). Obviously you must
1350not free the watcher as long as it has pending events.
1351
1352Stopping the watcher, letting libev invoke it, or calling
1353C<ev_clear_pending> will clear the pending event, even if the watcher was
1354not started in the first place.
1355
1356See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1357functions that do not need a watcher.
1358
1359=back
1360
1361
1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1363
1364Each watcher has, by default, a member C<void *data> that you can change
1365and read at any time: libev will completely ignore it. This can be used
1366to associate arbitrary data with your watcher. If you need more data and
1367don't want to allocate memory and store a pointer to it in that data
1368member, you can also "subclass" the watcher type and provide your own
1369data:
1370
1371 struct my_io
1372 {
1373 ev_io io;
1374 int otherfd;
1375 void *somedata;
1376 struct whatever *mostinteresting;
1377 };
1378
1379 ...
1380 struct my_io w;
1381 ev_io_init (&w.io, my_cb, fd, EV_READ);
1382
1383And since your callback will be called with a pointer to the watcher, you
1384can cast it back to your own type:
1385
1386 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1387 {
1388 struct my_io *w = (struct my_io *)w_;
1389 ...
1390 }
1391
1392More interesting and less C-conformant ways of casting your callback type
1393instead have been omitted.
1394
1395Another common scenario is to use some data structure with multiple
1396embedded watchers:
1397
1398 struct my_biggy
1399 {
1400 int some_data;
1401 ev_timer t1;
1402 ev_timer t2;
1403 }
1404
1405In this case getting the pointer to C<my_biggy> is a bit more
1406complicated: Either you store the address of your C<my_biggy> struct
1407in the C<data> member of the watcher (for woozies), or you need to use
1408some pointer arithmetic using C<offsetof> inside your watchers (for real
1409programmers):
1410
1411 #include <stddef.h>
1412
1413 static void
1414 t1_cb (EV_P_ ev_timer *w, int revents)
1415 {
1416 struct my_biggy big = (struct my_biggy *)
1417 (((char *)w) - offsetof (struct my_biggy, t1));
1418 }
1419
1420 static void
1421 t2_cb (EV_P_ ev_timer *w, int revents)
1422 {
1423 struct my_biggy big = (struct my_biggy *)
1424 (((char *)w) - offsetof (struct my_biggy, t2));
1425 }
1426 1434
1427=head2 WATCHER PRIORITY MODELS 1435=head2 WATCHER PRIORITY MODELS
1428 1436
1429Many event loops support I<watcher priorities>, which are usually small 1437Many event loops support I<watcher priorities>, which are usually small
1430integers that influence the ordering of event callback invocation 1438integers that influence the ordering of event callback invocation
1557In general you can register as many read and/or write event watchers per 1565In general you can register as many read and/or write event watchers per
1558fd as you want (as long as you don't confuse yourself). Setting all file 1566fd as you want (as long as you don't confuse yourself). Setting all file
1559descriptors to non-blocking mode is also usually a good idea (but not 1567descriptors to non-blocking mode is also usually a good idea (but not
1560required if you know what you are doing). 1568required if you know what you are doing).
1561 1569
1562If you cannot use non-blocking mode, then force the use of a
1563known-to-be-good backend (at the time of this writing, this includes only
1564C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1565descriptors for which non-blocking operation makes no sense (such as
1566files) - libev doesn't guarantee any specific behaviour in that case.
1567
1568Another thing you have to watch out for is that it is quite easy to 1570Another thing you have to watch out for is that it is quite easy to
1569receive "spurious" readiness notifications, that is your callback might 1571receive "spurious" readiness notifications, that is, your callback might
1570be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1572be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1571because there is no data. Not only are some backends known to create a 1573because there is no data. It is very easy to get into this situation even
1572lot of those (for example Solaris ports), it is very easy to get into 1574with a relatively standard program structure. Thus it is best to always
1573this situation even with a relatively standard program structure. Thus 1575use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1574it is best to always use non-blocking I/O: An extra C<read>(2) returning
1575C<EAGAIN> is far preferable to a program hanging until some data arrives. 1576preferable to a program hanging until some data arrives.
1576 1577
1577If you cannot run the fd in non-blocking mode (for example you should 1578If you cannot run the fd in non-blocking mode (for example you should
1578not play around with an Xlib connection), then you have to separately 1579not play around with an Xlib connection), then you have to separately
1579re-test whether a file descriptor is really ready with a known-to-be good 1580re-test whether a file descriptor is really ready with a known-to-be good
1580interface such as poll (fortunately in our Xlib example, Xlib already 1581interface such as poll (fortunately in the case of Xlib, it already does
1581does this on its own, so its quite safe to use). Some people additionally 1582this on its own, so its quite safe to use). Some people additionally
1582use C<SIGALRM> and an interval timer, just to be sure you won't block 1583use C<SIGALRM> and an interval timer, just to be sure you won't block
1583indefinitely. 1584indefinitely.
1584 1585
1585But really, best use non-blocking mode. 1586But really, best use non-blocking mode.
1586 1587
1614 1615
1615There is no workaround possible except not registering events 1616There is no workaround possible except not registering events
1616for potentially C<dup ()>'ed file descriptors, or to resort to 1617for potentially C<dup ()>'ed file descriptors, or to resort to
1617C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1618C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1618 1619
1620=head3 The special problem of files
1621
1622Many people try to use C<select> (or libev) on file descriptors
1623representing files, and expect it to become ready when their program
1624doesn't block on disk accesses (which can take a long time on their own).
1625
1626However, this cannot ever work in the "expected" way - you get a readiness
1627notification as soon as the kernel knows whether and how much data is
1628there, and in the case of open files, that's always the case, so you
1629always get a readiness notification instantly, and your read (or possibly
1630write) will still block on the disk I/O.
1631
1632Another way to view it is that in the case of sockets, pipes, character
1633devices and so on, there is another party (the sender) that delivers data
1634on its own, but in the case of files, there is no such thing: the disk
1635will not send data on its own, simply because it doesn't know what you
1636wish to read - you would first have to request some data.
1637
1638Since files are typically not-so-well supported by advanced notification
1639mechanism, libev tries hard to emulate POSIX behaviour with respect
1640to files, even though you should not use it. The reason for this is
1641convenience: sometimes you want to watch STDIN or STDOUT, which is
1642usually a tty, often a pipe, but also sometimes files or special devices
1643(for example, C<epoll> on Linux works with F</dev/random> but not with
1644F</dev/urandom>), and even though the file might better be served with
1645asynchronous I/O instead of with non-blocking I/O, it is still useful when
1646it "just works" instead of freezing.
1647
1648So avoid file descriptors pointing to files when you know it (e.g. use
1649libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
1650when you rarely read from a file instead of from a socket, and want to
1651reuse the same code path.
1652
1619=head3 The special problem of fork 1653=head3 The special problem of fork
1620 1654
1621Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1655Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1622useless behaviour. Libev fully supports fork, but needs to be told about 1656useless behaviour. Libev fully supports fork, but needs to be told about
1623it in the child. 1657it in the child if you want to continue to use it in the child.
1624 1658
1625To support fork in your programs, you either have to call 1659To support fork in your child processes, you have to call C<ev_loop_fork
1626C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1660()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1627enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1661C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1628C<EVBACKEND_POLL>.
1629 1662
1630=head3 The special problem of SIGPIPE 1663=head3 The special problem of SIGPIPE
1631 1664
1632While not really specific to libev, it is easy to forget about C<SIGPIPE>: 1665While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1633when writing to a pipe whose other end has been closed, your program gets 1666when writing to a pipe whose other end has been closed, your program gets
2123 2156
2124Another way to think about it (for the mathematically inclined) is that 2157Another way to think about it (for the mathematically inclined) is that
2125C<ev_periodic> will try to run the callback in this mode at the next possible 2158C<ev_periodic> will try to run the callback in this mode at the next possible
2126time where C<time = offset (mod interval)>, regardless of any time jumps. 2159time where C<time = offset (mod interval)>, regardless of any time jumps.
2127 2160
2128For numerical stability it is preferable that the C<offset> value is near 2161The C<interval> I<MUST> be positive, and for numerical stability, the
2129C<ev_now ()> (the current time), but there is no range requirement for 2162interval value should be higher than C<1/8192> (which is around 100
2130this value, and in fact is often specified as zero. 2163microseconds) and C<offset> should be higher than C<0> and should have
2164at most a similar magnitude as the current time (say, within a factor of
2165ten). Typical values for offset are, in fact, C<0> or something between
2166C<0> and C<interval>, which is also the recommended range.
2131 2167
2132Note also that there is an upper limit to how often a timer can fire (CPU 2168Note also that there is an upper limit to how often a timer can fire (CPU
2133speed for example), so if C<interval> is very small then timing stability 2169speed for example), so if C<interval> is very small then timing stability
2134will of course deteriorate. Libev itself tries to be exact to be about one 2170will of course deteriorate. Libev itself tries to be exact to be about one
2135millisecond (if the OS supports it and the machine is fast enough). 2171millisecond (if the OS supports it and the machine is fast enough).
2249 2285
2250=head2 C<ev_signal> - signal me when a signal gets signalled! 2286=head2 C<ev_signal> - signal me when a signal gets signalled!
2251 2287
2252Signal watchers will trigger an event when the process receives a specific 2288Signal watchers will trigger an event when the process receives a specific
2253signal one or more times. Even though signals are very asynchronous, libev 2289signal one or more times. Even though signals are very asynchronous, libev
2254will try it's best to deliver signals synchronously, i.e. as part of the 2290will try its best to deliver signals synchronously, i.e. as part of the
2255normal event processing, like any other event. 2291normal event processing, like any other event.
2256 2292
2257If you want signals to be delivered truly asynchronously, just use 2293If you want signals to be delivered truly asynchronously, just use
2258C<sigaction> as you would do without libev and forget about sharing 2294C<sigaction> as you would do without libev and forget about sharing
2259the signal. You can even use C<ev_async> from a signal handler to 2295the signal. You can even use C<ev_async> from a signal handler to
2278=head3 The special problem of inheritance over fork/execve/pthread_create 2314=head3 The special problem of inheritance over fork/execve/pthread_create
2279 2315
2280Both the signal mask (C<sigprocmask>) and the signal disposition 2316Both the signal mask (C<sigprocmask>) and the signal disposition
2281(C<sigaction>) are unspecified after starting a signal watcher (and after 2317(C<sigaction>) are unspecified after starting a signal watcher (and after
2282stopping it again), that is, libev might or might not block the signal, 2318stopping it again), that is, libev might or might not block the signal,
2283and might or might not set or restore the installed signal handler. 2319and might or might not set or restore the installed signal handler (but
2320see C<EVFLAG_NOSIGMASK>).
2284 2321
2285While this does not matter for the signal disposition (libev never 2322While this does not matter for the signal disposition (libev never
2286sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on 2323sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2287C<execve>), this matters for the signal mask: many programs do not expect 2324C<execve>), this matters for the signal mask: many programs do not expect
2288certain signals to be blocked. 2325certain signals to be blocked.
2301I<has> to modify the signal mask, at least temporarily. 2338I<has> to modify the signal mask, at least temporarily.
2302 2339
2303So I can't stress this enough: I<If you do not reset your signal mask when 2340So I can't stress this enough: I<If you do not reset your signal mask when
2304you expect it to be empty, you have a race condition in your code>. This 2341you expect it to be empty, you have a race condition in your code>. This
2305is not a libev-specific thing, this is true for most event libraries. 2342is not a libev-specific thing, this is true for most event libraries.
2343
2344=head3 The special problem of threads signal handling
2345
2346POSIX threads has problematic signal handling semantics, specifically,
2347a lot of functionality (sigfd, sigwait etc.) only really works if all
2348threads in a process block signals, which is hard to achieve.
2349
2350When you want to use sigwait (or mix libev signal handling with your own
2351for the same signals), you can tackle this problem by globally blocking
2352all signals before creating any threads (or creating them with a fully set
2353sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
2354loops. Then designate one thread as "signal receiver thread" which handles
2355these signals. You can pass on any signals that libev might be interested
2356in by calling C<ev_feed_signal>.
2306 2357
2307=head3 Watcher-Specific Functions and Data Members 2358=head3 Watcher-Specific Functions and Data Members
2308 2359
2309=over 4 2360=over 4
2310 2361
3098 3149
3099=item ev_fork_init (ev_fork *, callback) 3150=item ev_fork_init (ev_fork *, callback)
3100 3151
3101Initialises and configures the fork watcher - it has no parameters of any 3152Initialises and configures the fork watcher - it has no parameters of any
3102kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 3153kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3103believe me. 3154really.
3104 3155
3105=back 3156=back
3106 3157
3107 3158
3108=head2 C<ev_cleanup> - even the best things end 3159=head2 C<ev_cleanup> - even the best things end
3109 3160
3110Cleanup watchers are called just before the event loop they are registered 3161Cleanup watchers are called just before the event loop is being destroyed
3111with is being destroyed. 3162by a call to C<ev_loop_destroy>.
3112 3163
3113While there is no guarantee that the event loop gets destroyed, cleanup 3164While there is no guarantee that the event loop gets destroyed, cleanup
3114watchers provide a convenient method to install cleanup hooks for your 3165watchers provide a convenient method to install cleanup hooks for your
3115program, worker threads and so on - you just to make sure to destroy the 3166program, worker threads and so on - you just to make sure to destroy the
3116loop when you want them to be invoked. 3167loop when you want them to be invoked.
3126 3177
3127=item ev_cleanup_init (ev_cleanup *, callback) 3178=item ev_cleanup_init (ev_cleanup *, callback)
3128 3179
3129Initialises and configures the cleanup watcher - it has no parameters of 3180Initialises and configures the cleanup watcher - it has no parameters of
3130any kind. There is a C<ev_cleanup_set> macro, but using it is utterly 3181any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3131pointless, believe me. 3182pointless, I assure you.
3132 3183
3133=back 3184=back
3134 3185
3135Example: Register an atexit handler to destroy the default loop, so any 3186Example: Register an atexit handler to destroy the default loop, so any
3136cleanup functions are called. 3187cleanup functions are called.
3145 atexit (program_exits); 3196 atexit (program_exits);
3146 3197
3147 3198
3148=head2 C<ev_async> - how to wake up an event loop 3199=head2 C<ev_async> - how to wake up an event loop
3149 3200
3150In general, you cannot use an C<ev_run> from multiple threads or other 3201In general, you cannot use an C<ev_loop> from multiple threads or other
3151asynchronous sources such as signal handlers (as opposed to multiple event 3202asynchronous sources such as signal handlers (as opposed to multiple event
3152loops - those are of course safe to use in different threads). 3203loops - those are of course safe to use in different threads).
3153 3204
3154Sometimes, however, you need to wake up an event loop you do not control, 3205Sometimes, however, you need to wake up an event loop you do not control,
3155for example because it belongs to another thread. This is what C<ev_async> 3206for example because it belongs to another thread. This is what C<ev_async>
3157it by calling C<ev_async_send>, which is thread- and signal safe. 3208it by calling C<ev_async_send>, which is thread- and signal safe.
3158 3209
3159This functionality is very similar to C<ev_signal> watchers, as signals, 3210This functionality is very similar to C<ev_signal> watchers, as signals,
3160too, are asynchronous in nature, and signals, too, will be compressed 3211too, are asynchronous in nature, and signals, too, will be compressed
3161(i.e. the number of callback invocations may be less than the number of 3212(i.e. the number of callback invocations may be less than the number of
3162C<ev_async_sent> calls). 3213C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3214of "global async watchers" by using a watcher on an otherwise unused
3215signal, and C<ev_feed_signal> to signal this watcher from another thread,
3216even without knowing which loop owns the signal.
3163 3217
3164Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not 3218Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3165just the default loop. 3219just the default loop.
3166 3220
3167=head3 Queueing 3221=head3 Queueing
3262trust me. 3316trust me.
3263 3317
3264=item ev_async_send (loop, ev_async *) 3318=item ev_async_send (loop, ev_async *)
3265 3319
3266Sends/signals/activates the given C<ev_async> watcher, that is, feeds 3320Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3267an C<EV_ASYNC> event on the watcher into the event loop. Unlike 3321an C<EV_ASYNC> event on the watcher into the event loop, and instantly
3322returns.
3323
3268C<ev_feed_event>, this call is safe to do from other threads, signal or 3324Unlike C<ev_feed_event>, this call is safe to do from other threads,
3269similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding 3325signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3270section below on what exactly this means). 3326embedding section below on what exactly this means).
3271 3327
3272Note that, as with other watchers in libev, multiple events might get 3328Note that, as with other watchers in libev, multiple events might get
3273compressed into a single callback invocation (another way to look at this 3329compressed into a single callback invocation (another way to look at this
3274is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>, 3330is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
3275reset when the event loop detects that). 3331reset when the event loop detects that).
3343Feed an event on the given fd, as if a file descriptor backend detected 3399Feed an event on the given fd, as if a file descriptor backend detected
3344the given events it. 3400the given events it.
3345 3401
3346=item ev_feed_signal_event (loop, int signum) 3402=item ev_feed_signal_event (loop, int signum)
3347 3403
3348Feed an event as if the given signal occurred (C<loop> must be the default 3404Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3349loop!). 3405which is async-safe.
3350 3406
3351=back 3407=back
3408
3409
3410=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3411
3412This section explains some common idioms that are not immediately
3413obvious. Note that examples are sprinkled over the whole manual, and this
3414section only contains stuff that wouldn't fit anywhere else.
3415
3416=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3417
3418Each watcher has, by default, a C<void *data> member that you can read
3419or modify at any time: libev will completely ignore it. This can be used
3420to associate arbitrary data with your watcher. If you need more data and
3421don't want to allocate memory separately and store a pointer to it in that
3422data member, you can also "subclass" the watcher type and provide your own
3423data:
3424
3425 struct my_io
3426 {
3427 ev_io io;
3428 int otherfd;
3429 void *somedata;
3430 struct whatever *mostinteresting;
3431 };
3432
3433 ...
3434 struct my_io w;
3435 ev_io_init (&w.io, my_cb, fd, EV_READ);
3436
3437And since your callback will be called with a pointer to the watcher, you
3438can cast it back to your own type:
3439
3440 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
3441 {
3442 struct my_io *w = (struct my_io *)w_;
3443 ...
3444 }
3445
3446More interesting and less C-conformant ways of casting your callback
3447function type instead have been omitted.
3448
3449=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
3450
3451Another common scenario is to use some data structure with multiple
3452embedded watchers, in effect creating your own watcher that combines
3453multiple libev event sources into one "super-watcher":
3454
3455 struct my_biggy
3456 {
3457 int some_data;
3458 ev_timer t1;
3459 ev_timer t2;
3460 }
3461
3462In this case getting the pointer to C<my_biggy> is a bit more
3463complicated: Either you store the address of your C<my_biggy> struct in
3464the C<data> member of the watcher (for woozies or C++ coders), or you need
3465to use some pointer arithmetic using C<offsetof> inside your watchers (for
3466real programmers):
3467
3468 #include <stddef.h>
3469
3470 static void
3471 t1_cb (EV_P_ ev_timer *w, int revents)
3472 {
3473 struct my_biggy big = (struct my_biggy *)
3474 (((char *)w) - offsetof (struct my_biggy, t1));
3475 }
3476
3477 static void
3478 t2_cb (EV_P_ ev_timer *w, int revents)
3479 {
3480 struct my_biggy big = (struct my_biggy *)
3481 (((char *)w) - offsetof (struct my_biggy, t2));
3482 }
3483
3484=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3485
3486Often (especially in GUI toolkits) there are places where you have
3487I<modal> interaction, which is most easily implemented by recursively
3488invoking C<ev_run>.
3489
3490This brings the problem of exiting - a callback might want to finish the
3491main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3492a modal "Are you sure?" dialog is still waiting), or just the nested one
3493and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3494other combination: In these cases, C<ev_break> will not work alone.
3495
3496The solution is to maintain "break this loop" variable for each C<ev_run>
3497invocation, and use a loop around C<ev_run> until the condition is
3498triggered, using C<EVRUN_ONCE>:
3499
3500 // main loop
3501 int exit_main_loop = 0;
3502
3503 while (!exit_main_loop)
3504 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3505
3506 // in a model watcher
3507 int exit_nested_loop = 0;
3508
3509 while (!exit_nested_loop)
3510 ev_run (EV_A_ EVRUN_ONCE);
3511
3512To exit from any of these loops, just set the corresponding exit variable:
3513
3514 // exit modal loop
3515 exit_nested_loop = 1;
3516
3517 // exit main program, after modal loop is finished
3518 exit_main_loop = 1;
3519
3520 // exit both
3521 exit_main_loop = exit_nested_loop = 1;
3522
3523=head2 THREAD LOCKING EXAMPLE
3524
3525Here is a fictitious example of how to run an event loop in a different
3526thread from where callbacks are being invoked and watchers are
3527created/added/removed.
3528
3529For a real-world example, see the C<EV::Loop::Async> perl module,
3530which uses exactly this technique (which is suited for many high-level
3531languages).
3532
3533The example uses a pthread mutex to protect the loop data, a condition
3534variable to wait for callback invocations, an async watcher to notify the
3535event loop thread and an unspecified mechanism to wake up the main thread.
3536
3537First, you need to associate some data with the event loop:
3538
3539 typedef struct {
3540 mutex_t lock; /* global loop lock */
3541 ev_async async_w;
3542 thread_t tid;
3543 cond_t invoke_cv;
3544 } userdata;
3545
3546 void prepare_loop (EV_P)
3547 {
3548 // for simplicity, we use a static userdata struct.
3549 static userdata u;
3550
3551 ev_async_init (&u->async_w, async_cb);
3552 ev_async_start (EV_A_ &u->async_w);
3553
3554 pthread_mutex_init (&u->lock, 0);
3555 pthread_cond_init (&u->invoke_cv, 0);
3556
3557 // now associate this with the loop
3558 ev_set_userdata (EV_A_ u);
3559 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3560 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3561
3562 // then create the thread running ev_run
3563 pthread_create (&u->tid, 0, l_run, EV_A);
3564 }
3565
3566The callback for the C<ev_async> watcher does nothing: the watcher is used
3567solely to wake up the event loop so it takes notice of any new watchers
3568that might have been added:
3569
3570 static void
3571 async_cb (EV_P_ ev_async *w, int revents)
3572 {
3573 // just used for the side effects
3574 }
3575
3576The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
3577protecting the loop data, respectively.
3578
3579 static void
3580 l_release (EV_P)
3581 {
3582 userdata *u = ev_userdata (EV_A);
3583 pthread_mutex_unlock (&u->lock);
3584 }
3585
3586 static void
3587 l_acquire (EV_P)
3588 {
3589 userdata *u = ev_userdata (EV_A);
3590 pthread_mutex_lock (&u->lock);
3591 }
3592
3593The event loop thread first acquires the mutex, and then jumps straight
3594into C<ev_run>:
3595
3596 void *
3597 l_run (void *thr_arg)
3598 {
3599 struct ev_loop *loop = (struct ev_loop *)thr_arg;
3600
3601 l_acquire (EV_A);
3602 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
3603 ev_run (EV_A_ 0);
3604 l_release (EV_A);
3605
3606 return 0;
3607 }
3608
3609Instead of invoking all pending watchers, the C<l_invoke> callback will
3610signal the main thread via some unspecified mechanism (signals? pipe
3611writes? C<Async::Interrupt>?) and then waits until all pending watchers
3612have been called (in a while loop because a) spurious wakeups are possible
3613and b) skipping inter-thread-communication when there are no pending
3614watchers is very beneficial):
3615
3616 static void
3617 l_invoke (EV_P)
3618 {
3619 userdata *u = ev_userdata (EV_A);
3620
3621 while (ev_pending_count (EV_A))
3622 {
3623 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
3624 pthread_cond_wait (&u->invoke_cv, &u->lock);
3625 }
3626 }
3627
3628Now, whenever the main thread gets told to invoke pending watchers, it
3629will grab the lock, call C<ev_invoke_pending> and then signal the loop
3630thread to continue:
3631
3632 static void
3633 real_invoke_pending (EV_P)
3634 {
3635 userdata *u = ev_userdata (EV_A);
3636
3637 pthread_mutex_lock (&u->lock);
3638 ev_invoke_pending (EV_A);
3639 pthread_cond_signal (&u->invoke_cv);
3640 pthread_mutex_unlock (&u->lock);
3641 }
3642
3643Whenever you want to start/stop a watcher or do other modifications to an
3644event loop, you will now have to lock:
3645
3646 ev_timer timeout_watcher;
3647 userdata *u = ev_userdata (EV_A);
3648
3649 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
3650
3651 pthread_mutex_lock (&u->lock);
3652 ev_timer_start (EV_A_ &timeout_watcher);
3653 ev_async_send (EV_A_ &u->async_w);
3654 pthread_mutex_unlock (&u->lock);
3655
3656Note that sending the C<ev_async> watcher is required because otherwise
3657an event loop currently blocking in the kernel will have no knowledge
3658about the newly added timer. By waking up the loop it will pick up any new
3659watchers in the next event loop iteration.
3660
3661=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
3662
3663While the overhead of a callback that e.g. schedules a thread is small, it
3664is still an overhead. If you embed libev, and your main usage is with some
3665kind of threads or coroutines, you might want to customise libev so that
3666doesn't need callbacks anymore.
3667
3668Imagine you have coroutines that you can switch to using a function
3669C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
3670and that due to some magic, the currently active coroutine is stored in a
3671global called C<current_coro>. Then you can build your own "wait for libev
3672event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
3673the differing C<;> conventions):
3674
3675 #define EV_CB_DECLARE(type) struct my_coro *cb;
3676 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3677
3678That means instead of having a C callback function, you store the
3679coroutine to switch to in each watcher, and instead of having libev call
3680your callback, you instead have it switch to that coroutine.
3681
3682A coroutine might now wait for an event with a function called
3683C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
3684matter when, or whether the watcher is active or not when this function is
3685called):
3686
3687 void
3688 wait_for_event (ev_watcher *w)
3689 {
3690 ev_cb_set (w) = current_coro;
3691 switch_to (libev_coro);
3692 }
3693
3694That basically suspends the coroutine inside C<wait_for_event> and
3695continues the libev coroutine, which, when appropriate, switches back to
3696this or any other coroutine. I am sure if you sue this your own :)
3697
3698You can do similar tricks if you have, say, threads with an event queue -
3699instead of storing a coroutine, you store the queue object and instead of
3700switching to a coroutine, you push the watcher onto the queue and notify
3701any waiters.
3702
3703To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
3704files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3705
3706 // my_ev.h
3707 #define EV_CB_DECLARE(type) struct my_coro *cb;
3708 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3709 #include "../libev/ev.h"
3710
3711 // my_ev.c
3712 #define EV_H "my_ev.h"
3713 #include "../libev/ev.c"
3714
3715And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
3716F<my_ev.c> into your project. When properly specifying include paths, you
3717can even use F<ev.h> as header file name directly.
3352 3718
3353 3719
3354=head1 LIBEVENT EMULATION 3720=head1 LIBEVENT EMULATION
3355 3721
3356Libev offers a compatibility emulation layer for libevent. It cannot 3722Libev offers a compatibility emulation layer for libevent. It cannot
3357emulate the internals of libevent, so here are some usage hints: 3723emulate the internals of libevent, so here are some usage hints:
3358 3724
3359=over 4 3725=over 4
3726
3727=item * Only the libevent-1.4.1-beta API is being emulated.
3728
3729This was the newest libevent version available when libev was implemented,
3730and is still mostly unchanged in 2010.
3360 3731
3361=item * Use it by including <event.h>, as usual. 3732=item * Use it by including <event.h>, as usual.
3362 3733
3363=item * The following members are fully supported: ev_base, ev_callback, 3734=item * The following members are fully supported: ev_base, ev_callback,
3364ev_arg, ev_fd, ev_res, ev_events. 3735ev_arg, ev_fd, ev_res, ev_events.
3370=item * Priorities are not currently supported. Initialising priorities 3741=item * Priorities are not currently supported. Initialising priorities
3371will fail and all watchers will have the same priority, even though there 3742will fail and all watchers will have the same priority, even though there
3372is an ev_pri field. 3743is an ev_pri field.
3373 3744
3374=item * In libevent, the last base created gets the signals, in libev, the 3745=item * In libevent, the last base created gets the signals, in libev, the
3375first base created (== the default loop) gets the signals. 3746base that registered the signal gets the signals.
3376 3747
3377=item * Other members are not supported. 3748=item * Other members are not supported.
3378 3749
3379=item * The libev emulation is I<not> ABI compatible to libevent, you need 3750=item * The libev emulation is I<not> ABI compatible to libevent, you need
3380to use the libev header file and library. 3751to use the libev header file and library.
3399Care has been taken to keep the overhead low. The only data member the C++ 3770Care has been taken to keep the overhead low. The only data member the C++
3400classes add (compared to plain C-style watchers) is the event loop pointer 3771classes add (compared to plain C-style watchers) is the event loop pointer
3401that the watcher is associated with (or no additional members at all if 3772that the watcher is associated with (or no additional members at all if
3402you disable C<EV_MULTIPLICITY> when embedding libev). 3773you disable C<EV_MULTIPLICITY> when embedding libev).
3403 3774
3404Currently, functions, and static and non-static member functions can be 3775Currently, functions, static and non-static member functions and classes
3405used as callbacks. Other types should be easy to add as long as they only 3776with C<operator ()> can be used as callbacks. Other types should be easy
3406need one additional pointer for context. If you need support for other 3777to add as long as they only need one additional pointer for context. If
3407types of functors please contact the author (preferably after implementing 3778you need support for other types of functors please contact the author
3408it). 3779(preferably after implementing it).
3409 3780
3410Here is a list of things available in the C<ev> namespace: 3781Here is a list of things available in the C<ev> namespace:
3411 3782
3412=over 4 3783=over 4
3413 3784
3841F<event.h> that are not directly supported by the libev core alone. 4212F<event.h> that are not directly supported by the libev core alone.
3842 4213
3843In standalone mode, libev will still try to automatically deduce the 4214In standalone mode, libev will still try to automatically deduce the
3844configuration, but has to be more conservative. 4215configuration, but has to be more conservative.
3845 4216
4217=item EV_USE_FLOOR
4218
4219If defined to be C<1>, libev will use the C<floor ()> function for its
4220periodic reschedule calculations, otherwise libev will fall back on a
4221portable (slower) implementation. If you enable this, you usually have to
4222link against libm or something equivalent. Enabling this when the C<floor>
4223function is not available will fail, so the safe default is to not enable
4224this.
4225
3846=item EV_USE_MONOTONIC 4226=item EV_USE_MONOTONIC
3847 4227
3848If defined to be C<1>, libev will try to detect the availability of the 4228If defined to be C<1>, libev will try to detect the availability of the
3849monotonic clock option at both compile time and runtime. Otherwise no 4229monotonic clock option at both compile time and runtime. Otherwise no
3850use of the monotonic clock option will be attempted. If you enable this, 4230use of the monotonic clock option will be attempted. If you enable this,
4281And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4661And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4282 4662
4283 #include "ev_cpp.h" 4663 #include "ev_cpp.h"
4284 #include "ev.c" 4664 #include "ev.c"
4285 4665
4286=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4666=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4287 4667
4288=head2 THREADS AND COROUTINES 4668=head2 THREADS AND COROUTINES
4289 4669
4290=head3 THREADS 4670=head3 THREADS
4291 4671
4342default loop and triggering an C<ev_async> watcher from the default loop 4722default loop and triggering an C<ev_async> watcher from the default loop
4343watcher callback into the event loop interested in the signal. 4723watcher callback into the event loop interested in the signal.
4344 4724
4345=back 4725=back
4346 4726
4347=head4 THREAD LOCKING EXAMPLE 4727See also L<THREAD LOCKING EXAMPLE>.
4348
4349Here is a fictitious example of how to run an event loop in a different
4350thread than where callbacks are being invoked and watchers are
4351created/added/removed.
4352
4353For a real-world example, see the C<EV::Loop::Async> perl module,
4354which uses exactly this technique (which is suited for many high-level
4355languages).
4356
4357The example uses a pthread mutex to protect the loop data, a condition
4358variable to wait for callback invocations, an async watcher to notify the
4359event loop thread and an unspecified mechanism to wake up the main thread.
4360
4361First, you need to associate some data with the event loop:
4362
4363 typedef struct {
4364 mutex_t lock; /* global loop lock */
4365 ev_async async_w;
4366 thread_t tid;
4367 cond_t invoke_cv;
4368 } userdata;
4369
4370 void prepare_loop (EV_P)
4371 {
4372 // for simplicity, we use a static userdata struct.
4373 static userdata u;
4374
4375 ev_async_init (&u->async_w, async_cb);
4376 ev_async_start (EV_A_ &u->async_w);
4377
4378 pthread_mutex_init (&u->lock, 0);
4379 pthread_cond_init (&u->invoke_cv, 0);
4380
4381 // now associate this with the loop
4382 ev_set_userdata (EV_A_ u);
4383 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4384 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4385
4386 // then create the thread running ev_loop
4387 pthread_create (&u->tid, 0, l_run, EV_A);
4388 }
4389
4390The callback for the C<ev_async> watcher does nothing: the watcher is used
4391solely to wake up the event loop so it takes notice of any new watchers
4392that might have been added:
4393
4394 static void
4395 async_cb (EV_P_ ev_async *w, int revents)
4396 {
4397 // just used for the side effects
4398 }
4399
4400The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4401protecting the loop data, respectively.
4402
4403 static void
4404 l_release (EV_P)
4405 {
4406 userdata *u = ev_userdata (EV_A);
4407 pthread_mutex_unlock (&u->lock);
4408 }
4409
4410 static void
4411 l_acquire (EV_P)
4412 {
4413 userdata *u = ev_userdata (EV_A);
4414 pthread_mutex_lock (&u->lock);
4415 }
4416
4417The event loop thread first acquires the mutex, and then jumps straight
4418into C<ev_run>:
4419
4420 void *
4421 l_run (void *thr_arg)
4422 {
4423 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4424
4425 l_acquire (EV_A);
4426 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4427 ev_run (EV_A_ 0);
4428 l_release (EV_A);
4429
4430 return 0;
4431 }
4432
4433Instead of invoking all pending watchers, the C<l_invoke> callback will
4434signal the main thread via some unspecified mechanism (signals? pipe
4435writes? C<Async::Interrupt>?) and then waits until all pending watchers
4436have been called (in a while loop because a) spurious wakeups are possible
4437and b) skipping inter-thread-communication when there are no pending
4438watchers is very beneficial):
4439
4440 static void
4441 l_invoke (EV_P)
4442 {
4443 userdata *u = ev_userdata (EV_A);
4444
4445 while (ev_pending_count (EV_A))
4446 {
4447 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4448 pthread_cond_wait (&u->invoke_cv, &u->lock);
4449 }
4450 }
4451
4452Now, whenever the main thread gets told to invoke pending watchers, it
4453will grab the lock, call C<ev_invoke_pending> and then signal the loop
4454thread to continue:
4455
4456 static void
4457 real_invoke_pending (EV_P)
4458 {
4459 userdata *u = ev_userdata (EV_A);
4460
4461 pthread_mutex_lock (&u->lock);
4462 ev_invoke_pending (EV_A);
4463 pthread_cond_signal (&u->invoke_cv);
4464 pthread_mutex_unlock (&u->lock);
4465 }
4466
4467Whenever you want to start/stop a watcher or do other modifications to an
4468event loop, you will now have to lock:
4469
4470 ev_timer timeout_watcher;
4471 userdata *u = ev_userdata (EV_A);
4472
4473 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4474
4475 pthread_mutex_lock (&u->lock);
4476 ev_timer_start (EV_A_ &timeout_watcher);
4477 ev_async_send (EV_A_ &u->async_w);
4478 pthread_mutex_unlock (&u->lock);
4479
4480Note that sending the C<ev_async> watcher is required because otherwise
4481an event loop currently blocking in the kernel will have no knowledge
4482about the newly added timer. By waking up the loop it will pick up any new
4483watchers in the next event loop iteration.
4484 4728
4485=head3 COROUTINES 4729=head3 COROUTINES
4486 4730
4487Libev is very accommodating to coroutines ("cooperative threads"): 4731Libev is very accommodating to coroutines ("cooperative threads"):
4488libev fully supports nesting calls to its functions from different 4732libev fully supports nesting calls to its functions from different
4757structure (guaranteed by POSIX but not by ISO C for example), but it also 5001structure (guaranteed by POSIX but not by ISO C for example), but it also
4758assumes that the same (machine) code can be used to call any watcher 5002assumes that the same (machine) code can be used to call any watcher
4759callback: The watcher callbacks have different type signatures, but libev 5003callback: The watcher callbacks have different type signatures, but libev
4760calls them using an C<ev_watcher *> internally. 5004calls them using an C<ev_watcher *> internally.
4761 5005
5006=item pointer accesses must be thread-atomic
5007
5008Accessing a pointer value must be atomic, it must both be readable and
5009writable in one piece - this is the case on all current architectures.
5010
4762=item C<sig_atomic_t volatile> must be thread-atomic as well 5011=item C<sig_atomic_t volatile> must be thread-atomic as well
4763 5012
4764The type C<sig_atomic_t volatile> (or whatever is defined as 5013The type C<sig_atomic_t volatile> (or whatever is defined as
4765C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 5014C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4766threads. This is not part of the specification for C<sig_atomic_t>, but is 5015threads. This is not part of the specification for C<sig_atomic_t>, but is
4872=back 5121=back
4873 5122
4874 5123
4875=head1 PORTING FROM LIBEV 3.X TO 4.X 5124=head1 PORTING FROM LIBEV 3.X TO 4.X
4876 5125
4877The major version 4 introduced some minor incompatible changes to the API. 5126The major version 4 introduced some incompatible changes to the API.
4878 5127
4879At the moment, the C<ev.h> header file tries to implement superficial 5128At the moment, the C<ev.h> header file provides compatibility definitions
4880compatibility, so most programs should still compile. Those might be 5129for all changes, so most programs should still compile. The compatibility
4881removed in later versions of libev, so better update early than late. 5130layer might be removed in later versions of libev, so better update to the
5131new API early than late.
4882 5132
4883=over 4 5133=over 4
5134
5135=item C<EV_COMPAT3> backwards compatibility mechanism
5136
5137The backward compatibility mechanism can be controlled by
5138C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
5139section.
4884 5140
4885=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5141=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4886 5142
4887These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5143These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4888 5144
4914ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 5170ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4915as all other watcher types. Note that C<ev_loop_fork> is still called 5171as all other watcher types. Note that C<ev_loop_fork> is still called
4916C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> 5172C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4917typedef. 5173typedef.
4918 5174
4919=item C<EV_COMPAT3> backwards compatibility mechanism
4920
4921The backward compatibility mechanism can be controlled by
4922C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4923section.
4924
4925=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 5175=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4926 5176
4927The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 5177The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4928mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 5178mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4929and work, but the library code will of course be larger. 5179and work, but the library code will of course be larger.
4991The physical time that is observed. It is apparently strictly monotonic :) 5241The physical time that is observed. It is apparently strictly monotonic :)
4992 5242
4993=item wall-clock time 5243=item wall-clock time
4994 5244
4995The time and date as shown on clocks. Unlike real time, it can actually 5245The time and date as shown on clocks. Unlike real time, it can actually
4996be wrong and jump forwards and backwards, e.g. when the you adjust your 5246be wrong and jump forwards and backwards, e.g. when you adjust your
4997clock. 5247clock.
4998 5248
4999=item watcher 5249=item watcher
5000 5250
5001A data structure that describes interest in certain events. Watchers need 5251A data structure that describes interest in certain events. Watchers need
5003 5253
5004=back 5254=back
5005 5255
5006=head1 AUTHOR 5256=head1 AUTHOR
5007 5257
5008Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5258Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5259Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5009 5260

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines