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

Comparing libev/ev.pod (file contents):
Revision 1.337 by root, Sun Oct 31 20:20:20 2010 UTC vs.
Revision 1.367 by root, Sun Feb 20 02:56:23 2011 UTC

58 ev_timer_start (loop, &timeout_watcher); 58 ev_timer_start (loop, &timeout_watcher);
59 59
60 // now wait for events to arrive 60 // now wait for events to arrive
61 ev_run (loop, 0); 61 ev_run (loop, 0);
62 62
63 // unloop was called, so exit 63 // break was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
67=head1 ABOUT THIS DOCUMENT 67=head1 ABOUT THIS DOCUMENT
68 68
241the 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 ()
242& ev_supported_backends ()>, likewise for recommended ones. 242& ev_supported_backends ()>, likewise for recommended ones.
243 243
244See the description of C<ev_embed> watchers for more info. 244See the description of C<ev_embed> watchers for more info.
245 245
246=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT] 246=item ev_set_allocator (void *(*cb)(void *ptr, long size))
247 247
248Sets the allocation function to use (the prototype is similar - the 248Sets the allocation function to use (the prototype is similar - the
249semantics 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
250used 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
251when 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
277 } 277 }
278 278
279 ... 279 ...
280 ev_set_allocator (persistent_realloc); 280 ev_set_allocator (persistent_realloc);
281 281
282=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT] 282=item ev_set_syserr_cb (void (*cb)(const char *msg))
283 283
284Set 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
285as failed select, poll, epoll_wait). The message is a printable string 285as failed select, poll, epoll_wait). The message is a printable string
286indicating the system call or subsystem causing the problem. If this 286indicating the system call or subsystem causing the problem. If this
287callback 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
299 } 299 }
300 300
301 ... 301 ...
302 ev_set_syserr_cb (fatal_error); 302 ev_set_syserr_cb (fatal_error);
303 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
304=back 317=back
305 318
306=head1 FUNCTIONS CONTROLLING EVENT LOOPS 319=head1 FUNCTIONS CONTROLLING EVENT LOOPS
307 320
308An 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
355=item struct ev_loop *ev_loop_new (unsigned int flags) 368=item struct ev_loop *ev_loop_new (unsigned int flags)
356 369
357This 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
358could not be initialised, returns false. 371could not be initialised, returns false.
359 372
360Note 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
361libev 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
362default loop in the "main" or "initial" thread. 375loop in the "main" or "initial" thread.
363 376
364The flags argument can be used to specify special behaviour or specific 377The flags argument can be used to specify special behaviour or specific
365backends 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>).
366 379
367The following flags are supported: 380The following flags are supported:
402environment variable. 415environment variable.
403 416
404=item C<EVFLAG_NOINOTIFY> 417=item C<EVFLAG_NOINOTIFY>
405 418
406When 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
407I<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
408testing, this flag can be useful to conserve inotify file descriptors, as 421testing, this flag can be useful to conserve inotify file descriptors, as
409otherwise each loop using C<ev_stat> watchers consumes one inotify handle. 422otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
410 423
411=item C<EVFLAG_SIGNALFD> 424=item C<EVFLAG_SIGNALFD>
412 425
413When this flag is specified, then libev will attempt to use the 426When this flag is specified, then libev will attempt to use the
414I<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
415delivers signals synchronously, which makes it both faster and might make 428delivers signals synchronously, which makes it both faster and might make
416it 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
417handling with threads, as long as you properly block signals in your 430handling with threads, as long as you properly block signals in your
418threads that are not interested in handling them. 431threads that are not interested in handling them.
419 432
420Signalfd 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
421there 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
422example) that can't properly initialise their signal masks. 435example) that can't properly initialise their signal masks.
436
437=item C<EVFLAG_NOSIGMASK>
438
439When this flag is specified, then libev will avoid to modify the signal
440mask. Specifically, this means you ahve to make sure signals are unblocked
441when you want to receive them.
442
443This behaviour is useful when you want to do your own signal handling, or
444want to handle signals only in specific threads and want to avoid libev
445unblocking the signals.
446
447It's also required by POSIX in a threaded program, as libev calls
448C<sigprocmask>, whose behaviour is officially unspecified.
449
450This flag's behaviour will become the default in future versions of libev.
423 451
424=item C<EVBACKEND_SELECT> (value 1, portable select backend) 452=item C<EVBACKEND_SELECT> (value 1, portable select backend)
425 453
426This is your standard select(2) backend. Not I<completely> standard, as 454This is your standard select(2) backend. Not I<completely> standard, as
427libev tries to roll its own fd_set with no limits on the number of fds, 455libev tries to roll its own fd_set with no limits on the number of fds,
464 492
465The epoll mechanism deserves honorable mention as the most misdesigned 493The epoll mechanism deserves honorable mention as the most misdesigned
466of the more advanced event mechanisms: mere annoyances include silently 494of the more advanced event mechanisms: mere annoyances include silently
467dropping file descriptors, requiring a system call per change per file 495dropping file descriptors, requiring a system call per change per file
468descriptor (and unnecessary guessing of parameters), problems with dup, 496descriptor (and unnecessary guessing of parameters), problems with dup,
469returning before the timeout value requiring additional iterations and so 497returning before the timeout value, resulting in additional iterations
498(and only giving 5ms accuracy while select on the same platform gives
470on. The biggest issue is fork races, however - if a program forks then 4990.1ms) and so on. The biggest issue is fork races, however - if a program
471I<both> parent and child process have to recreate the epoll set, which can 500forks then I<both> parent and child process have to recreate the epoll
472take considerable time (one syscall per file descriptor) and is of course 501set, which can take considerable time (one syscall per file descriptor)
473hard to detect. 502and is of course hard to detect.
474 503
475Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 504Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
476of course I<doesn't>, and epoll just loves to report events for totally 505of course I<doesn't>, and epoll just loves to report events for totally
477I<different> file descriptors (even already closed ones, so one cannot 506I<different> file descriptors (even already closed ones, so one cannot
478even remove them from the set) than registered in the set (especially 507even remove them from the set) than registered in the set (especially
480employing an additional generation counter and comparing that against the 509employing an additional generation counter and comparing that against the
481events to filter out spurious ones, recreating the set when required. Last 510events to filter out spurious ones, recreating the set when required. Last
482not least, it also refuses to work with some file descriptors which work 511not least, it also refuses to work with some file descriptors which work
483perfectly fine with C<select> (files, many character devices...). 512perfectly fine with C<select> (files, many character devices...).
484 513
514Epoll is truly the train wreck analog among event poll mechanisms,
515a frankenpoll, cobbled together in a hurry, no thought to design or
516interaction with others.
517
485While stopping, setting and starting an I/O watcher in the same iteration 518While stopping, setting and starting an I/O watcher in the same iteration
486will result in some caching, there is still a system call per such 519will result in some caching, there is still a system call per such
487incident (because the same I<file descriptor> could point to a different 520incident (because the same I<file descriptor> could point to a different
488I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 521I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
489file descriptors might not work very well if you register events for both 522file descriptors might not work very well if you register events for both
554=item C<EVBACKEND_PORT> (value 32, Solaris 10) 587=item C<EVBACKEND_PORT> (value 32, Solaris 10)
555 588
556This uses the Solaris 10 event port mechanism. As with everything on Solaris, 589This uses the Solaris 10 event port mechanism. As with everything on Solaris,
557it's really slow, but it still scales very well (O(active_fds)). 590it's really slow, but it still scales very well (O(active_fds)).
558 591
559Please note that Solaris event ports can deliver a lot of spurious
560notifications, so you need to use non-blocking I/O or other means to avoid
561blocking when no data (or space) is available.
562
563While this backend scales well, it requires one system call per active 592While this backend scales well, it requires one system call per active
564file descriptor per loop iteration. For small and medium numbers of file 593file descriptor per loop iteration. For small and medium numbers of file
565descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 594descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
566might perform better. 595might perform better.
567 596
568On the positive side, with the exception of the spurious readiness 597On the positive side, this backend actually performed fully to
569notifications, this backend actually performed fully to specification
570in all tests and is fully embeddable, which is a rare feat among the 598specification in all tests and is fully embeddable, which is a rare feat
571OS-specific backends (I vastly prefer correctness over speed hacks). 599among the OS-specific backends (I vastly prefer correctness over speed
600hacks).
601
602On the negative side, the interface is I<bizarre> - so bizarre that
603even sun itself gets it wrong in their code examples: The event polling
604function sometimes returning events to the caller even though an error
605occurred, but with no indication whether it has done so or not (yes, it's
606even documented that way) - deadly for edge-triggered interfaces where
607you absolutely have to know whether an event occurred or not because you
608have to re-arm the watcher.
609
610Fortunately libev seems to be able to work around these idiocies.
572 611
573This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 612This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
574C<EVBACKEND_POLL>. 613C<EVBACKEND_POLL>.
575 614
576=item C<EVBACKEND_ALL> 615=item C<EVBACKEND_ALL>
577 616
578Try all backends (even potentially broken ones that wouldn't be tried 617Try all backends (even potentially broken ones that wouldn't be tried
579with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 618with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
580C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 619C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
581 620
582It is definitely not recommended to use this flag. 621It is definitely not recommended to use this flag, use whatever
622C<ev_recommended_backends ()> returns, or simply do not specify a backend
623at all.
624
625=item C<EVBACKEND_MASK>
626
627Not a backend at all, but a mask to select all backend bits from a
628C<flags> value, in case you want to mask out any backends from a flags
629value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
583 630
584=back 631=back
585 632
586If one or more of the backend flags are or'ed into the flags value, 633If one or more of the backend flags are or'ed into the flags value,
587then only these backends will be tried (in the reverse order as listed 634then only these backends will be tried (in the reverse order as listed
616This function is normally used on loop objects allocated by 663This function is normally used on loop objects allocated by
617C<ev_loop_new>, but it can also be used on the default loop returned by 664C<ev_loop_new>, but it can also be used on the default loop returned by
618C<ev_default_loop>, in which case it is not thread-safe. 665C<ev_default_loop>, in which case it is not thread-safe.
619 666
620Note that it is not advisable to call this function on the default loop 667Note that it is not advisable to call this function on the default loop
621except in the rare occasion where you really need to free it's resources. 668except in the rare occasion where you really need to free its resources.
622If you need dynamically allocated loops it is better to use C<ev_loop_new> 669If you need dynamically allocated loops it is better to use C<ev_loop_new>
623and C<ev_loop_destroy>. 670and C<ev_loop_destroy>.
624 671
625=item ev_loop_fork (loop) 672=item ev_loop_fork (loop)
626 673
674prepare and check phases. 721prepare and check phases.
675 722
676=item unsigned int ev_depth (loop) 723=item unsigned int ev_depth (loop)
677 724
678Returns the number of times C<ev_run> was entered minus the number of 725Returns the number of times C<ev_run> was entered minus the number of
679times C<ev_run> was exited, in other words, the recursion depth. 726times C<ev_run> was exited normally, in other words, the recursion depth.
680 727
681Outside C<ev_run>, this number is zero. In a callback, this number is 728Outside C<ev_run>, this number is zero. In a callback, this number is
682C<1>, unless C<ev_run> was invoked recursively (or from another thread), 729C<1>, unless C<ev_run> was invoked recursively (or from another thread),
683in which case it is higher. 730in which case it is higher.
684 731
685Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 732Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
686etc.), doesn't count as "exit" - consider this as a hint to avoid such 733throwing an exception etc.), doesn't count as "exit" - consider this
687ungentleman-like behaviour unless it's really convenient. 734as a hint to avoid such ungentleman-like behaviour unless it's really
735convenient, in which case it is fully supported.
688 736
689=item unsigned int ev_backend (loop) 737=item unsigned int ev_backend (loop)
690 738
691Returns one of the C<EVBACKEND_*> flags indicating the event backend in 739Returns one of the C<EVBACKEND_*> flags indicating the event backend in
692use. 740use.
753relying on all watchers to be stopped when deciding when a program has 801relying on all watchers to be stopped when deciding when a program has
754finished (especially in interactive programs), but having a program 802finished (especially in interactive programs), but having a program
755that automatically loops as long as it has to and no longer by virtue 803that automatically loops as long as it has to and no longer by virtue
756of relying on its watchers stopping correctly, that is truly a thing of 804of relying on its watchers stopping correctly, that is truly a thing of
757beauty. 805beauty.
806
807This function is also I<mostly> exception-safe - you can break out of
808a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
809exception and so on. This does not decrement the C<ev_depth> value, nor
810will it clear any outstanding C<EVBREAK_ONE> breaks.
758 811
759A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 812A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
760those events and any already outstanding ones, but will not wait and 813those events and any already outstanding ones, but will not wait and
761block your process in case there are no events and will return after one 814block your process in case there are no events and will return after one
762iteration of the loop. This is sometimes useful to poll and handle new 815iteration of the loop. This is sometimes useful to poll and handle new
815anymore. 868anymore.
816 869
817 ... queue jobs here, make sure they register event watchers as long 870 ... queue jobs here, make sure they register event watchers as long
818 ... as they still have work to do (even an idle watcher will do..) 871 ... as they still have work to do (even an idle watcher will do..)
819 ev_run (my_loop, 0); 872 ev_run (my_loop, 0);
820 ... jobs done or somebody called unloop. yeah! 873 ... jobs done or somebody called break. yeah!
821 874
822=item ev_break (loop, how) 875=item ev_break (loop, how)
823 876
824Can be used to make a call to C<ev_run> return early (but only after it 877Can be used to make a call to C<ev_run> return early (but only after it
825has processed all outstanding events). The C<how> argument must be either 878has processed all outstanding events). The C<how> argument must be either
826C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or 879C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
827C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return. 880C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
828 881
829This "break state" will be cleared when entering C<ev_run> again. 882This "break state" will be cleared on the next call to C<ev_run>.
830 883
831It is safe to call C<ev_break> from outside any C<ev_run> calls, too. 884It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
885which case it will have no effect.
832 886
833=item ev_ref (loop) 887=item ev_ref (loop)
834 888
835=item ev_unref (loop) 889=item ev_unref (loop)
836 890
857running when nothing else is active. 911running when nothing else is active.
858 912
859 ev_signal exitsig; 913 ev_signal exitsig;
860 ev_signal_init (&exitsig, sig_cb, SIGINT); 914 ev_signal_init (&exitsig, sig_cb, SIGINT);
861 ev_signal_start (loop, &exitsig); 915 ev_signal_start (loop, &exitsig);
862 evf_unref (loop); 916 ev_unref (loop);
863 917
864Example: For some weird reason, unregister the above signal handler again. 918Example: For some weird reason, unregister the above signal handler again.
865 919
866 ev_ref (loop); 920 ev_ref (loop);
867 ev_signal_stop (loop, &exitsig); 921 ev_signal_stop (loop, &exitsig);
979See also the locking example in the C<THREADS> section later in this 1033See also the locking example in the C<THREADS> section later in this
980document. 1034document.
981 1035
982=item ev_set_userdata (loop, void *data) 1036=item ev_set_userdata (loop, void *data)
983 1037
984=item ev_userdata (loop) 1038=item void *ev_userdata (loop)
985 1039
986Set and retrieve a single C<void *> associated with a loop. When 1040Set and retrieve a single C<void *> associated with a loop. When
987C<ev_set_userdata> has never been called, then C<ev_userdata> returns 1041C<ev_set_userdata> has never been called, then C<ev_userdata> returns
988C<0.> 1042C<0>.
989 1043
990These two functions can be used to associate arbitrary data with a loop, 1044These two functions can be used to associate arbitrary data with a loop,
991and are intended solely for the C<invoke_pending_cb>, C<release> and 1045and are intended solely for the C<invoke_pending_cb>, C<release> and
992C<acquire> callbacks described above, but of course can be (ab-)used for 1046C<acquire> callbacks described above, but of course can be (ab-)used for
993any other purpose as well. 1047any other purpose as well.
1306See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1360See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1307functions that do not need a watcher. 1361functions that do not need a watcher.
1308 1362
1309=back 1363=back
1310 1364
1311=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1365See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1312 1366OWN COMPOSITE WATCHERS> idioms.
1313Each watcher has, by default, a member C<void *data> that you can change
1314and read at any time: libev will completely ignore it. This can be used
1315to associate arbitrary data with your watcher. If you need more data and
1316don't want to allocate memory and store a pointer to it in that data
1317member, you can also "subclass" the watcher type and provide your own
1318data:
1319
1320 struct my_io
1321 {
1322 ev_io io;
1323 int otherfd;
1324 void *somedata;
1325 struct whatever *mostinteresting;
1326 };
1327
1328 ...
1329 struct my_io w;
1330 ev_io_init (&w.io, my_cb, fd, EV_READ);
1331
1332And since your callback will be called with a pointer to the watcher, you
1333can cast it back to your own type:
1334
1335 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1336 {
1337 struct my_io *w = (struct my_io *)w_;
1338 ...
1339 }
1340
1341More interesting and less C-conformant ways of casting your callback type
1342instead have been omitted.
1343
1344Another common scenario is to use some data structure with multiple
1345embedded watchers:
1346
1347 struct my_biggy
1348 {
1349 int some_data;
1350 ev_timer t1;
1351 ev_timer t2;
1352 }
1353
1354In this case getting the pointer to C<my_biggy> is a bit more
1355complicated: Either you store the address of your C<my_biggy> struct
1356in the C<data> member of the watcher (for woozies), or you need to use
1357some pointer arithmetic using C<offsetof> inside your watchers (for real
1358programmers):
1359
1360 #include <stddef.h>
1361
1362 static void
1363 t1_cb (EV_P_ ev_timer *w, int revents)
1364 {
1365 struct my_biggy big = (struct my_biggy *)
1366 (((char *)w) - offsetof (struct my_biggy, t1));
1367 }
1368
1369 static void
1370 t2_cb (EV_P_ ev_timer *w, int revents)
1371 {
1372 struct my_biggy big = (struct my_biggy *)
1373 (((char *)w) - offsetof (struct my_biggy, t2));
1374 }
1375 1367
1376=head2 WATCHER STATES 1368=head2 WATCHER STATES
1377 1369
1378There are various watcher states mentioned throughout this manual - 1370There are various watcher states mentioned throughout this manual -
1379active, pending and so on. In this section these states and the rules to 1371active, pending and so on. In this section these states and the rules to
1386 1378
1387Before a watcher can be registered with the event looop it has to be 1379Before a watcher can be registered with the event looop it has to be
1388initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1380initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1389C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1381C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1390 1382
1391In this state it is simply some block of memory that is suitable for use 1383In this state it is simply some block of memory that is suitable for
1392in an event loop. It can be moved around, freed, reused etc. at will. 1384use in an event loop. It can be moved around, freed, reused etc. at
1385will - as long as you either keep the memory contents intact, or call
1386C<ev_TYPE_init> again.
1393 1387
1394=item started/running/active 1388=item started/running/active
1395 1389
1396Once a watcher has been started with a call to C<ev_TYPE_start> it becomes 1390Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1397property of the event loop, and is actively waiting for events. While in 1391property of the event loop, and is actively waiting for events. While in
1425latter will clear any pending state the watcher might be in, regardless 1419latter will clear any pending state the watcher might be in, regardless
1426of whether it was active or not, so stopping a watcher explicitly before 1420of whether it was active or not, so stopping a watcher explicitly before
1427freeing it is often a good idea. 1421freeing it is often a good idea.
1428 1422
1429While stopped (and not pending) the watcher is essentially in the 1423While stopped (and not pending) the watcher is essentially in the
1430initialised state, that is it can be reused, moved, modified in any way 1424initialised state, that is, it can be reused, moved, modified in any way
1431you wish. 1425you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
1426it again).
1432 1427
1433=back 1428=back
1434 1429
1435=head2 WATCHER PRIORITY MODELS 1430=head2 WATCHER PRIORITY MODELS
1436 1431
1565In general you can register as many read and/or write event watchers per 1560In general you can register as many read and/or write event watchers per
1566fd as you want (as long as you don't confuse yourself). Setting all file 1561fd as you want (as long as you don't confuse yourself). Setting all file
1567descriptors to non-blocking mode is also usually a good idea (but not 1562descriptors to non-blocking mode is also usually a good idea (but not
1568required if you know what you are doing). 1563required if you know what you are doing).
1569 1564
1570If you cannot use non-blocking mode, then force the use of a
1571known-to-be-good backend (at the time of this writing, this includes only
1572C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1573descriptors for which non-blocking operation makes no sense (such as
1574files) - libev doesn't guarantee any specific behaviour in that case.
1575
1576Another thing you have to watch out for is that it is quite easy to 1565Another thing you have to watch out for is that it is quite easy to
1577receive "spurious" readiness notifications, that is your callback might 1566receive "spurious" readiness notifications, that is, your callback might
1578be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1567be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1579because there is no data. Not only are some backends known to create a 1568because there is no data. It is very easy to get into this situation even
1580lot of those (for example Solaris ports), it is very easy to get into 1569with a relatively standard program structure. Thus it is best to always
1581this situation even with a relatively standard program structure. Thus 1570use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1582it is best to always use non-blocking I/O: An extra C<read>(2) returning
1583C<EAGAIN> is far preferable to a program hanging until some data arrives. 1571preferable to a program hanging until some data arrives.
1584 1572
1585If you cannot run the fd in non-blocking mode (for example you should 1573If you cannot run the fd in non-blocking mode (for example you should
1586not play around with an Xlib connection), then you have to separately 1574not play around with an Xlib connection), then you have to separately
1587re-test whether a file descriptor is really ready with a known-to-be good 1575re-test whether a file descriptor is really ready with a known-to-be good
1588interface such as poll (fortunately in our Xlib example, Xlib already 1576interface such as poll (fortunately in the case of Xlib, it already does
1589does this on its own, so its quite safe to use). Some people additionally 1577this on its own, so its quite safe to use). Some people additionally
1590use C<SIGALRM> and an interval timer, just to be sure you won't block 1578use C<SIGALRM> and an interval timer, just to be sure you won't block
1591indefinitely. 1579indefinitely.
1592 1580
1593But really, best use non-blocking mode. 1581But really, best use non-blocking mode.
1594 1582
1622 1610
1623There is no workaround possible except not registering events 1611There is no workaround possible except not registering events
1624for potentially C<dup ()>'ed file descriptors, or to resort to 1612for potentially C<dup ()>'ed file descriptors, or to resort to
1625C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1613C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1626 1614
1615=head3 The special problem of files
1616
1617Many people try to use C<select> (or libev) on file descriptors
1618representing files, and expect it to become ready when their program
1619doesn't block on disk accesses (which can take a long time on their own).
1620
1621However, this cannot ever work in the "expected" way - you get a readiness
1622notification as soon as the kernel knows whether and how much data is
1623there, and in the case of open files, that's always the case, so you
1624always get a readiness notification instantly, and your read (or possibly
1625write) will still block on the disk I/O.
1626
1627Another way to view it is that in the case of sockets, pipes, character
1628devices and so on, there is another party (the sender) that delivers data
1629on its own, but in the case of files, there is no such thing: the disk
1630will not send data on its own, simply because it doesn't know what you
1631wish to read - you would first have to request some data.
1632
1633Since files are typically not-so-well supported by advanced notification
1634mechanism, libev tries hard to emulate POSIX behaviour with respect
1635to files, even though you should not use it. The reason for this is
1636convenience: sometimes you want to watch STDIN or STDOUT, which is
1637usually a tty, often a pipe, but also sometimes files or special devices
1638(for example, C<epoll> on Linux works with F</dev/random> but not with
1639F</dev/urandom>), and even though the file might better be served with
1640asynchronous I/O instead of with non-blocking I/O, it is still useful when
1641it "just works" instead of freezing.
1642
1643So avoid file descriptors pointing to files when you know it (e.g. use
1644libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
1645when you rarely read from a file instead of from a socket, and want to
1646reuse the same code path.
1647
1627=head3 The special problem of fork 1648=head3 The special problem of fork
1628 1649
1629Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1650Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1630useless behaviour. Libev fully supports fork, but needs to be told about 1651useless behaviour. Libev fully supports fork, but needs to be told about
1631it in the child. 1652it in the child if you want to continue to use it in the child.
1632 1653
1633To support fork in your programs, you either have to call 1654To support fork in your child processes, you have to call C<ev_loop_fork
1634C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1655()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1635enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1656C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1636C<EVBACKEND_POLL>.
1637 1657
1638=head3 The special problem of SIGPIPE 1658=head3 The special problem of SIGPIPE
1639 1659
1640While not really specific to libev, it is easy to forget about C<SIGPIPE>: 1660While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1641when writing to a pipe whose other end has been closed, your program gets 1661when writing to a pipe whose other end has been closed, your program gets
2131 2151
2132Another way to think about it (for the mathematically inclined) is that 2152Another way to think about it (for the mathematically inclined) is that
2133C<ev_periodic> will try to run the callback in this mode at the next possible 2153C<ev_periodic> will try to run the callback in this mode at the next possible
2134time where C<time = offset (mod interval)>, regardless of any time jumps. 2154time where C<time = offset (mod interval)>, regardless of any time jumps.
2135 2155
2136For numerical stability it is preferable that the C<offset> value is near 2156The C<interval> I<MUST> be positive, and for numerical stability, the
2137C<ev_now ()> (the current time), but there is no range requirement for 2157interval value should be higher than C<1/8192> (which is around 100
2138this value, and in fact is often specified as zero. 2158microseconds) and C<offset> should be higher than C<0> and should have
2159at most a similar magnitude as the current time (say, within a factor of
2160ten). Typical values for offset are, in fact, C<0> or something between
2161C<0> and C<interval>, which is also the recommended range.
2139 2162
2140Note also that there is an upper limit to how often a timer can fire (CPU 2163Note also that there is an upper limit to how often a timer can fire (CPU
2141speed for example), so if C<interval> is very small then timing stability 2164speed for example), so if C<interval> is very small then timing stability
2142will of course deteriorate. Libev itself tries to be exact to be about one 2165will of course deteriorate. Libev itself tries to be exact to be about one
2143millisecond (if the OS supports it and the machine is fast enough). 2166millisecond (if the OS supports it and the machine is fast enough).
2257 2280
2258=head2 C<ev_signal> - signal me when a signal gets signalled! 2281=head2 C<ev_signal> - signal me when a signal gets signalled!
2259 2282
2260Signal watchers will trigger an event when the process receives a specific 2283Signal watchers will trigger an event when the process receives a specific
2261signal one or more times. Even though signals are very asynchronous, libev 2284signal one or more times. Even though signals are very asynchronous, libev
2262will try it's best to deliver signals synchronously, i.e. as part of the 2285will try its best to deliver signals synchronously, i.e. as part of the
2263normal event processing, like any other event. 2286normal event processing, like any other event.
2264 2287
2265If you want signals to be delivered truly asynchronously, just use 2288If you want signals to be delivered truly asynchronously, just use
2266C<sigaction> as you would do without libev and forget about sharing 2289C<sigaction> as you would do without libev and forget about sharing
2267the signal. You can even use C<ev_async> from a signal handler to 2290the signal. You can even use C<ev_async> from a signal handler to
2286=head3 The special problem of inheritance over fork/execve/pthread_create 2309=head3 The special problem of inheritance over fork/execve/pthread_create
2287 2310
2288Both the signal mask (C<sigprocmask>) and the signal disposition 2311Both the signal mask (C<sigprocmask>) and the signal disposition
2289(C<sigaction>) are unspecified after starting a signal watcher (and after 2312(C<sigaction>) are unspecified after starting a signal watcher (and after
2290stopping it again), that is, libev might or might not block the signal, 2313stopping it again), that is, libev might or might not block the signal,
2291and might or might not set or restore the installed signal handler. 2314and might or might not set or restore the installed signal handler (but
2315see C<EVFLAG_NOSIGMASK>).
2292 2316
2293While this does not matter for the signal disposition (libev never 2317While this does not matter for the signal disposition (libev never
2294sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on 2318sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2295C<execve>), this matters for the signal mask: many programs do not expect 2319C<execve>), this matters for the signal mask: many programs do not expect
2296certain signals to be blocked. 2320certain signals to be blocked.
2309I<has> to modify the signal mask, at least temporarily. 2333I<has> to modify the signal mask, at least temporarily.
2310 2334
2311So I can't stress this enough: I<If you do not reset your signal mask when 2335So I can't stress this enough: I<If you do not reset your signal mask when
2312you expect it to be empty, you have a race condition in your code>. This 2336you expect it to be empty, you have a race condition in your code>. This
2313is not a libev-specific thing, this is true for most event libraries. 2337is not a libev-specific thing, this is true for most event libraries.
2338
2339=head3 The special problem of threads signal handling
2340
2341POSIX threads has problematic signal handling semantics, specifically,
2342a lot of functionality (sigfd, sigwait etc.) only really works if all
2343threads in a process block signals, which is hard to achieve.
2344
2345When you want to use sigwait (or mix libev signal handling with your own
2346for the same signals), you can tackle this problem by globally blocking
2347all signals before creating any threads (or creating them with a fully set
2348sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
2349loops. Then designate one thread as "signal receiver thread" which handles
2350these signals. You can pass on any signals that libev might be interested
2351in by calling C<ev_feed_signal>.
2314 2352
2315=head3 Watcher-Specific Functions and Data Members 2353=head3 Watcher-Specific Functions and Data Members
2316 2354
2317=over 4 2355=over 4
2318 2356
3153 atexit (program_exits); 3191 atexit (program_exits);
3154 3192
3155 3193
3156=head2 C<ev_async> - how to wake up an event loop 3194=head2 C<ev_async> - how to wake up an event loop
3157 3195
3158In general, you cannot use an C<ev_run> from multiple threads or other 3196In general, you cannot use an C<ev_loop> from multiple threads or other
3159asynchronous sources such as signal handlers (as opposed to multiple event 3197asynchronous sources such as signal handlers (as opposed to multiple event
3160loops - those are of course safe to use in different threads). 3198loops - those are of course safe to use in different threads).
3161 3199
3162Sometimes, however, you need to wake up an event loop you do not control, 3200Sometimes, however, you need to wake up an event loop you do not control,
3163for example because it belongs to another thread. This is what C<ev_async> 3201for example because it belongs to another thread. This is what C<ev_async>
3165it by calling C<ev_async_send>, which is thread- and signal safe. 3203it by calling C<ev_async_send>, which is thread- and signal safe.
3166 3204
3167This functionality is very similar to C<ev_signal> watchers, as signals, 3205This functionality is very similar to C<ev_signal> watchers, as signals,
3168too, are asynchronous in nature, and signals, too, will be compressed 3206too, are asynchronous in nature, and signals, too, will be compressed
3169(i.e. the number of callback invocations may be less than the number of 3207(i.e. the number of callback invocations may be less than the number of
3170C<ev_async_sent> calls). 3208C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3209of "global async watchers" by using a watcher on an otherwise unused
3210signal, and C<ev_feed_signal> to signal this watcher from another thread,
3211even without knowing which loop owns the signal.
3171 3212
3172Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not 3213Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3173just the default loop. 3214just the default loop.
3174 3215
3175=head3 Queueing 3216=head3 Queueing
3270trust me. 3311trust me.
3271 3312
3272=item ev_async_send (loop, ev_async *) 3313=item ev_async_send (loop, ev_async *)
3273 3314
3274Sends/signals/activates the given C<ev_async> watcher, that is, feeds 3315Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3275an C<EV_ASYNC> event on the watcher into the event loop. Unlike 3316an C<EV_ASYNC> event on the watcher into the event loop, and instantly
3317returns.
3318
3276C<ev_feed_event>, this call is safe to do from other threads, signal or 3319Unlike C<ev_feed_event>, this call is safe to do from other threads,
3277similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding 3320signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3278section below on what exactly this means). 3321embedding section below on what exactly this means).
3279 3322
3280Note that, as with other watchers in libev, multiple events might get 3323Note that, as with other watchers in libev, multiple events might get
3281compressed into a single callback invocation (another way to look at this 3324compressed into a single callback invocation (another way to look at this
3282is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>, 3325is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
3283reset when the event loop detects that). 3326reset when the event loop detects that).
3351Feed an event on the given fd, as if a file descriptor backend detected 3394Feed an event on the given fd, as if a file descriptor backend detected
3352the given events it. 3395the given events it.
3353 3396
3354=item ev_feed_signal_event (loop, int signum) 3397=item ev_feed_signal_event (loop, int signum)
3355 3398
3356Feed an event as if the given signal occurred (C<loop> must be the default 3399Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3357loop!). 3400which is async-safe.
3358 3401
3359=back 3402=back
3403
3404
3405=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3406
3407This section explains some common idioms that are not immediately
3408obvious. Note that examples are sprinkled over the whole manual, and this
3409section only contains stuff that wouldn't fit anywhere else.
3410
3411=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3412
3413Each watcher has, by default, a C<void *data> member that you can read
3414or modify at any time: libev will completely ignore it. This can be used
3415to associate arbitrary data with your watcher. If you need more data and
3416don't want to allocate memory separately and store a pointer to it in that
3417data member, you can also "subclass" the watcher type and provide your own
3418data:
3419
3420 struct my_io
3421 {
3422 ev_io io;
3423 int otherfd;
3424 void *somedata;
3425 struct whatever *mostinteresting;
3426 };
3427
3428 ...
3429 struct my_io w;
3430 ev_io_init (&w.io, my_cb, fd, EV_READ);
3431
3432And since your callback will be called with a pointer to the watcher, you
3433can cast it back to your own type:
3434
3435 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
3436 {
3437 struct my_io *w = (struct my_io *)w_;
3438 ...
3439 }
3440
3441More interesting and less C-conformant ways of casting your callback
3442function type instead have been omitted.
3443
3444=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
3445
3446Another common scenario is to use some data structure with multiple
3447embedded watchers, in effect creating your own watcher that combines
3448multiple libev event sources into one "super-watcher":
3449
3450 struct my_biggy
3451 {
3452 int some_data;
3453 ev_timer t1;
3454 ev_timer t2;
3455 }
3456
3457In this case getting the pointer to C<my_biggy> is a bit more
3458complicated: Either you store the address of your C<my_biggy> struct in
3459the C<data> member of the watcher (for woozies or C++ coders), or you need
3460to use some pointer arithmetic using C<offsetof> inside your watchers (for
3461real programmers):
3462
3463 #include <stddef.h>
3464
3465 static void
3466 t1_cb (EV_P_ ev_timer *w, int revents)
3467 {
3468 struct my_biggy big = (struct my_biggy *)
3469 (((char *)w) - offsetof (struct my_biggy, t1));
3470 }
3471
3472 static void
3473 t2_cb (EV_P_ ev_timer *w, int revents)
3474 {
3475 struct my_biggy big = (struct my_biggy *)
3476 (((char *)w) - offsetof (struct my_biggy, t2));
3477 }
3478
3479=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3480
3481Often (especially in GUI toolkits) there are places where you have
3482I<modal> interaction, which is most easily implemented by recursively
3483invoking C<ev_run>.
3484
3485This brings the problem of exiting - a callback might want to finish the
3486main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3487a modal "Are you sure?" dialog is still waiting), or just the nested one
3488and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3489other combination: In these cases, C<ev_break> will not work alone.
3490
3491The solution is to maintain "break this loop" variable for each C<ev_run>
3492invocation, and use a loop around C<ev_run> until the condition is
3493triggered, using C<EVRUN_ONCE>:
3494
3495 // main loop
3496 int exit_main_loop = 0;
3497
3498 while (!exit_main_loop)
3499 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3500
3501 // in a model watcher
3502 int exit_nested_loop = 0;
3503
3504 while (!exit_nested_loop)
3505 ev_run (EV_A_ EVRUN_ONCE);
3506
3507To exit from any of these loops, just set the corresponding exit variable:
3508
3509 // exit modal loop
3510 exit_nested_loop = 1;
3511
3512 // exit main program, after modal loop is finished
3513 exit_main_loop = 1;
3514
3515 // exit both
3516 exit_main_loop = exit_nested_loop = 1;
3517
3518=head2 THREAD LOCKING EXAMPLE
3519
3520Here is a fictitious example of how to run an event loop in a different
3521thread from where callbacks are being invoked and watchers are
3522created/added/removed.
3523
3524For a real-world example, see the C<EV::Loop::Async> perl module,
3525which uses exactly this technique (which is suited for many high-level
3526languages).
3527
3528The example uses a pthread mutex to protect the loop data, a condition
3529variable to wait for callback invocations, an async watcher to notify the
3530event loop thread and an unspecified mechanism to wake up the main thread.
3531
3532First, you need to associate some data with the event loop:
3533
3534 typedef struct {
3535 mutex_t lock; /* global loop lock */
3536 ev_async async_w;
3537 thread_t tid;
3538 cond_t invoke_cv;
3539 } userdata;
3540
3541 void prepare_loop (EV_P)
3542 {
3543 // for simplicity, we use a static userdata struct.
3544 static userdata u;
3545
3546 ev_async_init (&u->async_w, async_cb);
3547 ev_async_start (EV_A_ &u->async_w);
3548
3549 pthread_mutex_init (&u->lock, 0);
3550 pthread_cond_init (&u->invoke_cv, 0);
3551
3552 // now associate this with the loop
3553 ev_set_userdata (EV_A_ u);
3554 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3555 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3556
3557 // then create the thread running ev_run
3558 pthread_create (&u->tid, 0, l_run, EV_A);
3559 }
3560
3561The callback for the C<ev_async> watcher does nothing: the watcher is used
3562solely to wake up the event loop so it takes notice of any new watchers
3563that might have been added:
3564
3565 static void
3566 async_cb (EV_P_ ev_async *w, int revents)
3567 {
3568 // just used for the side effects
3569 }
3570
3571The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
3572protecting the loop data, respectively.
3573
3574 static void
3575 l_release (EV_P)
3576 {
3577 userdata *u = ev_userdata (EV_A);
3578 pthread_mutex_unlock (&u->lock);
3579 }
3580
3581 static void
3582 l_acquire (EV_P)
3583 {
3584 userdata *u = ev_userdata (EV_A);
3585 pthread_mutex_lock (&u->lock);
3586 }
3587
3588The event loop thread first acquires the mutex, and then jumps straight
3589into C<ev_run>:
3590
3591 void *
3592 l_run (void *thr_arg)
3593 {
3594 struct ev_loop *loop = (struct ev_loop *)thr_arg;
3595
3596 l_acquire (EV_A);
3597 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
3598 ev_run (EV_A_ 0);
3599 l_release (EV_A);
3600
3601 return 0;
3602 }
3603
3604Instead of invoking all pending watchers, the C<l_invoke> callback will
3605signal the main thread via some unspecified mechanism (signals? pipe
3606writes? C<Async::Interrupt>?) and then waits until all pending watchers
3607have been called (in a while loop because a) spurious wakeups are possible
3608and b) skipping inter-thread-communication when there are no pending
3609watchers is very beneficial):
3610
3611 static void
3612 l_invoke (EV_P)
3613 {
3614 userdata *u = ev_userdata (EV_A);
3615
3616 while (ev_pending_count (EV_A))
3617 {
3618 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
3619 pthread_cond_wait (&u->invoke_cv, &u->lock);
3620 }
3621 }
3622
3623Now, whenever the main thread gets told to invoke pending watchers, it
3624will grab the lock, call C<ev_invoke_pending> and then signal the loop
3625thread to continue:
3626
3627 static void
3628 real_invoke_pending (EV_P)
3629 {
3630 userdata *u = ev_userdata (EV_A);
3631
3632 pthread_mutex_lock (&u->lock);
3633 ev_invoke_pending (EV_A);
3634 pthread_cond_signal (&u->invoke_cv);
3635 pthread_mutex_unlock (&u->lock);
3636 }
3637
3638Whenever you want to start/stop a watcher or do other modifications to an
3639event loop, you will now have to lock:
3640
3641 ev_timer timeout_watcher;
3642 userdata *u = ev_userdata (EV_A);
3643
3644 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
3645
3646 pthread_mutex_lock (&u->lock);
3647 ev_timer_start (EV_A_ &timeout_watcher);
3648 ev_async_send (EV_A_ &u->async_w);
3649 pthread_mutex_unlock (&u->lock);
3650
3651Note that sending the C<ev_async> watcher is required because otherwise
3652an event loop currently blocking in the kernel will have no knowledge
3653about the newly added timer. By waking up the loop it will pick up any new
3654watchers in the next event loop iteration.
3655
3656=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
3657
3658While the overhead of a callback that e.g. schedules a thread is small, it
3659is still an overhead. If you embed libev, and your main usage is with some
3660kind of threads or coroutines, you might want to customise libev so that
3661doesn't need callbacks anymore.
3662
3663Imagine you have coroutines that you can switch to using a function
3664C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
3665and that due to some magic, the currently active coroutine is stored in a
3666global called C<current_coro>. Then you can build your own "wait for libev
3667event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
3668the differing C<;> conventions):
3669
3670 #define EV_CB_DECLARE(type) struct my_coro *cb;
3671 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3672
3673That means instead of having a C callback function, you store the
3674coroutine to switch to in each watcher, and instead of having libev call
3675your callback, you instead have it switch to that coroutine.
3676
3677A coroutine might now wait for an event with a function called
3678C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
3679matter when, or whether the watcher is active or not when this function is
3680called):
3681
3682 void
3683 wait_for_event (ev_watcher *w)
3684 {
3685 ev_cb_set (w) = current_coro;
3686 switch_to (libev_coro);
3687 }
3688
3689That basically suspends the coroutine inside C<wait_for_event> and
3690continues the libev coroutine, which, when appropriate, switches back to
3691this or any other coroutine. I am sure if you sue this your own :)
3692
3693You can do similar tricks if you have, say, threads with an event queue -
3694instead of storing a coroutine, you store the queue object and instead of
3695switching to a coroutine, you push the watcher onto the queue and notify
3696any waiters.
3697
3698To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
3699files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3700
3701 // my_ev.h
3702 #define EV_CB_DECLARE(type) struct my_coro *cb;
3703 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3704 #include "../libev/ev.h"
3705
3706 // my_ev.c
3707 #define EV_H "my_ev.h"
3708 #include "../libev/ev.c"
3709
3710And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
3711F<my_ev.c> into your project. When properly specifying include paths, you
3712can even use F<ev.h> as header file name directly.
3360 3713
3361 3714
3362=head1 LIBEVENT EMULATION 3715=head1 LIBEVENT EMULATION
3363 3716
3364Libev offers a compatibility emulation layer for libevent. It cannot 3717Libev offers a compatibility emulation layer for libevent. It cannot
3365emulate the internals of libevent, so here are some usage hints: 3718emulate the internals of libevent, so here are some usage hints:
3366 3719
3367=over 4 3720=over 4
3721
3722=item * Only the libevent-1.4.1-beta API is being emulated.
3723
3724This was the newest libevent version available when libev was implemented,
3725and is still mostly unchanged in 2010.
3368 3726
3369=item * Use it by including <event.h>, as usual. 3727=item * Use it by including <event.h>, as usual.
3370 3728
3371=item * The following members are fully supported: ev_base, ev_callback, 3729=item * The following members are fully supported: ev_base, ev_callback,
3372ev_arg, ev_fd, ev_res, ev_events. 3730ev_arg, ev_fd, ev_res, ev_events.
3378=item * Priorities are not currently supported. Initialising priorities 3736=item * Priorities are not currently supported. Initialising priorities
3379will fail and all watchers will have the same priority, even though there 3737will fail and all watchers will have the same priority, even though there
3380is an ev_pri field. 3738is an ev_pri field.
3381 3739
3382=item * In libevent, the last base created gets the signals, in libev, the 3740=item * In libevent, the last base created gets the signals, in libev, the
3383first base created (== the default loop) gets the signals. 3741base that registered the signal gets the signals.
3384 3742
3385=item * Other members are not supported. 3743=item * Other members are not supported.
3386 3744
3387=item * The libev emulation is I<not> ABI compatible to libevent, you need 3745=item * The libev emulation is I<not> ABI compatible to libevent, you need
3388to use the libev header file and library. 3746to use the libev header file and library.
3407Care has been taken to keep the overhead low. The only data member the C++ 3765Care has been taken to keep the overhead low. The only data member the C++
3408classes add (compared to plain C-style watchers) is the event loop pointer 3766classes add (compared to plain C-style watchers) is the event loop pointer
3409that the watcher is associated with (or no additional members at all if 3767that the watcher is associated with (or no additional members at all if
3410you disable C<EV_MULTIPLICITY> when embedding libev). 3768you disable C<EV_MULTIPLICITY> when embedding libev).
3411 3769
3412Currently, functions, and static and non-static member functions can be 3770Currently, functions, static and non-static member functions and classes
3413used as callbacks. Other types should be easy to add as long as they only 3771with C<operator ()> can be used as callbacks. Other types should be easy
3414need one additional pointer for context. If you need support for other 3772to add as long as they only need one additional pointer for context. If
3415types of functors please contact the author (preferably after implementing 3773you need support for other types of functors please contact the author
3416it). 3774(preferably after implementing it).
3417 3775
3418Here is a list of things available in the C<ev> namespace: 3776Here is a list of things available in the C<ev> namespace:
3419 3777
3420=over 4 3778=over 4
3421 3779
3849F<event.h> that are not directly supported by the libev core alone. 4207F<event.h> that are not directly supported by the libev core alone.
3850 4208
3851In standalone mode, libev will still try to automatically deduce the 4209In standalone mode, libev will still try to automatically deduce the
3852configuration, but has to be more conservative. 4210configuration, but has to be more conservative.
3853 4211
4212=item EV_USE_FLOOR
4213
4214If defined to be C<1>, libev will use the C<floor ()> function for its
4215periodic reschedule calculations, otherwise libev will fall back on a
4216portable (slower) implementation. If you enable this, you usually have to
4217link against libm or something equivalent. Enabling this when the C<floor>
4218function is not available will fail, so the safe default is to not enable
4219this.
4220
3854=item EV_USE_MONOTONIC 4221=item EV_USE_MONOTONIC
3855 4222
3856If defined to be C<1>, libev will try to detect the availability of the 4223If defined to be C<1>, libev will try to detect the availability of the
3857monotonic clock option at both compile time and runtime. Otherwise no 4224monotonic clock option at both compile time and runtime. Otherwise no
3858use of the monotonic clock option will be attempted. If you enable this, 4225use of the monotonic clock option will be attempted. If you enable this,
4289And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4656And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4290 4657
4291 #include "ev_cpp.h" 4658 #include "ev_cpp.h"
4292 #include "ev.c" 4659 #include "ev.c"
4293 4660
4294=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4661=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4295 4662
4296=head2 THREADS AND COROUTINES 4663=head2 THREADS AND COROUTINES
4297 4664
4298=head3 THREADS 4665=head3 THREADS
4299 4666
4350default loop and triggering an C<ev_async> watcher from the default loop 4717default loop and triggering an C<ev_async> watcher from the default loop
4351watcher callback into the event loop interested in the signal. 4718watcher callback into the event loop interested in the signal.
4352 4719
4353=back 4720=back
4354 4721
4355=head4 THREAD LOCKING EXAMPLE 4722See also L<THREAD LOCKING EXAMPLE>.
4356
4357Here is a fictitious example of how to run an event loop in a different
4358thread than where callbacks are being invoked and watchers are
4359created/added/removed.
4360
4361For a real-world example, see the C<EV::Loop::Async> perl module,
4362which uses exactly this technique (which is suited for many high-level
4363languages).
4364
4365The example uses a pthread mutex to protect the loop data, a condition
4366variable to wait for callback invocations, an async watcher to notify the
4367event loop thread and an unspecified mechanism to wake up the main thread.
4368
4369First, you need to associate some data with the event loop:
4370
4371 typedef struct {
4372 mutex_t lock; /* global loop lock */
4373 ev_async async_w;
4374 thread_t tid;
4375 cond_t invoke_cv;
4376 } userdata;
4377
4378 void prepare_loop (EV_P)
4379 {
4380 // for simplicity, we use a static userdata struct.
4381 static userdata u;
4382
4383 ev_async_init (&u->async_w, async_cb);
4384 ev_async_start (EV_A_ &u->async_w);
4385
4386 pthread_mutex_init (&u->lock, 0);
4387 pthread_cond_init (&u->invoke_cv, 0);
4388
4389 // now associate this with the loop
4390 ev_set_userdata (EV_A_ u);
4391 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4392 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4393
4394 // then create the thread running ev_loop
4395 pthread_create (&u->tid, 0, l_run, EV_A);
4396 }
4397
4398The callback for the C<ev_async> watcher does nothing: the watcher is used
4399solely to wake up the event loop so it takes notice of any new watchers
4400that might have been added:
4401
4402 static void
4403 async_cb (EV_P_ ev_async *w, int revents)
4404 {
4405 // just used for the side effects
4406 }
4407
4408The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4409protecting the loop data, respectively.
4410
4411 static void
4412 l_release (EV_P)
4413 {
4414 userdata *u = ev_userdata (EV_A);
4415 pthread_mutex_unlock (&u->lock);
4416 }
4417
4418 static void
4419 l_acquire (EV_P)
4420 {
4421 userdata *u = ev_userdata (EV_A);
4422 pthread_mutex_lock (&u->lock);
4423 }
4424
4425The event loop thread first acquires the mutex, and then jumps straight
4426into C<ev_run>:
4427
4428 void *
4429 l_run (void *thr_arg)
4430 {
4431 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4432
4433 l_acquire (EV_A);
4434 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4435 ev_run (EV_A_ 0);
4436 l_release (EV_A);
4437
4438 return 0;
4439 }
4440
4441Instead of invoking all pending watchers, the C<l_invoke> callback will
4442signal the main thread via some unspecified mechanism (signals? pipe
4443writes? C<Async::Interrupt>?) and then waits until all pending watchers
4444have been called (in a while loop because a) spurious wakeups are possible
4445and b) skipping inter-thread-communication when there are no pending
4446watchers is very beneficial):
4447
4448 static void
4449 l_invoke (EV_P)
4450 {
4451 userdata *u = ev_userdata (EV_A);
4452
4453 while (ev_pending_count (EV_A))
4454 {
4455 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4456 pthread_cond_wait (&u->invoke_cv, &u->lock);
4457 }
4458 }
4459
4460Now, whenever the main thread gets told to invoke pending watchers, it
4461will grab the lock, call C<ev_invoke_pending> and then signal the loop
4462thread to continue:
4463
4464 static void
4465 real_invoke_pending (EV_P)
4466 {
4467 userdata *u = ev_userdata (EV_A);
4468
4469 pthread_mutex_lock (&u->lock);
4470 ev_invoke_pending (EV_A);
4471 pthread_cond_signal (&u->invoke_cv);
4472 pthread_mutex_unlock (&u->lock);
4473 }
4474
4475Whenever you want to start/stop a watcher or do other modifications to an
4476event loop, you will now have to lock:
4477
4478 ev_timer timeout_watcher;
4479 userdata *u = ev_userdata (EV_A);
4480
4481 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4482
4483 pthread_mutex_lock (&u->lock);
4484 ev_timer_start (EV_A_ &timeout_watcher);
4485 ev_async_send (EV_A_ &u->async_w);
4486 pthread_mutex_unlock (&u->lock);
4487
4488Note that sending the C<ev_async> watcher is required because otherwise
4489an event loop currently blocking in the kernel will have no knowledge
4490about the newly added timer. By waking up the loop it will pick up any new
4491watchers in the next event loop iteration.
4492 4723
4493=head3 COROUTINES 4724=head3 COROUTINES
4494 4725
4495Libev is very accommodating to coroutines ("cooperative threads"): 4726Libev is very accommodating to coroutines ("cooperative threads"):
4496libev fully supports nesting calls to its functions from different 4727libev fully supports nesting calls to its functions from different
5005The physical time that is observed. It is apparently strictly monotonic :) 5236The physical time that is observed. It is apparently strictly monotonic :)
5006 5237
5007=item wall-clock time 5238=item wall-clock time
5008 5239
5009The time and date as shown on clocks. Unlike real time, it can actually 5240The time and date as shown on clocks. Unlike real time, it can actually
5010be wrong and jump forwards and backwards, e.g. when the you adjust your 5241be wrong and jump forwards and backwards, e.g. when you adjust your
5011clock. 5242clock.
5012 5243
5013=item watcher 5244=item watcher
5014 5245
5015A data structure that describes interest in certain events. Watchers need 5246A data structure that describes interest in certain events. Watchers need
5018=back 5249=back
5019 5250
5020=head1 AUTHOR 5251=head1 AUTHOR
5021 5252
5022Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael 5253Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5023Magnusson and Emanuele Giaquinta. 5254Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5024 5255

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines