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.356 by root, Tue Jan 11 01:42:47 2011 UTC

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
447This flag's behaviour will become the default in future versions of libev.
415 448
416=item C<EVBACKEND_SELECT> (value 1, portable select backend) 449=item C<EVBACKEND_SELECT> (value 1, portable select backend)
417 450
418This is your standard select(2) backend. Not I<completely> standard, as 451This 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, 452libev tries to roll its own fd_set with no limits on the number of fds,
455epoll scales either O(1) or O(active_fds). 488epoll scales either O(1) or O(active_fds).
456 489
457The epoll mechanism deserves honorable mention as the most misdesigned 490The epoll mechanism deserves honorable mention as the most misdesigned
458of the more advanced event mechanisms: mere annoyances include silently 491of the more advanced event mechanisms: mere annoyances include silently
459dropping file descriptors, requiring a system call per change per file 492dropping file descriptors, requiring a system call per change per file
460descriptor (and unnecessary guessing of parameters), problems with dup and 493descriptor (and unnecessary guessing of parameters), problems with dup,
494returning before the timeout value, resulting in additional iterations
495(and only giving 5ms accuracy while select on the same platform gives
461so on. The biggest issue is fork races, however - if a program forks then 4960.1ms) and so on. The biggest issue is fork races, however - if a program
462I<both> parent and child process have to recreate the epoll set, which can 497forks then I<both> parent and child process have to recreate the epoll
463take considerable time (one syscall per file descriptor) and is of course 498set, which can take considerable time (one syscall per file descriptor)
464hard to detect. 499and is of course hard to detect.
465 500
466Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 501Epoll 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 502of course I<doesn't>, and epoll just loves to report events for totally
468I<different> file descriptors (even already closed ones, so one cannot 503I<different> file descriptors (even already closed ones, so one cannot
469even remove them from the set) than registered in the set (especially 504even remove them from the set) than registered in the set (especially
471employing an additional generation counter and comparing that against the 506employing an additional generation counter and comparing that against the
472events to filter out spurious ones, recreating the set when required. Last 507events to filter out spurious ones, recreating the set when required. Last
473not least, it also refuses to work with some file descriptors which work 508not least, it also refuses to work with some file descriptors which work
474perfectly fine with C<select> (files, many character devices...). 509perfectly fine with C<select> (files, many character devices...).
475 510
511Epoll is truly the train wreck analog among event poll mechanisms,
512a frankenpoll, cobbled together in a hurry, no thought to design or
513interaction with others.
514
476While stopping, setting and starting an I/O watcher in the same iteration 515While stopping, setting and starting an I/O watcher in the same iteration
477will result in some caching, there is still a system call per such 516will result in some caching, there is still a system call per such
478incident (because the same I<file descriptor> could point to a different 517incident (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 518I<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 519file descriptors might not work very well if you register events for both
545=item C<EVBACKEND_PORT> (value 32, Solaris 10) 584=item C<EVBACKEND_PORT> (value 32, Solaris 10)
546 585
547This uses the Solaris 10 event port mechanism. As with everything on Solaris, 586This uses the Solaris 10 event port mechanism. As with everything on Solaris,
548it's really slow, but it still scales very well (O(active_fds)). 587it's really slow, but it still scales very well (O(active_fds)).
549 588
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 589While this backend scales well, it requires one system call per active
555file descriptor per loop iteration. For small and medium numbers of file 590file descriptor per loop iteration. For small and medium numbers of file
556descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 591descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
557might perform better. 592might perform better.
558 593
559On the positive side, with the exception of the spurious readiness 594On 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 595specification in all tests and is fully embeddable, which is a rare feat
562OS-specific backends (I vastly prefer correctness over speed hacks). 596among the OS-specific backends (I vastly prefer correctness over speed
597hacks).
598
599On the negative side, the interface is I<bizarre> - so bizarre that
600even sun itself gets it wrong in their code examples: The event polling
601function sometimes returning events to the caller even though an error
602occurred, but with no indication whether it has done so or not (yes, it's
603even documented that way) - deadly for edge-triggered interfaces where
604you absolutely have to know whether an event occurred or not because you
605have to re-arm the watcher.
606
607Fortunately libev seems to be able to work around these idiocies.
563 608
564This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 609This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
565C<EVBACKEND_POLL>. 610C<EVBACKEND_POLL>.
566 611
567=item C<EVBACKEND_ALL> 612=item C<EVBACKEND_ALL>
568 613
569Try all backends (even potentially broken ones that wouldn't be tried 614Try 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 615with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
571C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 616C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
572 617
573It is definitely not recommended to use this flag. 618It is definitely not recommended to use this flag, use whatever
619C<ev_recommended_backends ()> returns, or simply do not specify a backend
620at all.
621
622=item C<EVBACKEND_MASK>
623
624Not a backend at all, but a mask to select all backend bits from a
625C<flags> value, in case you want to mask out any backends from a flags
626value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
574 627
575=back 628=back
576 629
577If one or more of the backend flags are or'ed into the flags value, 630If one or more of the backend flags are or'ed into the flags value,
578then only these backends will be tried (in the reverse order as listed 631then only these backends will be tried (in the reverse order as listed
607This function is normally used on loop objects allocated by 660This 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 661C<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. 662C<ev_default_loop>, in which case it is not thread-safe.
610 663
611Note that it is not advisable to call this function on the default loop 664Note 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. 665except 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> 666If you need dynamically allocated loops it is better to use C<ev_loop_new>
614and C<ev_loop_destroy>. 667and C<ev_loop_destroy>.
615 668
616=item ev_loop_fork (loop) 669=item ev_loop_fork (loop)
617 670
665prepare and check phases. 718prepare and check phases.
666 719
667=item unsigned int ev_depth (loop) 720=item unsigned int ev_depth (loop)
668 721
669Returns the number of times C<ev_run> was entered minus the number of 722Returns 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. 723times C<ev_run> was exited normally, in other words, the recursion depth.
671 724
672Outside C<ev_run>, this number is zero. In a callback, this number is 725Outside 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), 726C<1>, unless C<ev_run> was invoked recursively (or from another thread),
674in which case it is higher. 727in which case it is higher.
675 728
676Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 729Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
677etc.), doesn't count as "exit" - consider this as a hint to avoid such 730throwing an exception etc.), doesn't count as "exit" - consider this
678ungentleman-like behaviour unless it's really convenient. 731as a hint to avoid such ungentleman-like behaviour unless it's really
732convenient, in which case it is fully supported.
679 733
680=item unsigned int ev_backend (loop) 734=item unsigned int ev_backend (loop)
681 735
682Returns one of the C<EVBACKEND_*> flags indicating the event backend in 736Returns one of the C<EVBACKEND_*> flags indicating the event backend in
683use. 737use.
744relying on all watchers to be stopped when deciding when a program has 798relying on all watchers to be stopped when deciding when a program has
745finished (especially in interactive programs), but having a program 799finished (especially in interactive programs), but having a program
746that automatically loops as long as it has to and no longer by virtue 800that automatically loops as long as it has to and no longer by virtue
747of relying on its watchers stopping correctly, that is truly a thing of 801of relying on its watchers stopping correctly, that is truly a thing of
748beauty. 802beauty.
803
804This function is also I<mostly> exception-safe - you can break out of
805a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
806exception and so on. This does not decrement the C<ev_depth> value, nor
807will it clear any outstanding C<EVBREAK_ONE> breaks.
749 808
750A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 809A 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 810those 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 811block 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 812iteration of the loop. This is sometimes useful to poll and handle new
815Can be used to make a call to C<ev_run> return early (but only after it 874Can 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 875has 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 876C<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. 877C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
819 878
820This "unloop state" will be cleared when entering C<ev_run> again. 879This "break state" will be cleared on the next call to C<ev_run>.
821 880
822It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## 881It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
882which case it will have no effect.
823 883
824=item ev_ref (loop) 884=item ev_ref (loop)
825 885
826=item ev_unref (loop) 886=item ev_unref (loop)
827 887
848running when nothing else is active. 908running when nothing else is active.
849 909
850 ev_signal exitsig; 910 ev_signal exitsig;
851 ev_signal_init (&exitsig, sig_cb, SIGINT); 911 ev_signal_init (&exitsig, sig_cb, SIGINT);
852 ev_signal_start (loop, &exitsig); 912 ev_signal_start (loop, &exitsig);
853 evf_unref (loop); 913 ev_unref (loop);
854 914
855Example: For some weird reason, unregister the above signal handler again. 915Example: For some weird reason, unregister the above signal handler again.
856 916
857 ev_ref (loop); 917 ev_ref (loop);
858 ev_signal_stop (loop, &exitsig); 918 ev_signal_stop (loop, &exitsig);
970See also the locking example in the C<THREADS> section later in this 1030See also the locking example in the C<THREADS> section later in this
971document. 1031document.
972 1032
973=item ev_set_userdata (loop, void *data) 1033=item ev_set_userdata (loop, void *data)
974 1034
975=item ev_userdata (loop) 1035=item void *ev_userdata (loop)
976 1036
977Set and retrieve a single C<void *> associated with a loop. When 1037Set and retrieve a single C<void *> associated with a loop. When
978C<ev_set_userdata> has never been called, then C<ev_userdata> returns 1038C<ev_set_userdata> has never been called, then C<ev_userdata> returns
979C<0.> 1039C<0>.
980 1040
981These two functions can be used to associate arbitrary data with a loop, 1041These two functions can be used to associate arbitrary data with a loop,
982and are intended solely for the C<invoke_pending_cb>, C<release> and 1042and are intended solely for the C<invoke_pending_cb>, C<release> and
983C<acquire> callbacks described above, but of course can be (ab-)used for 1043C<acquire> callbacks described above, but of course can be (ab-)used for
984any other purpose as well. 1044any other purpose as well.
1114The event loop has been resumed in the child process after fork (see 1174The event loop has been resumed in the child process after fork (see
1115C<ev_fork>). 1175C<ev_fork>).
1116 1176
1117=item C<EV_CLEANUP> 1177=item C<EV_CLEANUP>
1118 1178
1119The event loop is abotu to be destroyed (see C<ev_cleanup>). 1179The event loop is about to be destroyed (see C<ev_cleanup>).
1120 1180
1121=item C<EV_ASYNC> 1181=item C<EV_ASYNC>
1122 1182
1123The given async watcher has been asynchronously notified (see C<ev_async>). 1183The given async watcher has been asynchronously notified (see C<ev_async>).
1124 1184
1146programs, though, as the fd could already be closed and reused for another 1206programs, though, as the fd could already be closed and reused for another
1147thing, so beware. 1207thing, so beware.
1148 1208
1149=back 1209=back
1150 1210
1151=head2 WATCHER STATES
1152
1153There are various watcher states mentioned throughout this manual -
1154active, 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
1156rules might look complicated, they usually do "the right thing".
1157
1158=over 4
1159
1160=item initialiased
1161
1162Before 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
1164C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1165
1166In this state it is simply some block of memory that is suitable for use
1167in an event loop. It can be moved around, freed, reused etc. at will.
1168
1169=item started/running/active
1170
1171Once 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
1173this state it cannot be accessed (except in a few documented ways), moved,
1174freed or anything else - the only legal thing is to keep a pointer to it,
1175and call libev functions on it that are documented to work on active watchers.
1176
1177=item pending
1178
1179If a watcher is active and libev determines that an event it is interested
1180in has occurred (such as a timer expiring), it will become pending. It will
1181stay in this pending state until either it is stopped or its callback is
1182about to be invoked, so it is not normally pending inside the watcher
1183callback.
1184
1185The watcher might or might not be active while it is pending (for example,
1186an expired non-repeating timer can be pending but no longer active). If it
1187is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1188but it is still property of the event loop at this time, so cannot be
1189moved, freed or reused. And if it is active the rules described in the
1190previous item still apply.
1191
1192It is also possible to feed an event on a watcher that is not active (e.g.
1193via C<ev_feed_event>), in which case it becomes pending without being
1194active.
1195
1196=item stopped
1197
1198A watcher can be stopped implicitly by libev (in which case it might still
1199be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1200latter will clear any pending state the watcher might be in, regardless
1201of whether it was active or not, so stopping a watcher explicitly before
1202freeing it is often a good idea.
1203
1204While stopped (and not pending) the watcher is essentially in the
1205initialised state, that is it can be reused, moved, modified in any way
1206you wish.
1207
1208=back
1209
1210=head2 GENERIC WATCHER FUNCTIONS 1211=head2 GENERIC WATCHER FUNCTIONS
1211 1212
1212=over 4 1213=over 4
1213 1214
1214=item C<ev_init> (ev_TYPE *watcher, callback) 1215=item C<ev_init> (ev_TYPE *watcher, callback)
1355 1356
1356See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1357See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1357functions that do not need a watcher. 1358functions that do not need a watcher.
1358 1359
1359=back 1360=back
1360
1361 1361
1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1363 1363
1364Each watcher has, by default, a member C<void *data> that you can change 1364Each watcher has, by default, a member C<void *data> that you can change
1365and read at any time: libev will completely ignore it. This can be used 1365and read at any time: libev will completely ignore it. This can be used
1421 t2_cb (EV_P_ ev_timer *w, int revents) 1421 t2_cb (EV_P_ ev_timer *w, int revents)
1422 { 1422 {
1423 struct my_biggy big = (struct my_biggy *) 1423 struct my_biggy big = (struct my_biggy *)
1424 (((char *)w) - offsetof (struct my_biggy, t2)); 1424 (((char *)w) - offsetof (struct my_biggy, t2));
1425 } 1425 }
1426
1427=head2 WATCHER STATES
1428
1429There are various watcher states mentioned throughout this manual -
1430active, pending and so on. In this section these states and the rules to
1431transition between them will be described in more detail - and while these
1432rules might look complicated, they usually do "the right thing".
1433
1434=over 4
1435
1436=item initialiased
1437
1438Before a watcher can be registered with the event looop it has to be
1439initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1440C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1441
1442In this state it is simply some block of memory that is suitable for use
1443in an event loop. It can be moved around, freed, reused etc. at will.
1444
1445=item started/running/active
1446
1447Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1448property of the event loop, and is actively waiting for events. While in
1449this state it cannot be accessed (except in a few documented ways), moved,
1450freed or anything else - the only legal thing is to keep a pointer to it,
1451and call libev functions on it that are documented to work on active watchers.
1452
1453=item pending
1454
1455If a watcher is active and libev determines that an event it is interested
1456in has occurred (such as a timer expiring), it will become pending. It will
1457stay in this pending state until either it is stopped or its callback is
1458about to be invoked, so it is not normally pending inside the watcher
1459callback.
1460
1461The watcher might or might not be active while it is pending (for example,
1462an expired non-repeating timer can be pending but no longer active). If it
1463is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1464but it is still property of the event loop at this time, so cannot be
1465moved, freed or reused. And if it is active the rules described in the
1466previous item still apply.
1467
1468It is also possible to feed an event on a watcher that is not active (e.g.
1469via C<ev_feed_event>), in which case it becomes pending without being
1470active.
1471
1472=item stopped
1473
1474A watcher can be stopped implicitly by libev (in which case it might still
1475be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1476latter will clear any pending state the watcher might be in, regardless
1477of whether it was active or not, so stopping a watcher explicitly before
1478freeing it is often a good idea.
1479
1480While stopped (and not pending) the watcher is essentially in the
1481initialised state, that is it can be reused, moved, modified in any way
1482you wish.
1483
1484=back
1426 1485
1427=head2 WATCHER PRIORITY MODELS 1486=head2 WATCHER PRIORITY MODELS
1428 1487
1429Many event loops support I<watcher priorities>, which are usually small 1488Many event loops support I<watcher priorities>, which are usually small
1430integers that influence the ordering of event callback invocation 1489integers that influence the ordering of event callback invocation
1557In general you can register as many read and/or write event watchers per 1616In general you can register as many read and/or write event watchers per
1558fd as you want (as long as you don't confuse yourself). Setting all file 1617fd as you want (as long as you don't confuse yourself). Setting all file
1559descriptors to non-blocking mode is also usually a good idea (but not 1618descriptors to non-blocking mode is also usually a good idea (but not
1560required if you know what you are doing). 1619required if you know what you are doing).
1561 1620
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 1621Another thing you have to watch out for is that it is quite easy to
1569receive "spurious" readiness notifications, that is your callback might 1622receive "spurious" readiness notifications, that is, your callback might
1570be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1623be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1571because there is no data. Not only are some backends known to create a 1624because there is no data. It is very easy to get into this situation even
1572lot of those (for example Solaris ports), it is very easy to get into 1625with a relatively standard program structure. Thus it is best to always
1573this situation even with a relatively standard program structure. Thus 1626use 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. 1627preferable to a program hanging until some data arrives.
1576 1628
1577If you cannot run the fd in non-blocking mode (for example you should 1629If you cannot run the fd in non-blocking mode (for example you should
1578not play around with an Xlib connection), then you have to separately 1630not 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 1631re-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 1632interface 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 1633this 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 1634use C<SIGALRM> and an interval timer, just to be sure you won't block
1583indefinitely. 1635indefinitely.
1584 1636
1585But really, best use non-blocking mode. 1637But really, best use non-blocking mode.
1586 1638
1614 1666
1615There is no workaround possible except not registering events 1667There is no workaround possible except not registering events
1616for potentially C<dup ()>'ed file descriptors, or to resort to 1668for potentially C<dup ()>'ed file descriptors, or to resort to
1617C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1669C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1618 1670
1671=head3 The special problem of files
1672
1673Many people try to use C<select> (or libev) on file descriptors
1674representing files, and expect it to become ready when their program
1675doesn't block on disk accesses (which can take a long time on their own).
1676
1677However, this cannot ever work in the "expected" way - you get a readiness
1678notification as soon as the kernel knows whether and how much data is
1679there, and in the case of open files, that's always the case, so you
1680always get a readiness notification instantly, and your read (or possibly
1681write) will still block on the disk I/O.
1682
1683Another way to view it is that in the case of sockets, pipes, character
1684devices and so on, there is another party (the sender) that delivers data
1685on it's own, but in the case of files, there is no such thing: the disk
1686will not send data on it's own, simply because it doesn't know what you
1687wish to read - you would first have to request some data.
1688
1689Since files are typically not-so-well supported by advanced notification
1690mechanism, libev tries hard to emulate POSIX behaviour with respect
1691to files, even though you should not use it. The reason for this is
1692convenience: sometimes you want to watch STDIN or STDOUT, which is
1693usually a tty, often a pipe, but also sometimes files or special devices
1694(for example, C<epoll> on Linux works with F</dev/random> but not with
1695F</dev/urandom>), and even though the file might better be served with
1696asynchronous I/O instead of with non-blocking I/O, it is still useful when
1697it "just works" instead of freezing.
1698
1699So avoid file descriptors pointing to files when you know it (e.g. use
1700libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
1701when you rarely read from a file instead of from a socket, and want to
1702reuse the same code path.
1703
1619=head3 The special problem of fork 1704=head3 The special problem of fork
1620 1705
1621Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1706Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1622useless behaviour. Libev fully supports fork, but needs to be told about 1707useless behaviour. Libev fully supports fork, but needs to be told about
1623it in the child. 1708it in the child if you want to continue to use it in the child.
1624 1709
1625To support fork in your programs, you either have to call 1710To support fork in your child processes, you have to call C<ev_loop_fork
1626C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1711()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1627enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1712C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1628C<EVBACKEND_POLL>.
1629 1713
1630=head3 The special problem of SIGPIPE 1714=head3 The special problem of SIGPIPE
1631 1715
1632While not really specific to libev, it is easy to forget about C<SIGPIPE>: 1716While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1633when writing to a pipe whose other end has been closed, your program gets 1717when writing to a pipe whose other end has been closed, your program gets
2249 2333
2250=head2 C<ev_signal> - signal me when a signal gets signalled! 2334=head2 C<ev_signal> - signal me when a signal gets signalled!
2251 2335
2252Signal watchers will trigger an event when the process receives a specific 2336Signal watchers will trigger an event when the process receives a specific
2253signal one or more times. Even though signals are very asynchronous, libev 2337signal 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 2338will try its best to deliver signals synchronously, i.e. as part of the
2255normal event processing, like any other event. 2339normal event processing, like any other event.
2256 2340
2257If you want signals to be delivered truly asynchronously, just use 2341If you want signals to be delivered truly asynchronously, just use
2258C<sigaction> as you would do without libev and forget about sharing 2342C<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 2343the signal. You can even use C<ev_async> from a signal handler to
2301I<has> to modify the signal mask, at least temporarily. 2385I<has> to modify the signal mask, at least temporarily.
2302 2386
2303So I can't stress this enough: I<If you do not reset your signal mask when 2387So I can't stress this enough: I<If you do not reset your signal mask when
2304you expect it to be empty, you have a race condition in your code>. This 2388you expect it to be empty, you have a race condition in your code>. This
2305is not a libev-specific thing, this is true for most event libraries. 2389is not a libev-specific thing, this is true for most event libraries.
2390
2391=head3 The special problem of threads signal handling
2392
2393POSIX threads has problematic signal handling semantics, specifically,
2394a lot of functionality (sigfd, sigwait etc.) only really works if all
2395threads in a process block signals, which is hard to achieve.
2396
2397When you want to use sigwait (or mix libev signal handling with your own
2398for the same signals), you can tackle this problem by globally blocking
2399all signals before creating any threads (or creating them with a fully set
2400sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
2401loops. Then designate one thread as "signal receiver thread" which handles
2402these signals. You can pass on any signals that libev might be interested
2403in by calling C<ev_feed_signal>.
2306 2404
2307=head3 Watcher-Specific Functions and Data Members 2405=head3 Watcher-Specific Functions and Data Members
2308 2406
2309=over 4 2407=over 4
2310 2408
3098 3196
3099=item ev_fork_init (ev_fork *, callback) 3197=item ev_fork_init (ev_fork *, callback)
3100 3198
3101Initialises and configures the fork watcher - it has no parameters of any 3199Initialises 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, 3200kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3103believe me. 3201really.
3104 3202
3105=back 3203=back
3106 3204
3107 3205
3108=head2 C<ev_cleanup> - even the best things end 3206=head2 C<ev_cleanup> - even the best things end
3109 3207
3110Cleanup watchers are called just before the event loop they are registered 3208Cleanup watchers are called just before the event loop is being destroyed
3111with is being destroyed. 3209by a call to C<ev_loop_destroy>.
3112 3210
3113While there is no guarantee that the event loop gets destroyed, cleanup 3211While there is no guarantee that the event loop gets destroyed, cleanup
3114watchers provide a convenient method to install cleanup hooks for your 3212watchers provide a convenient method to install cleanup hooks for your
3115program, worker threads and so on - you just to make sure to destroy the 3213program, worker threads and so on - you just to make sure to destroy the
3116loop when you want them to be invoked. 3214loop when you want them to be invoked.
3126 3224
3127=item ev_cleanup_init (ev_cleanup *, callback) 3225=item ev_cleanup_init (ev_cleanup *, callback)
3128 3226
3129Initialises and configures the cleanup watcher - it has no parameters of 3227Initialises 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 3228any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3131pointless, believe me. 3229pointless, I assure you.
3132 3230
3133=back 3231=back
3134 3232
3135Example: Register an atexit handler to destroy the default loop, so any 3233Example: Register an atexit handler to destroy the default loop, so any
3136cleanup functions are called. 3234cleanup functions are called.
3157it by calling C<ev_async_send>, which is thread- and signal safe. 3255it by calling C<ev_async_send>, which is thread- and signal safe.
3158 3256
3159This functionality is very similar to C<ev_signal> watchers, as signals, 3257This functionality is very similar to C<ev_signal> watchers, as signals,
3160too, are asynchronous in nature, and signals, too, will be compressed 3258too, 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 3259(i.e. the number of callback invocations may be less than the number of
3162C<ev_async_sent> calls). 3260C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3261of "global async watchers" by using a watcher on an otherwise unused
3262signal, and C<ev_feed_signal> to signal this watcher from another thread,
3263even without knowing which loop owns the signal.
3163 3264
3164Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not 3265Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3165just the default loop. 3266just the default loop.
3166 3267
3167=head3 Queueing 3268=head3 Queueing
3343Feed an event on the given fd, as if a file descriptor backend detected 3444Feed an event on the given fd, as if a file descriptor backend detected
3344the given events it. 3445the given events it.
3345 3446
3346=item ev_feed_signal_event (loop, int signum) 3447=item ev_feed_signal_event (loop, int signum)
3347 3448
3348Feed an event as if the given signal occurred (C<loop> must be the default 3449Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3349loop!). 3450which is async-safe.
3350 3451
3351=back 3452=back
3453
3454
3455=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3456
3457This section explains some common idioms that are not immediately
3458obvious. Note that examples are sprinkled over the whole manual, and this
3459section only contains stuff that wouldn't fit anywhere else.
3460
3461=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3462
3463Often (especially in GUI toolkits) there are places where you have
3464I<modal> interaction, which is most easily implemented by recursively
3465invoking C<ev_run>.
3466
3467This brings the problem of exiting - a callback might want to finish the
3468main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3469a modal "Are you sure?" dialog is still waiting), or just the nested one
3470and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3471other combination: In these cases, C<ev_break> will not work alone.
3472
3473The solution is to maintain "break this loop" variable for each C<ev_run>
3474invocation, and use a loop around C<ev_run> until the condition is
3475triggered, using C<EVRUN_ONCE>:
3476
3477 // main loop
3478 int exit_main_loop = 0;
3479
3480 while (!exit_main_loop)
3481 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3482
3483 // in a model watcher
3484 int exit_nested_loop = 0;
3485
3486 while (!exit_nested_loop)
3487 ev_run (EV_A_ EVRUN_ONCE);
3488
3489To exit from any of these loops, just set the corresponding exit variable:
3490
3491 // exit modal loop
3492 exit_nested_loop = 1;
3493
3494 // exit main program, after modal loop is finished
3495 exit_main_loop = 1;
3496
3497 // exit both
3498 exit_main_loop = exit_nested_loop = 1;
3499
3500=head2 THREAD LOCKING EXAMPLE
3501
3502Here is a fictitious example of how to run an event loop in a different
3503thread than where callbacks are being invoked and watchers are
3504created/added/removed.
3505
3506For a real-world example, see the C<EV::Loop::Async> perl module,
3507which uses exactly this technique (which is suited for many high-level
3508languages).
3509
3510The example uses a pthread mutex to protect the loop data, a condition
3511variable to wait for callback invocations, an async watcher to notify the
3512event loop thread and an unspecified mechanism to wake up the main thread.
3513
3514First, you need to associate some data with the event loop:
3515
3516 typedef struct {
3517 mutex_t lock; /* global loop lock */
3518 ev_async async_w;
3519 thread_t tid;
3520 cond_t invoke_cv;
3521 } userdata;
3522
3523 void prepare_loop (EV_P)
3524 {
3525 // for simplicity, we use a static userdata struct.
3526 static userdata u;
3527
3528 ev_async_init (&u->async_w, async_cb);
3529 ev_async_start (EV_A_ &u->async_w);
3530
3531 pthread_mutex_init (&u->lock, 0);
3532 pthread_cond_init (&u->invoke_cv, 0);
3533
3534 // now associate this with the loop
3535 ev_set_userdata (EV_A_ u);
3536 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3537 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3538
3539 // then create the thread running ev_loop
3540 pthread_create (&u->tid, 0, l_run, EV_A);
3541 }
3542
3543The callback for the C<ev_async> watcher does nothing: the watcher is used
3544solely to wake up the event loop so it takes notice of any new watchers
3545that might have been added:
3546
3547 static void
3548 async_cb (EV_P_ ev_async *w, int revents)
3549 {
3550 // just used for the side effects
3551 }
3552
3553The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
3554protecting the loop data, respectively.
3555
3556 static void
3557 l_release (EV_P)
3558 {
3559 userdata *u = ev_userdata (EV_A);
3560 pthread_mutex_unlock (&u->lock);
3561 }
3562
3563 static void
3564 l_acquire (EV_P)
3565 {
3566 userdata *u = ev_userdata (EV_A);
3567 pthread_mutex_lock (&u->lock);
3568 }
3569
3570The event loop thread first acquires the mutex, and then jumps straight
3571into C<ev_run>:
3572
3573 void *
3574 l_run (void *thr_arg)
3575 {
3576 struct ev_loop *loop = (struct ev_loop *)thr_arg;
3577
3578 l_acquire (EV_A);
3579 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
3580 ev_run (EV_A_ 0);
3581 l_release (EV_A);
3582
3583 return 0;
3584 }
3585
3586Instead of invoking all pending watchers, the C<l_invoke> callback will
3587signal the main thread via some unspecified mechanism (signals? pipe
3588writes? C<Async::Interrupt>?) and then waits until all pending watchers
3589have been called (in a while loop because a) spurious wakeups are possible
3590and b) skipping inter-thread-communication when there are no pending
3591watchers is very beneficial):
3592
3593 static void
3594 l_invoke (EV_P)
3595 {
3596 userdata *u = ev_userdata (EV_A);
3597
3598 while (ev_pending_count (EV_A))
3599 {
3600 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
3601 pthread_cond_wait (&u->invoke_cv, &u->lock);
3602 }
3603 }
3604
3605Now, whenever the main thread gets told to invoke pending watchers, it
3606will grab the lock, call C<ev_invoke_pending> and then signal the loop
3607thread to continue:
3608
3609 static void
3610 real_invoke_pending (EV_P)
3611 {
3612 userdata *u = ev_userdata (EV_A);
3613
3614 pthread_mutex_lock (&u->lock);
3615 ev_invoke_pending (EV_A);
3616 pthread_cond_signal (&u->invoke_cv);
3617 pthread_mutex_unlock (&u->lock);
3618 }
3619
3620Whenever you want to start/stop a watcher or do other modifications to an
3621event loop, you will now have to lock:
3622
3623 ev_timer timeout_watcher;
3624 userdata *u = ev_userdata (EV_A);
3625
3626 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
3627
3628 pthread_mutex_lock (&u->lock);
3629 ev_timer_start (EV_A_ &timeout_watcher);
3630 ev_async_send (EV_A_ &u->async_w);
3631 pthread_mutex_unlock (&u->lock);
3632
3633Note that sending the C<ev_async> watcher is required because otherwise
3634an event loop currently blocking in the kernel will have no knowledge
3635about the newly added timer. By waking up the loop it will pick up any new
3636watchers in the next event loop iteration.
3352 3637
3353 3638
3354=head1 LIBEVENT EMULATION 3639=head1 LIBEVENT EMULATION
3355 3640
3356Libev offers a compatibility emulation layer for libevent. It cannot 3641Libev offers a compatibility emulation layer for libevent. It cannot
3357emulate the internals of libevent, so here are some usage hints: 3642emulate the internals of libevent, so here are some usage hints:
3358 3643
3359=over 4 3644=over 4
3645
3646=item * Only the libevent-1.4.1-beta API is being emulated.
3647
3648This was the newest libevent version available when libev was implemented,
3649and is still mostly unchanged in 2010.
3360 3650
3361=item * Use it by including <event.h>, as usual. 3651=item * Use it by including <event.h>, as usual.
3362 3652
3363=item * The following members are fully supported: ev_base, ev_callback, 3653=item * The following members are fully supported: ev_base, ev_callback,
3364ev_arg, ev_fd, ev_res, ev_events. 3654ev_arg, ev_fd, ev_res, ev_events.
3370=item * Priorities are not currently supported. Initialising priorities 3660=item * Priorities are not currently supported. Initialising priorities
3371will fail and all watchers will have the same priority, even though there 3661will fail and all watchers will have the same priority, even though there
3372is an ev_pri field. 3662is an ev_pri field.
3373 3663
3374=item * In libevent, the last base created gets the signals, in libev, the 3664=item * In libevent, the last base created gets the signals, in libev, the
3375first base created (== the default loop) gets the signals. 3665base that registered the signal gets the signals.
3376 3666
3377=item * Other members are not supported. 3667=item * Other members are not supported.
3378 3668
3379=item * The libev emulation is I<not> ABI compatible to libevent, you need 3669=item * The libev emulation is I<not> ABI compatible to libevent, you need
3380to use the libev header file and library. 3670to use the libev header file and library.
3399Care has been taken to keep the overhead low. The only data member the C++ 3689Care 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 3690classes 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 3691that the watcher is associated with (or no additional members at all if
3402you disable C<EV_MULTIPLICITY> when embedding libev). 3692you disable C<EV_MULTIPLICITY> when embedding libev).
3403 3693
3404Currently, functions, and static and non-static member functions can be 3694Currently, functions, static and non-static member functions and classes
3405used as callbacks. Other types should be easy to add as long as they only 3695with C<operator ()> can be used as callbacks. Other types should be easy
3406need one additional pointer for context. If you need support for other 3696to add as long as they only need one additional pointer for context. If
3407types of functors please contact the author (preferably after implementing 3697you need support for other types of functors please contact the author
3408it). 3698(preferably after implementing it).
3409 3699
3410Here is a list of things available in the C<ev> namespace: 3700Here is a list of things available in the C<ev> namespace:
3411 3701
3412=over 4 3702=over 4
3413 3703
4281And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4571And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4282 4572
4283 #include "ev_cpp.h" 4573 #include "ev_cpp.h"
4284 #include "ev.c" 4574 #include "ev.c"
4285 4575
4286=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4576=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4287 4577
4288=head2 THREADS AND COROUTINES 4578=head2 THREADS AND COROUTINES
4289 4579
4290=head3 THREADS 4580=head3 THREADS
4291 4581
4342default loop and triggering an C<ev_async> watcher from the default loop 4632default loop and triggering an C<ev_async> watcher from the default loop
4343watcher callback into the event loop interested in the signal. 4633watcher callback into the event loop interested in the signal.
4344 4634
4345=back 4635=back
4346 4636
4347=head4 THREAD LOCKING EXAMPLE 4637See 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 4638
4485=head3 COROUTINES 4639=head3 COROUTINES
4486 4640
4487Libev is very accommodating to coroutines ("cooperative threads"): 4641Libev is very accommodating to coroutines ("cooperative threads"):
4488libev fully supports nesting calls to its functions from different 4642libev fully supports nesting calls to its functions from different
4757structure (guaranteed by POSIX but not by ISO C for example), but it also 4911structure (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 4912assumes that the same (machine) code can be used to call any watcher
4759callback: The watcher callbacks have different type signatures, but libev 4913callback: The watcher callbacks have different type signatures, but libev
4760calls them using an C<ev_watcher *> internally. 4914calls them using an C<ev_watcher *> internally.
4761 4915
4916=item pointer accesses must be thread-atomic
4917
4918Accessing a pointer value must be atomic, it must both be readable and
4919writable in one piece - this is the case on all current architectures.
4920
4762=item C<sig_atomic_t volatile> must be thread-atomic as well 4921=item C<sig_atomic_t volatile> must be thread-atomic as well
4763 4922
4764The type C<sig_atomic_t volatile> (or whatever is defined as 4923The type C<sig_atomic_t volatile> (or whatever is defined as
4765C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4924C<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 4925threads. This is not part of the specification for C<sig_atomic_t>, but is
4872=back 5031=back
4873 5032
4874 5033
4875=head1 PORTING FROM LIBEV 3.X TO 4.X 5034=head1 PORTING FROM LIBEV 3.X TO 4.X
4876 5035
4877The major version 4 introduced some minor incompatible changes to the API. 5036The major version 4 introduced some incompatible changes to the API.
4878 5037
4879At the moment, the C<ev.h> header file tries to implement superficial 5038At the moment, the C<ev.h> header file provides compatibility definitions
4880compatibility, so most programs should still compile. Those might be 5039for all changes, so most programs should still compile. The compatibility
4881removed in later versions of libev, so better update early than late. 5040layer might be removed in later versions of libev, so better update to the
5041new API early than late.
4882 5042
4883=over 4 5043=over 4
5044
5045=item C<EV_COMPAT3> backwards compatibility mechanism
5046
5047The backward compatibility mechanism can be controlled by
5048C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
5049section.
4884 5050
4885=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5051=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4886 5052
4887These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5053These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4888 5054
4914ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 5080ev_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 5081as 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> 5082C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4917typedef. 5083typedef.
4918 5084
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> 5085=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4926 5086
4927The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 5087The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4928mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 5088mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4929and work, but the library code will of course be larger. 5089and work, but the library code will of course be larger.
5003 5163
5004=back 5164=back
5005 5165
5006=head1 AUTHOR 5166=head1 AUTHOR
5007 5167
5008Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5168Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5169Magnusson and Emanuele Giaquinta.
5009 5170

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines