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

Comparing libev/ev.pod (file contents):
Revision 1.340 by root, Wed Nov 3 20:03:21 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
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:
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,
481employing an additional generation counter and comparing that against the 509employing an additional generation counter and comparing that against the
482events to filter out spurious ones, recreating the set when required. Last 510events to filter out spurious ones, recreating the set when required. Last
483not 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
484perfectly fine with C<select> (files, many character devices...). 512perfectly fine with C<select> (files, many character devices...).
485 513
486Epoll is truly the train wreck analog among event poll mechanisms. 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.
487 517
488While 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
489will 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
490incident (because the same I<file descriptor> could point to a different 520incident (because the same I<file descriptor> could point to a different
491I<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
557=item C<EVBACKEND_PORT> (value 32, Solaris 10) 587=item C<EVBACKEND_PORT> (value 32, Solaris 10)
558 588
559This 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,
560it'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)).
561 591
562Please note that Solaris event ports can deliver a lot of spurious
563notifications, so you need to use non-blocking I/O or other means to avoid
564blocking when no data (or space) is available.
565
566While this backend scales well, it requires one system call per active 592While this backend scales well, it requires one system call per active
567file descriptor per loop iteration. For small and medium numbers of file 593file descriptor per loop iteration. For small and medium numbers of file
568descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 594descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
569might perform better. 595might perform better.
570 596
571On the positive side, with the exception of the spurious readiness 597On the positive side, this backend actually performed fully to
572notifications, this backend actually performed fully to specification
573in 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
574OS-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.
575 611
576This 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
577C<EVBACKEND_POLL>. 613C<EVBACKEND_POLL>.
578 614
579=item C<EVBACKEND_ALL> 615=item C<EVBACKEND_ALL>
580 616
581Try all backends (even potentially broken ones that wouldn't be tried 617Try all backends (even potentially broken ones that wouldn't be tried
582with 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
583C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 619C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
584 620
585It 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).
586 630
587=back 631=back
588 632
589If 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,
590then 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
677prepare and check phases. 721prepare and check phases.
678 722
679=item unsigned int ev_depth (loop) 723=item unsigned int ev_depth (loop)
680 724
681Returns 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
682times C<ev_run> was exited, in other words, the recursion depth. 726times C<ev_run> was exited normally, in other words, the recursion depth.
683 727
684Outside 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
685C<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),
686in which case it is higher. 730in which case it is higher.
687 731
688Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 732Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
689etc.), doesn't count as "exit" - consider this as a hint to avoid such 733throwing an exception etc.), doesn't count as "exit" - consider this
690ungentleman-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.
691 736
692=item unsigned int ev_backend (loop) 737=item unsigned int ev_backend (loop)
693 738
694Returns one of the C<EVBACKEND_*> flags indicating the event backend in 739Returns one of the C<EVBACKEND_*> flags indicating the event backend in
695use. 740use.
756relying 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
757finished (especially in interactive programs), but having a program 802finished (especially in interactive programs), but having a program
758that 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
759of 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
760beauty. 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.
761 811
762A 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
763those events and any already outstanding ones, but will not wait and 813those events and any already outstanding ones, but will not wait and
764block 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
765iteration 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
818anymore. 868anymore.
819 869
820 ... queue jobs here, make sure they register event watchers as long 870 ... queue jobs here, make sure they register event watchers as long
821 ... 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..)
822 ev_run (my_loop, 0); 872 ev_run (my_loop, 0);
823 ... jobs done or somebody called unloop. yeah! 873 ... jobs done or somebody called break. yeah!
824 874
825=item ev_break (loop, how) 875=item ev_break (loop, how)
826 876
827Can 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
828has processed all outstanding events). The C<how> argument must be either 878has processed all outstanding events). The C<how> argument must be either
829C<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
830C<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.
831 881
832This "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>.
833 883
834It 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.
835 886
836=item ev_ref (loop) 887=item ev_ref (loop)
837 888
838=item ev_unref (loop) 889=item ev_unref (loop)
839 890
860running when nothing else is active. 911running when nothing else is active.
861 912
862 ev_signal exitsig; 913 ev_signal exitsig;
863 ev_signal_init (&exitsig, sig_cb, SIGINT); 914 ev_signal_init (&exitsig, sig_cb, SIGINT);
864 ev_signal_start (loop, &exitsig); 915 ev_signal_start (loop, &exitsig);
865 evf_unref (loop); 916 ev_unref (loop);
866 917
867Example: For some weird reason, unregister the above signal handler again. 918Example: For some weird reason, unregister the above signal handler again.
868 919
869 ev_ref (loop); 920 ev_ref (loop);
870 ev_signal_stop (loop, &exitsig); 921 ev_signal_stop (loop, &exitsig);
982See 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
983document. 1034document.
984 1035
985=item ev_set_userdata (loop, void *data) 1036=item ev_set_userdata (loop, void *data)
986 1037
987=item ev_userdata (loop) 1038=item void *ev_userdata (loop)
988 1039
989Set and retrieve a single C<void *> associated with a loop. When 1040Set and retrieve a single C<void *> associated with a loop. When
990C<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
991C<0.> 1042C<0>.
992 1043
993These 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,
994and 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
995C<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
996any other purpose as well. 1047any other purpose as well.
1309See 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
1310functions that do not need a watcher. 1361functions that do not need a watcher.
1311 1362
1312=back 1363=back
1313 1364
1314=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1365See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1315 1366OWN COMPOSITE WATCHERS> idioms.
1316Each watcher has, by default, a member C<void *data> that you can change
1317and read at any time: libev will completely ignore it. This can be used
1318to associate arbitrary data with your watcher. If you need more data and
1319don't want to allocate memory and store a pointer to it in that data
1320member, you can also "subclass" the watcher type and provide your own
1321data:
1322
1323 struct my_io
1324 {
1325 ev_io io;
1326 int otherfd;
1327 void *somedata;
1328 struct whatever *mostinteresting;
1329 };
1330
1331 ...
1332 struct my_io w;
1333 ev_io_init (&w.io, my_cb, fd, EV_READ);
1334
1335And since your callback will be called with a pointer to the watcher, you
1336can cast it back to your own type:
1337
1338 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1339 {
1340 struct my_io *w = (struct my_io *)w_;
1341 ...
1342 }
1343
1344More interesting and less C-conformant ways of casting your callback type
1345instead have been omitted.
1346
1347Another common scenario is to use some data structure with multiple
1348embedded watchers:
1349
1350 struct my_biggy
1351 {
1352 int some_data;
1353 ev_timer t1;
1354 ev_timer t2;
1355 }
1356
1357In this case getting the pointer to C<my_biggy> is a bit more
1358complicated: Either you store the address of your C<my_biggy> struct
1359in the C<data> member of the watcher (for woozies), or you need to use
1360some pointer arithmetic using C<offsetof> inside your watchers (for real
1361programmers):
1362
1363 #include <stddef.h>
1364
1365 static void
1366 t1_cb (EV_P_ ev_timer *w, int revents)
1367 {
1368 struct my_biggy big = (struct my_biggy *)
1369 (((char *)w) - offsetof (struct my_biggy, t1));
1370 }
1371
1372 static void
1373 t2_cb (EV_P_ ev_timer *w, int revents)
1374 {
1375 struct my_biggy big = (struct my_biggy *)
1376 (((char *)w) - offsetof (struct my_biggy, t2));
1377 }
1378 1367
1379=head2 WATCHER STATES 1368=head2 WATCHER STATES
1380 1369
1381There are various watcher states mentioned throughout this manual - 1370There are various watcher states mentioned throughout this manual -
1382active, 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
1389 1378
1390Before 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
1391initialised. 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
1392C<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.
1393 1382
1394In 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
1395in 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.
1396 1387
1397=item started/running/active 1388=item started/running/active
1398 1389
1399Once 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
1400property 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
1428latter will clear any pending state the watcher might be in, regardless 1419latter will clear any pending state the watcher might be in, regardless
1429of 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
1430freeing it is often a good idea. 1421freeing it is often a good idea.
1431 1422
1432While stopped (and not pending) the watcher is essentially in the 1423While stopped (and not pending) the watcher is essentially in the
1433initialised 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
1434you wish. 1425you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
1426it again).
1435 1427
1436=back 1428=back
1437 1429
1438=head2 WATCHER PRIORITY MODELS 1430=head2 WATCHER PRIORITY MODELS
1439 1431
1568In 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
1569fd 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
1570descriptors 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
1571required if you know what you are doing). 1563required if you know what you are doing).
1572 1564
1573If you cannot use non-blocking mode, then force the use of a
1574known-to-be-good backend (at the time of this writing, this includes only
1575C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1576descriptors for which non-blocking operation makes no sense (such as
1577files) - libev doesn't guarantee any specific behaviour in that case.
1578
1579Another 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
1580receive "spurious" readiness notifications, that is your callback might 1566receive "spurious" readiness notifications, that is, your callback might
1581be 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
1582because 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
1583lot 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
1584this situation even with a relatively standard program structure. Thus 1570use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1585it is best to always use non-blocking I/O: An extra C<read>(2) returning
1586C<EAGAIN> is far preferable to a program hanging until some data arrives. 1571preferable to a program hanging until some data arrives.
1587 1572
1588If 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
1589not play around with an Xlib connection), then you have to separately 1574not play around with an Xlib connection), then you have to separately
1590re-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
1591interface such as poll (fortunately in our Xlib example, Xlib already 1576interface such as poll (fortunately in the case of Xlib, it already does
1592does 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
1593use 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
1594indefinitely. 1579indefinitely.
1595 1580
1596But really, best use non-blocking mode. 1581But really, best use non-blocking mode.
1597 1582
1625 1610
1626There is no workaround possible except not registering events 1611There is no workaround possible except not registering events
1627for potentially C<dup ()>'ed file descriptors, or to resort to 1612for potentially C<dup ()>'ed file descriptors, or to resort to
1628C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1613C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1629 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
1630=head3 The special problem of fork 1648=head3 The special problem of fork
1631 1649
1632Some 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
1633useless behaviour. Libev fully supports fork, but needs to be told about 1651useless behaviour. Libev fully supports fork, but needs to be told about
1634it in the child. 1652it in the child if you want to continue to use it in the child.
1635 1653
1636To 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
1637C<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
1638enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1656C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1639C<EVBACKEND_POLL>.
1640 1657
1641=head3 The special problem of SIGPIPE 1658=head3 The special problem of SIGPIPE
1642 1659
1643While 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>:
1644when 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
2134 2151
2135Another way to think about it (for the mathematically inclined) is that 2152Another way to think about it (for the mathematically inclined) is that
2136C<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
2137time where C<time = offset (mod interval)>, regardless of any time jumps. 2154time where C<time = offset (mod interval)>, regardless of any time jumps.
2138 2155
2139For numerical stability it is preferable that the C<offset> value is near 2156The C<interval> I<MUST> be positive, and for numerical stability, the
2140C<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
2141this 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.
2142 2162
2143Note 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
2144speed 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
2145will 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
2146millisecond (if the OS supports it and the machine is fast enough). 2166millisecond (if the OS supports it and the machine is fast enough).
2289=head3 The special problem of inheritance over fork/execve/pthread_create 2309=head3 The special problem of inheritance over fork/execve/pthread_create
2290 2310
2291Both the signal mask (C<sigprocmask>) and the signal disposition 2311Both the signal mask (C<sigprocmask>) and the signal disposition
2292(C<sigaction>) are unspecified after starting a signal watcher (and after 2312(C<sigaction>) are unspecified after starting a signal watcher (and after
2293stopping 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,
2294and 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>).
2295 2316
2296While this does not matter for the signal disposition (libev never 2317While this does not matter for the signal disposition (libev never
2297sets 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
2298C<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
2299certain signals to be blocked. 2320certain signals to be blocked.
2312I<has> to modify the signal mask, at least temporarily. 2333I<has> to modify the signal mask, at least temporarily.
2313 2334
2314So 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
2315you 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
2316is 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>.
2317 2352
2318=head3 Watcher-Specific Functions and Data Members 2353=head3 Watcher-Specific Functions and Data Members
2319 2354
2320=over 4 2355=over 4
2321 2356
3156 atexit (program_exits); 3191 atexit (program_exits);
3157 3192
3158 3193
3159=head2 C<ev_async> - how to wake up an event loop 3194=head2 C<ev_async> - how to wake up an event loop
3160 3195
3161In 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
3162asynchronous sources such as signal handlers (as opposed to multiple event 3197asynchronous sources such as signal handlers (as opposed to multiple event
3163loops - those are of course safe to use in different threads). 3198loops - those are of course safe to use in different threads).
3164 3199
3165Sometimes, 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,
3166for 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>
3168it 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.
3169 3204
3170This functionality is very similar to C<ev_signal> watchers, as signals, 3205This functionality is very similar to C<ev_signal> watchers, as signals,
3171too, are asynchronous in nature, and signals, too, will be compressed 3206too, are asynchronous in nature, and signals, too, will be compressed
3172(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
3173C<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.
3174 3212
3175Unlike 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
3176just the default loop. 3214just the default loop.
3177 3215
3178=head3 Queueing 3216=head3 Queueing
3273trust me. 3311trust me.
3274 3312
3275=item ev_async_send (loop, ev_async *) 3313=item ev_async_send (loop, ev_async *)
3276 3314
3277Sends/signals/activates the given C<ev_async> watcher, that is, feeds 3315Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3278an 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
3279C<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,
3280similar 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
3281section below on what exactly this means). 3321embedding section below on what exactly this means).
3282 3322
3283Note that, as with other watchers in libev, multiple events might get 3323Note that, as with other watchers in libev, multiple events might get
3284compressed into a single callback invocation (another way to look at this 3324compressed into a single callback invocation (another way to look at this
3285is 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>,
3286reset when the event loop detects that). 3326reset when the event loop detects that).
3354Feed 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
3355the given events it. 3395the given events it.
3356 3396
3357=item ev_feed_signal_event (loop, int signum) 3397=item ev_feed_signal_event (loop, int signum)
3358 3398
3359Feed 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>,
3360loop!). 3400which is async-safe.
3361 3401
3362=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.
3363 3713
3364 3714
3365=head1 LIBEVENT EMULATION 3715=head1 LIBEVENT EMULATION
3366 3716
3367Libev offers a compatibility emulation layer for libevent. It cannot 3717Libev offers a compatibility emulation layer for libevent. It cannot
3368emulate the internals of libevent, so here are some usage hints: 3718emulate the internals of libevent, so here are some usage hints:
3369 3719
3370=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.
3371 3726
3372=item * Use it by including <event.h>, as usual. 3727=item * Use it by including <event.h>, as usual.
3373 3728
3374=item * The following members are fully supported: ev_base, ev_callback, 3729=item * The following members are fully supported: ev_base, ev_callback,
3375ev_arg, ev_fd, ev_res, ev_events. 3730ev_arg, ev_fd, ev_res, ev_events.
3381=item * Priorities are not currently supported. Initialising priorities 3736=item * Priorities are not currently supported. Initialising priorities
3382will 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
3383is an ev_pri field. 3738is an ev_pri field.
3384 3739
3385=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
3386first base created (== the default loop) gets the signals. 3741base that registered the signal gets the signals.
3387 3742
3388=item * Other members are not supported. 3743=item * Other members are not supported.
3389 3744
3390=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
3391to use the libev header file and library. 3746to use the libev header file and library.
3410Care 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++
3411classes 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
3412that 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
3413you disable C<EV_MULTIPLICITY> when embedding libev). 3768you disable C<EV_MULTIPLICITY> when embedding libev).
3414 3769
3415Currently, functions, and static and non-static member functions can be 3770Currently, functions, static and non-static member functions and classes
3416used 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
3417need 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
3418types of functors please contact the author (preferably after implementing 3773you need support for other types of functors please contact the author
3419it). 3774(preferably after implementing it).
3420 3775
3421Here is a list of things available in the C<ev> namespace: 3776Here is a list of things available in the C<ev> namespace:
3422 3777
3423=over 4 3778=over 4
3424 3779
3852F<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.
3853 4208
3854In standalone mode, libev will still try to automatically deduce the 4209In standalone mode, libev will still try to automatically deduce the
3855configuration, but has to be more conservative. 4210configuration, but has to be more conservative.
3856 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
3857=item EV_USE_MONOTONIC 4221=item EV_USE_MONOTONIC
3858 4222
3859If 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
3860monotonic clock option at both compile time and runtime. Otherwise no 4224monotonic clock option at both compile time and runtime. Otherwise no
3861use 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,
4292And 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:
4293 4657
4294 #include "ev_cpp.h" 4658 #include "ev_cpp.h"
4295 #include "ev.c" 4659 #include "ev.c"
4296 4660
4297=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4661=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4298 4662
4299=head2 THREADS AND COROUTINES 4663=head2 THREADS AND COROUTINES
4300 4664
4301=head3 THREADS 4665=head3 THREADS
4302 4666
4353default 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
4354watcher callback into the event loop interested in the signal. 4718watcher callback into the event loop interested in the signal.
4355 4719
4356=back 4720=back
4357 4721
4358=head4 THREAD LOCKING EXAMPLE 4722See also L<THREAD LOCKING EXAMPLE>.
4359
4360Here is a fictitious example of how to run an event loop in a different
4361thread than where callbacks are being invoked and watchers are
4362created/added/removed.
4363
4364For a real-world example, see the C<EV::Loop::Async> perl module,
4365which uses exactly this technique (which is suited for many high-level
4366languages).
4367
4368The example uses a pthread mutex to protect the loop data, a condition
4369variable to wait for callback invocations, an async watcher to notify the
4370event loop thread and an unspecified mechanism to wake up the main thread.
4371
4372First, you need to associate some data with the event loop:
4373
4374 typedef struct {
4375 mutex_t lock; /* global loop lock */
4376 ev_async async_w;
4377 thread_t tid;
4378 cond_t invoke_cv;
4379 } userdata;
4380
4381 void prepare_loop (EV_P)
4382 {
4383 // for simplicity, we use a static userdata struct.
4384 static userdata u;
4385
4386 ev_async_init (&u->async_w, async_cb);
4387 ev_async_start (EV_A_ &u->async_w);
4388
4389 pthread_mutex_init (&u->lock, 0);
4390 pthread_cond_init (&u->invoke_cv, 0);
4391
4392 // now associate this with the loop
4393 ev_set_userdata (EV_A_ u);
4394 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4395 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4396
4397 // then create the thread running ev_loop
4398 pthread_create (&u->tid, 0, l_run, EV_A);
4399 }
4400
4401The callback for the C<ev_async> watcher does nothing: the watcher is used
4402solely to wake up the event loop so it takes notice of any new watchers
4403that might have been added:
4404
4405 static void
4406 async_cb (EV_P_ ev_async *w, int revents)
4407 {
4408 // just used for the side effects
4409 }
4410
4411The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4412protecting the loop data, respectively.
4413
4414 static void
4415 l_release (EV_P)
4416 {
4417 userdata *u = ev_userdata (EV_A);
4418 pthread_mutex_unlock (&u->lock);
4419 }
4420
4421 static void
4422 l_acquire (EV_P)
4423 {
4424 userdata *u = ev_userdata (EV_A);
4425 pthread_mutex_lock (&u->lock);
4426 }
4427
4428The event loop thread first acquires the mutex, and then jumps straight
4429into C<ev_run>:
4430
4431 void *
4432 l_run (void *thr_arg)
4433 {
4434 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4435
4436 l_acquire (EV_A);
4437 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4438 ev_run (EV_A_ 0);
4439 l_release (EV_A);
4440
4441 return 0;
4442 }
4443
4444Instead of invoking all pending watchers, the C<l_invoke> callback will
4445signal the main thread via some unspecified mechanism (signals? pipe
4446writes? C<Async::Interrupt>?) and then waits until all pending watchers
4447have been called (in a while loop because a) spurious wakeups are possible
4448and b) skipping inter-thread-communication when there are no pending
4449watchers is very beneficial):
4450
4451 static void
4452 l_invoke (EV_P)
4453 {
4454 userdata *u = ev_userdata (EV_A);
4455
4456 while (ev_pending_count (EV_A))
4457 {
4458 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4459 pthread_cond_wait (&u->invoke_cv, &u->lock);
4460 }
4461 }
4462
4463Now, whenever the main thread gets told to invoke pending watchers, it
4464will grab the lock, call C<ev_invoke_pending> and then signal the loop
4465thread to continue:
4466
4467 static void
4468 real_invoke_pending (EV_P)
4469 {
4470 userdata *u = ev_userdata (EV_A);
4471
4472 pthread_mutex_lock (&u->lock);
4473 ev_invoke_pending (EV_A);
4474 pthread_cond_signal (&u->invoke_cv);
4475 pthread_mutex_unlock (&u->lock);
4476 }
4477
4478Whenever you want to start/stop a watcher or do other modifications to an
4479event loop, you will now have to lock:
4480
4481 ev_timer timeout_watcher;
4482 userdata *u = ev_userdata (EV_A);
4483
4484 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4485
4486 pthread_mutex_lock (&u->lock);
4487 ev_timer_start (EV_A_ &timeout_watcher);
4488 ev_async_send (EV_A_ &u->async_w);
4489 pthread_mutex_unlock (&u->lock);
4490
4491Note that sending the C<ev_async> watcher is required because otherwise
4492an event loop currently blocking in the kernel will have no knowledge
4493about the newly added timer. By waking up the loop it will pick up any new
4494watchers in the next event loop iteration.
4495 4723
4496=head3 COROUTINES 4724=head3 COROUTINES
4497 4725
4498Libev is very accommodating to coroutines ("cooperative threads"): 4726Libev is very accommodating to coroutines ("cooperative threads"):
4499libev fully supports nesting calls to its functions from different 4727libev fully supports nesting calls to its functions from different
5008The physical time that is observed. It is apparently strictly monotonic :) 5236The physical time that is observed. It is apparently strictly monotonic :)
5009 5237
5010=item wall-clock time 5238=item wall-clock time
5011 5239
5012The 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
5013be 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
5014clock. 5242clock.
5015 5243
5016=item watcher 5244=item watcher
5017 5245
5018A data structure that describes interest in certain events. Watchers need 5246A data structure that describes interest in certain events. Watchers need
5021=back 5249=back
5022 5250
5023=head1 AUTHOR 5251=head1 AUTHOR
5024 5252
5025Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael 5253Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5026Magnusson and Emanuele Giaquinta. 5254Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5027 5255

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines