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

Comparing libev/ev.pod (file contents):
Revision 1.406 by root, Thu May 3 16:00:47 2012 UTC vs.
Revision 1.454 by root, Tue Jun 25 05:17:50 2019 UTC

1=encoding utf-8
2
1=head1 NAME 3=head1 NAME
2 4
3libev - a high performance full-featured event loop written in C 5libev - a high performance full-featured event loop written in C
4 6
5=head1 SYNOPSIS 7=head1 SYNOPSIS
82 84
83=head1 WHAT TO READ WHEN IN A HURRY 85=head1 WHAT TO READ WHEN IN A HURRY
84 86
85This manual tries to be very detailed, but unfortunately, this also makes 87This manual tries to be very detailed, but unfortunately, this also makes
86it very long. If you just want to know the basics of libev, I suggest 88it very long. If you just want to know the basics of libev, I suggest
87reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and 89reading L</ANATOMY OF A WATCHER>, then the L</EXAMPLE PROGRAM> above and
88look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and 90look up the missing functions in L</GLOBAL FUNCTIONS> and the C<ev_io> and
89C<ev_timer> sections in L<WATCHER TYPES>. 91C<ev_timer> sections in L</WATCHER TYPES>.
90 92
91=head1 ABOUT LIBEV 93=head1 ABOUT LIBEV
92 94
93Libev is an event loop: you register interest in certain events (such as a 95Libev is an event loop: you register interest in certain events (such as a
94file descriptor being readable or a timeout occurring), and it will manage 96file descriptor being readable or a timeout occurring), and it will manage
103details of the event, and then hand it over to libev by I<starting> the 105details of the event, and then hand it over to libev by I<starting> the
104watcher. 106watcher.
105 107
106=head2 FEATURES 108=head2 FEATURES
107 109
108Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 110Libev supports C<select>, C<poll>, the Linux-specific aio and C<epoll>
109BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 111interfaces, the BSD-specific C<kqueue> and the Solaris-specific event port
110for file descriptor events (C<ev_io>), the Linux C<inotify> interface 112mechanisms for file descriptor events (C<ev_io>), the Linux C<inotify>
111(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner 113interface (for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
112inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative 114inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
113timers (C<ev_timer>), absolute timers with customised rescheduling 115timers (C<ev_timer>), absolute timers with customised rescheduling
114(C<ev_periodic>), synchronous signals (C<ev_signal>), process status 116(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
115change events (C<ev_child>), and event watchers dealing with the event 117change events (C<ev_child>), and event watchers dealing with the event
116loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and 118loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
263 265
264You could override this function in high-availability programs to, say, 266You could override this function in high-availability programs to, say,
265free some memory if it cannot allocate memory, to use a special allocator, 267free some memory if it cannot allocate memory, to use a special allocator,
266or even to sleep a while and retry until some memory is available. 268or even to sleep a while and retry until some memory is available.
267 269
270Example: The following is the C<realloc> function that libev itself uses
271which should work with C<realloc> and C<free> functions of all kinds and
272is probably a good basis for your own implementation.
273
274 static void *
275 ev_realloc_emul (void *ptr, long size) EV_NOEXCEPT
276 {
277 if (size)
278 return realloc (ptr, size);
279
280 free (ptr);
281 return 0;
282 }
283
268Example: Replace the libev allocator with one that waits a bit and then 284Example: Replace the libev allocator with one that waits a bit and then
269retries (example requires a standards-compliant C<realloc>). 285retries.
270 286
271 static void * 287 static void *
272 persistent_realloc (void *ptr, size_t size) 288 persistent_realloc (void *ptr, size_t size)
273 { 289 {
290 if (!size)
291 {
292 free (ptr);
293 return 0;
294 }
295
274 for (;;) 296 for (;;)
275 { 297 {
276 void *newptr = realloc (ptr, size); 298 void *newptr = realloc (ptr, size);
277 299
278 if (newptr) 300 if (newptr)
396 418
397If this flag bit is or'ed into the flag value (or the program runs setuid 419If this flag bit is or'ed into the flag value (or the program runs setuid
398or setgid) then libev will I<not> look at the environment variable 420or setgid) then libev will I<not> look at the environment variable
399C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 421C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
400override the flags completely if it is found in the environment. This is 422override the flags completely if it is found in the environment. This is
401useful to try out specific backends to test their performance, or to work 423useful to try out specific backends to test their performance, to work
402around bugs. 424around bugs, or to make libev threadsafe (accessing environment variables
425cannot be done in a threadsafe way, but usually it works if no other
426thread modifies them).
403 427
404=item C<EVFLAG_FORKCHECK> 428=item C<EVFLAG_FORKCHECK>
405 429
406Instead of calling C<ev_loop_fork> manually after a fork, you can also 430Instead of calling C<ev_loop_fork> manually after a fork, you can also
407make libev check for a fork in each iteration by enabling this flag. 431make libev check for a fork in each iteration by enabling this flag.
408 432
409This works by calling C<getpid ()> on every iteration of the loop, 433This works by calling C<getpid ()> on every iteration of the loop,
410and thus this might slow down your event loop if you do a lot of loop 434and thus this might slow down your event loop if you do a lot of loop
411iterations and little real work, but is usually not noticeable (on my 435iterations and little real work, but is usually not noticeable (on my
412GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 436GNU/Linux system for example, C<getpid> is actually a simple 5-insn
413without a system call and thus I<very> fast, but my GNU/Linux system also has 437sequence without a system call and thus I<very> fast, but my GNU/Linux
414C<pthread_atfork> which is even faster). 438system also has C<pthread_atfork> which is even faster). (Update: glibc
439versions 2.25 apparently removed the C<getpid> optimisation again).
415 440
416The big advantage of this flag is that you can forget about fork (and 441The big advantage of this flag is that you can forget about fork (and
417forget about forgetting to tell libev about forking) when you use this 442forget about forgetting to tell libev about forking, although you still
418flag. 443have to ignore C<SIGPIPE>) when you use this flag.
419 444
420This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 445This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
421environment variable. 446environment variable.
422 447
423=item C<EVFLAG_NOINOTIFY> 448=item C<EVFLAG_NOINOTIFY>
486This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 511This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
487C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 512C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
488 513
489=item C<EVBACKEND_EPOLL> (value 4, Linux) 514=item C<EVBACKEND_EPOLL> (value 4, Linux)
490 515
491Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9 516Use the Linux-specific epoll(7) interface (for both pre- and post-2.6.9
492kernels). 517kernels).
493 518
494For few fds, this backend is a bit little slower than poll and select, but 519For few fds, this backend is a bit little slower than poll and select, but
495it scales phenomenally better. While poll and select usually scale like 520it scales phenomenally better. While poll and select usually scale like
496O(total_fds) where total_fds is the total number of fds (or the highest 521O(total_fds) where total_fds is the total number of fds (or the highest
542All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or 567All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
543faster than epoll for maybe up to a hundred file descriptors, depending on 568faster than epoll for maybe up to a hundred file descriptors, depending on
544the usage. So sad. 569the usage. So sad.
545 570
546While nominally embeddable in other event loops, this feature is broken in 571While nominally embeddable in other event loops, this feature is broken in
547all kernel versions tested so far. 572a lot of kernel revisions, but probably(!) works in current versions.
548 573
549This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 574This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
550C<EVBACKEND_POLL>. 575C<EVBACKEND_POLL>.
551 576
577=item C<EVBACKEND_LINUXAIO> (value 64, Linux)
578
579Use the Linux-specific Linux AIO (I<not> C<< aio(7) >> but C<<
580io_submit(2) >>) event interface available in post-4.18 kernels (but libev
581only tries to use it in 4.19+).
582
583This is another Linux train wreck of an event interface.
584
585If this backend works for you (as of this writing, it was very
586experimental), it is the best event interface available on Linux and might
587be well worth enabling it - if it isn't available in your kernel this will
588be detected and this backend will be skipped.
589
590This backend can batch oneshot requests and supports a user-space ring
591buffer to receive events. It also doesn't suffer from most of the design
592problems of epoll (such as not being able to remove event sources from
593the epoll set), and generally sounds too good to be true. Because, this
594being the Linux kernel, of course it suffers from a whole new set of
595limitations, forcing you to fall back to epoll, inheriting all its design
596issues.
597
598For one, it is not easily embeddable (but probably could be done using
599an event fd at some extra overhead). It also is subject to a system wide
600limit that can be configured in F</proc/sys/fs/aio-max-nr>. If no AIO
601requests are left, this backend will be skipped during initialisation, and
602will switch to epoll when the loop is active.
603
604Most problematic in practice, however, is that not all file descriptors
605work with it. For example, in Linux 5.1, TCP sockets, pipes, event fds,
606files, F</dev/null> and many others are supported, but ttys do not work
607properly (a known bug that the kernel developers don't care about, see
608L<https://lore.kernel.org/patchwork/patch/1047453/>), so this is not
609(yet?) a generic event polling interface.
610
611Overall, it seems the Linux developers just don't want it to have a
612generic event handling mechanism other than C<select> or C<poll>.
613
614To work around all these problem, the current version of libev uses its
615epoll backend as a fallback for file descriptor types that do not work. Or
616falls back completely to epoll if the kernel acts up.
617
618This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
619C<EVBACKEND_POLL>.
620
552=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 621=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
553 622
554Kqueue deserves special mention, as at the time of this writing, it 623Kqueue deserves special mention, as at the time this backend was
555was broken on all BSDs except NetBSD (usually it doesn't work reliably 624implemented, it was broken on all BSDs except NetBSD (usually it doesn't
556with anything but sockets and pipes, except on Darwin, where of course 625work reliably with anything but sockets and pipes, except on Darwin,
557it's completely useless). Unlike epoll, however, whose brokenness 626where of course it's completely useless). Unlike epoll, however, whose
558is by design, these kqueue bugs can (and eventually will) be fixed 627brokenness is by design, these kqueue bugs can be (and mostly have been)
559without API changes to existing programs. For this reason it's not being 628fixed without API changes to existing programs. For this reason it's not
560"auto-detected" unless you explicitly specify it in the flags (i.e. using 629being "auto-detected" on all platforms unless you explicitly specify it
561C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) 630in the flags (i.e. using C<EVBACKEND_KQUEUE>) or libev was compiled on a
562system like NetBSD. 631known-to-be-good (-enough) system like NetBSD.
563 632
564You still can embed kqueue into a normal poll or select backend and use it 633You still can embed kqueue into a normal poll or select backend and use it
565only for sockets (after having made sure that sockets work with kqueue on 634only for sockets (after having made sure that sockets work with kqueue on
566the target platform). See C<ev_embed> watchers for more info. 635the target platform). See C<ev_embed> watchers for more info.
567 636
568It scales in the same way as the epoll backend, but the interface to the 637It scales in the same way as the epoll backend, but the interface to the
569kernel is more efficient (which says nothing about its actual speed, of 638kernel is more efficient (which says nothing about its actual speed, of
570course). While stopping, setting and starting an I/O watcher does never 639course). While stopping, setting and starting an I/O watcher does never
571cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to 640cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
572two event changes per incident. Support for C<fork ()> is very bad (you 641two event changes per incident. Support for C<fork ()> is very bad (you
573might have to leak fd's on fork, but it's more sane than epoll) and it 642might have to leak fds on fork, but it's more sane than epoll) and it
574drops fds silently in similarly hard-to-detect cases 643drops fds silently in similarly hard-to-detect cases.
575 644
576This backend usually performs well under most conditions. 645This backend usually performs well under most conditions.
577 646
578While nominally embeddable in other event loops, this doesn't work 647While nominally embeddable in other event loops, this doesn't work
579everywhere, so you might need to test for this. And since it is broken 648everywhere, so you might need to test for this. And since it is broken
653Example: Use whatever libev has to offer, but make sure that kqueue is 722Example: Use whatever libev has to offer, but make sure that kqueue is
654used if available. 723used if available.
655 724
656 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE); 725 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
657 726
727Example: Similarly, on linux, you mgiht want to take advantage of the
728linux aio backend if possible, but fall back to something else if that
729isn't available.
730
731 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_LINUXAIO);
732
658=item ev_loop_destroy (loop) 733=item ev_loop_destroy (loop)
659 734
660Destroys an event loop object (frees all memory and kernel state 735Destroys an event loop object (frees all memory and kernel state
661etc.). None of the active event watchers will be stopped in the normal 736etc.). None of the active event watchers will be stopped in the normal
662sense, so e.g. C<ev_is_active> might still return true. It is your 737sense, so e.g. C<ev_is_active> might still return true. It is your
678If you need dynamically allocated loops it is better to use C<ev_loop_new> 753If you need dynamically allocated loops it is better to use C<ev_loop_new>
679and C<ev_loop_destroy>. 754and C<ev_loop_destroy>.
680 755
681=item ev_loop_fork (loop) 756=item ev_loop_fork (loop)
682 757
683This function sets a flag that causes subsequent C<ev_run> iterations to 758This function sets a flag that causes subsequent C<ev_run> iterations
684reinitialise the kernel state for backends that have one. Despite the 759to reinitialise the kernel state for backends that have one. Despite
685name, you can call it anytime, but it makes most sense after forking, in 760the name, you can call it anytime you are allowed to start or stop
686the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the 761watchers (except inside an C<ev_prepare> callback), but it makes most
762sense after forking, in the child process. You I<must> call it (or use
687child before resuming or calling C<ev_run>. 763C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
688 764
765In addition, if you want to reuse a loop (via this function or
766C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
767
689Again, you I<have> to call it on I<any> loop that you want to re-use after 768Again, you I<have> to call it on I<any> loop that you want to re-use after
690a fork, I<even if you do not plan to use the loop in the parent>. This is 769a fork, I<even if you do not plan to use the loop in the parent>. This is
691because some kernel interfaces *cough* I<kqueue> *cough* do funny things 770because some kernel interfaces *cough* I<kqueue> *cough* do funny things
692during fork. 771during fork.
693 772
694On the other hand, you only need to call this function in the child 773On the other hand, you only need to call this function in the child
764 843
765This function is rarely useful, but when some event callback runs for a 844This function is rarely useful, but when some event callback runs for a
766very long time without entering the event loop, updating libev's idea of 845very long time without entering the event loop, updating libev's idea of
767the current time is a good idea. 846the current time is a good idea.
768 847
769See also L<The special problem of time updates> in the C<ev_timer> section. 848See also L</The special problem of time updates> in the C<ev_timer> section.
770 849
771=item ev_suspend (loop) 850=item ev_suspend (loop)
772 851
773=item ev_resume (loop) 852=item ev_resume (loop)
774 853
1318 1397
1319=item callback ev_cb (ev_TYPE *watcher) 1398=item callback ev_cb (ev_TYPE *watcher)
1320 1399
1321Returns the callback currently set on the watcher. 1400Returns the callback currently set on the watcher.
1322 1401
1323=item ev_cb_set (ev_TYPE *watcher, callback) 1402=item ev_set_cb (ev_TYPE *watcher, callback)
1324 1403
1325Change the callback. You can change the callback at virtually any time 1404Change the callback. You can change the callback at virtually any time
1326(modulo threads). 1405(modulo threads).
1327 1406
1328=item ev_set_priority (ev_TYPE *watcher, int priority) 1407=item ev_set_priority (ev_TYPE *watcher, int priority)
1346or might not have been clamped to the valid range. 1425or might not have been clamped to the valid range.
1347 1426
1348The default priority used by watchers when no priority has been set is 1427The default priority used by watchers when no priority has been set is
1349always C<0>, which is supposed to not be too high and not be too low :). 1428always C<0>, which is supposed to not be too high and not be too low :).
1350 1429
1351See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of 1430See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1352priorities. 1431priorities.
1353 1432
1354=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1433=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1355 1434
1356Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1435Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1381See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1460See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1382functions that do not need a watcher. 1461functions that do not need a watcher.
1383 1462
1384=back 1463=back
1385 1464
1386See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR 1465See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1387OWN COMPOSITE WATCHERS> idioms. 1466OWN COMPOSITE WATCHERS> idioms.
1388 1467
1389=head2 WATCHER STATES 1468=head2 WATCHER STATES
1390 1469
1391There are various watcher states mentioned throughout this manual - 1470There are various watcher states mentioned throughout this manual -
1393transition between them will be described in more detail - and while these 1472transition between them will be described in more detail - and while these
1394rules might look complicated, they usually do "the right thing". 1473rules might look complicated, they usually do "the right thing".
1395 1474
1396=over 4 1475=over 4
1397 1476
1398=item initialiased 1477=item initialised
1399 1478
1400Before a watcher can be registered with the event loop it has to be 1479Before a watcher can be registered with the event loop it has to be
1401initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1480initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1402C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1481C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1403 1482
1601 1680
1602But really, best use non-blocking mode. 1681But really, best use non-blocking mode.
1603 1682
1604=head3 The special problem of disappearing file descriptors 1683=head3 The special problem of disappearing file descriptors
1605 1684
1606Some backends (e.g. kqueue, epoll) need to be told about closing a file 1685Some backends (e.g. kqueue, epoll, linuxaio) need to be told about closing
1607descriptor (either due to calling C<close> explicitly or any other means, 1686a file descriptor (either due to calling C<close> explicitly or any other
1608such as C<dup2>). The reason is that you register interest in some file 1687means, such as C<dup2>). The reason is that you register interest in some
1609descriptor, but when it goes away, the operating system will silently drop 1688file descriptor, but when it goes away, the operating system will silently
1610this interest. If another file descriptor with the same number then is 1689drop this interest. If another file descriptor with the same number then
1611registered with libev, there is no efficient way to see that this is, in 1690is registered with libev, there is no efficient way to see that this is,
1612fact, a different file descriptor. 1691in fact, a different file descriptor.
1613 1692
1614To avoid having to explicitly tell libev about such cases, libev follows 1693To avoid having to explicitly tell libev about such cases, libev follows
1615the following policy: Each time C<ev_io_set> is being called, libev 1694the following policy: Each time C<ev_io_set> is being called, libev
1616will assume that this is potentially a new file descriptor, otherwise 1695will assume that this is potentially a new file descriptor, otherwise
1617it is assumed that the file descriptor stays the same. That means that 1696it is assumed that the file descriptor stays the same. That means that
1666when you rarely read from a file instead of from a socket, and want to 1745when you rarely read from a file instead of from a socket, and want to
1667reuse the same code path. 1746reuse the same code path.
1668 1747
1669=head3 The special problem of fork 1748=head3 The special problem of fork
1670 1749
1671Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1750Some backends (epoll, kqueue, probably linuxaio) do not support C<fork ()>
1672useless behaviour. Libev fully supports fork, but needs to be told about 1751at all or exhibit useless behaviour. Libev fully supports fork, but needs
1673it in the child if you want to continue to use it in the child. 1752to be told about it in the child if you want to continue to use it in the
1753child.
1674 1754
1675To support fork in your child processes, you have to call C<ev_loop_fork 1755To support fork in your child processes, you have to call C<ev_loop_fork
1676()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to 1756()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1677C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1757C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1678 1758
2024 2104
2025The relative timeouts are calculated relative to the C<ev_now ()> 2105The relative timeouts are calculated relative to the C<ev_now ()>
2026time. This is usually the right thing as this timestamp refers to the time 2106time. This is usually the right thing as this timestamp refers to the time
2027of the event triggering whatever timeout you are modifying/starting. If 2107of the event triggering whatever timeout you are modifying/starting. If
2028you suspect event processing to be delayed and you I<need> to base the 2108you suspect event processing to be delayed and you I<need> to base the
2029timeout on the current time, use something like this to adjust for this: 2109timeout on the current time, use something like the following to adjust
2110for it:
2030 2111
2031 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 2112 ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
2032 2113
2033If the event loop is suspended for a long time, you can also force an 2114If the event loop is suspended for a long time, you can also force an
2034update of the time returned by C<ev_now ()> by calling C<ev_now_update 2115update of the time returned by C<ev_now ()> by calling C<ev_now_update
2035()>. 2116()>, although that will push the event time of all outstanding events
2117further into the future.
2036 2118
2037=head3 The special problem of unsynchronised clocks 2119=head3 The special problem of unsynchronised clocks
2038 2120
2039Modern systems have a variety of clocks - libev itself uses the normal 2121Modern systems have a variety of clocks - libev itself uses the normal
2040"wall clock" clock and, if available, the monotonic clock (to avoid time 2122"wall clock" clock and, if available, the monotonic clock (to avoid time
2103 2185
2104=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 2186=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
2105 2187
2106=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) 2188=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
2107 2189
2108Configure the timer to trigger after C<after> seconds. If C<repeat> 2190Configure the timer to trigger after C<after> seconds (fractional and
2109is C<0.>, then it will automatically be stopped once the timeout is 2191negative values are supported). If C<repeat> is C<0.>, then it will
2110reached. If it is positive, then the timer will automatically be 2192automatically be stopped once the timeout is reached. If it is positive,
2111configured to trigger again C<repeat> seconds later, again, and again, 2193then the timer will automatically be configured to trigger again C<repeat>
2112until stopped manually. 2194seconds later, again, and again, until stopped manually.
2113 2195
2114The timer itself will do a best-effort at avoiding drift, that is, if 2196The timer itself will do a best-effort at avoiding drift, that is, if
2115you configure a timer to trigger every 10 seconds, then it will normally 2197you configure a timer to trigger every 10 seconds, then it will normally
2116trigger at exactly 10 second intervals. If, however, your program cannot 2198trigger at exactly 10 second intervals. If, however, your program cannot
2117keep up with the timer (because it takes longer than those 10 seconds to 2199keep up with the timer (because it takes longer than those 10 seconds to
2136=item If the timer is repeating, make the C<repeat> value the new timeout 2218=item If the timer is repeating, make the C<repeat> value the new timeout
2137and start the timer, if necessary. 2219and start the timer, if necessary.
2138 2220
2139=back 2221=back
2140 2222
2141This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 2223This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2142usage example. 2224usage example.
2143 2225
2144=item ev_tstamp ev_timer_remaining (loop, ev_timer *) 2226=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2145 2227
2146Returns the remaining time until a timer fires. If the timer is active, 2228Returns the remaining time until a timer fires. If the timer is active,
2199Periodic watchers are also timers of a kind, but they are very versatile 2281Periodic watchers are also timers of a kind, but they are very versatile
2200(and unfortunately a bit complex). 2282(and unfortunately a bit complex).
2201 2283
2202Unlike C<ev_timer>, periodic watchers are not based on real time (or 2284Unlike C<ev_timer>, periodic watchers are not based on real time (or
2203relative time, the physical time that passes) but on wall clock time 2285relative time, the physical time that passes) but on wall clock time
2204(absolute time, the thing you can read on your calender or clock). The 2286(absolute time, the thing you can read on your calendar or clock). The
2205difference is that wall clock time can run faster or slower than real 2287difference is that wall clock time can run faster or slower than real
2206time, and time jumps are not uncommon (e.g. when you adjust your 2288time, and time jumps are not uncommon (e.g. when you adjust your
2207wrist-watch). 2289wrist-watch).
2208 2290
2209You can tell a periodic watcher to trigger after some specific point 2291You can tell a periodic watcher to trigger after some specific point
2214C<ev_timer>, which would still trigger roughly 10 seconds after starting 2296C<ev_timer>, which would still trigger roughly 10 seconds after starting
2215it, as it uses a relative timeout). 2297it, as it uses a relative timeout).
2216 2298
2217C<ev_periodic> watchers can also be used to implement vastly more complex 2299C<ev_periodic> watchers can also be used to implement vastly more complex
2218timers, such as triggering an event on each "midnight, local time", or 2300timers, such as triggering an event on each "midnight, local time", or
2219other complicated rules. This cannot be done with C<ev_timer> watchers, as 2301other complicated rules. This cannot easily be done with C<ev_timer>
2220those cannot react to time jumps. 2302watchers, as those cannot react to time jumps.
2221 2303
2222As with timers, the callback is guaranteed to be invoked only when the 2304As with timers, the callback is guaranteed to be invoked only when the
2223point in time where it is supposed to trigger has passed. If multiple 2305point in time where it is supposed to trigger has passed. If multiple
2224timers become ready during the same loop iteration then the ones with 2306timers become ready during the same loop iteration then the ones with
2225earlier time-out values are invoked before ones with later time-out values 2307earlier time-out values are invoked before ones with later time-out values
2311 2393
2312NOTE: I<< This callback must always return a time that is higher than or 2394NOTE: I<< This callback must always return a time that is higher than or
2313equal to the passed C<now> value >>. 2395equal to the passed C<now> value >>.
2314 2396
2315This can be used to create very complex timers, such as a timer that 2397This can be used to create very complex timers, such as a timer that
2316triggers on "next midnight, local time". To do this, you would calculate the 2398triggers on "next midnight, local time". To do this, you would calculate
2317next midnight after C<now> and return the timestamp value for this. How 2399the next midnight after C<now> and return the timestamp value for
2318you do this is, again, up to you (but it is not trivial, which is the main 2400this. Here is a (completely untested, no error checking) example on how to
2319reason I omitted it as an example). 2401do this:
2402
2403 #include <time.h>
2404
2405 static ev_tstamp
2406 my_rescheduler (ev_periodic *w, ev_tstamp now)
2407 {
2408 time_t tnow = (time_t)now;
2409 struct tm tm;
2410 localtime_r (&tnow, &tm);
2411
2412 tm.tm_sec = tm.tm_min = tm.tm_hour = 0; // midnight current day
2413 ++tm.tm_mday; // midnight next day
2414
2415 return mktime (&tm);
2416 }
2417
2418Note: this code might run into trouble on days that have more then two
2419midnights (beginning and end).
2320 2420
2321=back 2421=back
2322 2422
2323=item ev_periodic_again (loop, ev_periodic *) 2423=item ev_periodic_again (loop, ev_periodic *)
2324 2424
2389 2489
2390 ev_periodic hourly_tick; 2490 ev_periodic hourly_tick;
2391 ev_periodic_init (&hourly_tick, clock_cb, 2491 ev_periodic_init (&hourly_tick, clock_cb,
2392 fmod (ev_now (loop), 3600.), 3600., 0); 2492 fmod (ev_now (loop), 3600.), 3600., 0);
2393 ev_periodic_start (loop, &hourly_tick); 2493 ev_periodic_start (loop, &hourly_tick);
2394 2494
2395 2495
2396=head2 C<ev_signal> - signal me when a signal gets signalled! 2496=head2 C<ev_signal> - signal me when a signal gets signalled!
2397 2497
2398Signal watchers will trigger an event when the process receives a specific 2498Signal watchers will trigger an event when the process receives a specific
2399signal one or more times. Even though signals are very asynchronous, libev 2499signal one or more times. Even though signals are very asynchronous, libev
2409only within the same loop, i.e. you can watch for C<SIGINT> in your 2509only within the same loop, i.e. you can watch for C<SIGINT> in your
2410default loop and for C<SIGIO> in another loop, but you cannot watch for 2510default loop and for C<SIGIO> in another loop, but you cannot watch for
2411C<SIGINT> in both the default loop and another loop at the same time. At 2511C<SIGINT> in both the default loop and another loop at the same time. At
2412the moment, C<SIGCHLD> is permanently tied to the default loop. 2512the moment, C<SIGCHLD> is permanently tied to the default loop.
2413 2513
2414When the first watcher gets started will libev actually register something 2514Only after the first watcher for a signal is started will libev actually
2415with the kernel (thus it coexists with your own signal handlers as long as 2515register something with the kernel. It thus coexists with your own signal
2416you don't register any with libev for the same signal). 2516handlers as long as you don't register any with libev for the same signal.
2417 2517
2418If possible and supported, libev will install its handlers with 2518If possible and supported, libev will install its handlers with
2419C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should 2519C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2420not be unduly interrupted. If you have a problem with system calls getting 2520not be unduly interrupted. If you have a problem with system calls getting
2421interrupted by signals you can block all signals in an C<ev_check> watcher 2521interrupted by signals you can block all signals in an C<ev_check> watcher
2606 2706
2607=head2 C<ev_stat> - did the file attributes just change? 2707=head2 C<ev_stat> - did the file attributes just change?
2608 2708
2609This watches a file system path for attribute changes. That is, it calls 2709This watches a file system path for attribute changes. That is, it calls
2610C<stat> on that path in regular intervals (or when the OS says it changed) 2710C<stat> on that path in regular intervals (or when the OS says it changed)
2611and sees if it changed compared to the last time, invoking the callback if 2711and sees if it changed compared to the last time, invoking the callback
2612it did. 2712if it did. Starting the watcher C<stat>'s the file, so only changes that
2713happen after the watcher has been started will be reported.
2613 2714
2614The path does not need to exist: changing from "path exists" to "path does 2715The path does not need to exist: changing from "path exists" to "path does
2615not exist" is a status change like any other. The condition "path does not 2716not exist" is a status change like any other. The condition "path does not
2616exist" (or more correctly "path cannot be stat'ed") is signified by the 2717exist" (or more correctly "path cannot be stat'ed") is signified by the
2617C<st_nlink> field being zero (which is otherwise always forced to be at 2718C<st_nlink> field being zero (which is otherwise always forced to be at
2858 2959
2859This mode of operation can be useful together with an C<ev_check> watcher, 2960This mode of operation can be useful together with an C<ev_check> watcher,
2860to do something on each event loop iteration - for example to balance load 2961to do something on each event loop iteration - for example to balance load
2861between different connections. 2962between different connections.
2862 2963
2863See L<Abusing an C<ev_check> watcher for its side-effect> for a longer 2964See L</Abusing an ev_check watcher for its side-effect> for a longer
2864example. 2965example.
2865 2966
2866=head3 Watcher-Specific Functions and Data Members 2967=head3 Watcher-Specific Functions and Data Members
2867 2968
2868=over 4 2969=over 4
2881callback, free it. Also, use no error checking, as usual. 2982callback, free it. Also, use no error checking, as usual.
2882 2983
2883 static void 2984 static void
2884 idle_cb (struct ev_loop *loop, ev_idle *w, int revents) 2985 idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2885 { 2986 {
2987 // stop the watcher
2988 ev_idle_stop (loop, w);
2989
2990 // now we can free it
2886 free (w); 2991 free (w);
2992
2887 // now do something you wanted to do when the program has 2993 // now do something you wanted to do when the program has
2888 // no longer anything immediate to do. 2994 // no longer anything immediate to do.
2889 } 2995 }
2890 2996
2891 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2997 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2897 3003
2898Prepare and check watchers are often (but not always) used in pairs: 3004Prepare and check watchers are often (but not always) used in pairs:
2899prepare watchers get invoked before the process blocks and check watchers 3005prepare watchers get invoked before the process blocks and check watchers
2900afterwards. 3006afterwards.
2901 3007
2902You I<must not> call C<ev_run> or similar functions that enter 3008You I<must not> call C<ev_run> (or similar functions that enter the
2903the current event loop from either C<ev_prepare> or C<ev_check> 3009current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2904watchers. Other loops than the current one are fine, however. The 3010C<ev_check> watchers. Other loops than the current one are fine,
2905rationale behind this is that you do not need to check for recursion in 3011however. The rationale behind this is that you do not need to check
2906those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 3012for recursion in those watchers, i.e. the sequence will always be
2907C<ev_check> so if you have one watcher of each kind they will always be 3013C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2908called in pairs bracketing the blocking call. 3014kind they will always be called in pairs bracketing the blocking call.
2909 3015
2910Their main purpose is to integrate other event mechanisms into libev and 3016Their main purpose is to integrate other event mechanisms into libev and
2911their use is somewhat advanced. They could be used, for example, to track 3017their use is somewhat advanced. They could be used, for example, to track
2912variable changes, implement your own watchers, integrate net-snmp or a 3018variable changes, implement your own watchers, integrate net-snmp or a
2913coroutine library and lots more. They are also occasionally useful if 3019coroutine library and lots more. They are also occasionally useful if
2957 3063
2958Using an C<ev_check> watcher is almost enough: it will be called on the 3064Using an C<ev_check> watcher is almost enough: it will be called on the
2959next event loop iteration. However, that isn't as soon as possible - 3065next event loop iteration. However, that isn't as soon as possible -
2960without external events, your C<ev_check> watcher will not be invoked. 3066without external events, your C<ev_check> watcher will not be invoked.
2961 3067
2962
2963This is where C<ev_idle> watchers come in handy - all you need is a 3068This is where C<ev_idle> watchers come in handy - all you need is a
2964single global idle watcher that is active as long as you have one active 3069single global idle watcher that is active as long as you have one active
2965C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop 3070C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
2966will not sleep, and the C<ev_check> watcher makes sure a callback gets 3071will not sleep, and the C<ev_check> watcher makes sure a callback gets
2967invoked. Neither watcher alone can do that. 3072invoked. Neither watcher alone can do that.
3173 3278
3174=over 4 3279=over 4
3175 3280
3176=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3281=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3177 3282
3178=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3283=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3179 3284
3180Configures the watcher to embed the given loop, which must be 3285Configures the watcher to embed the given loop, which must be
3181embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3286embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3182invoked automatically, otherwise it is the responsibility of the callback 3287invoked automatically, otherwise it is the responsibility of the callback
3183to invoke it (it will continue to be called until the sweep has been done, 3288to invoke it (it will continue to be called until the sweep has been done,
3204used). 3309used).
3205 3310
3206 struct ev_loop *loop_hi = ev_default_init (0); 3311 struct ev_loop *loop_hi = ev_default_init (0);
3207 struct ev_loop *loop_lo = 0; 3312 struct ev_loop *loop_lo = 0;
3208 ev_embed embed; 3313 ev_embed embed;
3209 3314
3210 // see if there is a chance of getting one that works 3315 // see if there is a chance of getting one that works
3211 // (remember that a flags value of 0 means autodetection) 3316 // (remember that a flags value of 0 means autodetection)
3212 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 3317 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3213 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 3318 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3214 : 0; 3319 : 0;
3228C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 3333C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3229 3334
3230 struct ev_loop *loop = ev_default_init (0); 3335 struct ev_loop *loop = ev_default_init (0);
3231 struct ev_loop *loop_socket = 0; 3336 struct ev_loop *loop_socket = 0;
3232 ev_embed embed; 3337 ev_embed embed;
3233 3338
3234 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 3339 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3235 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 3340 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3236 { 3341 {
3237 ev_embed_init (&embed, 0, loop_socket); 3342 ev_embed_init (&embed, 0, loop_socket);
3238 ev_embed_start (loop, &embed); 3343 ev_embed_start (loop, &embed);
3246 3351
3247=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3352=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3248 3353
3249Fork watchers are called when a C<fork ()> was detected (usually because 3354Fork watchers are called when a C<fork ()> was detected (usually because
3250whoever is a good citizen cared to tell libev about it by calling 3355whoever is a good citizen cared to tell libev about it by calling
3251C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the 3356C<ev_loop_fork>). The invocation is done before the event loop blocks next
3252event loop blocks next and before C<ev_check> watchers are being called, 3357and before C<ev_check> watchers are being called, and only in the child
3253and only in the child after the fork. If whoever good citizen calling 3358after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3254C<ev_default_fork> cheats and calls it in the wrong process, the fork 3359and calls it in the wrong process, the fork handlers will be invoked, too,
3255handlers will be invoked, too, of course. 3360of course.
3256 3361
3257=head3 The special problem of life after fork - how is it possible? 3362=head3 The special problem of life after fork - how is it possible?
3258 3363
3259Most uses of C<fork()> consist of forking, then some simple calls to set 3364Most uses of C<fork ()> consist of forking, then some simple calls to set
3260up/change the process environment, followed by a call to C<exec()>. This 3365up/change the process environment, followed by a call to C<exec()>. This
3261sequence should be handled by libev without any problems. 3366sequence should be handled by libev without any problems.
3262 3367
3263This changes when the application actually wants to do event handling 3368This changes when the application actually wants to do event handling
3264in the child, or both parent in child, in effect "continuing" after the 3369in the child, or both parent in child, in effect "continuing" after the
3502 3607
3503There are some other functions of possible interest. Described. Here. Now. 3608There are some other functions of possible interest. Described. Here. Now.
3504 3609
3505=over 4 3610=over 4
3506 3611
3507=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback) 3612=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback, arg)
3508 3613
3509This function combines a simple timer and an I/O watcher, calls your 3614This function combines a simple timer and an I/O watcher, calls your
3510callback on whichever event happens first and automatically stops both 3615callback on whichever event happens first and automatically stops both
3511watchers. This is useful if you want to wait for a single event on an fd 3616watchers. This is useful if you want to wait for a single event on an fd
3512or timeout without having to allocate/configure/start/stop/free one or 3617or timeout without having to allocate/configure/start/stop/free one or
3654already been invoked. 3759already been invoked.
3655 3760
3656A common way around all these issues is to make sure that 3761A common way around all these issues is to make sure that
3657C<start_new_request> I<always> returns before the callback is invoked. If 3762C<start_new_request> I<always> returns before the callback is invoked. If
3658C<start_new_request> immediately knows the result, it can artificially 3763C<start_new_request> immediately knows the result, it can artificially
3659delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher 3764delay invoking the callback by using a C<prepare> or C<idle> watcher for
3660for example, or more sneakily, by reusing an existing (stopped) watcher 3765example, or more sneakily, by reusing an existing (stopped) watcher and
3661and pushing it into the pending queue: 3766pushing it into the pending queue:
3662 3767
3663 ev_set_cb (watcher, callback); 3768 ev_set_cb (watcher, callback);
3664 ev_feed_event (EV_A_ watcher, 0); 3769 ev_feed_event (EV_A_ watcher, 0);
3665 3770
3666This way, C<start_new_request> can safely return before the callback is 3771This way, C<start_new_request> can safely return before the callback is
3674 3779
3675This brings the problem of exiting - a callback might want to finish the 3780This brings the problem of exiting - a callback might want to finish the
3676main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but 3781main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3677a modal "Are you sure?" dialog is still waiting), or just the nested one 3782a modal "Are you sure?" dialog is still waiting), or just the nested one
3678and not the main one (e.g. user clocked "Ok" in a modal dialog), or some 3783and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3679other combination: In these cases, C<ev_break> will not work alone. 3784other combination: In these cases, a simple C<ev_break> will not work.
3680 3785
3681The solution is to maintain "break this loop" variable for each C<ev_run> 3786The solution is to maintain "break this loop" variable for each C<ev_run>
3682invocation, and use a loop around C<ev_run> until the condition is 3787invocation, and use a loop around C<ev_run> until the condition is
3683triggered, using C<EVRUN_ONCE>: 3788triggered, using C<EVRUN_ONCE>:
3684 3789
3870called): 3975called):
3871 3976
3872 void 3977 void
3873 wait_for_event (ev_watcher *w) 3978 wait_for_event (ev_watcher *w)
3874 { 3979 {
3875 ev_cb_set (w) = current_coro; 3980 ev_set_cb (w, current_coro);
3876 switch_to (libev_coro); 3981 switch_to (libev_coro);
3877 } 3982 }
3878 3983
3879That basically suspends the coroutine inside C<wait_for_event> and 3984That basically suspends the coroutine inside C<wait_for_event> and
3880continues the libev coroutine, which, when appropriate, switches back to 3985continues the libev coroutine, which, when appropriate, switches back to
3883You can do similar tricks if you have, say, threads with an event queue - 3988You can do similar tricks if you have, say, threads with an event queue -
3884instead of storing a coroutine, you store the queue object and instead of 3989instead of storing a coroutine, you store the queue object and instead of
3885switching to a coroutine, you push the watcher onto the queue and notify 3990switching to a coroutine, you push the watcher onto the queue and notify
3886any waiters. 3991any waiters.
3887 3992
3888To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two 3993To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
3889files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: 3994files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3890 3995
3891 // my_ev.h 3996 // my_ev.h
3892 #define EV_CB_DECLARE(type) struct my_coro *cb; 3997 #define EV_CB_DECLARE(type) struct my_coro *cb;
3893 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); 3998 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3894 #include "../libev/ev.h" 3999 #include "../libev/ev.h"
3895 4000
3896 // my_ev.c 4001 // my_ev.c
3897 #define EV_H "my_ev.h" 4002 #define EV_H "my_ev.h"
3898 #include "../libev/ev.c" 4003 #include "../libev/ev.c"
3944The normal C API should work fine when used from C++: both ev.h and the 4049The normal C API should work fine when used from C++: both ev.h and the
3945libev sources can be compiled as C++. Therefore, code that uses the C API 4050libev sources can be compiled as C++. Therefore, code that uses the C API
3946will work fine. 4051will work fine.
3947 4052
3948Proper exception specifications might have to be added to callbacks passed 4053Proper exception specifications might have to be added to callbacks passed
3949to libev: exceptions may be thrown only from watcher callbacks, all 4054to libev: exceptions may be thrown only from watcher callbacks, all other
3950other callbacks (allocator, syserr, loop acquire/release and periodioc 4055callbacks (allocator, syserr, loop acquire/release and periodic reschedule
3951reschedule callbacks) must not throw exceptions, and might need a C<throw 4056callbacks) must not throw exceptions, and might need a C<noexcept>
3952()> specification. If you have code that needs to be compiled as both C 4057specification. If you have code that needs to be compiled as both C and
3953and C++ you can use the C<EV_THROW> macro for this: 4058C++ you can use the C<EV_NOEXCEPT> macro for this:
3954 4059
3955 static void 4060 static void
3956 fatal_error (const char *msg) EV_THROW 4061 fatal_error (const char *msg) EV_NOEXCEPT
3957 { 4062 {
3958 perror (msg); 4063 perror (msg);
3959 abort (); 4064 abort ();
3960 } 4065 }
3961 4066
3975Libev comes with some simplistic wrapper classes for C++ that mainly allow 4080Libev comes with some simplistic wrapper classes for C++ that mainly allow
3976you to use some convenience methods to start/stop watchers and also change 4081you to use some convenience methods to start/stop watchers and also change
3977the callback model to a model using method callbacks on objects. 4082the callback model to a model using method callbacks on objects.
3978 4083
3979To use it, 4084To use it,
3980 4085
3981 #include <ev++.h> 4086 #include <ev++.h>
3982 4087
3983This automatically includes F<ev.h> and puts all of its definitions (many 4088This automatically includes F<ev.h> and puts all of its definitions (many
3984of them macros) into the global namespace. All C++ specific things are 4089of them macros) into the global namespace. All C++ specific things are
3985put into the C<ev> namespace. It should support all the same embedding 4090put into the C<ev> namespace. It should support all the same embedding
4088 void operator() (ev::io &w, int revents) 4193 void operator() (ev::io &w, int revents)
4089 { 4194 {
4090 ... 4195 ...
4091 } 4196 }
4092 } 4197 }
4093 4198
4094 myfunctor f; 4199 myfunctor f;
4095 4200
4096 ev::io w; 4201 ev::io w;
4097 w.set (&f); 4202 w.set (&f);
4098 4203
4116Associates a different C<struct ev_loop> with this watcher. You can only 4221Associates a different C<struct ev_loop> with this watcher. You can only
4117do this when the watcher is inactive (and not pending either). 4222do this when the watcher is inactive (and not pending either).
4118 4223
4119=item w->set ([arguments]) 4224=item w->set ([arguments])
4120 4225
4121Basically the same as C<ev_TYPE_set>, with the same arguments. Either this 4226Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
4122method or a suitable start method must be called at least once. Unlike the 4227with the same arguments. Either this method or a suitable start method
4123C counterpart, an active watcher gets automatically stopped and restarted 4228must be called at least once. Unlike the C counterpart, an active watcher
4124when reconfiguring it with this method. 4229gets automatically stopped and restarted when reconfiguring it with this
4230method.
4231
4232For C<ev::embed> watchers this method is called C<set_embed>, to avoid
4233clashing with the C<set (loop)> method.
4125 4234
4126=item w->start () 4235=item w->start ()
4127 4236
4128Starts the watcher. Note that there is no C<loop> argument, as the 4237Starts the watcher. Note that there is no C<loop> argument, as the
4129constructor already stores the event loop. 4238constructor already stores the event loop.
4233 4342
4234Brian Maher has written a partial interface to libev for lua (at the 4343Brian Maher has written a partial interface to libev for lua (at the
4235time of this writing, only C<ev_io> and C<ev_timer>), to be found at 4344time of this writing, only C<ev_io> and C<ev_timer>), to be found at
4236L<http://github.com/brimworks/lua-ev>. 4345L<http://github.com/brimworks/lua-ev>.
4237 4346
4347=item Javascript
4348
4349Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
4350
4351=item Others
4352
4353There are others, and I stopped counting.
4354
4238=back 4355=back
4239 4356
4240 4357
4241=head1 MACRO MAGIC 4358=head1 MACRO MAGIC
4242 4359
4359 ev_vars.h 4476 ev_vars.h
4360 ev_wrap.h 4477 ev_wrap.h
4361 4478
4362 ev_win32.c required on win32 platforms only 4479 ev_win32.c required on win32 platforms only
4363 4480
4364 ev_select.c only when select backend is enabled (which is enabled by default) 4481 ev_select.c only when select backend is enabled
4365 ev_poll.c only when poll backend is enabled (disabled by default) 4482 ev_poll.c only when poll backend is enabled
4366 ev_epoll.c only when the epoll backend is enabled (disabled by default) 4483 ev_epoll.c only when the epoll backend is enabled
4484 ev_linuxaio.c only when the linux aio backend is enabled
4367 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 4485 ev_kqueue.c only when the kqueue backend is enabled
4368 ev_port.c only when the solaris port backend is enabled (disabled by default) 4486 ev_port.c only when the solaris port backend is enabled
4369 4487
4370F<ev.c> includes the backend files directly when enabled, so you only need 4488F<ev.c> includes the backend files directly when enabled, so you only need
4371to compile this single file. 4489to compile this single file.
4372 4490
4373=head3 LIBEVENT COMPATIBILITY API 4491=head3 LIBEVENT COMPATIBILITY API
4541If programs implement their own fd to handle mapping on win32, then this 4659If programs implement their own fd to handle mapping on win32, then this
4542macro can be used to override the C<close> function, useful to unregister 4660macro can be used to override the C<close> function, useful to unregister
4543file descriptors again. Note that the replacement function has to close 4661file descriptors again. Note that the replacement function has to close
4544the underlying OS handle. 4662the underlying OS handle.
4545 4663
4664=item EV_USE_WSASOCKET
4665
4666If defined to be C<1>, libev will use C<WSASocket> to create its internal
4667communication socket, which works better in some environments. Otherwise,
4668the normal C<socket> function will be used, which works better in other
4669environments.
4670
4546=item EV_USE_POLL 4671=item EV_USE_POLL
4547 4672
4548If defined to be C<1>, libev will compile in support for the C<poll>(2) 4673If defined to be C<1>, libev will compile in support for the C<poll>(2)
4549backend. Otherwise it will be enabled on non-win32 platforms. It 4674backend. Otherwise it will be enabled on non-win32 platforms. It
4550takes precedence over select. 4675takes precedence over select.
4554If defined to be C<1>, libev will compile in support for the Linux 4679If defined to be C<1>, libev will compile in support for the Linux
4555C<epoll>(7) backend. Its availability will be detected at runtime, 4680C<epoll>(7) backend. Its availability will be detected at runtime,
4556otherwise another method will be used as fallback. This is the preferred 4681otherwise another method will be used as fallback. This is the preferred
4557backend for GNU/Linux systems. If undefined, it will be enabled if the 4682backend for GNU/Linux systems. If undefined, it will be enabled if the
4558headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. 4683headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
4684
4685=item EV_USE_LINUXAIO
4686
4687If defined to be C<1>, libev will compile in support for the Linux
4688aio backend. Due to it's currenbt limitations it has to be requested
4689explicitly. If undefined, it will be enabled on linux, otherwise
4690disabled.
4559 4691
4560=item EV_USE_KQUEUE 4692=item EV_USE_KQUEUE
4561 4693
4562If defined to be C<1>, libev will compile in support for the BSD style 4694If defined to be C<1>, libev will compile in support for the BSD style
4563C<kqueue>(2) backend. Its actual availability will be detected at runtime, 4695C<kqueue>(2) backend. Its actual availability will be detected at runtime,
4594different cpus (or different cpu cores). This reduces dependencies 4726different cpus (or different cpu cores). This reduces dependencies
4595and makes libev faster. 4727and makes libev faster.
4596 4728
4597=item EV_NO_THREADS 4729=item EV_NO_THREADS
4598 4730
4599If defined to be C<1>, libev will assume that it will never be called 4731If defined to be C<1>, libev will assume that it will never be called from
4600from different threads, which is a stronger assumption than C<EV_NO_SMP>, 4732different threads (that includes signal handlers), which is a stronger
4601above. This reduces dependencies and makes libev faster. 4733assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4734libev faster.
4602 4735
4603=item EV_ATOMIC_T 4736=item EV_ATOMIC_T
4604 4737
4605Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4738Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4606access is atomic and serialised with respect to other threads or signal 4739access is atomic with respect to other threads or signal contexts. No
4607contexts. No such type is easily found in the C language, so you can 4740such type is easily found in the C language, so you can provide your own
4608provide your own type that you know is safe for your purposes. It is used 4741type that you know is safe for your purposes. It is used both for signal
4609both for signal handler "locking" as well as for signal and thread safety 4742handler "locking" as well as for signal and thread safety in C<ev_async>
4610in C<ev_async> watchers. 4743watchers.
4611 4744
4612In the absence of this define, libev will use C<sig_atomic_t volatile> 4745In the absence of this define, libev will use C<sig_atomic_t volatile>
4613(from F<signal.h>), which is usually good enough on most platforms, 4746(from F<signal.h>), which is usually good enough on most platforms.
4614although strictly speaking using a type that also implies a memory fence
4615is required.
4616 4747
4617=item EV_H (h) 4748=item EV_H (h)
4618 4749
4619The name of the F<ev.h> header file used to include it. The default if 4750The name of the F<ev.h> header file used to include it. The default if
4620undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 4751undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
4988default loop and triggering an C<ev_async> watcher from the default loop 5119default loop and triggering an C<ev_async> watcher from the default loop
4989watcher callback into the event loop interested in the signal. 5120watcher callback into the event loop interested in the signal.
4990 5121
4991=back 5122=back
4992 5123
4993See also L<THREAD LOCKING EXAMPLE>. 5124See also L</THREAD LOCKING EXAMPLE>.
4994 5125
4995=head3 COROUTINES 5126=head3 COROUTINES
4996 5127
4997Libev is very accommodating to coroutines ("cooperative threads"): 5128Libev is very accommodating to coroutines ("cooperative threads"):
4998libev fully supports nesting calls to its functions from different 5129libev fully supports nesting calls to its functions from different
5267structure (guaranteed by POSIX but not by ISO C for example), but it also 5398structure (guaranteed by POSIX but not by ISO C for example), but it also
5268assumes that the same (machine) code can be used to call any watcher 5399assumes that the same (machine) code can be used to call any watcher
5269callback: The watcher callbacks have different type signatures, but libev 5400callback: The watcher callbacks have different type signatures, but libev
5270calls them using an C<ev_watcher *> internally. 5401calls them using an C<ev_watcher *> internally.
5271 5402
5403=item null pointers and integer zero are represented by 0 bytes
5404
5405Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and
5406relies on this setting pointers and integers to null.
5407
5272=item pointer accesses must be thread-atomic 5408=item pointer accesses must be thread-atomic
5273 5409
5274Accessing a pointer value must be atomic, it must both be readable and 5410Accessing a pointer value must be atomic, it must both be readable and
5275writable in one piece - this is the case on all current architectures. 5411writable in one piece - this is the case on all current architectures.
5276 5412
5289thread" or will block signals process-wide, both behaviours would 5425thread" or will block signals process-wide, both behaviours would
5290be compatible with libev. Interaction between C<sigprocmask> and 5426be compatible with libev. Interaction between C<sigprocmask> and
5291C<pthread_sigmask> could complicate things, however. 5427C<pthread_sigmask> could complicate things, however.
5292 5428
5293The most portable way to handle signals is to block signals in all threads 5429The most portable way to handle signals is to block signals in all threads
5294except the initial one, and run the default loop in the initial thread as 5430except the initial one, and run the signal handling loop in the initial
5295well. 5431thread as well.
5296 5432
5297=item C<long> must be large enough for common memory allocation sizes 5433=item C<long> must be large enough for common memory allocation sizes
5298 5434
5299To improve portability and simplify its API, libev uses C<long> internally 5435To improve portability and simplify its API, libev uses C<long> internally
5300instead of C<size_t> when allocating its data structures. On non-POSIX 5436instead of C<size_t> when allocating its data structures. On non-POSIX
5404=over 4 5540=over 4
5405 5541
5406=item C<EV_COMPAT3> backwards compatibility mechanism 5542=item C<EV_COMPAT3> backwards compatibility mechanism
5407 5543
5408The backward compatibility mechanism can be controlled by 5544The backward compatibility mechanism can be controlled by
5409C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> 5545C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5410section. 5546section.
5411 5547
5412=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5548=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5413 5549
5414These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5550These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5457=over 4 5593=over 4
5458 5594
5459=item active 5595=item active
5460 5596
5461A watcher is active as long as it has been started and not yet stopped. 5597A watcher is active as long as it has been started and not yet stopped.
5462See L<WATCHER STATES> for details. 5598See L</WATCHER STATES> for details.
5463 5599
5464=item application 5600=item application
5465 5601
5466In this document, an application is whatever is using libev. 5602In this document, an application is whatever is using libev.
5467 5603
5503watchers and events. 5639watchers and events.
5504 5640
5505=item pending 5641=item pending
5506 5642
5507A watcher is pending as soon as the corresponding event has been 5643A watcher is pending as soon as the corresponding event has been
5508detected. See L<WATCHER STATES> for details. 5644detected. See L</WATCHER STATES> for details.
5509 5645
5510=item real time 5646=item real time
5511 5647
5512The physical time that is observed. It is apparently strictly monotonic :) 5648The physical time that is observed. It is apparently strictly monotonic :)
5513 5649

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines