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

Comparing libev/ev.pod (file contents):
Revision 1.238 by root, Sat Apr 18 12:10:41 2009 UTC vs.
Revision 1.265 by root, Wed Aug 26 17:11:42 2009 UTC

98=head2 FEATURES 98=head2 FEATURES
99 99
100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
102for file descriptor events (C<ev_io>), the Linux C<inotify> interface 102for file descriptor events (C<ev_io>), the Linux C<inotify> interface
103(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 103(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
104with customised rescheduling (C<ev_periodic>), synchronous signals 104inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
105(C<ev_signal>), process status change events (C<ev_child>), and event 105timers (C<ev_timer>), absolute timers with customised rescheduling
106watchers dealing with the event loop mechanism itself (C<ev_idle>, 106(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
107C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as 107change events (C<ev_child>), and event watchers dealing with the event
108file watchers (C<ev_stat>) and even limited support for fork events 108loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
109(C<ev_fork>). 109C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
110limited support for fork events (C<ev_fork>).
110 111
111It also is quite fast (see this 112It also is quite fast (see this
112L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 113L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
113for example). 114for example).
114 115
361forget about forgetting to tell libev about forking) when you use this 362forget about forgetting to tell libev about forking) when you use this
362flag. 363flag.
363 364
364This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 365This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
365environment variable. 366environment variable.
367
368=item C<EVFLAG_NOINOTIFY>
369
370When this flag is specified, then libev will not attempt to use the
371I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
372testing, this flag can be useful to conserve inotify file descriptors, as
373otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374
375=item C<EVFLAG_NOSIGNALFD>
376
377When this flag is specified, then libev will not attempt to use the
378I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This is
379probably only useful to work around any bugs in libev. Consequently, this
380flag might go away once the signalfd functionality is considered stable,
381so it's useful mostly in environment variables and not in program code.
366 382
367=item C<EVBACKEND_SELECT> (value 1, portable select backend) 383=item C<EVBACKEND_SELECT> (value 1, portable select backend)
368 384
369This is your standard select(2) backend. Not I<completely> standard, as 385This is your standard select(2) backend. Not I<completely> standard, as
370libev tries to roll its own fd_set with no limits on the number of fds, 386libev tries to roll its own fd_set with no limits on the number of fds,
518 534
519It is definitely not recommended to use this flag. 535It is definitely not recommended to use this flag.
520 536
521=back 537=back
522 538
523If one or more of these are or'ed into the flags value, then only these 539If one or more of the backend flags are or'ed into the flags value,
524backends will be tried (in the reverse order as listed here). If none are 540then only these backends will be tried (in the reverse order as listed
525specified, all backends in C<ev_recommended_backends ()> will be tried. 541here). If none are specified, all backends in C<ev_recommended_backends
542()> will be tried.
526 543
527Example: This is the most typical usage. 544Example: This is the most typical usage.
528 545
529 if (!ev_default_loop (0)) 546 if (!ev_default_loop (0))
530 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 547 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
620happily wraps around with enough iterations. 637happily wraps around with enough iterations.
621 638
622This value can sometimes be useful as a generation counter of sorts (it 639This value can sometimes be useful as a generation counter of sorts (it
623"ticks" the number of loop iterations), as it roughly corresponds with 640"ticks" the number of loop iterations), as it roughly corresponds with
624C<ev_prepare> and C<ev_check> calls. 641C<ev_prepare> and C<ev_check> calls.
642
643=item unsigned int ev_loop_depth (loop)
644
645Returns the number of times C<ev_loop> was entered minus the number of
646times C<ev_loop> was exited, in other words, the recursion depth.
647
648Outside C<ev_loop>, this number is zero. In a callback, this number is
649C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
650in which case it is higher.
651
652Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
653etc.), doesn't count as exit.
625 654
626=item unsigned int ev_backend (loop) 655=item unsigned int ev_backend (loop)
627 656
628Returns one of the C<EVBACKEND_*> flags indicating the event backend in 657Returns one of the C<EVBACKEND_*> flags indicating the event backend in
629use. 658use.
811 840
812By setting a higher I<io collect interval> you allow libev to spend more 841By setting a higher I<io collect interval> you allow libev to spend more
813time collecting I/O events, so you can handle more events per iteration, 842time collecting I/O events, so you can handle more events per iteration,
814at the cost of increasing latency. Timeouts (both C<ev_periodic> and 843at the cost of increasing latency. Timeouts (both C<ev_periodic> and
815C<ev_timer>) will be not affected. Setting this to a non-null value will 844C<ev_timer>) will be not affected. Setting this to a non-null value will
816introduce an additional C<ev_sleep ()> call into most loop iterations. 845introduce an additional C<ev_sleep ()> call into most loop iterations. The
846sleep time ensures that libev will not poll for I/O events more often then
847once per this interval, on average.
817 848
818Likewise, by setting a higher I<timeout collect interval> you allow libev 849Likewise, by setting a higher I<timeout collect interval> you allow libev
819to spend more time collecting timeouts, at the expense of increased 850to spend more time collecting timeouts, at the expense of increased
820latency/jitter/inexactness (the watcher callback will be called 851latency/jitter/inexactness (the watcher callback will be called
821later). C<ev_io> watchers will not be affected. Setting this to a non-null 852later). C<ev_io> watchers will not be affected. Setting this to a non-null
823 854
824Many (busy) programs can usually benefit by setting the I/O collect 855Many (busy) programs can usually benefit by setting the I/O collect
825interval to a value near C<0.1> or so, which is often enough for 856interval to a value near C<0.1> or so, which is often enough for
826interactive servers (of course not for games), likewise for timeouts. It 857interactive servers (of course not for games), likewise for timeouts. It
827usually doesn't make much sense to set it to a lower value than C<0.01>, 858usually doesn't make much sense to set it to a lower value than C<0.01>,
828as this approaches the timing granularity of most systems. 859as this approaches the timing granularity of most systems. Note that if
860you do transactions with the outside world and you can't increase the
861parallelity, then this setting will limit your transaction rate (if you
862need to poll once per transaction and the I/O collect interval is 0.01,
863then you can't do more than 100 transations per second).
829 864
830Setting the I<timeout collect interval> can improve the opportunity for 865Setting the I<timeout collect interval> can improve the opportunity for
831saving power, as the program will "bundle" timer callback invocations that 866saving power, as the program will "bundle" timer callback invocations that
832are "near" in time together, by delaying some, thus reducing the number of 867are "near" in time together, by delaying some, thus reducing the number of
833times the process sleeps and wakes up again. Another useful technique to 868times the process sleeps and wakes up again. Another useful technique to
834reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure 869reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
835they fire on, say, one-second boundaries only. 870they fire on, say, one-second boundaries only.
871
872Example: we only need 0.1s timeout granularity, and we wish not to poll
873more often than 100 times per second:
874
875 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
876 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
877
878=item ev_invoke_pending (loop)
879
880This call will simply invoke all pending watchers while resetting their
881pending state. Normally, C<ev_loop> does this automatically when required,
882but when overriding the invoke callback this call comes handy.
883
884=item int ev_pending_count (loop)
885
886Returns the number of pending watchers - zero indicates that no watchers
887are pending.
888
889=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
890
891This overrides the invoke pending functionality of the loop: Instead of
892invoking all pending watchers when there are any, C<ev_loop> will call
893this callback instead. This is useful, for example, when you want to
894invoke the actual watchers inside another context (another thread etc.).
895
896If you want to reset the callback, use C<ev_invoke_pending> as new
897callback.
898
899=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
900
901Sometimes you want to share the same loop between multiple threads. This
902can be done relatively simply by putting mutex_lock/unlock calls around
903each call to a libev function.
904
905However, C<ev_loop> can run an indefinite time, so it is not feasible to
906wait for it to return. One way around this is to wake up the loop via
907C<ev_unloop> and C<av_async_send>, another way is to set these I<release>
908and I<acquire> callbacks on the loop.
909
910When set, then C<release> will be called just before the thread is
911suspended waiting for new events, and C<acquire> is called just
912afterwards.
913
914Ideally, C<release> will just call your mutex_unlock function, and
915C<acquire> will just call the mutex_lock function again.
916
917While event loop modifications are allowed between invocations of
918C<release> and C<acquire> (that's their only purpose after all), no
919modifications done will affect the event loop, i.e. adding watchers will
920have no effect on the set of file descriptors being watched, or the time
921waited. USe an C<ev_async> watcher to wake up C<ev_loop> when you want it
922to take note of any changes you made.
923
924In theory, threads executing C<ev_loop> will be async-cancel safe between
925invocations of C<release> and C<acquire>.
926
927See also the locking example in the C<THREADS> section later in this
928document.
929
930=item ev_set_userdata (loop, void *data)
931
932=item ev_userdata (loop)
933
934Set and retrieve a single C<void *> associated with a loop. When
935C<ev_set_userdata> has never been called, then C<ev_userdata> returns
936C<0.>
937
938These two functions can be used to associate arbitrary data with a loop,
939and are intended solely for the C<invoke_pending_cb>, C<release> and
940C<acquire> callbacks described above, but of course can be (ab-)used for
941any other purpose as well.
836 942
837=item ev_loop_verify (loop) 943=item ev_loop_verify (loop)
838 944
839This function only does something when C<EV_VERIFY> support has been 945This function only does something when C<EV_VERIFY> support has been
840compiled in, which is the default for non-minimal builds. It tries to go 946compiled in, which is the default for non-minimal builds. It tries to go
1184 #include <stddef.h> 1290 #include <stddef.h>
1185 1291
1186 static void 1292 static void
1187 t1_cb (EV_P_ ev_timer *w, int revents) 1293 t1_cb (EV_P_ ev_timer *w, int revents)
1188 { 1294 {
1189 struct my_biggy big = (struct my_biggy * 1295 struct my_biggy big = (struct my_biggy *)
1190 (((char *)w) - offsetof (struct my_biggy, t1)); 1296 (((char *)w) - offsetof (struct my_biggy, t1));
1191 } 1297 }
1192 1298
1193 static void 1299 static void
1194 t2_cb (EV_P_ ev_timer *w, int revents) 1300 t2_cb (EV_P_ ev_timer *w, int revents)
1195 { 1301 {
1196 struct my_biggy big = (struct my_biggy * 1302 struct my_biggy big = (struct my_biggy *)
1197 (((char *)w) - offsetof (struct my_biggy, t2)); 1303 (((char *)w) - offsetof (struct my_biggy, t2));
1198 } 1304 }
1199 1305
1200=head2 WATCHER PRIORITY MODELS 1306=head2 WATCHER PRIORITY MODELS
1201 1307
1277 // with the default priority are receiving events. 1383 // with the default priority are receiving events.
1278 ev_idle_start (EV_A_ &idle); 1384 ev_idle_start (EV_A_ &idle);
1279 } 1385 }
1280 1386
1281 static void 1387 static void
1282 idle-cb (EV_P_ ev_idle *w, int revents) 1388 idle_cb (EV_P_ ev_idle *w, int revents)
1283 { 1389 {
1284 // actual processing 1390 // actual processing
1285 read (STDIN_FILENO, ...); 1391 read (STDIN_FILENO, ...);
1286 1392
1287 // have to start the I/O watcher again, as 1393 // have to start the I/O watcher again, as
1332descriptors to non-blocking mode is also usually a good idea (but not 1438descriptors to non-blocking mode is also usually a good idea (but not
1333required if you know what you are doing). 1439required if you know what you are doing).
1334 1440
1335If you cannot use non-blocking mode, then force the use of a 1441If you cannot use non-blocking mode, then force the use of a
1336known-to-be-good backend (at the time of this writing, this includes only 1442known-to-be-good backend (at the time of this writing, this includes only
1337C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1443C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1444descriptors for which non-blocking operation makes no sense (such as
1445files) - libev doesn't guarentee any specific behaviour in that case.
1338 1446
1339Another thing you have to watch out for is that it is quite easy to 1447Another thing you have to watch out for is that it is quite easy to
1340receive "spurious" readiness notifications, that is your callback might 1448receive "spurious" readiness notifications, that is your callback might
1341be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1449be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1342because there is no data. Not only are some backends known to create a 1450because there is no data. Not only are some backends known to create a
1463year, it will still time out after (roughly) one hour. "Roughly" because 1571year, it will still time out after (roughly) one hour. "Roughly" because
1464detecting time jumps is hard, and some inaccuracies are unavoidable (the 1572detecting time jumps is hard, and some inaccuracies are unavoidable (the
1465monotonic clock option helps a lot here). 1573monotonic clock option helps a lot here).
1466 1574
1467The callback is guaranteed to be invoked only I<after> its timeout has 1575The callback is guaranteed to be invoked only I<after> its timeout has
1468passed. If multiple timers become ready during the same loop iteration 1576passed (not I<at>, so on systems with very low-resolution clocks this
1469then the ones with earlier time-out values are invoked before ones with 1577might introduce a small delay). If multiple timers become ready during the
1470later time-out values (but this is no longer true when a callback calls 1578same loop iteration then the ones with earlier time-out values are invoked
1471C<ev_loop> recursively). 1579before ones of the same priority with later time-out values (but this is
1580no longer true when a callback calls C<ev_loop> recursively).
1472 1581
1473=head3 Be smart about timeouts 1582=head3 Be smart about timeouts
1474 1583
1475Many real-world problems involve some kind of timeout, usually for error 1584Many real-world problems involve some kind of timeout, usually for error
1476recovery. A typical example is an HTTP request - if the other side hangs, 1585recovery. A typical example is an HTTP request - if the other side hangs,
1520C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> 1629C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1521member and C<ev_timer_again>. 1630member and C<ev_timer_again>.
1522 1631
1523At start: 1632At start:
1524 1633
1525 ev_timer_init (timer, callback); 1634 ev_init (timer, callback);
1526 timer->repeat = 60.; 1635 timer->repeat = 60.;
1527 ev_timer_again (loop, timer); 1636 ev_timer_again (loop, timer);
1528 1637
1529Each time there is some activity: 1638Each time there is some activity:
1530 1639
1592 1701
1593To start the timer, simply initialise the watcher and set C<last_activity> 1702To start the timer, simply initialise the watcher and set C<last_activity>
1594to the current time (meaning we just have some activity :), then call the 1703to the current time (meaning we just have some activity :), then call the
1595callback, which will "do the right thing" and start the timer: 1704callback, which will "do the right thing" and start the timer:
1596 1705
1597 ev_timer_init (timer, callback); 1706 ev_init (timer, callback);
1598 last_activity = ev_now (loop); 1707 last_activity = ev_now (loop);
1599 callback (loop, timer, EV_TIMEOUT); 1708 callback (loop, timer, EV_TIMEOUT);
1600 1709
1601And when there is some activity, simply store the current time in 1710And when there is some activity, simply store the current time in
1602C<last_activity>, no libev calls at all: 1711C<last_activity>, no libev calls at all:
1663 1772
1664If the event loop is suspended for a long time, you can also force an 1773If the event loop is suspended for a long time, you can also force an
1665update of the time returned by C<ev_now ()> by calling C<ev_now_update 1774update of the time returned by C<ev_now ()> by calling C<ev_now_update
1666()>. 1775()>.
1667 1776
1777=head3 The special problems of suspended animation
1778
1779When you leave the server world it is quite customary to hit machines that
1780can suspend/hibernate - what happens to the clocks during such a suspend?
1781
1782Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1783all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1784to run until the system is suspended, but they will not advance while the
1785system is suspended. That means, on resume, it will be as if the program
1786was frozen for a few seconds, but the suspend time will not be counted
1787towards C<ev_timer> when a monotonic clock source is used. The real time
1788clock advanced as expected, but if it is used as sole clocksource, then a
1789long suspend would be detected as a time jump by libev, and timers would
1790be adjusted accordingly.
1791
1792I would not be surprised to see different behaviour in different between
1793operating systems, OS versions or even different hardware.
1794
1795The other form of suspend (job control, or sending a SIGSTOP) will see a
1796time jump in the monotonic clocks and the realtime clock. If the program
1797is suspended for a very long time, and monotonic clock sources are in use,
1798then you can expect C<ev_timer>s to expire as the full suspension time
1799will be counted towards the timers. When no monotonic clock source is in
1800use, then libev will again assume a timejump and adjust accordingly.
1801
1802It might be beneficial for this latter case to call C<ev_suspend>
1803and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1804deterministic behaviour in this case (you can do nothing against
1805C<SIGSTOP>).
1806
1668=head3 Watcher-Specific Functions and Data Members 1807=head3 Watcher-Specific Functions and Data Members
1669 1808
1670=over 4 1809=over 4
1671 1810
1672=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1811=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1697If the timer is repeating, either start it if necessary (with the 1836If the timer is repeating, either start it if necessary (with the
1698C<repeat> value), or reset the running timer to the C<repeat> value. 1837C<repeat> value), or reset the running timer to the C<repeat> value.
1699 1838
1700This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 1839This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1701usage example. 1840usage example.
1841
1842=item ev_timer_remaining (loop, ev_timer *)
1843
1844Returns the remaining time until a timer fires. If the timer is active,
1845then this time is relative to the current event loop time, otherwise it's
1846the timeout value currently configured.
1847
1848That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1849C<5>. When the timer is started and one second passes, C<ev_timer_remain>
1850will return C<4>. When the timer expires and is restarted, it will return
1851roughly C<7> (likely slightly less as callback invocation takes some time,
1852too), and so on.
1702 1853
1703=item ev_tstamp repeat [read-write] 1854=item ev_tstamp repeat [read-write]
1704 1855
1705The current C<repeat> value. Will be used each time the watcher times out 1856The current C<repeat> value. Will be used each time the watcher times out
1706or C<ev_timer_again> is called, and determines the next timeout (if any), 1857or C<ev_timer_again> is called, and determines the next timeout (if any),
1942Signal watchers will trigger an event when the process receives a specific 2093Signal watchers will trigger an event when the process receives a specific
1943signal one or more times. Even though signals are very asynchronous, libev 2094signal one or more times. Even though signals are very asynchronous, libev
1944will try it's best to deliver signals synchronously, i.e. as part of the 2095will try it's best to deliver signals synchronously, i.e. as part of the
1945normal event processing, like any other event. 2096normal event processing, like any other event.
1946 2097
1947If you want signals asynchronously, just use C<sigaction> as you would 2098If you want signals to be delivered truly asynchronously, just use
1948do without libev and forget about sharing the signal. You can even use 2099C<sigaction> as you would do without libev and forget about sharing
1949C<ev_async> from a signal handler to synchronously wake up an event loop. 2100the signal. You can even use C<ev_async> from a signal handler to
2101synchronously wake up an event loop.
1950 2102
1951You can configure as many watchers as you like per signal. Only when the 2103You can configure as many watchers as you like for the same signal, but
2104only within the same loop, i.e. you can watch for C<SIGINT> in your
2105default loop and for C<SIGIO> in another loop, but you cannot watch for
2106C<SIGINT> in both the default loop and another loop at the same time. At
2107the moment, C<SIGCHLD> is permanently tied to the default loop.
2108
1952first watcher gets started will libev actually register a signal handler 2109When the first watcher gets started will libev actually register something
1953with the kernel (thus it coexists with your own signal handlers as long as 2110with the kernel (thus it coexists with your own signal handlers as long as
1954you don't register any with libev for the same signal). Similarly, when 2111you don't register any with libev for the same signal).
1955the last signal watcher for a signal is stopped, libev will reset the
1956signal handler to SIG_DFL (regardless of what it was set to before).
1957 2112
1958If possible and supported, libev will install its handlers with 2113If possible and supported, libev will install its handlers with
1959C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2114C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1960interrupted. If you have a problem with system calls getting interrupted by 2115not be unduly interrupted. If you have a problem with system calls getting
1961signals you can block all signals in an C<ev_check> watcher and unblock 2116interrupted by signals you can block all signals in an C<ev_check> watcher
1962them in an C<ev_prepare> watcher. 2117and unblock them in an C<ev_prepare> watcher.
2118
2119=head3 The special problem of inheritance over execve
2120
2121Both the signal mask (C<sigprocmask>) and the signal disposition
2122(C<sigaction>) are unspecified after starting a signal watcher (and after
2123stopping it again), that is, libev might or might not block the signal,
2124and might or might not set or restore the installed signal handler.
2125
2126While this does not matter for the signal disposition (libev never
2127sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2128C<execve>), this matters for the signal mask: many programs do not expect
2129many signals to be blocked.
2130
2131This means that before calling C<exec> (from the child) you should reset
2132the signal mask to whatever "default" you expect (all clear is a good
2133choice usually).
1963 2134
1964=head3 Watcher-Specific Functions and Data Members 2135=head3 Watcher-Specific Functions and Data Members
1965 2136
1966=over 4 2137=over 4
1967 2138
1999some child status changes (most typically when a child of yours dies or 2170some child status changes (most typically when a child of yours dies or
2000exits). It is permissible to install a child watcher I<after> the child 2171exits). It is permissible to install a child watcher I<after> the child
2001has been forked (which implies it might have already exited), as long 2172has been forked (which implies it might have already exited), as long
2002as the event loop isn't entered (or is continued from a watcher), i.e., 2173as the event loop isn't entered (or is continued from a watcher), i.e.,
2003forking and then immediately registering a watcher for the child is fine, 2174forking and then immediately registering a watcher for the child is fine,
2004but forking and registering a watcher a few event loop iterations later is 2175but forking and registering a watcher a few event loop iterations later or
2005not. 2176in the next callback invocation is not.
2006 2177
2007Only the default event loop is capable of handling signals, and therefore 2178Only the default event loop is capable of handling signals, and therefore
2008you can only register child watchers in the default event loop. 2179you can only register child watchers in the default event loop.
2009 2180
2181Due to some design glitches inside libev, child watchers will always be
2182handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2183libev)
2184
2010=head3 Process Interaction 2185=head3 Process Interaction
2011 2186
2012Libev grabs C<SIGCHLD> as soon as the default event loop is 2187Libev grabs C<SIGCHLD> as soon as the default event loop is
2013initialised. This is necessary to guarantee proper behaviour even if 2188initialised. This is necessary to guarantee proper behaviour even if the
2014the first child watcher is started after the child exits. The occurrence 2189first child watcher is started after the child exits. The occurrence
2015of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2190of C<SIGCHLD> is recorded asynchronously, but child reaping is done
2016synchronously as part of the event loop processing. Libev always reaps all 2191synchronously as part of the event loop processing. Libev always reaps all
2017children, even ones not watched. 2192children, even ones not watched.
2018 2193
2019=head3 Overriding the Built-In Processing 2194=head3 Overriding the Built-In Processing
2029=head3 Stopping the Child Watcher 2204=head3 Stopping the Child Watcher
2030 2205
2031Currently, the child watcher never gets stopped, even when the 2206Currently, the child watcher never gets stopped, even when the
2032child terminates, so normally one needs to stop the watcher in the 2207child terminates, so normally one needs to stop the watcher in the
2033callback. Future versions of libev might stop the watcher automatically 2208callback. Future versions of libev might stop the watcher automatically
2034when a child exit is detected. 2209when a child exit is detected (calling C<ev_child_stop> twice is not a
2210problem).
2035 2211
2036=head3 Watcher-Specific Functions and Data Members 2212=head3 Watcher-Specific Functions and Data Members
2037 2213
2038=over 4 2214=over 4
2039 2215
2365 // no longer anything immediate to do. 2541 // no longer anything immediate to do.
2366 } 2542 }
2367 2543
2368 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2544 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2369 ev_idle_init (idle_watcher, idle_cb); 2545 ev_idle_init (idle_watcher, idle_cb);
2370 ev_idle_start (loop, idle_cb); 2546 ev_idle_start (loop, idle_watcher);
2371 2547
2372 2548
2373=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2549=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2374 2550
2375Prepare and check watchers are usually (but not always) used in pairs: 2551Prepare and check watchers are usually (but not always) used in pairs:
2468 struct pollfd fds [nfd]; 2644 struct pollfd fds [nfd];
2469 // actual code will need to loop here and realloc etc. 2645 // actual code will need to loop here and realloc etc.
2470 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2646 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2471 2647
2472 /* the callback is illegal, but won't be called as we stop during check */ 2648 /* the callback is illegal, but won't be called as we stop during check */
2473 ev_timer_init (&tw, 0, timeout * 1e-3); 2649 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2474 ev_timer_start (loop, &tw); 2650 ev_timer_start (loop, &tw);
2475 2651
2476 // create one ev_io per pollfd 2652 // create one ev_io per pollfd
2477 for (int i = 0; i < nfd; ++i) 2653 for (int i = 0; i < nfd; ++i)
2478 { 2654 {
3242=item Ocaml 3418=item Ocaml
3243 3419
3244Erkki Seppala has written Ocaml bindings for libev, to be found at 3420Erkki Seppala has written Ocaml bindings for libev, to be found at
3245L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3421L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3246 3422
3423=item Lua
3424
3425Brian Maher has written a partial interface to libev
3426for lua (only C<ev_io> and C<ev_timer>), to be found at
3427L<http://github.com/brimworks/lua-ev>.
3428
3247=back 3429=back
3248 3430
3249 3431
3250=head1 MACRO MAGIC 3432=head1 MACRO MAGIC
3251 3433
3417keeps libev from including F<config.h>, and it also defines dummy 3599keeps libev from including F<config.h>, and it also defines dummy
3418implementations for some libevent functions (such as logging, which is not 3600implementations for some libevent functions (such as logging, which is not
3419supported). It will also not define any of the structs usually found in 3601supported). It will also not define any of the structs usually found in
3420F<event.h> that are not directly supported by the libev core alone. 3602F<event.h> that are not directly supported by the libev core alone.
3421 3603
3422In stanbdalone mode, libev will still try to automatically deduce the 3604In standalone mode, libev will still try to automatically deduce the
3423configuration, but has to be more conservative. 3605configuration, but has to be more conservative.
3424 3606
3425=item EV_USE_MONOTONIC 3607=item EV_USE_MONOTONIC
3426 3608
3427If defined to be C<1>, libev will try to detect the availability of the 3609If defined to be C<1>, libev will try to detect the availability of the
3492be used is the winsock select). This means that it will call 3674be used is the winsock select). This means that it will call
3493C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3675C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3494it is assumed that all these functions actually work on fds, even 3676it is assumed that all these functions actually work on fds, even
3495on win32. Should not be defined on non-win32 platforms. 3677on win32. Should not be defined on non-win32 platforms.
3496 3678
3497=item EV_FD_TO_WIN32_HANDLE 3679=item EV_FD_TO_WIN32_HANDLE(fd)
3498 3680
3499If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3681If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3500file descriptors to socket handles. When not defining this symbol (the 3682file descriptors to socket handles. When not defining this symbol (the
3501default), then libev will call C<_get_osfhandle>, which is usually 3683default), then libev will call C<_get_osfhandle>, which is usually
3502correct. In some cases, programs use their own file descriptor management, 3684correct. In some cases, programs use their own file descriptor management,
3503in which case they can provide this function to map fds to socket handles. 3685in which case they can provide this function to map fds to socket handles.
3686
3687=item EV_WIN32_HANDLE_TO_FD(handle)
3688
3689If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3690using the standard C<_open_osfhandle> function. For programs implementing
3691their own fd to handle mapping, overwriting this function makes it easier
3692to do so. This can be done by defining this macro to an appropriate value.
3693
3694=item EV_WIN32_CLOSE_FD(fd)
3695
3696If programs implement their own fd to handle mapping on win32, then this
3697macro can be used to override the C<close> function, useful to unregister
3698file descriptors again. Note that the replacement function has to close
3699the underlying OS handle.
3504 3700
3505=item EV_USE_POLL 3701=item EV_USE_POLL
3506 3702
3507If defined to be C<1>, libev will compile in support for the C<poll>(2) 3703If defined to be C<1>, libev will compile in support for the C<poll>(2)
3508backend. Otherwise it will be enabled on non-win32 platforms. It 3704backend. Otherwise it will be enabled on non-win32 platforms. It
3640defined to be C<0>, then they are not. 3836defined to be C<0>, then they are not.
3641 3837
3642=item EV_MINIMAL 3838=item EV_MINIMAL
3643 3839
3644If you need to shave off some kilobytes of code at the expense of some 3840If you need to shave off some kilobytes of code at the expense of some
3645speed, define this symbol to C<1>. Currently this is used to override some 3841speed (but with the full API), define this symbol to C<1>. Currently this
3646inlining decisions, saves roughly 30% code size on amd64. It also selects a 3842is used to override some inlining decisions, saves roughly 30% code size
3647much smaller 2-heap for timer management over the default 4-heap. 3843on amd64. It also selects a much smaller 2-heap for timer management over
3844the default 4-heap.
3845
3846You can save even more by disabling watcher types you do not need
3847and setting C<EV_MAXPRI> == C<EV_MINPRI>. Also, disabling C<assert>
3848(C<-DNDEBUG>) will usually reduce code size a lot.
3849
3850Defining C<EV_MINIMAL> to C<2> will additionally reduce the core API to
3851provide a bare-bones event library. See C<ev.h> for details on what parts
3852of the API are still available, and do not complain if this subset changes
3853over time.
3854
3855=item EV_NSIG
3856
3857The highest supported signal number, +1 (or, the number of
3858signals): Normally, libev tries to deduce the maximum number of signals
3859automatically, but sometimes this fails, in which case it can be
3860specified. Also, using a lower number than detected (C<32> should be
3861good for about any system in existance) can save some memory, as libev
3862statically allocates some 12-24 bytes per signal number.
3648 3863
3649=item EV_PID_HASHSIZE 3864=item EV_PID_HASHSIZE
3650 3865
3651C<ev_child> watchers use a small hash table to distribute workload by 3866C<ev_child> watchers use a small hash table to distribute workload by
3652pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 3867pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
3838default loop and triggering an C<ev_async> watcher from the default loop 4053default loop and triggering an C<ev_async> watcher from the default loop
3839watcher callback into the event loop interested in the signal. 4054watcher callback into the event loop interested in the signal.
3840 4055
3841=back 4056=back
3842 4057
4058=head4 THREAD LOCKING EXAMPLE
4059
4060Here is a fictitious example of how to run an event loop in a different
4061thread than where callbacks are being invoked and watchers are
4062created/added/removed.
4063
4064For a real-world example, see the C<EV::Loop::Async> perl module,
4065which uses exactly this technique (which is suited for many high-level
4066languages).
4067
4068The example uses a pthread mutex to protect the loop data, a condition
4069variable to wait for callback invocations, an async watcher to notify the
4070event loop thread and an unspecified mechanism to wake up the main thread.
4071
4072First, you need to associate some data with the event loop:
4073
4074 typedef struct {
4075 mutex_t lock; /* global loop lock */
4076 ev_async async_w;
4077 thread_t tid;
4078 cond_t invoke_cv;
4079 } userdata;
4080
4081 void prepare_loop (EV_P)
4082 {
4083 // for simplicity, we use a static userdata struct.
4084 static userdata u;
4085
4086 ev_async_init (&u->async_w, async_cb);
4087 ev_async_start (EV_A_ &u->async_w);
4088
4089 pthread_mutex_init (&u->lock, 0);
4090 pthread_cond_init (&u->invoke_cv, 0);
4091
4092 // now associate this with the loop
4093 ev_set_userdata (EV_A_ u);
4094 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4095 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4096
4097 // then create the thread running ev_loop
4098 pthread_create (&u->tid, 0, l_run, EV_A);
4099 }
4100
4101The callback for the C<ev_async> watcher does nothing: the watcher is used
4102solely to wake up the event loop so it takes notice of any new watchers
4103that might have been added:
4104
4105 static void
4106 async_cb (EV_P_ ev_async *w, int revents)
4107 {
4108 // just used for the side effects
4109 }
4110
4111The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4112protecting the loop data, respectively.
4113
4114 static void
4115 l_release (EV_P)
4116 {
4117 userdata *u = ev_userdata (EV_A);
4118 pthread_mutex_unlock (&u->lock);
4119 }
4120
4121 static void
4122 l_acquire (EV_P)
4123 {
4124 userdata *u = ev_userdata (EV_A);
4125 pthread_mutex_lock (&u->lock);
4126 }
4127
4128The event loop thread first acquires the mutex, and then jumps straight
4129into C<ev_loop>:
4130
4131 void *
4132 l_run (void *thr_arg)
4133 {
4134 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4135
4136 l_acquire (EV_A);
4137 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4138 ev_loop (EV_A_ 0);
4139 l_release (EV_A);
4140
4141 return 0;
4142 }
4143
4144Instead of invoking all pending watchers, the C<l_invoke> callback will
4145signal the main thread via some unspecified mechanism (signals? pipe
4146writes? C<Async::Interrupt>?) and then waits until all pending watchers
4147have been called (in a while loop because a) spurious wakeups are possible
4148and b) skipping inter-thread-communication when there are no pending
4149watchers is very beneficial):
4150
4151 static void
4152 l_invoke (EV_P)
4153 {
4154 userdata *u = ev_userdata (EV_A);
4155
4156 while (ev_pending_count (EV_A))
4157 {
4158 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4159 pthread_cond_wait (&u->invoke_cv, &u->lock);
4160 }
4161 }
4162
4163Now, whenever the main thread gets told to invoke pending watchers, it
4164will grab the lock, call C<ev_invoke_pending> and then signal the loop
4165thread to continue:
4166
4167 static void
4168 real_invoke_pending (EV_P)
4169 {
4170 userdata *u = ev_userdata (EV_A);
4171
4172 pthread_mutex_lock (&u->lock);
4173 ev_invoke_pending (EV_A);
4174 pthread_cond_signal (&u->invoke_cv);
4175 pthread_mutex_unlock (&u->lock);
4176 }
4177
4178Whenever you want to start/stop a watcher or do other modifications to an
4179event loop, you will now have to lock:
4180
4181 ev_timer timeout_watcher;
4182 userdata *u = ev_userdata (EV_A);
4183
4184 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4185
4186 pthread_mutex_lock (&u->lock);
4187 ev_timer_start (EV_A_ &timeout_watcher);
4188 ev_async_send (EV_A_ &u->async_w);
4189 pthread_mutex_unlock (&u->lock);
4190
4191Note that sending the C<ev_async> watcher is required because otherwise
4192an event loop currently blocking in the kernel will have no knowledge
4193about the newly added timer. By waking up the loop it will pick up any new
4194watchers in the next event loop iteration.
4195
3843=head3 COROUTINES 4196=head3 COROUTINES
3844 4197
3845Libev is very accommodating to coroutines ("cooperative threads"): 4198Libev is very accommodating to coroutines ("cooperative threads"):
3846libev fully supports nesting calls to its functions from different 4199libev fully supports nesting calls to its functions from different
3847coroutines (e.g. you can call C<ev_loop> on the same loop from two 4200coroutines (e.g. you can call C<ev_loop> on the same loop from two
3848different coroutines, and switch freely between both coroutines running the 4201different coroutines, and switch freely between both coroutines running
3849loop, as long as you don't confuse yourself). The only exception is that 4202the loop, as long as you don't confuse yourself). The only exception is
3850you must not do this from C<ev_periodic> reschedule callbacks. 4203that you must not do this from C<ev_periodic> reschedule callbacks.
3851 4204
3852Care has been taken to ensure that libev does not keep local state inside 4205Care has been taken to ensure that libev does not keep local state inside
3853C<ev_loop>, and other calls do not usually allow for coroutine switches as 4206C<ev_loop>, and other calls do not usually allow for coroutine switches as
3854they do not call any callbacks. 4207they do not call any callbacks.
3855 4208
3932way (note also that glib is the slowest event library known to man). 4285way (note also that glib is the slowest event library known to man).
3933 4286
3934There is no supported compilation method available on windows except 4287There is no supported compilation method available on windows except
3935embedding it into other applications. 4288embedding it into other applications.
3936 4289
4290Sensible signal handling is officially unsupported by Microsoft - libev
4291tries its best, but under most conditions, signals will simply not work.
4292
3937Not a libev limitation but worth mentioning: windows apparently doesn't 4293Not a libev limitation but worth mentioning: windows apparently doesn't
3938accept large writes: instead of resulting in a partial write, windows will 4294accept large writes: instead of resulting in a partial write, windows will
3939either accept everything or return C<ENOBUFS> if the buffer is too large, 4295either accept everything or return C<ENOBUFS> if the buffer is too large,
3940so make sure you only write small amounts into your sockets (less than a 4296so make sure you only write small amounts into your sockets (less than a
3941megabyte seems safe, but this apparently depends on the amount of memory 4297megabyte seems safe, but this apparently depends on the amount of memory
3945the abysmal performance of winsockets, using a large number of sockets 4301the abysmal performance of winsockets, using a large number of sockets
3946is not recommended (and not reasonable). If your program needs to use 4302is not recommended (and not reasonable). If your program needs to use
3947more than a hundred or so sockets, then likely it needs to use a totally 4303more than a hundred or so sockets, then likely it needs to use a totally
3948different implementation for windows, as libev offers the POSIX readiness 4304different implementation for windows, as libev offers the POSIX readiness
3949notification model, which cannot be implemented efficiently on windows 4305notification model, which cannot be implemented efficiently on windows
3950(Microsoft monopoly games). 4306(due to Microsoft monopoly games).
3951 4307
3952A typical way to use libev under windows is to embed it (see the embedding 4308A typical way to use libev under windows is to embed it (see the embedding
3953section for details) and use the following F<evwrap.h> header file instead 4309section for details) and use the following F<evwrap.h> header file instead
3954of F<ev.h>: 4310of F<ev.h>:
3955 4311
3991 4347
3992Early versions of winsocket's select only supported waiting for a maximum 4348Early versions of winsocket's select only supported waiting for a maximum
3993of C<64> handles (probably owning to the fact that all windows kernels 4349of C<64> handles (probably owning to the fact that all windows kernels
3994can only wait for C<64> things at the same time internally; Microsoft 4350can only wait for C<64> things at the same time internally; Microsoft
3995recommends spawning a chain of threads and wait for 63 handles and the 4351recommends spawning a chain of threads and wait for 63 handles and the
3996previous thread in each. Great). 4352previous thread in each. Sounds great!).
3997 4353
3998Newer versions support more handles, but you need to define C<FD_SETSIZE> 4354Newer versions support more handles, but you need to define C<FD_SETSIZE>
3999to some high number (e.g. C<2048>) before compiling the winsocket select 4355to some high number (e.g. C<2048>) before compiling the winsocket select
4000call (which might be in libev or elsewhere, for example, perl does its own 4356call (which might be in libev or elsewhere, for example, perl and many
4001select emulation on windows). 4357other interpreters do their own select emulation on windows).
4002 4358
4003Another limit is the number of file descriptors in the Microsoft runtime 4359Another limit is the number of file descriptors in the Microsoft runtime
4004libraries, which by default is C<64> (there must be a hidden I<64> fetish 4360libraries, which by default is C<64> (there must be a hidden I<64>
4005or something like this inside Microsoft). You can increase this by calling 4361fetish or something like this inside Microsoft). You can increase this
4006C<_setmaxstdio>, which can increase this limit to C<2048> (another 4362by calling C<_setmaxstdio>, which can increase this limit to C<2048>
4007arbitrary limit), but is broken in many versions of the Microsoft runtime 4363(another arbitrary limit), but is broken in many versions of the Microsoft
4008libraries.
4009
4010This might get you to about C<512> or C<2048> sockets (depending on 4364runtime libraries. This might get you to about C<512> or C<2048> sockets
4011windows version and/or the phase of the moon). To get more, you need to 4365(depending on windows version and/or the phase of the moon). To get more,
4012wrap all I/O functions and provide your own fd management, but the cost of 4366you need to wrap all I/O functions and provide your own fd management, but
4013calling select (O(n²)) will likely make this unworkable. 4367the cost of calling select (O(n²)) will likely make this unworkable.
4014 4368
4015=back 4369=back
4016 4370
4017=head2 PORTABILITY REQUIREMENTS 4371=head2 PORTABILITY REQUIREMENTS
4018 4372
4061=item C<double> must hold a time value in seconds with enough accuracy 4415=item C<double> must hold a time value in seconds with enough accuracy
4062 4416
4063The type C<double> is used to represent timestamps. It is required to 4417The type C<double> is used to represent timestamps. It is required to
4064have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4418have at least 51 bits of mantissa (and 9 bits of exponent), which is good
4065enough for at least into the year 4000. This requirement is fulfilled by 4419enough for at least into the year 4000. This requirement is fulfilled by
4066implementations implementing IEEE 754 (basically all existing ones). 4420implementations implementing IEEE 754, which is basically all existing
4421ones. With IEEE 754 doubles, you get microsecond accuracy until at least
44222200.
4067 4423
4068=back 4424=back
4069 4425
4070If you know of other additional requirements drop me a note. 4426If you know of other additional requirements drop me a note.
4071 4427

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines