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

Comparing libev/ev.pod (file contents):
Revision 1.322 by root, Sun Oct 24 17:58:41 2010 UTC vs.
Revision 1.355 by root, Tue Jan 11 01:41:56 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
342Example: Restrict libev to the select and poll backends, and do not allow 363Example: Restrict libev to the select and poll backends, and do not allow
343environment settings to be taken into account: 364environment settings to be taken into account:
344 365
345 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV); 366 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
346 367
347Example: Use whatever libev has to offer, but make sure that kqueue is
348used if available (warning, breaks stuff, best use only with your own
349private event loop and only if you know the OS supports your types of
350fds):
351
352 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
353
354=item struct ev_loop *ev_loop_new (unsigned int flags) 368=item struct ev_loop *ev_loop_new (unsigned int flags)
355 369
356This 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
357could not be initialised, returns false. 371could not be initialised, returns false.
358 372
359Note 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
360libev 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
361default loop in the "main" or "initial" thread. 375loop in the "main" or "initial" thread.
362 376
363The flags argument can be used to specify special behaviour or specific 377The flags argument can be used to specify special behaviour or specific
364backends 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>).
365 379
366The following flags are supported: 380The following flags are supported:
401environment variable. 415environment variable.
402 416
403=item C<EVFLAG_NOINOTIFY> 417=item C<EVFLAG_NOINOTIFY>
404 418
405When 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
406I<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
407testing, this flag can be useful to conserve inotify file descriptors, as 421testing, this flag can be useful to conserve inotify file descriptors, as
408otherwise each loop using C<ev_stat> watchers consumes one inotify handle. 422otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
409 423
410=item C<EVFLAG_SIGNALFD> 424=item C<EVFLAG_SIGNALFD>
411 425
412When this flag is specified, then libev will attempt to use the 426When this flag is specified, then libev will attempt to use the
413I<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
414delivers signals synchronously, which makes it both faster and might make 428delivers signals synchronously, which makes it both faster and might make
415it 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
416handling with threads, as long as you properly block signals in your 430handling with threads, as long as you properly block signals in your
417threads that are not interested in handling them. 431threads that are not interested in handling them.
418 432
419Signalfd 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
420there 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
421example) 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.
422 448
423=item C<EVBACKEND_SELECT> (value 1, portable select backend) 449=item C<EVBACKEND_SELECT> (value 1, portable select backend)
424 450
425This is your standard select(2) backend. Not I<completely> standard, as 451This is your standard select(2) backend. Not I<completely> standard, as
426libev 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,
462epoll scales either O(1) or O(active_fds). 488epoll scales either O(1) or O(active_fds).
463 489
464The epoll mechanism deserves honorable mention as the most misdesigned 490The epoll mechanism deserves honorable mention as the most misdesigned
465of the more advanced event mechanisms: mere annoyances include silently 491of the more advanced event mechanisms: mere annoyances include silently
466dropping file descriptors, requiring a system call per change per file 492dropping file descriptors, requiring a system call per change per file
467descriptor (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
468so 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
469I<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
470take considerable time (one syscall per file descriptor) and is of course 498set, which can take considerable time (one syscall per file descriptor)
471hard to detect. 499and is of course hard to detect.
472 500
473Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 501Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
474of 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
475I<different> file descriptors (even already closed ones, so one cannot 503I<different> file descriptors (even already closed ones, so one cannot
476even remove them from the set) than registered in the set (especially 504even remove them from the set) than registered in the set (especially
478employing an additional generation counter and comparing that against the 506employing an additional generation counter and comparing that against the
479events to filter out spurious ones, recreating the set when required. Last 507events to filter out spurious ones, recreating the set when required. Last
480not 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
481perfectly fine with C<select> (files, many character devices...). 509perfectly fine with C<select> (files, many character devices...).
482 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
483While 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
484will 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
485incident (because the same I<file descriptor> could point to a different 517incident (because the same I<file descriptor> could point to a different
486I<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
487file 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
552=item C<EVBACKEND_PORT> (value 32, Solaris 10) 584=item C<EVBACKEND_PORT> (value 32, Solaris 10)
553 585
554This 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,
555it'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)).
556 588
557Please note that Solaris event ports can deliver a lot of spurious
558notifications, so you need to use non-blocking I/O or other means to avoid
559blocking when no data (or space) is available.
560
561While this backend scales well, it requires one system call per active 589While this backend scales well, it requires one system call per active
562file descriptor per loop iteration. For small and medium numbers of file 590file descriptor per loop iteration. For small and medium numbers of file
563descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 591descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
564might perform better. 592might perform better.
565 593
566On the positive side, with the exception of the spurious readiness 594On the positive side, this backend actually performed fully to
567notifications, this backend actually performed fully to specification
568in 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
569OS-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.
570 608
571This 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
572C<EVBACKEND_POLL>. 610C<EVBACKEND_POLL>.
573 611
574=item C<EVBACKEND_ALL> 612=item C<EVBACKEND_ALL>
575 613
576Try all backends (even potentially broken ones that wouldn't be tried 614Try all backends (even potentially broken ones that wouldn't be tried
577with 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
578C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 616C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
579 617
580It 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).
581 627
582=back 628=back
583 629
584If 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,
585then 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
589Example: Try to create a event loop that uses epoll and nothing else. 635Example: Try to create a event loop that uses epoll and nothing else.
590 636
591 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 637 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
592 if (!epoller) 638 if (!epoller)
593 fatal ("no epoll found here, maybe it hides under your chair"); 639 fatal ("no epoll found here, maybe it hides under your chair");
640
641Example: Use whatever libev has to offer, but make sure that kqueue is
642used if available.
643
644 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
594 645
595=item ev_loop_destroy (loop) 646=item ev_loop_destroy (loop)
596 647
597Destroys an event loop object (frees all memory and kernel state 648Destroys an event loop object (frees all memory and kernel state
598etc.). None of the active event watchers will be stopped in the normal 649etc.). None of the active event watchers will be stopped in the normal
609This function is normally used on loop objects allocated by 660This function is normally used on loop objects allocated by
610C<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
611C<ev_default_loop>, in which case it is not thread-safe. 662C<ev_default_loop>, in which case it is not thread-safe.
612 663
613Note 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
614except 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.
615If 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>
616and C<ev_loop_destroy>. 667and C<ev_loop_destroy>.
617 668
618=item ev_loop_fork (loop) 669=item ev_loop_fork (loop)
619 670
667prepare and check phases. 718prepare and check phases.
668 719
669=item unsigned int ev_depth (loop) 720=item unsigned int ev_depth (loop)
670 721
671Returns 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
672times C<ev_run> was exited, in other words, the recursion depth. 723times C<ev_run> was exited normally, in other words, the recursion depth.
673 724
674Outside 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
675C<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),
676in which case it is higher. 727in which case it is higher.
677 728
678Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 729Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
679etc.), doesn't count as "exit" - consider this as a hint to avoid such 730throwing an exception etc.), doesn't count as "exit" - consider this
680ungentleman-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.
681 733
682=item unsigned int ev_backend (loop) 734=item unsigned int ev_backend (loop)
683 735
684Returns one of the C<EVBACKEND_*> flags indicating the event backend in 736Returns one of the C<EVBACKEND_*> flags indicating the event backend in
685use. 737use.
746relying 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
747finished (especially in interactive programs), but having a program 799finished (especially in interactive programs), but having a program
748that 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
749of 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
750beauty. 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.
751 808
752A 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
753those events and any already outstanding ones, but will not wait and 810those events and any already outstanding ones, but will not wait and
754block 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
755iteration 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
817Can 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
818has processed all outstanding events). The C<how> argument must be either 875has processed all outstanding events). The C<how> argument must be either
819C<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
820C<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.
821 878
822This "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>.
823 880
824It 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.
825 883
826=item ev_ref (loop) 884=item ev_ref (loop)
827 885
828=item ev_unref (loop) 886=item ev_unref (loop)
829 887
850running when nothing else is active. 908running when nothing else is active.
851 909
852 ev_signal exitsig; 910 ev_signal exitsig;
853 ev_signal_init (&exitsig, sig_cb, SIGINT); 911 ev_signal_init (&exitsig, sig_cb, SIGINT);
854 ev_signal_start (loop, &exitsig); 912 ev_signal_start (loop, &exitsig);
855 evf_unref (loop); 913 ev_unref (loop);
856 914
857Example: For some weird reason, unregister the above signal handler again. 915Example: For some weird reason, unregister the above signal handler again.
858 916
859 ev_ref (loop); 917 ev_ref (loop);
860 ev_signal_stop (loop, &exitsig); 918 ev_signal_stop (loop, &exitsig);
972See 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
973document. 1031document.
974 1032
975=item ev_set_userdata (loop, void *data) 1033=item ev_set_userdata (loop, void *data)
976 1034
977=item ev_userdata (loop) 1035=item void *ev_userdata (loop)
978 1036
979Set and retrieve a single C<void *> associated with a loop. When 1037Set and retrieve a single C<void *> associated with a loop. When
980C<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
981C<0.> 1039C<0>.
982 1040
983These 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,
984and 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
985C<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
986any other purpose as well. 1044any other purpose as well.
1114=item C<EV_FORK> 1172=item C<EV_FORK>
1115 1173
1116The 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
1117C<ev_fork>). 1175C<ev_fork>).
1118 1176
1177=item C<EV_CLEANUP>
1178
1179The event loop is about to be destroyed (see C<ev_cleanup>).
1180
1119=item C<EV_ASYNC> 1181=item C<EV_ASYNC>
1120 1182
1121The given async watcher has been asynchronously notified (see C<ev_async>). 1183The given async watcher has been asynchronously notified (see C<ev_async>).
1122 1184
1123=item C<EV_CUSTOM> 1185=item C<EV_CUSTOM>
1144programs, 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
1145thing, so beware. 1207thing, so beware.
1146 1208
1147=back 1209=back
1148 1210
1149=head2 WATCHER STATES
1150
1151There are various watcher states mentioned throughout this manual -
1152active, pending and so on. In this section these states and the rules to
1153transition between them will be described in more detail - and while these
1154rules might look complicated, they usually do "the right thing".
1155
1156=over 4
1157
1158=item initialiased
1159
1160Before a watcher can be registered with the event looop it has to be
1161initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1162C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1163
1164In this state it is simply some block of memory that is suitable for use
1165in an event loop. It can be moved around, freed, reused etc. at will.
1166
1167=item started/running/active
1168
1169Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1170property of the event loop, and is actively waiting for events. While in
1171this state it cannot be accessed (except in a few documented ways), moved,
1172freed or anything else - the only legal thing is to keep a pointer to it,
1173and call libev functions on it that are documented to work on active watchers.
1174
1175=item pending
1176
1177If a watcher is active and libev determines that an event it is interested
1178in has occurred (such as a timer expiring), it will become pending. It will
1179stay in this pending state until either it is stopped or its callback is
1180about to be invoked, so it is not normally pending inside the watcher
1181callback.
1182
1183The watcher might or might not be active while it is pending (for example,
1184an expired non-repeating timer can be pending but no longer active). If it
1185is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1186but it is still property of the event loop at this time, so cannot be
1187moved, freed or reused. And if it is active the rules described in the
1188previous item still apply.
1189
1190It is also possible to feed an event on a watcher that is not active (e.g.
1191via C<ev_feed_event>), in which case it becomes pending without being
1192active.
1193
1194=item stopped
1195
1196A watcher can be stopped implicitly by libev (in which case it might still
1197be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1198latter will clear any pending state the watcher might be in, regardless
1199of whether it was active or not, so stopping a watcher explicitly before
1200freeing it is often a good idea.
1201
1202While stopped (and not pending) the watcher is essentially in the
1203initialised state, that is it can be reused, moved, modified in any way
1204you wish.
1205
1206=back
1207
1208=head2 GENERIC WATCHER FUNCTIONS 1211=head2 GENERIC WATCHER FUNCTIONS
1209 1212
1210=over 4 1213=over 4
1211 1214
1212=item C<ev_init> (ev_TYPE *watcher, callback) 1215=item C<ev_init> (ev_TYPE *watcher, callback)
1353 1356
1354See 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
1355functions that do not need a watcher. 1358functions that do not need a watcher.
1356 1359
1357=back 1360=back
1358
1359 1361
1360=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1361 1363
1362Each 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
1363and 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
1419 t2_cb (EV_P_ ev_timer *w, int revents) 1421 t2_cb (EV_P_ ev_timer *w, int revents)
1420 { 1422 {
1421 struct my_biggy big = (struct my_biggy *) 1423 struct my_biggy big = (struct my_biggy *)
1422 (((char *)w) - offsetof (struct my_biggy, t2)); 1424 (((char *)w) - offsetof (struct my_biggy, t2));
1423 } 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
1424 1485
1425=head2 WATCHER PRIORITY MODELS 1486=head2 WATCHER PRIORITY MODELS
1426 1487
1427Many event loops support I<watcher priorities>, which are usually small 1488Many event loops support I<watcher priorities>, which are usually small
1428integers that influence the ordering of event callback invocation 1489integers that influence the ordering of event callback invocation
1555In 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
1556fd 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
1557descriptors 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
1558required if you know what you are doing). 1619required if you know what you are doing).
1559 1620
1560If you cannot use non-blocking mode, then force the use of a
1561known-to-be-good backend (at the time of this writing, this includes only
1562C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1563descriptors for which non-blocking operation makes no sense (such as
1564files) - libev doesn't guarantee any specific behaviour in that case.
1565
1566Another 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
1567receive "spurious" readiness notifications, that is your callback might 1622receive "spurious" readiness notifications, that is, your callback might
1568be 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
1569because 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
1570lot 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
1571this situation even with a relatively standard program structure. Thus 1626use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1572it is best to always use non-blocking I/O: An extra C<read>(2) returning
1573C<EAGAIN> is far preferable to a program hanging until some data arrives. 1627preferable to a program hanging until some data arrives.
1574 1628
1575If 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
1576not play around with an Xlib connection), then you have to separately 1630not play around with an Xlib connection), then you have to separately
1577re-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
1578interface such as poll (fortunately in our Xlib example, Xlib already 1632interface such as poll (fortunately in the case of Xlib, it already does
1579does 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
1580use 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
1581indefinitely. 1635indefinitely.
1582 1636
1583But really, best use non-blocking mode. 1637But really, best use non-blocking mode.
1584 1638
1612 1666
1613There is no workaround possible except not registering events 1667There is no workaround possible except not registering events
1614for potentially C<dup ()>'ed file descriptors, or to resort to 1668for potentially C<dup ()>'ed file descriptors, or to resort to
1615C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1669C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1616 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
1617=head3 The special problem of fork 1704=head3 The special problem of fork
1618 1705
1619Some 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
1620useless behaviour. Libev fully supports fork, but needs to be told about 1707useless behaviour. Libev fully supports fork, but needs to be told about
1621it in the child. 1708it in the child if you want to continue to use it in the child.
1622 1709
1623To 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
1624C<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
1625enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1712C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1626C<EVBACKEND_POLL>.
1627 1713
1628=head3 The special problem of SIGPIPE 1714=head3 The special problem of SIGPIPE
1629 1715
1630While 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>:
1631when 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
2247 2333
2248=head2 C<ev_signal> - signal me when a signal gets signalled! 2334=head2 C<ev_signal> - signal me when a signal gets signalled!
2249 2335
2250Signal watchers will trigger an event when the process receives a specific 2336Signal watchers will trigger an event when the process receives a specific
2251signal one or more times. Even though signals are very asynchronous, libev 2337signal one or more times. Even though signals are very asynchronous, libev
2252will 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
2253normal event processing, like any other event. 2339normal event processing, like any other event.
2254 2340
2255If you want signals to be delivered truly asynchronously, just use 2341If you want signals to be delivered truly asynchronously, just use
2256C<sigaction> as you would do without libev and forget about sharing 2342C<sigaction> as you would do without libev and forget about sharing
2257the 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
2299I<has> to modify the signal mask, at least temporarily. 2385I<has> to modify the signal mask, at least temporarily.
2300 2386
2301So 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
2302you 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
2303is 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>.
2304 2404
2305=head3 Watcher-Specific Functions and Data Members 2405=head3 Watcher-Specific Functions and Data Members
2306 2406
2307=over 4 2407=over 4
2308 2408
3092 3192
3093=head3 Watcher-Specific Functions and Data Members 3193=head3 Watcher-Specific Functions and Data Members
3094 3194
3095=over 4 3195=over 4
3096 3196
3097=item ev_fork_init (ev_signal *, callback) 3197=item ev_fork_init (ev_fork *, callback)
3098 3198
3099Initialises and configures the fork watcher - it has no parameters of any 3199Initialises and configures the fork watcher - it has no parameters of any
3100kind. 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,
3101believe me. 3201really.
3102 3202
3103=back 3203=back
3204
3205
3206=head2 C<ev_cleanup> - even the best things end
3207
3208Cleanup watchers are called just before the event loop is being destroyed
3209by a call to C<ev_loop_destroy>.
3210
3211While there is no guarantee that the event loop gets destroyed, cleanup
3212watchers provide a convenient method to install cleanup hooks for your
3213program, worker threads and so on - you just to make sure to destroy the
3214loop when you want them to be invoked.
3215
3216Cleanup watchers are invoked in the same way as any other watcher. Unlike
3217all other watchers, they do not keep a reference to the event loop (which
3218makes a lot of sense if you think about it). Like all other watchers, you
3219can call libev functions in the callback, except C<ev_cleanup_start>.
3220
3221=head3 Watcher-Specific Functions and Data Members
3222
3223=over 4
3224
3225=item ev_cleanup_init (ev_cleanup *, callback)
3226
3227Initialises and configures the cleanup watcher - it has no parameters of
3228any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3229pointless, I assure you.
3230
3231=back
3232
3233Example: Register an atexit handler to destroy the default loop, so any
3234cleanup functions are called.
3235
3236 static void
3237 program_exits (void)
3238 {
3239 ev_loop_destroy (EV_DEFAULT_UC);
3240 }
3241
3242 ...
3243 atexit (program_exits);
3104 3244
3105 3245
3106=head2 C<ev_async> - how to wake up an event loop 3246=head2 C<ev_async> - how to wake up an event loop
3107 3247
3108In general, you cannot use an C<ev_run> from multiple threads or other 3248In general, you cannot use an C<ev_run> from multiple threads or other
3115it 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.
3116 3256
3117This functionality is very similar to C<ev_signal> watchers, as signals, 3257This functionality is very similar to C<ev_signal> watchers, as signals,
3118too, are asynchronous in nature, and signals, too, will be compressed 3258too, are asynchronous in nature, and signals, too, will be compressed
3119(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
3120C<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.
3121 3264
3122Unlike 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
3123just the default loop. 3266just the default loop.
3124 3267
3125=head3 Queueing 3268=head3 Queueing
3301Feed 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
3302the given events it. 3445the given events it.
3303 3446
3304=item ev_feed_signal_event (loop, int signum) 3447=item ev_feed_signal_event (loop, int signum)
3305 3448
3306Feed 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>,
3307loop!). 3450which is async-safe.
3451
3452=back
3453
3454
3455=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3456
3457This section explains some common idioms that are not immediately
3458obvious. Note that examples are sprinkled over the whole manual, and this
3459section only contains stuff that wouldn't fit anywhere else.
3460
3461=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.
3308 3637
3309=back 3638=back
3310 3639
3311 3640
3312=head1 LIBEVENT EMULATION 3641=head1 LIBEVENT EMULATION
3313 3642
3314Libev offers a compatibility emulation layer for libevent. It cannot 3643Libev offers a compatibility emulation layer for libevent. It cannot
3315emulate the internals of libevent, so here are some usage hints: 3644emulate the internals of libevent, so here are some usage hints:
3316 3645
3317=over 4 3646=over 4
3647
3648=item * Only the libevent-1.4.1-beta API is being emulated.
3649
3650This was the newest libevent version available when libev was implemented,
3651and is still mostly unchanged in 2010.
3318 3652
3319=item * Use it by including <event.h>, as usual. 3653=item * Use it by including <event.h>, as usual.
3320 3654
3321=item * The following members are fully supported: ev_base, ev_callback, 3655=item * The following members are fully supported: ev_base, ev_callback,
3322ev_arg, ev_fd, ev_res, ev_events. 3656ev_arg, ev_fd, ev_res, ev_events.
3328=item * Priorities are not currently supported. Initialising priorities 3662=item * Priorities are not currently supported. Initialising priorities
3329will fail and all watchers will have the same priority, even though there 3663will fail and all watchers will have the same priority, even though there
3330is an ev_pri field. 3664is an ev_pri field.
3331 3665
3332=item * In libevent, the last base created gets the signals, in libev, the 3666=item * In libevent, the last base created gets the signals, in libev, the
3333first base created (== the default loop) gets the signals. 3667base that registered the signal gets the signals.
3334 3668
3335=item * Other members are not supported. 3669=item * Other members are not supported.
3336 3670
3337=item * The libev emulation is I<not> ABI compatible to libevent, you need 3671=item * The libev emulation is I<not> ABI compatible to libevent, you need
3338to use the libev header file and library. 3672to use the libev header file and library.
3357Care has been taken to keep the overhead low. The only data member the C++ 3691Care has been taken to keep the overhead low. The only data member the C++
3358classes add (compared to plain C-style watchers) is the event loop pointer 3692classes add (compared to plain C-style watchers) is the event loop pointer
3359that the watcher is associated with (or no additional members at all if 3693that the watcher is associated with (or no additional members at all if
3360you disable C<EV_MULTIPLICITY> when embedding libev). 3694you disable C<EV_MULTIPLICITY> when embedding libev).
3361 3695
3362Currently, functions, and static and non-static member functions can be 3696Currently, functions, static and non-static member functions and classes
3363used as callbacks. Other types should be easy to add as long as they only 3697with C<operator ()> can be used as callbacks. Other types should be easy
3364need one additional pointer for context. If you need support for other 3698to add as long as they only need one additional pointer for context. If
3365types of functors please contact the author (preferably after implementing 3699you need support for other types of functors please contact the author
3366it). 3700(preferably after implementing it).
3367 3701
3368Here is a list of things available in the C<ev> namespace: 3702Here is a list of things available in the C<ev> namespace:
3369 3703
3370=over 4 3704=over 4
3371 3705
4300default loop and triggering an C<ev_async> watcher from the default loop 4634default loop and triggering an C<ev_async> watcher from the default loop
4301watcher callback into the event loop interested in the signal. 4635watcher callback into the event loop interested in the signal.
4302 4636
4303=back 4637=back
4304 4638
4305=head4 THREAD LOCKING EXAMPLE 4639See also L<THREAD LOCKING EXAMPLE>.
4306
4307Here is a fictitious example of how to run an event loop in a different
4308thread than where callbacks are being invoked and watchers are
4309created/added/removed.
4310
4311For a real-world example, see the C<EV::Loop::Async> perl module,
4312which uses exactly this technique (which is suited for many high-level
4313languages).
4314
4315The example uses a pthread mutex to protect the loop data, a condition
4316variable to wait for callback invocations, an async watcher to notify the
4317event loop thread and an unspecified mechanism to wake up the main thread.
4318
4319First, you need to associate some data with the event loop:
4320
4321 typedef struct {
4322 mutex_t lock; /* global loop lock */
4323 ev_async async_w;
4324 thread_t tid;
4325 cond_t invoke_cv;
4326 } userdata;
4327
4328 void prepare_loop (EV_P)
4329 {
4330 // for simplicity, we use a static userdata struct.
4331 static userdata u;
4332
4333 ev_async_init (&u->async_w, async_cb);
4334 ev_async_start (EV_A_ &u->async_w);
4335
4336 pthread_mutex_init (&u->lock, 0);
4337 pthread_cond_init (&u->invoke_cv, 0);
4338
4339 // now associate this with the loop
4340 ev_set_userdata (EV_A_ u);
4341 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4342 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4343
4344 // then create the thread running ev_loop
4345 pthread_create (&u->tid, 0, l_run, EV_A);
4346 }
4347
4348The callback for the C<ev_async> watcher does nothing: the watcher is used
4349solely to wake up the event loop so it takes notice of any new watchers
4350that might have been added:
4351
4352 static void
4353 async_cb (EV_P_ ev_async *w, int revents)
4354 {
4355 // just used for the side effects
4356 }
4357
4358The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4359protecting the loop data, respectively.
4360
4361 static void
4362 l_release (EV_P)
4363 {
4364 userdata *u = ev_userdata (EV_A);
4365 pthread_mutex_unlock (&u->lock);
4366 }
4367
4368 static void
4369 l_acquire (EV_P)
4370 {
4371 userdata *u = ev_userdata (EV_A);
4372 pthread_mutex_lock (&u->lock);
4373 }
4374
4375The event loop thread first acquires the mutex, and then jumps straight
4376into C<ev_run>:
4377
4378 void *
4379 l_run (void *thr_arg)
4380 {
4381 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4382
4383 l_acquire (EV_A);
4384 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4385 ev_run (EV_A_ 0);
4386 l_release (EV_A);
4387
4388 return 0;
4389 }
4390
4391Instead of invoking all pending watchers, the C<l_invoke> callback will
4392signal the main thread via some unspecified mechanism (signals? pipe
4393writes? C<Async::Interrupt>?) and then waits until all pending watchers
4394have been called (in a while loop because a) spurious wakeups are possible
4395and b) skipping inter-thread-communication when there are no pending
4396watchers is very beneficial):
4397
4398 static void
4399 l_invoke (EV_P)
4400 {
4401 userdata *u = ev_userdata (EV_A);
4402
4403 while (ev_pending_count (EV_A))
4404 {
4405 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4406 pthread_cond_wait (&u->invoke_cv, &u->lock);
4407 }
4408 }
4409
4410Now, whenever the main thread gets told to invoke pending watchers, it
4411will grab the lock, call C<ev_invoke_pending> and then signal the loop
4412thread to continue:
4413
4414 static void
4415 real_invoke_pending (EV_P)
4416 {
4417 userdata *u = ev_userdata (EV_A);
4418
4419 pthread_mutex_lock (&u->lock);
4420 ev_invoke_pending (EV_A);
4421 pthread_cond_signal (&u->invoke_cv);
4422 pthread_mutex_unlock (&u->lock);
4423 }
4424
4425Whenever you want to start/stop a watcher or do other modifications to an
4426event loop, you will now have to lock:
4427
4428 ev_timer timeout_watcher;
4429 userdata *u = ev_userdata (EV_A);
4430
4431 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4432
4433 pthread_mutex_lock (&u->lock);
4434 ev_timer_start (EV_A_ &timeout_watcher);
4435 ev_async_send (EV_A_ &u->async_w);
4436 pthread_mutex_unlock (&u->lock);
4437
4438Note that sending the C<ev_async> watcher is required because otherwise
4439an event loop currently blocking in the kernel will have no knowledge
4440about the newly added timer. By waking up the loop it will pick up any new
4441watchers in the next event loop iteration.
4442 4640
4443=head3 COROUTINES 4641=head3 COROUTINES
4444 4642
4445Libev is very accommodating to coroutines ("cooperative threads"): 4643Libev is very accommodating to coroutines ("cooperative threads"):
4446libev fully supports nesting calls to its functions from different 4644libev fully supports nesting calls to its functions from different
4715structure (guaranteed by POSIX but not by ISO C for example), but it also 4913structure (guaranteed by POSIX but not by ISO C for example), but it also
4716assumes that the same (machine) code can be used to call any watcher 4914assumes that the same (machine) code can be used to call any watcher
4717callback: The watcher callbacks have different type signatures, but libev 4915callback: The watcher callbacks have different type signatures, but libev
4718calls them using an C<ev_watcher *> internally. 4916calls them using an C<ev_watcher *> internally.
4719 4917
4918=item pointer accesses must be thread-atomic
4919
4920Accessing a pointer value must be atomic, it must both be readable and
4921writable in one piece - this is the case on all current architectures.
4922
4720=item C<sig_atomic_t volatile> must be thread-atomic as well 4923=item C<sig_atomic_t volatile> must be thread-atomic as well
4721 4924
4722The type C<sig_atomic_t volatile> (or whatever is defined as 4925The type C<sig_atomic_t volatile> (or whatever is defined as
4723C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4926C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4724threads. This is not part of the specification for C<sig_atomic_t>, but is 4927threads. This is not part of the specification for C<sig_atomic_t>, but is
4830=back 5033=back
4831 5034
4832 5035
4833=head1 PORTING FROM LIBEV 3.X TO 4.X 5036=head1 PORTING FROM LIBEV 3.X TO 4.X
4834 5037
4835The major version 4 introduced some minor incompatible changes to the API. 5038The major version 4 introduced some incompatible changes to the API.
4836 5039
4837At the moment, the C<ev.h> header file tries to implement superficial 5040At the moment, the C<ev.h> header file provides compatibility definitions
4838compatibility, so most programs should still compile. Those might be 5041for all changes, so most programs should still compile. The compatibility
4839removed in later versions of libev, so better update early than late. 5042layer might be removed in later versions of libev, so better update to the
5043new API early than late.
4840 5044
4841=over 4 5045=over 4
4842 5046
5047=item C<EV_COMPAT3> backwards compatibility mechanism
5048
5049The backward compatibility mechanism can be controlled by
5050C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
5051section.
5052
4843=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5053=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4844 5054
4845These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5055These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4846 5056
4847 ev_loop_destroy (EV_DEFAULT); 5057 ev_loop_destroy (EV_DEFAULT_UC);
4848 ev_loop_fork (EV_DEFAULT); 5058 ev_loop_fork (EV_DEFAULT);
4849 5059
4850=item function/symbol renames 5060=item function/symbol renames
4851 5061
4852A number of functions and symbols have been renamed: 5062A number of functions and symbols have been renamed:
4872ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 5082ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4873as all other watcher types. Note that C<ev_loop_fork> is still called 5083as all other watcher types. Note that C<ev_loop_fork> is still called
4874C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> 5084C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4875typedef. 5085typedef.
4876 5086
4877=item C<EV_COMPAT3> backwards compatibility mechanism
4878
4879The backward compatibility mechanism can be controlled by
4880C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4881section.
4882
4883=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 5087=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4884 5088
4885The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 5089The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4886mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 5090mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4887and work, but the library code will of course be larger. 5091and work, but the library code will of course be larger.
4961 5165
4962=back 5166=back
4963 5167
4964=head1 AUTHOR 5168=head1 AUTHOR
4965 5169
4966Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5170Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5171Magnusson and Emanuele Giaquinta.
4967 5172

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines