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

Comparing libev/ev.pod (file contents):
Revision 1.383 by root, Sat Oct 15 02:19:19 2011 UTC vs.
Revision 1.394 by root, Tue Jan 24 16:37:12 2012 UTC

174=item ev_tstamp ev_time () 174=item ev_tstamp ev_time ()
175 175
176Returns the current time as libev would use it. Please note that the 176Returns the current time as libev would use it. Please note that the
177C<ev_now> function is usually faster and also often returns the timestamp 177C<ev_now> function is usually faster and also often returns the timestamp
178you actually want to know. Also interesting is the combination of 178you actually want to know. Also interesting is the combination of
179C<ev_update_now> and C<ev_now>. 179C<ev_now_update> and C<ev_now>.
180 180
181=item ev_sleep (ev_tstamp interval) 181=item ev_sleep (ev_tstamp interval)
182 182
183Sleep for the given interval: The current thread will be blocked 183Sleep for the given interval: The current thread will be blocked
184until either it is interrupted or the given time interval has 184until either it is interrupted or the given time interval has
1020can be done relatively simply by putting mutex_lock/unlock calls around 1020can be done relatively simply by putting mutex_lock/unlock calls around
1021each call to a libev function. 1021each call to a libev function.
1022 1022
1023However, C<ev_run> can run an indefinite time, so it is not feasible 1023However, C<ev_run> can run an indefinite time, so it is not feasible
1024to wait for it to return. One way around this is to wake up the event 1024to wait for it to return. One way around this is to wake up the event
1025loop via C<ev_break> and C<av_async_send>, another way is to set these 1025loop via C<ev_break> and C<ev_async_send>, another way is to set these
1026I<release> and I<acquire> callbacks on the loop. 1026I<release> and I<acquire> callbacks on the loop.
1027 1027
1028When set, then C<release> will be called just before the thread is 1028When set, then C<release> will be called just before the thread is
1029suspended waiting for new events, and C<acquire> is called just 1029suspended waiting for new events, and C<acquire> is called just
1030afterwards. 1030afterwards.
1860 1860
1861In this case, it would be more efficient to leave the C<ev_timer> alone, 1861In this case, it would be more efficient to leave the C<ev_timer> alone,
1862but remember the time of last activity, and check for a real timeout only 1862but remember the time of last activity, and check for a real timeout only
1863within the callback: 1863within the callback:
1864 1864
1865 ev_tstamp timeout = 60.;
1865 ev_tstamp last_activity; // time of last activity 1866 ev_tstamp last_activity; // time of last activity
1867 ev_timer timer;
1866 1868
1867 static void 1869 static void
1868 callback (EV_P_ ev_timer *w, int revents) 1870 callback (EV_P_ ev_timer *w, int revents)
1869 { 1871 {
1870 ev_tstamp now = ev_now (EV_A); 1872 // calculate when the timeout would happen
1871 ev_tstamp timeout = last_activity + 60.; 1873 ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1872 1874
1873 // if last_activity + 60. is older than now, we did time out 1875 // if negative, it means we the timeout already occured
1874 if (timeout < now) 1876 if (after < 0.)
1875 { 1877 {
1876 // timeout occurred, take action 1878 // timeout occurred, take action
1877 } 1879 }
1878 else 1880 else
1879 { 1881 {
1880 // callback was invoked, but there was some activity, re-arm 1882 // callback was invoked, but there was some recent
1881 // the watcher to fire in last_activity + 60, which is 1883 // activity. simply restart the timer to time out
1882 // guaranteed to be in the future, so "again" is positive: 1884 // after "after" seconds, which is the earliest time
1883 w->repeat = timeout - now; 1885 // the timeout can occur.
1886 ev_timer_set (w, after, 0.);
1884 ev_timer_again (EV_A_ w); 1887 ev_timer_start (EV_A_ w);
1885 } 1888 }
1886 } 1889 }
1887 1890
1888To summarise the callback: first calculate the real timeout (defined 1891To summarise the callback: first calculate in how many seconds the
1889as "60 seconds after the last activity"), then check if that time has 1892timeout will occur (by calculating the absolute time when it would occur,
1890been reached, which means something I<did>, in fact, time out. Otherwise 1893C<last_activity + timeout>, and subtracting the current time, C<ev_now
1891the callback was invoked too early (C<timeout> is in the future), so 1894(EV_A)> from that).
1892re-schedule the timer to fire at that future time, to see if maybe we have
1893a timeout then.
1894 1895
1895Note how C<ev_timer_again> is used, taking advantage of the 1896If this value is negative, then we are already past the timeout, i.e. we
1896C<ev_timer_again> optimisation when the timer is already running. 1897timed out, and need to do whatever is needed in this case.
1898
1899Otherwise, we now the earliest time at which the timeout would trigger,
1900and simply start the timer with this timeout value.
1901
1902In other words, each time the callback is invoked it will check whether
1903the timeout cocured. If not, it will simply reschedule itself to check
1904again at the earliest time it could time out. Rinse. Repeat.
1897 1905
1898This scheme causes more callback invocations (about one every 60 seconds 1906This scheme causes more callback invocations (about one every 60 seconds
1899minus half the average time between activity), but virtually no calls to 1907minus half the average time between activity), but virtually no calls to
1900libev to change the timeout. 1908libev to change the timeout.
1901 1909
1902To start the timer, simply initialise the watcher and set C<last_activity> 1910To start the machinery, simply initialise the watcher and set
1903to the current time (meaning we just have some activity :), then call the 1911C<last_activity> to the current time (meaning there was some activity just
1904callback, which will "do the right thing" and start the timer: 1912now), then call the callback, which will "do the right thing" and start
1913the timer:
1905 1914
1915 last_activity = ev_now (EV_A);
1906 ev_init (timer, callback); 1916 ev_init (&timer, callback);
1907 last_activity = ev_now (loop); 1917 callback (EV_A_ &timer, 0);
1908 callback (loop, timer, EV_TIMER);
1909 1918
1910And when there is some activity, simply store the current time in 1919When there is some activity, simply store the current time in
1911C<last_activity>, no libev calls at all: 1920C<last_activity>, no libev calls at all:
1912 1921
1922 if (activity detected)
1913 last_activity = ev_now (loop); 1923 last_activity = ev_now (EV_A);
1924
1925When your timeout value changes, then the timeout can be changed by simply
1926providing a new value, stopping the timer and calling the callback, which
1927will agaion do the right thing (for example, time out immediately :).
1928
1929 timeout = new_value;
1930 ev_timer_stop (EV_A_ &timer);
1931 callback (EV_A_ &timer, 0);
1914 1932
1915This technique is slightly more complex, but in most cases where the 1933This technique is slightly more complex, but in most cases where the
1916time-out is unlikely to be triggered, much more efficient. 1934time-out is unlikely to be triggered, much more efficient.
1917
1918Changing the timeout is trivial as well (if it isn't hard-coded in the
1919callback :) - just change the timeout and invoke the callback, which will
1920fix things for you.
1921 1935
1922=item 4. Wee, just use a double-linked list for your timeouts. 1936=item 4. Wee, just use a double-linked list for your timeouts.
1923 1937
1924If there is not one request, but many thousands (millions...), all 1938If there is not one request, but many thousands (millions...), all
1925employing some kind of timeout with the same timeout value, then one can 1939employing some kind of timeout with the same timeout value, then one can
1958 1972
1959If you ask a timer to call your callback after three seconds, then 1973If you ask a timer to call your callback after three seconds, then
1960you expect it to be invoked after three seconds - but of course, this 1974you expect it to be invoked after three seconds - but of course, this
1961cannot be guaranteed to infinite precision. Less obviously, it cannot be 1975cannot be guaranteed to infinite precision. Less obviously, it cannot be
1962guaranteed to any precision by libev - imagine somebody suspending the 1976guaranteed to any precision by libev - imagine somebody suspending the
1963process a STOP signal for a few hours for example. 1977process with a STOP signal for a few hours for example.
1964 1978
1965So, libev tries to invoke your callback as soon as possible I<after> the 1979So, libev tries to invoke your callback as soon as possible I<after> the
1966delay has occurred, but cannot guarantee this. 1980delay has occurred, but cannot guarantee this.
1967 1981
1968A less obvious failure mode is calling your callback too early: many event 1982A less obvious failure mode is calling your callback too early: many event
2094keep up with the timer (because it takes longer than those 10 seconds to 2108keep up with the timer (because it takes longer than those 10 seconds to
2095do stuff) the timer will not fire more than once per event loop iteration. 2109do stuff) the timer will not fire more than once per event loop iteration.
2096 2110
2097=item ev_timer_again (loop, ev_timer *) 2111=item ev_timer_again (loop, ev_timer *)
2098 2112
2099This will act as if the timer timed out and restarts it again if it is 2113This will act as if the timer timed out, and restarts it again if it is
2100repeating. The exact semantics are: 2114repeating. It basically works like calling C<ev_timer_stop>, updating the
2115timeout to the C<repeat> value and calling C<ev_timer_start>.
2101 2116
2117The exact semantics are as in the wollofing rules, all of which will be
2118applied to the watcher:
2119
2120=over 4
2121
2102If the timer is pending, its pending status is cleared. 2122=item If the timer is pending, the pending status is always cleared.
2103 2123
2104If the timer is started but non-repeating, stop it (as if it timed out). 2124=item If the timer is started but non-repeating, stop it (as if it timed
2125out, without invoking it).
2105 2126
2106If the timer is repeating, either start it if necessary (with the 2127=item If the timer is repeating, make the C<repeat> value the new timeout
2107C<repeat> value), or reset the running timer to the C<repeat> value. 2128and start the timer, if necessary.
2129
2130=back
2108 2131
2109This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 2132This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
2110usage example. 2133usage example.
2111 2134
2112=item ev_tstamp ev_timer_remaining (loop, ev_timer *) 2135=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
3473 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3496 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3474 3497
3475=item ev_feed_fd_event (loop, int fd, int revents) 3498=item ev_feed_fd_event (loop, int fd, int revents)
3476 3499
3477Feed an event on the given fd, as if a file descriptor backend detected 3500Feed an event on the given fd, as if a file descriptor backend detected
3478the given events it. 3501the given events.
3479 3502
3480=item ev_feed_signal_event (loop, int signum) 3503=item ev_feed_signal_event (loop, int signum)
3481 3504
3482Feed an event as if the given signal occurred. See also C<ev_feed_signal>, 3505Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3483which is async-safe. 3506which is async-safe.
3557 { 3580 {
3558 struct my_biggy big = (struct my_biggy *) 3581 struct my_biggy big = (struct my_biggy *)
3559 (((char *)w) - offsetof (struct my_biggy, t2)); 3582 (((char *)w) - offsetof (struct my_biggy, t2));
3560 } 3583 }
3561 3584
3585=head2 AVOIDING FINISHING BEFORE RETURNING
3586
3587Often you have structures like this in event-based programs:
3588
3589 callback ()
3590 {
3591 free (request);
3592 }
3593
3594 request = start_new_request (..., callback);
3595
3596The intent is to start some "lengthy" operation. The C<request> could be
3597used to cancel the operation, or do other things with it.
3598
3599It's not uncommon to have code paths in C<start_new_request> that
3600immediately invoke the callback, for example, to report errors. Or you add
3601some caching layer that finds that it can skip the lengthy aspects of the
3602operation and simply invoke the callback with the result.
3603
3604The problem here is that this will happen I<before> C<start_new_request>
3605has returned, so C<request> is not set.
3606
3607Even if you pass the request by some safer means to the callback, you
3608might want to do something to the request after starting it, such as
3609canceling it, which probably isn't working so well when the callback has
3610already been invoked.
3611
3612A common way around all these issues is to make sure that
3613C<start_new_request> I<always> returns before the callback is invoked. If
3614C<start_new_request> immediately knows the result, it can artificially
3615delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher
3616for example, or more sneakily, by reusing an existing (stopped) watcher
3617and pushing it into the pending queue:
3618
3619 ev_set_cb (watcher, callback);
3620 ev_feed_event (EV_A_ watcher, 0);
3621
3622This way, C<start_new_request> can safely return before the callback is
3623invoked, while not delaying callback invocation too much.
3624
3562=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS 3625=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3563 3626
3564Often (especially in GUI toolkits) there are places where you have 3627Often (especially in GUI toolkits) there are places where you have
3565I<modal> interaction, which is most easily implemented by recursively 3628I<modal> interaction, which is most easily implemented by recursively
3566invoking C<ev_run>. 3629invoking C<ev_run>.
3579 int exit_main_loop = 0; 3642 int exit_main_loop = 0;
3580 3643
3581 while (!exit_main_loop) 3644 while (!exit_main_loop)
3582 ev_run (EV_DEFAULT_ EVRUN_ONCE); 3645 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3583 3646
3584 // in a model watcher 3647 // in a modal watcher
3585 int exit_nested_loop = 0; 3648 int exit_nested_loop = 0;
3586 3649
3587 while (!exit_nested_loop) 3650 while (!exit_nested_loop)
3588 ev_run (EV_A_ EVRUN_ONCE); 3651 ev_run (EV_A_ EVRUN_ONCE);
3589 3652
3769 switch_to (libev_coro); 3832 switch_to (libev_coro);
3770 } 3833 }
3771 3834
3772That basically suspends the coroutine inside C<wait_for_event> and 3835That basically suspends the coroutine inside C<wait_for_event> and
3773continues the libev coroutine, which, when appropriate, switches back to 3836continues the libev coroutine, which, when appropriate, switches back to
3774this or any other coroutine. I am sure if you sue this your own :) 3837this or any other coroutine.
3775 3838
3776You can do similar tricks if you have, say, threads with an event queue - 3839You can do similar tricks if you have, say, threads with an event queue -
3777instead of storing a coroutine, you store the queue object and instead of 3840instead of storing a coroutine, you store the queue object and instead of
3778switching to a coroutine, you push the watcher onto the queue and notify 3841switching to a coroutine, you push the watcher onto the queue and notify
3779any waiters. 3842any waiters.
3872=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc. 3935=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
3873 3936
3874For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of 3937For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
3875the same name in the C<ev> namespace, with the exception of C<ev_signal> 3938the same name in the C<ev> namespace, with the exception of C<ev_signal>
3876which is called C<ev::sig> to avoid clashes with the C<signal> macro 3939which is called C<ev::sig> to avoid clashes with the C<signal> macro
3877defines by many implementations. 3940defined by many implementations.
3878 3941
3879All of those classes have these methods: 3942All of those classes have these methods:
3880 3943
3881=over 4 3944=over 4
3882 3945
4598With an intelligent-enough linker (gcc+binutils are intelligent enough 4661With an intelligent-enough linker (gcc+binutils are intelligent enough
4599when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by 4662when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4600your program might be left out as well - a binary starting a timer and an 4663your program might be left out as well - a binary starting a timer and an
4601I/O watcher then might come out at only 5Kb. 4664I/O watcher then might come out at only 5Kb.
4602 4665
4666=item EV_API_STATIC
4667
4668If this symbol is defined (by default it is not), then all identifiers
4669will have static linkage. This means that libev will not export any
4670identifiers, and you cannot link against libev anymore. This can be useful
4671when you embed libev, only want to use libev functions in a single file,
4672and do not want its identifiers to be visible.
4673
4674To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that
4675wants to use libev.
4676
4677This option only works when libev is compiled with a C compiler, as C++
4678doesn't support the required declaration syntax.
4679
4603=item EV_AVOID_STDIO 4680=item EV_AVOID_STDIO
4604 4681
4605If this is set to C<1> at compiletime, then libev will avoid using stdio 4682If this is set to C<1> at compiletime, then libev will avoid using stdio
4606functions (printf, scanf, perror etc.). This will increase the code size 4683functions (printf, scanf, perror etc.). This will increase the code size
4607somewhat, but if your program doesn't otherwise depend on stdio and your 4684somewhat, but if your program doesn't otherwise depend on stdio and your

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines