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

Comparing libev/ev.pod (file contents):
Revision 1.323 by root, Sun Oct 24 18:01:26 2010 UTC vs.
Revision 1.368 by root, Thu Apr 14 23:02:33 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, but
467of 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
468I<different> file descriptors (even already closed ones, so one cannot 506I<different> file descriptors (even already closed ones, so one cannot
469even remove them from the set) than registered in the set (especially 507even remove them from the set) than registered in the set (especially
471employing an additional generation counter and comparing that against the 509employing an additional generation counter and comparing that against the
472events to filter out spurious ones, recreating the set when required. Last 510events to filter out spurious ones, recreating the set when required. Last
473not least, it also refuses to work with some file descriptors which work 511not least, it also refuses to work with some file descriptors which work
474perfectly fine with C<select> (files, many character devices...). 512perfectly fine with C<select> (files, many character devices...).
475 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.
517
476While 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
477will 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
478incident (because the same I<file descriptor> could point to a different 520incident (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 521I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
480file descriptors might not work very well if you register events for both 522file descriptors might not work very well if you register events for both
545=item C<EVBACKEND_PORT> (value 32, Solaris 10) 587=item C<EVBACKEND_PORT> (value 32, Solaris 10)
546 588
547This 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,
548it'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)).
549 591
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 592While this backend scales well, it requires one system call per active
555file descriptor per loop iteration. For small and medium numbers of file 593file descriptor per loop iteration. For small and medium numbers of file
556descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 594descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
557might perform better. 595might perform better.
558 596
559On the positive side, with the exception of the spurious readiness 597On 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 598specification in all tests and is fully embeddable, which is a rare feat
562OS-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.
563 611
564This 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
565C<EVBACKEND_POLL>. 613C<EVBACKEND_POLL>.
566 614
567=item C<EVBACKEND_ALL> 615=item C<EVBACKEND_ALL>
568 616
569Try all backends (even potentially broken ones that wouldn't be tried 617Try 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 618with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
571C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 619C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
572 620
573It 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).
574 630
575=back 631=back
576 632
577If 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,
578then 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
607This function is normally used on loop objects allocated by 663This 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 664C<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. 665C<ev_default_loop>, in which case it is not thread-safe.
610 666
611Note that it is not advisable to call this function on the default loop 667Note 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. 668except 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> 669If you need dynamically allocated loops it is better to use C<ev_loop_new>
614and C<ev_loop_destroy>. 670and C<ev_loop_destroy>.
615 671
616=item ev_loop_fork (loop) 672=item ev_loop_fork (loop)
617 673
665prepare and check phases. 721prepare and check phases.
666 722
667=item unsigned int ev_depth (loop) 723=item unsigned int ev_depth (loop)
668 724
669Returns the number of times C<ev_run> was entered minus the number of 725Returns 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. 726times C<ev_run> was exited normally, in other words, the recursion depth.
671 727
672Outside C<ev_run>, this number is zero. In a callback, this number is 728Outside 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), 729C<1>, unless C<ev_run> was invoked recursively (or from another thread),
674in which case it is higher. 730in which case it is higher.
675 731
676Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 732Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
677etc.), doesn't count as "exit" - consider this as a hint to avoid such 733throwing an exception etc.), doesn't count as "exit" - consider this
678ungentleman-like 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.
679 736
680=item unsigned int ev_backend (loop) 737=item unsigned int ev_backend (loop)
681 738
682Returns one of the C<EVBACKEND_*> flags indicating the event backend in 739Returns one of the C<EVBACKEND_*> flags indicating the event backend in
683use. 740use.
744relying 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
745finished (especially in interactive programs), but having a program 802finished (especially in interactive programs), but having a program
746that 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
747of 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
748beauty. 805beauty.
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.
749 811
750A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 812A 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 813those 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 814block 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 815iteration of the loop. This is sometimes useful to poll and handle new
806anymore. 868anymore.
807 869
808 ... queue jobs here, make sure they register event watchers as long 870 ... 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..) 871 ... as they still have work to do (even an idle watcher will do..)
810 ev_run (my_loop, 0); 872 ev_run (my_loop, 0);
811 ... jobs done or somebody called unloop. yeah! 873 ... jobs done or somebody called break. yeah!
812 874
813=item ev_break (loop, how) 875=item ev_break (loop, how)
814 876
815Can be used to make a call to C<ev_run> return early (but only after it 877Can 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 878has 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 879C<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. 880C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
819 881
820This "unloop state" will be cleared when entering C<ev_run> again. 882This "break state" will be cleared on the next call to C<ev_run>.
821 883
822It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## 884It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
885which case it will have no effect.
823 886
824=item ev_ref (loop) 887=item ev_ref (loop)
825 888
826=item ev_unref (loop) 889=item ev_unref (loop)
827 890
848running when nothing else is active. 911running when nothing else is active.
849 912
850 ev_signal exitsig; 913 ev_signal exitsig;
851 ev_signal_init (&exitsig, sig_cb, SIGINT); 914 ev_signal_init (&exitsig, sig_cb, SIGINT);
852 ev_signal_start (loop, &exitsig); 915 ev_signal_start (loop, &exitsig);
853 evf_unref (loop); 916 ev_unref (loop);
854 917
855Example: For some weird reason, unregister the above signal handler again. 918Example: For some weird reason, unregister the above signal handler again.
856 919
857 ev_ref (loop); 920 ev_ref (loop);
858 ev_signal_stop (loop, &exitsig); 921 ev_signal_stop (loop, &exitsig);
970See 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
971document. 1034document.
972 1035
973=item ev_set_userdata (loop, void *data) 1036=item ev_set_userdata (loop, void *data)
974 1037
975=item ev_userdata (loop) 1038=item void *ev_userdata (loop)
976 1039
977Set and retrieve a single C<void *> associated with a loop. When 1040Set and retrieve a single C<void *> associated with a loop. When
978C<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
979C<0.> 1042C<0>.
980 1043
981These 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,
982and 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
983C<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
984any other purpose as well. 1047any other purpose as well.
1112=item C<EV_FORK> 1175=item C<EV_FORK>
1113 1176
1114The 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
1115C<ev_fork>). 1178C<ev_fork>).
1116 1179
1180=item C<EV_CLEANUP>
1181
1182The event loop is about to be destroyed (see C<ev_cleanup>).
1183
1117=item C<EV_ASYNC> 1184=item C<EV_ASYNC>
1118 1185
1119The given async watcher has been asynchronously notified (see C<ev_async>). 1186The given async watcher has been asynchronously notified (see C<ev_async>).
1120 1187
1121=item C<EV_CUSTOM> 1188=item C<EV_CUSTOM>
1142programs, though, as the fd could already be closed and reused for another 1209programs, though, as the fd could already be closed and reused for another
1143thing, so beware. 1210thing, so beware.
1144 1211
1145=back 1212=back
1146 1213
1214=head2 GENERIC WATCHER FUNCTIONS
1215
1216=over 4
1217
1218=item C<ev_init> (ev_TYPE *watcher, callback)
1219
1220This macro initialises the generic portion of a watcher. The contents
1221of the watcher object can be arbitrary (so C<malloc> will do). Only
1222the generic parts of the watcher are initialised, you I<need> to call
1223the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1224type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1225which rolls both calls into one.
1226
1227You can reinitialise a watcher at any time as long as it has been stopped
1228(or never started) and there are no pending events outstanding.
1229
1230The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1231int revents)>.
1232
1233Example: Initialise an C<ev_io> watcher in two steps.
1234
1235 ev_io w;
1236 ev_init (&w, my_cb);
1237 ev_io_set (&w, STDIN_FILENO, EV_READ);
1238
1239=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1240
1241This macro initialises the type-specific parts of a watcher. You need to
1242call C<ev_init> at least once before you call this macro, but you can
1243call C<ev_TYPE_set> any number of times. You must not, however, call this
1244macro on a watcher that is active (it can be pending, however, which is a
1245difference to the C<ev_init> macro).
1246
1247Although some watcher types do not have type-specific arguments
1248(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1249
1250See C<ev_init>, above, for an example.
1251
1252=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1253
1254This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1255calls into a single call. This is the most convenient method to initialise
1256a watcher. The same limitations apply, of course.
1257
1258Example: Initialise and set an C<ev_io> watcher in one step.
1259
1260 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1261
1262=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1263
1264Starts (activates) the given watcher. Only active watchers will receive
1265events. If the watcher is already active nothing will happen.
1266
1267Example: Start the C<ev_io> watcher that is being abused as example in this
1268whole section.
1269
1270 ev_io_start (EV_DEFAULT_UC, &w);
1271
1272=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1273
1274Stops the given watcher if active, and clears the pending status (whether
1275the watcher was active or not).
1276
1277It is possible that stopped watchers are pending - for example,
1278non-repeating timers are being stopped when they become pending - but
1279calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1280pending. If you want to free or reuse the memory used by the watcher it is
1281therefore a good idea to always call its C<ev_TYPE_stop> function.
1282
1283=item bool ev_is_active (ev_TYPE *watcher)
1284
1285Returns a true value iff the watcher is active (i.e. it has been started
1286and not yet been stopped). As long as a watcher is active you must not modify
1287it.
1288
1289=item bool ev_is_pending (ev_TYPE *watcher)
1290
1291Returns a true value iff the watcher is pending, (i.e. it has outstanding
1292events but its callback has not yet been invoked). As long as a watcher
1293is pending (but not active) you must not call an init function on it (but
1294C<ev_TYPE_set> is safe), you must not change its priority, and you must
1295make sure the watcher is available to libev (e.g. you cannot C<free ()>
1296it).
1297
1298=item callback ev_cb (ev_TYPE *watcher)
1299
1300Returns the callback currently set on the watcher.
1301
1302=item ev_cb_set (ev_TYPE *watcher, callback)
1303
1304Change the callback. You can change the callback at virtually any time
1305(modulo threads).
1306
1307=item ev_set_priority (ev_TYPE *watcher, int priority)
1308
1309=item int ev_priority (ev_TYPE *watcher)
1310
1311Set and query the priority of the watcher. The priority is a small
1312integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1313(default: C<-2>). Pending watchers with higher priority will be invoked
1314before watchers with lower priority, but priority will not keep watchers
1315from being executed (except for C<ev_idle> watchers).
1316
1317If you need to suppress invocation when higher priority events are pending
1318you need to look at C<ev_idle> watchers, which provide this functionality.
1319
1320You I<must not> change the priority of a watcher as long as it is active or
1321pending.
1322
1323Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1324fine, as long as you do not mind that the priority value you query might
1325or might not have been clamped to the valid range.
1326
1327The default priority used by watchers when no priority has been set is
1328always C<0>, which is supposed to not be too high and not be too low :).
1329
1330See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1331priorities.
1332
1333=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1334
1335Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1336C<loop> nor C<revents> need to be valid as long as the watcher callback
1337can deal with that fact, as both are simply passed through to the
1338callback.
1339
1340=item int ev_clear_pending (loop, ev_TYPE *watcher)
1341
1342If the watcher is pending, this function clears its pending status and
1343returns its C<revents> bitset (as if its callback was invoked). If the
1344watcher isn't pending it does nothing and returns C<0>.
1345
1346Sometimes it can be useful to "poll" a watcher instead of waiting for its
1347callback to be invoked, which can be accomplished with this function.
1348
1349=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1350
1351Feeds the given event set into the event loop, as if the specified event
1352had happened for the specified watcher (which must be a pointer to an
1353initialised but not necessarily started event watcher). Obviously you must
1354not free the watcher as long as it has pending events.
1355
1356Stopping the watcher, letting libev invoke it, or calling
1357C<ev_clear_pending> will clear the pending event, even if the watcher was
1358not started in the first place.
1359
1360See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1361functions that do not need a watcher.
1362
1363=back
1364
1365See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1366OWN COMPOSITE WATCHERS> idioms.
1367
1147=head2 WATCHER STATES 1368=head2 WATCHER STATES
1148 1369
1149There are various watcher states mentioned throughout this manual - 1370There are various watcher states mentioned throughout this manual -
1150active, pending and so on. In this section these states and the rules to 1371active, pending and so on. In this section these states and the rules to
1151transition between them will be described in more detail - and while these 1372transition between them will be described in more detail - and while these
1157 1378
1158Before a watcher can be registered with the event looop it has to be 1379Before a watcher can be registered with the event looop it has to be
1159initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1380initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1160C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1381C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1161 1382
1162In this state it is simply some block of memory that is suitable for use 1383In this state it is simply some block of memory that is suitable for
1163in an event loop. It can be moved around, freed, reused etc. at will. 1384use in an event loop. It can be moved around, freed, reused etc. at
1385will - as long as you either keep the memory contents intact, or call
1386C<ev_TYPE_init> again.
1164 1387
1165=item started/running/active 1388=item started/running/active
1166 1389
1167Once a watcher has been started with a call to C<ev_TYPE_start> it becomes 1390Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1168property of the event loop, and is actively waiting for events. While in 1391property of the event loop, and is actively waiting for events. While in
1196latter will clear any pending state the watcher might be in, regardless 1419latter will clear any pending state the watcher might be in, regardless
1197of whether it was active or not, so stopping a watcher explicitly before 1420of whether it was active or not, so stopping a watcher explicitly before
1198freeing it is often a good idea. 1421freeing it is often a good idea.
1199 1422
1200While stopped (and not pending) the watcher is essentially in the 1423While stopped (and not pending) the watcher is essentially in the
1201initialised state, that is it can be reused, moved, modified in any way 1424initialised state, that is, it can be reused, moved, modified in any way
1202you wish. 1425you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
1426it again).
1203 1427
1204=back 1428=back
1205
1206=head2 GENERIC WATCHER FUNCTIONS
1207
1208=over 4
1209
1210=item C<ev_init> (ev_TYPE *watcher, callback)
1211
1212This macro initialises the generic portion of a watcher. The contents
1213of the watcher object can be arbitrary (so C<malloc> will do). Only
1214the generic parts of the watcher are initialised, you I<need> to call
1215the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1216type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1217which rolls both calls into one.
1218
1219You can reinitialise a watcher at any time as long as it has been stopped
1220(or never started) and there are no pending events outstanding.
1221
1222The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1223int revents)>.
1224
1225Example: Initialise an C<ev_io> watcher in two steps.
1226
1227 ev_io w;
1228 ev_init (&w, my_cb);
1229 ev_io_set (&w, STDIN_FILENO, EV_READ);
1230
1231=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1232
1233This macro initialises the type-specific parts of a watcher. You need to
1234call C<ev_init> at least once before you call this macro, but you can
1235call C<ev_TYPE_set> any number of times. You must not, however, call this
1236macro on a watcher that is active (it can be pending, however, which is a
1237difference to the C<ev_init> macro).
1238
1239Although some watcher types do not have type-specific arguments
1240(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1241
1242See C<ev_init>, above, for an example.
1243
1244=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1245
1246This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1247calls into a single call. This is the most convenient method to initialise
1248a watcher. The same limitations apply, of course.
1249
1250Example: Initialise and set an C<ev_io> watcher in one step.
1251
1252 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1253
1254=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1255
1256Starts (activates) the given watcher. Only active watchers will receive
1257events. If the watcher is already active nothing will happen.
1258
1259Example: Start the C<ev_io> watcher that is being abused as example in this
1260whole section.
1261
1262 ev_io_start (EV_DEFAULT_UC, &w);
1263
1264=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1265
1266Stops the given watcher if active, and clears the pending status (whether
1267the watcher was active or not).
1268
1269It is possible that stopped watchers are pending - for example,
1270non-repeating timers are being stopped when they become pending - but
1271calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1272pending. If you want to free or reuse the memory used by the watcher it is
1273therefore a good idea to always call its C<ev_TYPE_stop> function.
1274
1275=item bool ev_is_active (ev_TYPE *watcher)
1276
1277Returns a true value iff the watcher is active (i.e. it has been started
1278and not yet been stopped). As long as a watcher is active you must not modify
1279it.
1280
1281=item bool ev_is_pending (ev_TYPE *watcher)
1282
1283Returns a true value iff the watcher is pending, (i.e. it has outstanding
1284events but its callback has not yet been invoked). As long as a watcher
1285is pending (but not active) you must not call an init function on it (but
1286C<ev_TYPE_set> is safe), you must not change its priority, and you must
1287make sure the watcher is available to libev (e.g. you cannot C<free ()>
1288it).
1289
1290=item callback ev_cb (ev_TYPE *watcher)
1291
1292Returns the callback currently set on the watcher.
1293
1294=item ev_cb_set (ev_TYPE *watcher, callback)
1295
1296Change the callback. You can change the callback at virtually any time
1297(modulo threads).
1298
1299=item ev_set_priority (ev_TYPE *watcher, int priority)
1300
1301=item int ev_priority (ev_TYPE *watcher)
1302
1303Set and query the priority of the watcher. The priority is a small
1304integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1305(default: C<-2>). Pending watchers with higher priority will be invoked
1306before watchers with lower priority, but priority will not keep watchers
1307from being executed (except for C<ev_idle> watchers).
1308
1309If you need to suppress invocation when higher priority events are pending
1310you need to look at C<ev_idle> watchers, which provide this functionality.
1311
1312You I<must not> change the priority of a watcher as long as it is active or
1313pending.
1314
1315Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1316fine, as long as you do not mind that the priority value you query might
1317or might not have been clamped to the valid range.
1318
1319The default priority used by watchers when no priority has been set is
1320always C<0>, which is supposed to not be too high and not be too low :).
1321
1322See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1323priorities.
1324
1325=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1326
1327Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1328C<loop> nor C<revents> need to be valid as long as the watcher callback
1329can deal with that fact, as both are simply passed through to the
1330callback.
1331
1332=item int ev_clear_pending (loop, ev_TYPE *watcher)
1333
1334If the watcher is pending, this function clears its pending status and
1335returns its C<revents> bitset (as if its callback was invoked). If the
1336watcher isn't pending it does nothing and returns C<0>.
1337
1338Sometimes it can be useful to "poll" a watcher instead of waiting for its
1339callback to be invoked, which can be accomplished with this function.
1340
1341=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1342
1343Feeds the given event set into the event loop, as if the specified event
1344had happened for the specified watcher (which must be a pointer to an
1345initialised but not necessarily started event watcher). Obviously you must
1346not free the watcher as long as it has pending events.
1347
1348Stopping the watcher, letting libev invoke it, or calling
1349C<ev_clear_pending> will clear the pending event, even if the watcher was
1350not started in the first place.
1351
1352See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1353functions that do not need a watcher.
1354
1355=back
1356
1357
1358=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1359
1360Each watcher has, by default, a member C<void *data> that you can change
1361and read at any time: libev will completely ignore it. This can be used
1362to associate arbitrary data with your watcher. If you need more data and
1363don't want to allocate memory and store a pointer to it in that data
1364member, you can also "subclass" the watcher type and provide your own
1365data:
1366
1367 struct my_io
1368 {
1369 ev_io io;
1370 int otherfd;
1371 void *somedata;
1372 struct whatever *mostinteresting;
1373 };
1374
1375 ...
1376 struct my_io w;
1377 ev_io_init (&w.io, my_cb, fd, EV_READ);
1378
1379And since your callback will be called with a pointer to the watcher, you
1380can cast it back to your own type:
1381
1382 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1383 {
1384 struct my_io *w = (struct my_io *)w_;
1385 ...
1386 }
1387
1388More interesting and less C-conformant ways of casting your callback type
1389instead have been omitted.
1390
1391Another common scenario is to use some data structure with multiple
1392embedded watchers:
1393
1394 struct my_biggy
1395 {
1396 int some_data;
1397 ev_timer t1;
1398 ev_timer t2;
1399 }
1400
1401In this case getting the pointer to C<my_biggy> is a bit more
1402complicated: Either you store the address of your C<my_biggy> struct
1403in the C<data> member of the watcher (for woozies), or you need to use
1404some pointer arithmetic using C<offsetof> inside your watchers (for real
1405programmers):
1406
1407 #include <stddef.h>
1408
1409 static void
1410 t1_cb (EV_P_ ev_timer *w, int revents)
1411 {
1412 struct my_biggy big = (struct my_biggy *)
1413 (((char *)w) - offsetof (struct my_biggy, t1));
1414 }
1415
1416 static void
1417 t2_cb (EV_P_ ev_timer *w, int revents)
1418 {
1419 struct my_biggy big = (struct my_biggy *)
1420 (((char *)w) - offsetof (struct my_biggy, t2));
1421 }
1422 1429
1423=head2 WATCHER PRIORITY MODELS 1430=head2 WATCHER PRIORITY MODELS
1424 1431
1425Many event loops support I<watcher priorities>, which are usually small 1432Many event loops support I<watcher priorities>, which are usually small
1426integers that influence the ordering of event callback invocation 1433integers that influence the ordering of event callback invocation
1553In general you can register as many read and/or write event watchers per 1560In general you can register as many read and/or write event watchers per
1554fd as you want (as long as you don't confuse yourself). Setting all file 1561fd as you want (as long as you don't confuse yourself). Setting all file
1555descriptors to non-blocking mode is also usually a good idea (but not 1562descriptors to non-blocking mode is also usually a good idea (but not
1556required if you know what you are doing). 1563required if you know what you are doing).
1557 1564
1558If you cannot use non-blocking mode, then force the use of a
1559known-to-be-good backend (at the time of this writing, this includes only
1560C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1561descriptors for which non-blocking operation makes no sense (such as
1562files) - libev doesn't guarantee any specific behaviour in that case.
1563
1564Another thing you have to watch out for is that it is quite easy to 1565Another thing you have to watch out for is that it is quite easy to
1565receive "spurious" readiness notifications, that is your callback might 1566receive "spurious" readiness notifications, that is, your callback might
1566be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1567be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1567because there is no data. Not only are some backends known to create a 1568because there is no data. It is very easy to get into this situation even
1568lot of those (for example Solaris ports), it is very easy to get into 1569with a relatively standard program structure. Thus it is best to always
1569this situation even with a relatively standard program structure. Thus 1570use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1570it is best to always use non-blocking I/O: An extra C<read>(2) returning
1571C<EAGAIN> is far preferable to a program hanging until some data arrives. 1571preferable to a program hanging until some data arrives.
1572 1572
1573If you cannot run the fd in non-blocking mode (for example you should 1573If you cannot run the fd in non-blocking mode (for example you should
1574not play around with an Xlib connection), then you have to separately 1574not play around with an Xlib connection), then you have to separately
1575re-test whether a file descriptor is really ready with a known-to-be good 1575re-test whether a file descriptor is really ready with a known-to-be good
1576interface such as poll (fortunately in our Xlib example, Xlib already 1576interface such as poll (fortunately in the case of Xlib, it already does
1577does this on its own, so its quite safe to use). Some people additionally 1577this on its own, so its quite safe to use). Some people additionally
1578use C<SIGALRM> and an interval timer, just to be sure you won't block 1578use C<SIGALRM> and an interval timer, just to be sure you won't block
1579indefinitely. 1579indefinitely.
1580 1580
1581But really, best use non-blocking mode. 1581But really, best use non-blocking mode.
1582 1582
1610 1610
1611There is no workaround possible except not registering events 1611There is no workaround possible except not registering events
1612for potentially C<dup ()>'ed file descriptors, or to resort to 1612for potentially C<dup ()>'ed file descriptors, or to resort to
1613C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1613C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1614 1614
1615=head3 The special problem of files
1616
1617Many people try to use C<select> (or libev) on file descriptors
1618representing files, and expect it to become ready when their program
1619doesn't block on disk accesses (which can take a long time on their own).
1620
1621However, this cannot ever work in the "expected" way - you get a readiness
1622notification as soon as the kernel knows whether and how much data is
1623there, and in the case of open files, that's always the case, so you
1624always get a readiness notification instantly, and your read (or possibly
1625write) will still block on the disk I/O.
1626
1627Another way to view it is that in the case of sockets, pipes, character
1628devices and so on, there is another party (the sender) that delivers data
1629on its own, but in the case of files, there is no such thing: the disk
1630will not send data on its own, simply because it doesn't know what you
1631wish to read - you would first have to request some data.
1632
1633Since files are typically not-so-well supported by advanced notification
1634mechanism, libev tries hard to emulate POSIX behaviour with respect
1635to files, even though you should not use it. The reason for this is
1636convenience: sometimes you want to watch STDIN or STDOUT, which is
1637usually a tty, often a pipe, but also sometimes files or special devices
1638(for example, C<epoll> on Linux works with F</dev/random> but not with
1639F</dev/urandom>), and even though the file might better be served with
1640asynchronous I/O instead of with non-blocking I/O, it is still useful when
1641it "just works" instead of freezing.
1642
1643So avoid file descriptors pointing to files when you know it (e.g. use
1644libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
1645when you rarely read from a file instead of from a socket, and want to
1646reuse the same code path.
1647
1615=head3 The special problem of fork 1648=head3 The special problem of fork
1616 1649
1617Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1650Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1618useless behaviour. Libev fully supports fork, but needs to be told about 1651useless behaviour. Libev fully supports fork, but needs to be told about
1619it in the child. 1652it in the child if you want to continue to use it in the child.
1620 1653
1621To support fork in your programs, you either have to call 1654To support fork in your child processes, you have to call C<ev_loop_fork
1622C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1655()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1623enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1656C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1624C<EVBACKEND_POLL>.
1625 1657
1626=head3 The special problem of SIGPIPE 1658=head3 The special problem of SIGPIPE
1627 1659
1628While not really specific to libev, it is easy to forget about C<SIGPIPE>: 1660While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1629when writing to a pipe whose other end has been closed, your program gets 1661when writing to a pipe whose other end has been closed, your program gets
2119 2151
2120Another way to think about it (for the mathematically inclined) is that 2152Another way to think about it (for the mathematically inclined) is that
2121C<ev_periodic> will try to run the callback in this mode at the next possible 2153C<ev_periodic> will try to run the callback in this mode at the next possible
2122time where C<time = offset (mod interval)>, regardless of any time jumps. 2154time where C<time = offset (mod interval)>, regardless of any time jumps.
2123 2155
2124For numerical stability it is preferable that the C<offset> value is near 2156The C<interval> I<MUST> be positive, and for numerical stability, the
2125C<ev_now ()> (the current time), but there is no range requirement for 2157interval value should be higher than C<1/8192> (which is around 100
2126this value, and in fact is often specified as zero. 2158microseconds) and C<offset> should be higher than C<0> and should have
2159at most a similar magnitude as the current time (say, within a factor of
2160ten). Typical values for offset are, in fact, C<0> or something between
2161C<0> and C<interval>, which is also the recommended range.
2127 2162
2128Note also that there is an upper limit to how often a timer can fire (CPU 2163Note also that there is an upper limit to how often a timer can fire (CPU
2129speed for example), so if C<interval> is very small then timing stability 2164speed for example), so if C<interval> is very small then timing stability
2130will of course deteriorate. Libev itself tries to be exact to be about one 2165will of course deteriorate. Libev itself tries to be exact to be about one
2131millisecond (if the OS supports it and the machine is fast enough). 2166millisecond (if the OS supports it and the machine is fast enough).
2245 2280
2246=head2 C<ev_signal> - signal me when a signal gets signalled! 2281=head2 C<ev_signal> - signal me when a signal gets signalled!
2247 2282
2248Signal watchers will trigger an event when the process receives a specific 2283Signal watchers will trigger an event when the process receives a specific
2249signal one or more times. Even though signals are very asynchronous, libev 2284signal one or more times. Even though signals are very asynchronous, libev
2250will try it's best to deliver signals synchronously, i.e. as part of the 2285will try its best to deliver signals synchronously, i.e. as part of the
2251normal event processing, like any other event. 2286normal event processing, like any other event.
2252 2287
2253If you want signals to be delivered truly asynchronously, just use 2288If you want signals to be delivered truly asynchronously, just use
2254C<sigaction> as you would do without libev and forget about sharing 2289C<sigaction> as you would do without libev and forget about sharing
2255the signal. You can even use C<ev_async> from a signal handler to 2290the signal. You can even use C<ev_async> from a signal handler to
2274=head3 The special problem of inheritance over fork/execve/pthread_create 2309=head3 The special problem of inheritance over fork/execve/pthread_create
2275 2310
2276Both the signal mask (C<sigprocmask>) and the signal disposition 2311Both the signal mask (C<sigprocmask>) and the signal disposition
2277(C<sigaction>) are unspecified after starting a signal watcher (and after 2312(C<sigaction>) are unspecified after starting a signal watcher (and after
2278stopping it again), that is, libev might or might not block the signal, 2313stopping it again), that is, libev might or might not block the signal,
2279and might or might not set or restore the installed signal handler. 2314and might or might not set or restore the installed signal handler (but
2315see C<EVFLAG_NOSIGMASK>).
2280 2316
2281While this does not matter for the signal disposition (libev never 2317While this does not matter for the signal disposition (libev never
2282sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on 2318sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2283C<execve>), this matters for the signal mask: many programs do not expect 2319C<execve>), this matters for the signal mask: many programs do not expect
2284certain signals to be blocked. 2320certain signals to be blocked.
2297I<has> to modify the signal mask, at least temporarily. 2333I<has> to modify the signal mask, at least temporarily.
2298 2334
2299So I can't stress this enough: I<If you do not reset your signal mask when 2335So I can't stress this enough: I<If you do not reset your signal mask when
2300you expect it to be empty, you have a race condition in your code>. This 2336you expect it to be empty, you have a race condition in your code>. This
2301is not a libev-specific thing, this is true for most event libraries. 2337is not a libev-specific thing, this is true for most event libraries.
2338
2339=head3 The special problem of threads signal handling
2340
2341POSIX threads has problematic signal handling semantics, specifically,
2342a lot of functionality (sigfd, sigwait etc.) only really works if all
2343threads in a process block signals, which is hard to achieve.
2344
2345When you want to use sigwait (or mix libev signal handling with your own
2346for the same signals), you can tackle this problem by globally blocking
2347all signals before creating any threads (or creating them with a fully set
2348sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
2349loops. Then designate one thread as "signal receiver thread" which handles
2350these signals. You can pass on any signals that libev might be interested
2351in by calling C<ev_feed_signal>.
2302 2352
2303=head3 Watcher-Specific Functions and Data Members 2353=head3 Watcher-Specific Functions and Data Members
2304 2354
2305=over 4 2355=over 4
2306 2356
3090 3140
3091=head3 Watcher-Specific Functions and Data Members 3141=head3 Watcher-Specific Functions and Data Members
3092 3142
3093=over 4 3143=over 4
3094 3144
3095=item ev_fork_init (ev_signal *, callback) 3145=item ev_fork_init (ev_fork *, callback)
3096 3146
3097Initialises and configures the fork watcher - it has no parameters of any 3147Initialises and configures the fork watcher - it has no parameters of any
3098kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 3148kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3099believe me. 3149really.
3100 3150
3101=back 3151=back
3102 3152
3103 3153
3154=head2 C<ev_cleanup> - even the best things end
3155
3156Cleanup watchers are called just before the event loop is being destroyed
3157by a call to C<ev_loop_destroy>.
3158
3159While there is no guarantee that the event loop gets destroyed, cleanup
3160watchers provide a convenient method to install cleanup hooks for your
3161program, worker threads and so on - you just to make sure to destroy the
3162loop when you want them to be invoked.
3163
3164Cleanup watchers are invoked in the same way as any other watcher. Unlike
3165all other watchers, they do not keep a reference to the event loop (which
3166makes a lot of sense if you think about it). Like all other watchers, you
3167can call libev functions in the callback, except C<ev_cleanup_start>.
3168
3169=head3 Watcher-Specific Functions and Data Members
3170
3171=over 4
3172
3173=item ev_cleanup_init (ev_cleanup *, callback)
3174
3175Initialises and configures the cleanup watcher - it has no parameters of
3176any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3177pointless, I assure you.
3178
3179=back
3180
3181Example: Register an atexit handler to destroy the default loop, so any
3182cleanup functions are called.
3183
3184 static void
3185 program_exits (void)
3186 {
3187 ev_loop_destroy (EV_DEFAULT_UC);
3188 }
3189
3190 ...
3191 atexit (program_exits);
3192
3193
3104=head2 C<ev_async> - how to wake up an event loop 3194=head2 C<ev_async> - how to wake up an event loop
3105 3195
3106In general, you cannot use an C<ev_run> from multiple threads or other 3196In general, you cannot use an C<ev_loop> from multiple threads or other
3107asynchronous sources such as signal handlers (as opposed to multiple event 3197asynchronous sources such as signal handlers (as opposed to multiple event
3108loops - those are of course safe to use in different threads). 3198loops - those are of course safe to use in different threads).
3109 3199
3110Sometimes, however, you need to wake up an event loop you do not control, 3200Sometimes, however, you need to wake up an event loop you do not control,
3111for example because it belongs to another thread. This is what C<ev_async> 3201for example because it belongs to another thread. This is what C<ev_async>
3113it by calling C<ev_async_send>, which is thread- and signal safe. 3203it by calling C<ev_async_send>, which is thread- and signal safe.
3114 3204
3115This functionality is very similar to C<ev_signal> watchers, as signals, 3205This functionality is very similar to C<ev_signal> watchers, as signals,
3116too, are asynchronous in nature, and signals, too, will be compressed 3206too, are asynchronous in nature, and signals, too, will be compressed
3117(i.e. the number of callback invocations may be less than the number of 3207(i.e. the number of callback invocations may be less than the number of
3118C<ev_async_sent> calls). 3208C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3209of "global async watchers" by using a watcher on an otherwise unused
3210signal, and C<ev_feed_signal> to signal this watcher from another thread,
3211even without knowing which loop owns the signal.
3119 3212
3120Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not 3213Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3121just the default loop. 3214just the default loop.
3122 3215
3123=head3 Queueing 3216=head3 Queueing
3218trust me. 3311trust me.
3219 3312
3220=item ev_async_send (loop, ev_async *) 3313=item ev_async_send (loop, ev_async *)
3221 3314
3222Sends/signals/activates the given C<ev_async> watcher, that is, feeds 3315Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3223an C<EV_ASYNC> event on the watcher into the event loop. Unlike 3316an C<EV_ASYNC> event on the watcher into the event loop, and instantly
3317returns.
3318
3224C<ev_feed_event>, this call is safe to do from other threads, signal or 3319Unlike C<ev_feed_event>, this call is safe to do from other threads,
3225similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding 3320signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3226section below on what exactly this means). 3321embedding section below on what exactly this means).
3227 3322
3228Note that, as with other watchers in libev, multiple events might get 3323Note that, as with other watchers in libev, multiple events might get
3229compressed into a single callback invocation (another way to look at this 3324compressed into a single callback invocation (another way to look at this
3230is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>, 3325is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
3231reset when the event loop detects that). 3326reset when the event loop detects that).
3299Feed an event on the given fd, as if a file descriptor backend detected 3394Feed an event on the given fd, as if a file descriptor backend detected
3300the given events it. 3395the given events it.
3301 3396
3302=item ev_feed_signal_event (loop, int signum) 3397=item ev_feed_signal_event (loop, int signum)
3303 3398
3304Feed an event as if the given signal occurred (C<loop> must be the default 3399Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3305loop!). 3400which is async-safe.
3306 3401
3307=back 3402=back
3403
3404
3405=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3406
3407This section explains some common idioms that are not immediately
3408obvious. Note that examples are sprinkled over the whole manual, and this
3409section only contains stuff that wouldn't fit anywhere else.
3410
3411=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3412
3413Each watcher has, by default, a C<void *data> member that you can read
3414or modify at any time: libev will completely ignore it. This can be used
3415to associate arbitrary data with your watcher. If you need more data and
3416don't want to allocate memory separately and store a pointer to it in that
3417data member, you can also "subclass" the watcher type and provide your own
3418data:
3419
3420 struct my_io
3421 {
3422 ev_io io;
3423 int otherfd;
3424 void *somedata;
3425 struct whatever *mostinteresting;
3426 };
3427
3428 ...
3429 struct my_io w;
3430 ev_io_init (&w.io, my_cb, fd, EV_READ);
3431
3432And since your callback will be called with a pointer to the watcher, you
3433can cast it back to your own type:
3434
3435 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
3436 {
3437 struct my_io *w = (struct my_io *)w_;
3438 ...
3439 }
3440
3441More interesting and less C-conformant ways of casting your callback
3442function type instead have been omitted.
3443
3444=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
3445
3446Another common scenario is to use some data structure with multiple
3447embedded watchers, in effect creating your own watcher that combines
3448multiple libev event sources into one "super-watcher":
3449
3450 struct my_biggy
3451 {
3452 int some_data;
3453 ev_timer t1;
3454 ev_timer t2;
3455 }
3456
3457In this case getting the pointer to C<my_biggy> is a bit more
3458complicated: Either you store the address of your C<my_biggy> struct in
3459the C<data> member of the watcher (for woozies or C++ coders), or you need
3460to use some pointer arithmetic using C<offsetof> inside your watchers (for
3461real programmers):
3462
3463 #include <stddef.h>
3464
3465 static void
3466 t1_cb (EV_P_ ev_timer *w, int revents)
3467 {
3468 struct my_biggy big = (struct my_biggy *)
3469 (((char *)w) - offsetof (struct my_biggy, t1));
3470 }
3471
3472 static void
3473 t2_cb (EV_P_ ev_timer *w, int revents)
3474 {
3475 struct my_biggy big = (struct my_biggy *)
3476 (((char *)w) - offsetof (struct my_biggy, t2));
3477 }
3478
3479=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3480
3481Often (especially in GUI toolkits) there are places where you have
3482I<modal> interaction, which is most easily implemented by recursively
3483invoking C<ev_run>.
3484
3485This brings the problem of exiting - a callback might want to finish the
3486main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3487a modal "Are you sure?" dialog is still waiting), or just the nested one
3488and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3489other combination: In these cases, C<ev_break> will not work alone.
3490
3491The solution is to maintain "break this loop" variable for each C<ev_run>
3492invocation, and use a loop around C<ev_run> until the condition is
3493triggered, using C<EVRUN_ONCE>:
3494
3495 // main loop
3496 int exit_main_loop = 0;
3497
3498 while (!exit_main_loop)
3499 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3500
3501 // in a model watcher
3502 int exit_nested_loop = 0;
3503
3504 while (!exit_nested_loop)
3505 ev_run (EV_A_ EVRUN_ONCE);
3506
3507To exit from any of these loops, just set the corresponding exit variable:
3508
3509 // exit modal loop
3510 exit_nested_loop = 1;
3511
3512 // exit main program, after modal loop is finished
3513 exit_main_loop = 1;
3514
3515 // exit both
3516 exit_main_loop = exit_nested_loop = 1;
3517
3518=head2 THREAD LOCKING EXAMPLE
3519
3520Here is a fictitious example of how to run an event loop in a different
3521thread from where callbacks are being invoked and watchers are
3522created/added/removed.
3523
3524For a real-world example, see the C<EV::Loop::Async> perl module,
3525which uses exactly this technique (which is suited for many high-level
3526languages).
3527
3528The example uses a pthread mutex to protect the loop data, a condition
3529variable to wait for callback invocations, an async watcher to notify the
3530event loop thread and an unspecified mechanism to wake up the main thread.
3531
3532First, you need to associate some data with the event loop:
3533
3534 typedef struct {
3535 mutex_t lock; /* global loop lock */
3536 ev_async async_w;
3537 thread_t tid;
3538 cond_t invoke_cv;
3539 } userdata;
3540
3541 void prepare_loop (EV_P)
3542 {
3543 // for simplicity, we use a static userdata struct.
3544 static userdata u;
3545
3546 ev_async_init (&u->async_w, async_cb);
3547 ev_async_start (EV_A_ &u->async_w);
3548
3549 pthread_mutex_init (&u->lock, 0);
3550 pthread_cond_init (&u->invoke_cv, 0);
3551
3552 // now associate this with the loop
3553 ev_set_userdata (EV_A_ u);
3554 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3555 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3556
3557 // then create the thread running ev_run
3558 pthread_create (&u->tid, 0, l_run, EV_A);
3559 }
3560
3561The callback for the C<ev_async> watcher does nothing: the watcher is used
3562solely to wake up the event loop so it takes notice of any new watchers
3563that might have been added:
3564
3565 static void
3566 async_cb (EV_P_ ev_async *w, int revents)
3567 {
3568 // just used for the side effects
3569 }
3570
3571The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
3572protecting the loop data, respectively.
3573
3574 static void
3575 l_release (EV_P)
3576 {
3577 userdata *u = ev_userdata (EV_A);
3578 pthread_mutex_unlock (&u->lock);
3579 }
3580
3581 static void
3582 l_acquire (EV_P)
3583 {
3584 userdata *u = ev_userdata (EV_A);
3585 pthread_mutex_lock (&u->lock);
3586 }
3587
3588The event loop thread first acquires the mutex, and then jumps straight
3589into C<ev_run>:
3590
3591 void *
3592 l_run (void *thr_arg)
3593 {
3594 struct ev_loop *loop = (struct ev_loop *)thr_arg;
3595
3596 l_acquire (EV_A);
3597 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
3598 ev_run (EV_A_ 0);
3599 l_release (EV_A);
3600
3601 return 0;
3602 }
3603
3604Instead of invoking all pending watchers, the C<l_invoke> callback will
3605signal the main thread via some unspecified mechanism (signals? pipe
3606writes? C<Async::Interrupt>?) and then waits until all pending watchers
3607have been called (in a while loop because a) spurious wakeups are possible
3608and b) skipping inter-thread-communication when there are no pending
3609watchers is very beneficial):
3610
3611 static void
3612 l_invoke (EV_P)
3613 {
3614 userdata *u = ev_userdata (EV_A);
3615
3616 while (ev_pending_count (EV_A))
3617 {
3618 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
3619 pthread_cond_wait (&u->invoke_cv, &u->lock);
3620 }
3621 }
3622
3623Now, whenever the main thread gets told to invoke pending watchers, it
3624will grab the lock, call C<ev_invoke_pending> and then signal the loop
3625thread to continue:
3626
3627 static void
3628 real_invoke_pending (EV_P)
3629 {
3630 userdata *u = ev_userdata (EV_A);
3631
3632 pthread_mutex_lock (&u->lock);
3633 ev_invoke_pending (EV_A);
3634 pthread_cond_signal (&u->invoke_cv);
3635 pthread_mutex_unlock (&u->lock);
3636 }
3637
3638Whenever you want to start/stop a watcher or do other modifications to an
3639event loop, you will now have to lock:
3640
3641 ev_timer timeout_watcher;
3642 userdata *u = ev_userdata (EV_A);
3643
3644 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
3645
3646 pthread_mutex_lock (&u->lock);
3647 ev_timer_start (EV_A_ &timeout_watcher);
3648 ev_async_send (EV_A_ &u->async_w);
3649 pthread_mutex_unlock (&u->lock);
3650
3651Note that sending the C<ev_async> watcher is required because otherwise
3652an event loop currently blocking in the kernel will have no knowledge
3653about the newly added timer. By waking up the loop it will pick up any new
3654watchers in the next event loop iteration.
3655
3656=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
3657
3658While the overhead of a callback that e.g. schedules a thread is small, it
3659is still an overhead. If you embed libev, and your main usage is with some
3660kind of threads or coroutines, you might want to customise libev so that
3661doesn't need callbacks anymore.
3662
3663Imagine you have coroutines that you can switch to using a function
3664C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
3665and that due to some magic, the currently active coroutine is stored in a
3666global called C<current_coro>. Then you can build your own "wait for libev
3667event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
3668the differing C<;> conventions):
3669
3670 #define EV_CB_DECLARE(type) struct my_coro *cb;
3671 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3672
3673That means instead of having a C callback function, you store the
3674coroutine to switch to in each watcher, and instead of having libev call
3675your callback, you instead have it switch to that coroutine.
3676
3677A coroutine might now wait for an event with a function called
3678C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
3679matter when, or whether the watcher is active or not when this function is
3680called):
3681
3682 void
3683 wait_for_event (ev_watcher *w)
3684 {
3685 ev_cb_set (w) = current_coro;
3686 switch_to (libev_coro);
3687 }
3688
3689That basically suspends the coroutine inside C<wait_for_event> and
3690continues the libev coroutine, which, when appropriate, switches back to
3691this or any other coroutine. I am sure if you sue this your own :)
3692
3693You can do similar tricks if you have, say, threads with an event queue -
3694instead of storing a coroutine, you store the queue object and instead of
3695switching to a coroutine, you push the watcher onto the queue and notify
3696any waiters.
3697
3698To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
3699files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3700
3701 // my_ev.h
3702 #define EV_CB_DECLARE(type) struct my_coro *cb;
3703 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3704 #include "../libev/ev.h"
3705
3706 // my_ev.c
3707 #define EV_H "my_ev.h"
3708 #include "../libev/ev.c"
3709
3710And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
3711F<my_ev.c> into your project. When properly specifying include paths, you
3712can even use F<ev.h> as header file name directly.
3308 3713
3309 3714
3310=head1 LIBEVENT EMULATION 3715=head1 LIBEVENT EMULATION
3311 3716
3312Libev offers a compatibility emulation layer for libevent. It cannot 3717Libev offers a compatibility emulation layer for libevent. It cannot
3313emulate the internals of libevent, so here are some usage hints: 3718emulate the internals of libevent, so here are some usage hints:
3314 3719
3315=over 4 3720=over 4
3721
3722=item * Only the libevent-1.4.1-beta API is being emulated.
3723
3724This was the newest libevent version available when libev was implemented,
3725and is still mostly unchanged in 2010.
3316 3726
3317=item * Use it by including <event.h>, as usual. 3727=item * Use it by including <event.h>, as usual.
3318 3728
3319=item * The following members are fully supported: ev_base, ev_callback, 3729=item * The following members are fully supported: ev_base, ev_callback,
3320ev_arg, ev_fd, ev_res, ev_events. 3730ev_arg, ev_fd, ev_res, ev_events.
3326=item * Priorities are not currently supported. Initialising priorities 3736=item * Priorities are not currently supported. Initialising priorities
3327will fail and all watchers will have the same priority, even though there 3737will fail and all watchers will have the same priority, even though there
3328is an ev_pri field. 3738is an ev_pri field.
3329 3739
3330=item * In libevent, the last base created gets the signals, in libev, the 3740=item * In libevent, the last base created gets the signals, in libev, the
3331first base created (== the default loop) gets the signals. 3741base that registered the signal gets the signals.
3332 3742
3333=item * Other members are not supported. 3743=item * Other members are not supported.
3334 3744
3335=item * The libev emulation is I<not> ABI compatible to libevent, you need 3745=item * The libev emulation is I<not> ABI compatible to libevent, you need
3336to use the libev header file and library. 3746to use the libev header file and library.
3355Care has been taken to keep the overhead low. The only data member the C++ 3765Care has been taken to keep the overhead low. The only data member the C++
3356classes add (compared to plain C-style watchers) is the event loop pointer 3766classes add (compared to plain C-style watchers) is the event loop pointer
3357that the watcher is associated with (or no additional members at all if 3767that the watcher is associated with (or no additional members at all if
3358you disable C<EV_MULTIPLICITY> when embedding libev). 3768you disable C<EV_MULTIPLICITY> when embedding libev).
3359 3769
3360Currently, functions, and static and non-static member functions can be 3770Currently, functions, static and non-static member functions and classes
3361used as callbacks. Other types should be easy to add as long as they only 3771with C<operator ()> can be used as callbacks. Other types should be easy
3362need one additional pointer for context. If you need support for other 3772to add as long as they only need one additional pointer for context. If
3363types of functors please contact the author (preferably after implementing 3773you need support for other types of functors please contact the author
3364it). 3774(preferably after implementing it).
3365 3775
3366Here is a list of things available in the C<ev> namespace: 3776Here is a list of things available in the C<ev> namespace:
3367 3777
3368=over 4 3778=over 4
3369 3779
3797F<event.h> that are not directly supported by the libev core alone. 4207F<event.h> that are not directly supported by the libev core alone.
3798 4208
3799In standalone mode, libev will still try to automatically deduce the 4209In standalone mode, libev will still try to automatically deduce the
3800configuration, but has to be more conservative. 4210configuration, but has to be more conservative.
3801 4211
4212=item EV_USE_FLOOR
4213
4214If defined to be C<1>, libev will use the C<floor ()> function for its
4215periodic reschedule calculations, otherwise libev will fall back on a
4216portable (slower) implementation. If you enable this, you usually have to
4217link against libm or something equivalent. Enabling this when the C<floor>
4218function is not available will fail, so the safe default is to not enable
4219this.
4220
3802=item EV_USE_MONOTONIC 4221=item EV_USE_MONOTONIC
3803 4222
3804If defined to be C<1>, libev will try to detect the availability of the 4223If defined to be C<1>, libev will try to detect the availability of the
3805monotonic clock option at both compile time and runtime. Otherwise no 4224monotonic clock option at both compile time and runtime. Otherwise no
3806use of the monotonic clock option will be attempted. If you enable this, 4225use of the monotonic clock option will be attempted. If you enable this,
4237And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4656And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4238 4657
4239 #include "ev_cpp.h" 4658 #include "ev_cpp.h"
4240 #include "ev.c" 4659 #include "ev.c"
4241 4660
4242=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4661=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4243 4662
4244=head2 THREADS AND COROUTINES 4663=head2 THREADS AND COROUTINES
4245 4664
4246=head3 THREADS 4665=head3 THREADS
4247 4666
4298default loop and triggering an C<ev_async> watcher from the default loop 4717default loop and triggering an C<ev_async> watcher from the default loop
4299watcher callback into the event loop interested in the signal. 4718watcher callback into the event loop interested in the signal.
4300 4719
4301=back 4720=back
4302 4721
4303=head4 THREAD LOCKING EXAMPLE 4722See also L<THREAD LOCKING EXAMPLE>.
4304
4305Here is a fictitious example of how to run an event loop in a different
4306thread than where callbacks are being invoked and watchers are
4307created/added/removed.
4308
4309For a real-world example, see the C<EV::Loop::Async> perl module,
4310which uses exactly this technique (which is suited for many high-level
4311languages).
4312
4313The example uses a pthread mutex to protect the loop data, a condition
4314variable to wait for callback invocations, an async watcher to notify the
4315event loop thread and an unspecified mechanism to wake up the main thread.
4316
4317First, you need to associate some data with the event loop:
4318
4319 typedef struct {
4320 mutex_t lock; /* global loop lock */
4321 ev_async async_w;
4322 thread_t tid;
4323 cond_t invoke_cv;
4324 } userdata;
4325
4326 void prepare_loop (EV_P)
4327 {
4328 // for simplicity, we use a static userdata struct.
4329 static userdata u;
4330
4331 ev_async_init (&u->async_w, async_cb);
4332 ev_async_start (EV_A_ &u->async_w);
4333
4334 pthread_mutex_init (&u->lock, 0);
4335 pthread_cond_init (&u->invoke_cv, 0);
4336
4337 // now associate this with the loop
4338 ev_set_userdata (EV_A_ u);
4339 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4340 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4341
4342 // then create the thread running ev_loop
4343 pthread_create (&u->tid, 0, l_run, EV_A);
4344 }
4345
4346The callback for the C<ev_async> watcher does nothing: the watcher is used
4347solely to wake up the event loop so it takes notice of any new watchers
4348that might have been added:
4349
4350 static void
4351 async_cb (EV_P_ ev_async *w, int revents)
4352 {
4353 // just used for the side effects
4354 }
4355
4356The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4357protecting the loop data, respectively.
4358
4359 static void
4360 l_release (EV_P)
4361 {
4362 userdata *u = ev_userdata (EV_A);
4363 pthread_mutex_unlock (&u->lock);
4364 }
4365
4366 static void
4367 l_acquire (EV_P)
4368 {
4369 userdata *u = ev_userdata (EV_A);
4370 pthread_mutex_lock (&u->lock);
4371 }
4372
4373The event loop thread first acquires the mutex, and then jumps straight
4374into C<ev_run>:
4375
4376 void *
4377 l_run (void *thr_arg)
4378 {
4379 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4380
4381 l_acquire (EV_A);
4382 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4383 ev_run (EV_A_ 0);
4384 l_release (EV_A);
4385
4386 return 0;
4387 }
4388
4389Instead of invoking all pending watchers, the C<l_invoke> callback will
4390signal the main thread via some unspecified mechanism (signals? pipe
4391writes? C<Async::Interrupt>?) and then waits until all pending watchers
4392have been called (in a while loop because a) spurious wakeups are possible
4393and b) skipping inter-thread-communication when there are no pending
4394watchers is very beneficial):
4395
4396 static void
4397 l_invoke (EV_P)
4398 {
4399 userdata *u = ev_userdata (EV_A);
4400
4401 while (ev_pending_count (EV_A))
4402 {
4403 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4404 pthread_cond_wait (&u->invoke_cv, &u->lock);
4405 }
4406 }
4407
4408Now, whenever the main thread gets told to invoke pending watchers, it
4409will grab the lock, call C<ev_invoke_pending> and then signal the loop
4410thread to continue:
4411
4412 static void
4413 real_invoke_pending (EV_P)
4414 {
4415 userdata *u = ev_userdata (EV_A);
4416
4417 pthread_mutex_lock (&u->lock);
4418 ev_invoke_pending (EV_A);
4419 pthread_cond_signal (&u->invoke_cv);
4420 pthread_mutex_unlock (&u->lock);
4421 }
4422
4423Whenever you want to start/stop a watcher or do other modifications to an
4424event loop, you will now have to lock:
4425
4426 ev_timer timeout_watcher;
4427 userdata *u = ev_userdata (EV_A);
4428
4429 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4430
4431 pthread_mutex_lock (&u->lock);
4432 ev_timer_start (EV_A_ &timeout_watcher);
4433 ev_async_send (EV_A_ &u->async_w);
4434 pthread_mutex_unlock (&u->lock);
4435
4436Note that sending the C<ev_async> watcher is required because otherwise
4437an event loop currently blocking in the kernel will have no knowledge
4438about the newly added timer. By waking up the loop it will pick up any new
4439watchers in the next event loop iteration.
4440 4723
4441=head3 COROUTINES 4724=head3 COROUTINES
4442 4725
4443Libev is very accommodating to coroutines ("cooperative threads"): 4726Libev is very accommodating to coroutines ("cooperative threads"):
4444libev fully supports nesting calls to its functions from different 4727libev fully supports nesting calls to its functions from different
4713structure (guaranteed by POSIX but not by ISO C for example), but it also 4996structure (guaranteed by POSIX but not by ISO C for example), but it also
4714assumes that the same (machine) code can be used to call any watcher 4997assumes that the same (machine) code can be used to call any watcher
4715callback: The watcher callbacks have different type signatures, but libev 4998callback: The watcher callbacks have different type signatures, but libev
4716calls them using an C<ev_watcher *> internally. 4999calls them using an C<ev_watcher *> internally.
4717 5000
5001=item pointer accesses must be thread-atomic
5002
5003Accessing a pointer value must be atomic, it must both be readable and
5004writable in one piece - this is the case on all current architectures.
5005
4718=item C<sig_atomic_t volatile> must be thread-atomic as well 5006=item C<sig_atomic_t volatile> must be thread-atomic as well
4719 5007
4720The type C<sig_atomic_t volatile> (or whatever is defined as 5008The type C<sig_atomic_t volatile> (or whatever is defined as
4721C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 5009C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4722threads. This is not part of the specification for C<sig_atomic_t>, but is 5010threads. This is not part of the specification for C<sig_atomic_t>, but is
4828=back 5116=back
4829 5117
4830 5118
4831=head1 PORTING FROM LIBEV 3.X TO 4.X 5119=head1 PORTING FROM LIBEV 3.X TO 4.X
4832 5120
4833The major version 4 introduced some minor incompatible changes to the API. 5121The major version 4 introduced some incompatible changes to the API.
4834 5122
4835At the moment, the C<ev.h> header file tries to implement superficial 5123At the moment, the C<ev.h> header file provides compatibility definitions
4836compatibility, so most programs should still compile. Those might be 5124for all changes, so most programs should still compile. The compatibility
4837removed in later versions of libev, so better update early than late. 5125layer might be removed in later versions of libev, so better update to the
5126new API early than late.
4838 5127
4839=over 4 5128=over 4
4840 5129
5130=item C<EV_COMPAT3> backwards compatibility mechanism
5131
5132The backward compatibility mechanism can be controlled by
5133C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
5134section.
5135
4841=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5136=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4842 5137
4843These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5138These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4844 5139
4845 ev_loop_destroy (EV_DEFAULT); 5140 ev_loop_destroy (EV_DEFAULT_UC);
4846 ev_loop_fork (EV_DEFAULT); 5141 ev_loop_fork (EV_DEFAULT);
4847 5142
4848=item function/symbol renames 5143=item function/symbol renames
4849 5144
4850A number of functions and symbols have been renamed: 5145A number of functions and symbols have been renamed:
4870ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 5165ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4871as all other watcher types. Note that C<ev_loop_fork> is still called 5166as all other watcher types. Note that C<ev_loop_fork> is still called
4872C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> 5167C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4873typedef. 5168typedef.
4874 5169
4875=item C<EV_COMPAT3> backwards compatibility mechanism
4876
4877The backward compatibility mechanism can be controlled by
4878C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4879section.
4880
4881=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 5170=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4882 5171
4883The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 5172The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4884mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 5173mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4885and work, but the library code will of course be larger. 5174and work, but the library code will of course be larger.
4947The physical time that is observed. It is apparently strictly monotonic :) 5236The physical time that is observed. It is apparently strictly monotonic :)
4948 5237
4949=item wall-clock time 5238=item wall-clock time
4950 5239
4951The time and date as shown on clocks. Unlike real time, it can actually 5240The time and date as shown on clocks. Unlike real time, it can actually
4952be wrong and jump forwards and backwards, e.g. when the you adjust your 5241be wrong and jump forwards and backwards, e.g. when you adjust your
4953clock. 5242clock.
4954 5243
4955=item watcher 5244=item watcher
4956 5245
4957A data structure that describes interest in certain events. Watchers need 5246A data structure that describes interest in certain events. Watchers need
4959 5248
4960=back 5249=back
4961 5250
4962=head1 AUTHOR 5251=head1 AUTHOR
4963 5252
4964Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5253Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5254Magnusson and Emanuele Giaquinta, and minor corrections by many others.
4965 5255

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines