1 | .\" Automatically generated by Pod::Man 2.22 (Pod::Simple 3.07) |
1 | .\" Automatically generated by Pod::Man 2.23 (Pod::Simple 3.14) |
2 | .\" |
2 | .\" |
3 | .\" Standard preamble: |
3 | .\" Standard preamble: |
4 | .\" ======================================================================== |
4 | .\" ======================================================================== |
5 | .de Sp \" Vertical space (when we can't use .PP) |
5 | .de Sp \" Vertical space (when we can't use .PP) |
6 | .if t .sp .5v |
6 | .if t .sp .5v |
… | |
… | |
122 | .\} |
122 | .\} |
123 | .rm #[ #] #H #V #F C |
123 | .rm #[ #] #H #V #F C |
124 | .\" ======================================================================== |
124 | .\" ======================================================================== |
125 | .\" |
125 | .\" |
126 | .IX Title "LIBEV 3" |
126 | .IX Title "LIBEV 3" |
127 | .TH LIBEV 3 "2011-02-16" "libev-4.04" "libev - high performance full featured event loop" |
127 | .TH LIBEV 3 "2012-02-04" "libev-4.11" "libev - high performance full featured event loop" |
128 | .\" For nroff, turn off justification. Always turn off hyphenation; it makes |
128 | .\" For nroff, turn off justification. Always turn off hyphenation; it makes |
129 | .\" way too many mistakes in technical documents. |
129 | .\" way too many mistakes in technical documents. |
130 | .if n .ad l |
130 | .if n .ad l |
131 | .nh |
131 | .nh |
132 | .SH "NAME" |
132 | .SH "NAME" |
… | |
… | |
244 | loop mechanism itself (\f(CW\*(C`ev_idle\*(C'\fR, \f(CW\*(C`ev_embed\*(C'\fR, \f(CW\*(C`ev_prepare\*(C'\fR and |
244 | loop mechanism itself (\f(CW\*(C`ev_idle\*(C'\fR, \f(CW\*(C`ev_embed\*(C'\fR, \f(CW\*(C`ev_prepare\*(C'\fR and |
245 | \&\f(CW\*(C`ev_check\*(C'\fR watchers) as well as file watchers (\f(CW\*(C`ev_stat\*(C'\fR) and even |
245 | \&\f(CW\*(C`ev_check\*(C'\fR watchers) as well as file watchers (\f(CW\*(C`ev_stat\*(C'\fR) and even |
246 | limited support for fork events (\f(CW\*(C`ev_fork\*(C'\fR). |
246 | limited support for fork events (\f(CW\*(C`ev_fork\*(C'\fR). |
247 | .PP |
247 | .PP |
248 | It also is quite fast (see this |
248 | It also is quite fast (see this |
249 | <benchmark> comparing it to libevent |
249 | benchmark <http://libev.schmorp.de/bench.html> comparing it to libevent |
250 | for example). |
250 | for example). |
251 | .SS "\s-1CONVENTIONS\s0" |
251 | .SS "\s-1CONVENTIONS\s0" |
252 | .IX Subsection "CONVENTIONS" |
252 | .IX Subsection "CONVENTIONS" |
253 | Libev is very configurable. In this manual the default (and most common) |
253 | Libev is very configurable. In this manual the default (and most common) |
254 | configuration will be described, which supports multiple event loops. For |
254 | configuration will be described, which supports multiple event loops. For |
… | |
… | |
294 | .IP "ev_tstamp ev_time ()" 4 |
294 | .IP "ev_tstamp ev_time ()" 4 |
295 | .IX Item "ev_tstamp ev_time ()" |
295 | .IX Item "ev_tstamp ev_time ()" |
296 | Returns the current time as libev would use it. Please note that the |
296 | Returns the current time as libev would use it. Please note that the |
297 | \&\f(CW\*(C`ev_now\*(C'\fR function is usually faster and also often returns the timestamp |
297 | \&\f(CW\*(C`ev_now\*(C'\fR function is usually faster and also often returns the timestamp |
298 | you actually want to know. Also interesting is the combination of |
298 | you actually want to know. Also interesting is the combination of |
299 | \&\f(CW\*(C`ev_update_now\*(C'\fR and \f(CW\*(C`ev_now\*(C'\fR. |
299 | \&\f(CW\*(C`ev_now_update\*(C'\fR and \f(CW\*(C`ev_now\*(C'\fR. |
300 | .IP "ev_sleep (ev_tstamp interval)" 4 |
300 | .IP "ev_sleep (ev_tstamp interval)" 4 |
301 | .IX Item "ev_sleep (ev_tstamp interval)" |
301 | .IX Item "ev_sleep (ev_tstamp interval)" |
302 | Sleep for the given interval: The current thread will be blocked until |
302 | Sleep for the given interval: The current thread will be blocked |
303 | either it is interrupted or the given time interval has passed. Basically |
303 | until either it is interrupted or the given time interval has |
|
|
304 | passed (approximately \- it might return a bit earlier even if not |
|
|
305 | interrupted). Returns immediately if \f(CW\*(C`interval <= 0\*(C'\fR. |
|
|
306 | .Sp |
304 | this is a sub-second-resolution \f(CW\*(C`sleep ()\*(C'\fR. |
307 | Basically this is a sub-second-resolution \f(CW\*(C`sleep ()\*(C'\fR. |
|
|
308 | .Sp |
|
|
309 | The range of the \f(CW\*(C`interval\*(C'\fR is limited \- libev only guarantees to work |
|
|
310 | with sleep times of up to one day (\f(CW\*(C`interval <= 86400\*(C'\fR). |
305 | .IP "int ev_version_major ()" 4 |
311 | .IP "int ev_version_major ()" 4 |
306 | .IX Item "int ev_version_major ()" |
312 | .IX Item "int ev_version_major ()" |
307 | .PD 0 |
313 | .PD 0 |
308 | .IP "int ev_version_minor ()" 4 |
314 | .IP "int ev_version_minor ()" 4 |
309 | .IX Item "int ev_version_minor ()" |
315 | .IX Item "int ev_version_minor ()" |
… | |
… | |
553 | example) that can't properly initialise their signal masks. |
559 | example) that can't properly initialise their signal masks. |
554 | .ie n .IP """EVFLAG_NOSIGMASK""" 4 |
560 | .ie n .IP """EVFLAG_NOSIGMASK""" 4 |
555 | .el .IP "\f(CWEVFLAG_NOSIGMASK\fR" 4 |
561 | .el .IP "\f(CWEVFLAG_NOSIGMASK\fR" 4 |
556 | .IX Item "EVFLAG_NOSIGMASK" |
562 | .IX Item "EVFLAG_NOSIGMASK" |
557 | When this flag is specified, then libev will avoid to modify the signal |
563 | When this flag is specified, then libev will avoid to modify the signal |
558 | mask. Specifically, this means you ahve to make sure signals are unblocked |
564 | mask. Specifically, this means you have to make sure signals are unblocked |
559 | when you want to receive them. |
565 | when you want to receive them. |
560 | .Sp |
566 | .Sp |
561 | This behaviour is useful when you want to do your own signal handling, or |
567 | This behaviour is useful when you want to do your own signal handling, or |
562 | want to handle signals only in specific threads and want to avoid libev |
568 | want to handle signals only in specific threads and want to avoid libev |
563 | unblocking the signals. |
569 | unblocking the signals. |
… | |
… | |
601 | .el .IP "\f(CWEVBACKEND_EPOLL\fR (value 4, Linux)" 4 |
607 | .el .IP "\f(CWEVBACKEND_EPOLL\fR (value 4, Linux)" 4 |
602 | .IX Item "EVBACKEND_EPOLL (value 4, Linux)" |
608 | .IX Item "EVBACKEND_EPOLL (value 4, Linux)" |
603 | Use the linux-specific \fIepoll\fR\|(7) interface (for both pre\- and post\-2.6.9 |
609 | Use the linux-specific \fIepoll\fR\|(7) interface (for both pre\- and post\-2.6.9 |
604 | kernels). |
610 | kernels). |
605 | .Sp |
611 | .Sp |
606 | For few fds, this backend is a bit little slower than poll and select, |
612 | For few fds, this backend is a bit little slower than poll and select, but |
607 | but it scales phenomenally better. While poll and select usually scale |
613 | it scales phenomenally better. While poll and select usually scale like |
608 | like O(total_fds) where n is the total number of fds (or the highest fd), |
614 | O(total_fds) where total_fds is the total number of fds (or the highest |
609 | epoll scales either O(1) or O(active_fds). |
615 | fd), epoll scales either O(1) or O(active_fds). |
610 | .Sp |
616 | .Sp |
611 | The epoll mechanism deserves honorable mention as the most misdesigned |
617 | The epoll mechanism deserves honorable mention as the most misdesigned |
612 | of the more advanced event mechanisms: mere annoyances include silently |
618 | of the more advanced event mechanisms: mere annoyances include silently |
613 | dropping file descriptors, requiring a system call per change per file |
619 | dropping file descriptors, requiring a system call per change per file |
614 | descriptor (and unnecessary guessing of parameters), problems with dup, |
620 | descriptor (and unnecessary guessing of parameters), problems with dup, |
… | |
… | |
617 | 0.1ms) and so on. The biggest issue is fork races, however \- if a program |
623 | 0.1ms) and so on. The biggest issue is fork races, however \- if a program |
618 | forks then \fIboth\fR parent and child process have to recreate the epoll |
624 | forks then \fIboth\fR parent and child process have to recreate the epoll |
619 | set, which can take considerable time (one syscall per file descriptor) |
625 | set, which can take considerable time (one syscall per file descriptor) |
620 | and is of course hard to detect. |
626 | and is of course hard to detect. |
621 | .Sp |
627 | .Sp |
622 | Epoll is also notoriously buggy \- embedding epoll fds \fIshould\fR work, but |
628 | Epoll is also notoriously buggy \- embedding epoll fds \fIshould\fR work, |
623 | of course \fIdoesn't\fR, and epoll just loves to report events for totally |
629 | but of course \fIdoesn't\fR, and epoll just loves to report events for |
624 | \&\fIdifferent\fR file descriptors (even already closed ones, so one cannot |
630 | totally \fIdifferent\fR file descriptors (even already closed ones, so |
625 | even remove them from the set) than registered in the set (especially |
631 | one cannot even remove them from the set) than registered in the set |
626 | on \s-1SMP\s0 systems). Libev tries to counter these spurious notifications by |
632 | (especially on \s-1SMP\s0 systems). Libev tries to counter these spurious |
627 | employing an additional generation counter and comparing that against the |
633 | notifications by employing an additional generation counter and comparing |
628 | events to filter out spurious ones, recreating the set when required. Last |
634 | that against the events to filter out spurious ones, recreating the set |
|
|
635 | when required. Epoll also erroneously rounds down timeouts, but gives you |
|
|
636 | no way to know when and by how much, so sometimes you have to busy-wait |
|
|
637 | because epoll returns immediately despite a nonzero timeout. And last |
629 | not least, it also refuses to work with some file descriptors which work |
638 | not least, it also refuses to work with some file descriptors which work |
630 | perfectly fine with \f(CW\*(C`select\*(C'\fR (files, many character devices...). |
639 | perfectly fine with \f(CW\*(C`select\*(C'\fR (files, many character devices...). |
631 | .Sp |
640 | .Sp |
632 | Epoll is truly the train wreck analog among event poll mechanisms, |
641 | Epoll is truly the train wreck among event poll mechanisms, a frankenpoll, |
633 | a frankenpoll, cobbled together in a hurry, no thought to design or |
642 | cobbled together in a hurry, no thought to design or interaction with |
634 | interaction with others. |
643 | others. Oh, the pain, will it ever stop... |
635 | .Sp |
644 | .Sp |
636 | While stopping, setting and starting an I/O watcher in the same iteration |
645 | While stopping, setting and starting an I/O watcher in the same iteration |
637 | will result in some caching, there is still a system call per such |
646 | will result in some caching, there is still a system call per such |
638 | incident (because the same \fIfile descriptor\fR could point to a different |
647 | incident (because the same \fIfile descriptor\fR could point to a different |
639 | \&\fIfile description\fR now), so its best to avoid that. Also, \f(CW\*(C`dup ()\*(C'\fR'ed |
648 | \&\fIfile description\fR now), so its best to avoid that. Also, \f(CW\*(C`dup ()\*(C'\fR'ed |
… | |
… | |
717 | among the OS-specific backends (I vastly prefer correctness over speed |
726 | among the OS-specific backends (I vastly prefer correctness over speed |
718 | hacks). |
727 | hacks). |
719 | .Sp |
728 | .Sp |
720 | On the negative side, the interface is \fIbizarre\fR \- so bizarre that |
729 | On the negative side, the interface is \fIbizarre\fR \- so bizarre that |
721 | even sun itself gets it wrong in their code examples: The event polling |
730 | even sun itself gets it wrong in their code examples: The event polling |
722 | function sometimes returning events to the caller even though an error |
731 | function sometimes returns events to the caller even though an error |
723 | occurred, but with no indication whether it has done so or not (yes, it's |
732 | occurred, but with no indication whether it has done so or not (yes, it's |
724 | even documented that way) \- deadly for edge-triggered interfaces where |
733 | even documented that way) \- deadly for edge-triggered interfaces where you |
725 | you absolutely have to know whether an event occurred or not because you |
734 | absolutely have to know whether an event occurred or not because you have |
726 | have to re-arm the watcher. |
735 | to re-arm the watcher. |
727 | .Sp |
736 | .Sp |
728 | Fortunately libev seems to be able to work around these idiocies. |
737 | Fortunately libev seems to be able to work around these idiocies. |
729 | .Sp |
738 | .Sp |
730 | This backend maps \f(CW\*(C`EV_READ\*(C'\fR and \f(CW\*(C`EV_WRITE\*(C'\fR in the same way as |
739 | This backend maps \f(CW\*(C`EV_READ\*(C'\fR and \f(CW\*(C`EV_WRITE\*(C'\fR in the same way as |
731 | \&\f(CW\*(C`EVBACKEND_POLL\*(C'\fR. |
740 | \&\f(CW\*(C`EVBACKEND_POLL\*(C'\fR. |
… | |
… | |
942 | This is useful if you are waiting for some external event in conjunction |
951 | This is useful if you are waiting for some external event in conjunction |
943 | with something not expressible using other libev watchers (i.e. "roll your |
952 | with something not expressible using other libev watchers (i.e. "roll your |
944 | own \f(CW\*(C`ev_run\*(C'\fR"). However, a pair of \f(CW\*(C`ev_prepare\*(C'\fR/\f(CW\*(C`ev_check\*(C'\fR watchers is |
953 | own \f(CW\*(C`ev_run\*(C'\fR"). However, a pair of \f(CW\*(C`ev_prepare\*(C'\fR/\f(CW\*(C`ev_check\*(C'\fR watchers is |
945 | usually a better approach for this kind of thing. |
954 | usually a better approach for this kind of thing. |
946 | .Sp |
955 | .Sp |
947 | Here are the gory details of what \f(CW\*(C`ev_run\*(C'\fR does: |
956 | Here are the gory details of what \f(CW\*(C`ev_run\*(C'\fR does (this is for your |
|
|
957 | understanding, not a guarantee that things will work exactly like this in |
|
|
958 | future versions): |
948 | .Sp |
959 | .Sp |
949 | .Vb 10 |
960 | .Vb 10 |
950 | \& \- Increment loop depth. |
961 | \& \- Increment loop depth. |
951 | \& \- Reset the ev_break status. |
962 | \& \- Reset the ev_break status. |
952 | \& \- Before the first iteration, call any pending watchers. |
963 | \& \- Before the first iteration, call any pending watchers. |
… | |
… | |
1067 | overhead for the actual polling but can deliver many events at once. |
1078 | overhead for the actual polling but can deliver many events at once. |
1068 | .Sp |
1079 | .Sp |
1069 | By setting a higher \fIio collect interval\fR you allow libev to spend more |
1080 | By setting a higher \fIio collect interval\fR you allow libev to spend more |
1070 | time collecting I/O events, so you can handle more events per iteration, |
1081 | time collecting I/O events, so you can handle more events per iteration, |
1071 | at the cost of increasing latency. Timeouts (both \f(CW\*(C`ev_periodic\*(C'\fR and |
1082 | at the cost of increasing latency. Timeouts (both \f(CW\*(C`ev_periodic\*(C'\fR and |
1072 | \&\f(CW\*(C`ev_timer\*(C'\fR) will be not affected. Setting this to a non-null value will |
1083 | \&\f(CW\*(C`ev_timer\*(C'\fR) will not be affected. Setting this to a non-null value will |
1073 | introduce an additional \f(CW\*(C`ev_sleep ()\*(C'\fR call into most loop iterations. The |
1084 | introduce an additional \f(CW\*(C`ev_sleep ()\*(C'\fR call into most loop iterations. The |
1074 | sleep time ensures that libev will not poll for I/O events more often then |
1085 | sleep time ensures that libev will not poll for I/O events more often then |
1075 | once per this interval, on average. |
1086 | once per this interval, on average (as long as the host time resolution is |
|
|
1087 | good enough). |
1076 | .Sp |
1088 | .Sp |
1077 | Likewise, by setting a higher \fItimeout collect interval\fR you allow libev |
1089 | Likewise, by setting a higher \fItimeout collect interval\fR you allow libev |
1078 | to spend more time collecting timeouts, at the expense of increased |
1090 | to spend more time collecting timeouts, at the expense of increased |
1079 | latency/jitter/inexactness (the watcher callback will be called |
1091 | latency/jitter/inexactness (the watcher callback will be called |
1080 | later). \f(CW\*(C`ev_io\*(C'\fR watchers will not be affected. Setting this to a non-null |
1092 | later). \f(CW\*(C`ev_io\*(C'\fR watchers will not be affected. Setting this to a non-null |
… | |
… | |
1132 | can be done relatively simply by putting mutex_lock/unlock calls around |
1144 | can be done relatively simply by putting mutex_lock/unlock calls around |
1133 | each call to a libev function. |
1145 | each call to a libev function. |
1134 | .Sp |
1146 | .Sp |
1135 | However, \f(CW\*(C`ev_run\*(C'\fR can run an indefinite time, so it is not feasible |
1147 | However, \f(CW\*(C`ev_run\*(C'\fR can run an indefinite time, so it is not feasible |
1136 | to wait for it to return. One way around this is to wake up the event |
1148 | to wait for it to return. One way around this is to wake up the event |
1137 | loop via \f(CW\*(C`ev_break\*(C'\fR and \f(CW\*(C`av_async_send\*(C'\fR, another way is to set these |
1149 | loop via \f(CW\*(C`ev_break\*(C'\fR and \f(CW\*(C`ev_async_send\*(C'\fR, another way is to set these |
1138 | \&\fIrelease\fR and \fIacquire\fR callbacks on the loop. |
1150 | \&\fIrelease\fR and \fIacquire\fR callbacks on the loop. |
1139 | .Sp |
1151 | .Sp |
1140 | When set, then \f(CW\*(C`release\*(C'\fR will be called just before the thread is |
1152 | When set, then \f(CW\*(C`release\*(C'\fR will be called just before the thread is |
1141 | suspended waiting for new events, and \f(CW\*(C`acquire\*(C'\fR is called just |
1153 | suspended waiting for new events, and \f(CW\*(C`acquire\*(C'\fR is called just |
1142 | afterwards. |
1154 | afterwards. |
… | |
… | |
1489 | active, pending and so on. In this section these states and the rules to |
1501 | active, pending and so on. In this section these states and the rules to |
1490 | transition between them will be described in more detail \- and while these |
1502 | transition between them will be described in more detail \- and while these |
1491 | rules might look complicated, they usually do \*(L"the right thing\*(R". |
1503 | rules might look complicated, they usually do \*(L"the right thing\*(R". |
1492 | .IP "initialiased" 4 |
1504 | .IP "initialiased" 4 |
1493 | .IX Item "initialiased" |
1505 | .IX Item "initialiased" |
1494 | Before a watcher can be registered with the event looop it has to be |
1506 | Before a watcher can be registered with the event loop it has to be |
1495 | initialised. This can be done with a call to \f(CW\*(C`ev_TYPE_init\*(C'\fR, or calls to |
1507 | initialised. This can be done with a call to \f(CW\*(C`ev_TYPE_init\*(C'\fR, or calls to |
1496 | \&\f(CW\*(C`ev_init\*(C'\fR followed by the watcher-specific \f(CW\*(C`ev_TYPE_set\*(C'\fR function. |
1508 | \&\f(CW\*(C`ev_init\*(C'\fR followed by the watcher-specific \f(CW\*(C`ev_TYPE_set\*(C'\fR function. |
1497 | .Sp |
1509 | .Sp |
1498 | In this state it is simply some block of memory that is suitable for |
1510 | In this state it is simply some block of memory that is suitable for |
1499 | use in an event loop. It can be moved around, freed, reused etc. at |
1511 | use in an event loop. It can be moved around, freed, reused etc. at |
… | |
… | |
1871 | detecting time jumps is hard, and some inaccuracies are unavoidable (the |
1883 | detecting time jumps is hard, and some inaccuracies are unavoidable (the |
1872 | monotonic clock option helps a lot here). |
1884 | monotonic clock option helps a lot here). |
1873 | .PP |
1885 | .PP |
1874 | The callback is guaranteed to be invoked only \fIafter\fR its timeout has |
1886 | The callback is guaranteed to be invoked only \fIafter\fR its timeout has |
1875 | passed (not \fIat\fR, so on systems with very low-resolution clocks this |
1887 | passed (not \fIat\fR, so on systems with very low-resolution clocks this |
1876 | might introduce a small delay). If multiple timers become ready during the |
1888 | might introduce a small delay, see \*(L"the special problem of being too |
|
|
1889 | early\*(R", below). If multiple timers become ready during the same loop |
1877 | same loop iteration then the ones with earlier time-out values are invoked |
1890 | iteration then the ones with earlier time-out values are invoked before |
1878 | before ones of the same priority with later time-out values (but this is |
1891 | ones of the same priority with later time-out values (but this is no |
1879 | no longer true when a callback calls \f(CW\*(C`ev_run\*(C'\fR recursively). |
1892 | longer true when a callback calls \f(CW\*(C`ev_run\*(C'\fR recursively). |
1880 | .PP |
1893 | .PP |
1881 | \fIBe smart about timeouts\fR |
1894 | \fIBe smart about timeouts\fR |
1882 | .IX Subsection "Be smart about timeouts" |
1895 | .IX Subsection "Be smart about timeouts" |
1883 | .PP |
1896 | .PP |
1884 | Many real-world problems involve some kind of timeout, usually for error |
1897 | Many real-world problems involve some kind of timeout, usually for error |
… | |
… | |
1966 | .Sp |
1979 | .Sp |
1967 | In this case, it would be more efficient to leave the \f(CW\*(C`ev_timer\*(C'\fR alone, |
1980 | In this case, it would be more efficient to leave the \f(CW\*(C`ev_timer\*(C'\fR alone, |
1968 | but remember the time of last activity, and check for a real timeout only |
1981 | but remember the time of last activity, and check for a real timeout only |
1969 | within the callback: |
1982 | within the callback: |
1970 | .Sp |
1983 | .Sp |
1971 | .Vb 1 |
1984 | .Vb 3 |
|
|
1985 | \& ev_tstamp timeout = 60.; |
1972 | \& ev_tstamp last_activity; // time of last activity |
1986 | \& ev_tstamp last_activity; // time of last activity |
|
|
1987 | \& ev_timer timer; |
1973 | \& |
1988 | \& |
1974 | \& static void |
1989 | \& static void |
1975 | \& callback (EV_P_ ev_timer *w, int revents) |
1990 | \& callback (EV_P_ ev_timer *w, int revents) |
1976 | \& { |
1991 | \& { |
1977 | \& ev_tstamp now = ev_now (EV_A); |
1992 | \& // calculate when the timeout would happen |
1978 | \& ev_tstamp timeout = last_activity + 60.; |
1993 | \& ev_tstamp after = last_activity \- ev_now (EV_A) + timeout; |
1979 | \& |
1994 | \& |
1980 | \& // if last_activity + 60. is older than now, we did time out |
1995 | \& // if negative, it means we the timeout already occured |
1981 | \& if (timeout < now) |
1996 | \& if (after < 0.) |
1982 | \& { |
1997 | \& { |
1983 | \& // timeout occurred, take action |
1998 | \& // timeout occurred, take action |
1984 | \& } |
1999 | \& } |
1985 | \& else |
2000 | \& else |
1986 | \& { |
2001 | \& { |
1987 | \& // callback was invoked, but there was some activity, re\-arm |
2002 | \& // callback was invoked, but there was some recent |
1988 | \& // the watcher to fire in last_activity + 60, which is |
2003 | \& // activity. simply restart the timer to time out |
1989 | \& // guaranteed to be in the future, so "again" is positive: |
2004 | \& // after "after" seconds, which is the earliest time |
1990 | \& w\->repeat = timeout \- now; |
2005 | \& // the timeout can occur. |
|
|
2006 | \& ev_timer_set (w, after, 0.); |
1991 | \& ev_timer_again (EV_A_ w); |
2007 | \& ev_timer_start (EV_A_ w); |
1992 | \& } |
2008 | \& } |
1993 | \& } |
2009 | \& } |
1994 | .Ve |
2010 | .Ve |
1995 | .Sp |
2011 | .Sp |
1996 | To summarise the callback: first calculate the real timeout (defined |
2012 | To summarise the callback: first calculate in how many seconds the |
1997 | as \*(L"60 seconds after the last activity\*(R"), then check if that time has |
2013 | timeout will occur (by calculating the absolute time when it would occur, |
1998 | been reached, which means something \fIdid\fR, in fact, time out. Otherwise |
2014 | \&\f(CW\*(C`last_activity + timeout\*(C'\fR, and subtracting the current time, \f(CW\*(C`ev_now |
1999 | the callback was invoked too early (\f(CW\*(C`timeout\*(C'\fR is in the future), so |
2015 | (EV_A)\*(C'\fR from that). |
2000 | re-schedule the timer to fire at that future time, to see if maybe we have |
|
|
2001 | a timeout then. |
|
|
2002 | .Sp |
2016 | .Sp |
2003 | Note how \f(CW\*(C`ev_timer_again\*(C'\fR is used, taking advantage of the |
2017 | If this value is negative, then we are already past the timeout, i.e. we |
2004 | \&\f(CW\*(C`ev_timer_again\*(C'\fR optimisation when the timer is already running. |
2018 | timed out, and need to do whatever is needed in this case. |
|
|
2019 | .Sp |
|
|
2020 | Otherwise, we now the earliest time at which the timeout would trigger, |
|
|
2021 | and simply start the timer with this timeout value. |
|
|
2022 | .Sp |
|
|
2023 | In other words, each time the callback is invoked it will check whether |
|
|
2024 | the timeout cocured. If not, it will simply reschedule itself to check |
|
|
2025 | again at the earliest time it could time out. Rinse. Repeat. |
2005 | .Sp |
2026 | .Sp |
2006 | This scheme causes more callback invocations (about one every 60 seconds |
2027 | This scheme causes more callback invocations (about one every 60 seconds |
2007 | minus half the average time between activity), but virtually no calls to |
2028 | minus half the average time between activity), but virtually no calls to |
2008 | libev to change the timeout. |
2029 | libev to change the timeout. |
2009 | .Sp |
2030 | .Sp |
2010 | To start the timer, simply initialise the watcher and set \f(CW\*(C`last_activity\*(C'\fR |
2031 | To start the machinery, simply initialise the watcher and set |
2011 | to the current time (meaning we just have some activity :), then call the |
2032 | \&\f(CW\*(C`last_activity\*(C'\fR to the current time (meaning there was some activity just |
2012 | callback, which will \*(L"do the right thing\*(R" and start the timer: |
2033 | now), then call the callback, which will \*(L"do the right thing\*(R" and start |
|
|
2034 | the timer: |
2013 | .Sp |
2035 | .Sp |
2014 | .Vb 3 |
2036 | .Vb 3 |
|
|
2037 | \& last_activity = ev_now (EV_A); |
2015 | \& ev_init (timer, callback); |
2038 | \& ev_init (&timer, callback); |
2016 | \& last_activity = ev_now (loop); |
2039 | \& callback (EV_A_ &timer, 0); |
2017 | \& callback (loop, timer, EV_TIMER); |
|
|
2018 | .Ve |
2040 | .Ve |
2019 | .Sp |
2041 | .Sp |
2020 | And when there is some activity, simply store the current time in |
2042 | When there is some activity, simply store the current time in |
2021 | \&\f(CW\*(C`last_activity\*(C'\fR, no libev calls at all: |
2043 | \&\f(CW\*(C`last_activity\*(C'\fR, no libev calls at all: |
2022 | .Sp |
2044 | .Sp |
2023 | .Vb 1 |
2045 | .Vb 2 |
|
|
2046 | \& if (activity detected) |
2024 | \& last_activity = ev_now (loop); |
2047 | \& last_activity = ev_now (EV_A); |
|
|
2048 | .Ve |
|
|
2049 | .Sp |
|
|
2050 | When your timeout value changes, then the timeout can be changed by simply |
|
|
2051 | providing a new value, stopping the timer and calling the callback, which |
|
|
2052 | will agaion do the right thing (for example, time out immediately :). |
|
|
2053 | .Sp |
|
|
2054 | .Vb 3 |
|
|
2055 | \& timeout = new_value; |
|
|
2056 | \& ev_timer_stop (EV_A_ &timer); |
|
|
2057 | \& callback (EV_A_ &timer, 0); |
2025 | .Ve |
2058 | .Ve |
2026 | .Sp |
2059 | .Sp |
2027 | This technique is slightly more complex, but in most cases where the |
2060 | This technique is slightly more complex, but in most cases where the |
2028 | time-out is unlikely to be triggered, much more efficient. |
2061 | time-out is unlikely to be triggered, much more efficient. |
2029 | .Sp |
|
|
2030 | Changing the timeout is trivial as well (if it isn't hard-coded in the |
|
|
2031 | callback :) \- just change the timeout and invoke the callback, which will |
|
|
2032 | fix things for you. |
|
|
2033 | .IP "4. Wee, just use a double-linked list for your timeouts." 4 |
2062 | .IP "4. Wee, just use a double-linked list for your timeouts." 4 |
2034 | .IX Item "4. Wee, just use a double-linked list for your timeouts." |
2063 | .IX Item "4. Wee, just use a double-linked list for your timeouts." |
2035 | If there is not one request, but many thousands (millions...), all |
2064 | If there is not one request, but many thousands (millions...), all |
2036 | employing some kind of timeout with the same timeout value, then one can |
2065 | employing some kind of timeout with the same timeout value, then one can |
2037 | do even better: |
2066 | do even better: |
… | |
… | |
2061 | Method #1 is almost always a bad idea, and buys you nothing. Method #4 is |
2090 | Method #1 is almost always a bad idea, and buys you nothing. Method #4 is |
2062 | rather complicated, but extremely efficient, something that really pays |
2091 | rather complicated, but extremely efficient, something that really pays |
2063 | off after the first million or so of active timers, i.e. it's usually |
2092 | off after the first million or so of active timers, i.e. it's usually |
2064 | overkill :) |
2093 | overkill :) |
2065 | .PP |
2094 | .PP |
|
|
2095 | \fIThe special problem of being too early\fR |
|
|
2096 | .IX Subsection "The special problem of being too early" |
|
|
2097 | .PP |
|
|
2098 | If you ask a timer to call your callback after three seconds, then |
|
|
2099 | you expect it to be invoked after three seconds \- but of course, this |
|
|
2100 | cannot be guaranteed to infinite precision. Less obviously, it cannot be |
|
|
2101 | guaranteed to any precision by libev \- imagine somebody suspending the |
|
|
2102 | process with a \s-1STOP\s0 signal for a few hours for example. |
|
|
2103 | .PP |
|
|
2104 | So, libev tries to invoke your callback as soon as possible \fIafter\fR the |
|
|
2105 | delay has occurred, but cannot guarantee this. |
|
|
2106 | .PP |
|
|
2107 | A less obvious failure mode is calling your callback too early: many event |
|
|
2108 | loops compare timestamps with a \*(L"elapsed delay >= requested delay\*(R", but |
|
|
2109 | this can cause your callback to be invoked much earlier than you would |
|
|
2110 | expect. |
|
|
2111 | .PP |
|
|
2112 | To see why, imagine a system with a clock that only offers full second |
|
|
2113 | resolution (think windows if you can't come up with a broken enough \s-1OS\s0 |
|
|
2114 | yourself). If you schedule a one-second timer at the time 500.9, then the |
|
|
2115 | event loop will schedule your timeout to elapse at a system time of 500 |
|
|
2116 | (500.9 truncated to the resolution) + 1, or 501. |
|
|
2117 | .PP |
|
|
2118 | If an event library looks at the timeout 0.1s later, it will see \*(L"501 >= |
|
|
2119 | 501\*(R" and invoke the callback 0.1s after it was started, even though a |
|
|
2120 | one-second delay was requested \- this is being \*(L"too early\*(R", despite best |
|
|
2121 | intentions. |
|
|
2122 | .PP |
|
|
2123 | This is the reason why libev will never invoke the callback if the elapsed |
|
|
2124 | delay equals the requested delay, but only when the elapsed delay is |
|
|
2125 | larger than the requested delay. In the example above, libev would only invoke |
|
|
2126 | the callback at system time 502, or 1.1s after the timer was started. |
|
|
2127 | .PP |
|
|
2128 | So, while libev cannot guarantee that your callback will be invoked |
|
|
2129 | exactly when requested, it \fIcan\fR and \fIdoes\fR guarantee that the requested |
|
|
2130 | delay has actually elapsed, or in other words, it always errs on the \*(L"too |
|
|
2131 | late\*(R" side of things. |
|
|
2132 | .PP |
2066 | \fIThe special problem of time updates\fR |
2133 | \fIThe special problem of time updates\fR |
2067 | .IX Subsection "The special problem of time updates" |
2134 | .IX Subsection "The special problem of time updates" |
2068 | .PP |
2135 | .PP |
2069 | Establishing the current time is a costly operation (it usually takes at |
2136 | Establishing the current time is a costly operation (it usually takes |
2070 | least two system calls): \s-1EV\s0 therefore updates its idea of the current |
2137 | at least one system call): \s-1EV\s0 therefore updates its idea of the current |
2071 | time only before and after \f(CW\*(C`ev_run\*(C'\fR collects new events, which causes a |
2138 | time only before and after \f(CW\*(C`ev_run\*(C'\fR collects new events, which causes a |
2072 | growing difference between \f(CW\*(C`ev_now ()\*(C'\fR and \f(CW\*(C`ev_time ()\*(C'\fR when handling |
2139 | growing difference between \f(CW\*(C`ev_now ()\*(C'\fR and \f(CW\*(C`ev_time ()\*(C'\fR when handling |
2073 | lots of events in one iteration. |
2140 | lots of events in one iteration. |
2074 | .PP |
2141 | .PP |
2075 | The relative timeouts are calculated relative to the \f(CW\*(C`ev_now ()\*(C'\fR |
2142 | The relative timeouts are calculated relative to the \f(CW\*(C`ev_now ()\*(C'\fR |
… | |
… | |
2083 | .Ve |
2150 | .Ve |
2084 | .PP |
2151 | .PP |
2085 | If the event loop is suspended for a long time, you can also force an |
2152 | If the event loop is suspended for a long time, you can also force an |
2086 | update of the time returned by \f(CW\*(C`ev_now ()\*(C'\fR by calling \f(CW\*(C`ev_now_update |
2153 | update of the time returned by \f(CW\*(C`ev_now ()\*(C'\fR by calling \f(CW\*(C`ev_now_update |
2087 | ()\*(C'\fR. |
2154 | ()\*(C'\fR. |
|
|
2155 | .PP |
|
|
2156 | \fIThe special problem of unsynchronised clocks\fR |
|
|
2157 | .IX Subsection "The special problem of unsynchronised clocks" |
|
|
2158 | .PP |
|
|
2159 | Modern systems have a variety of clocks \- libev itself uses the normal |
|
|
2160 | \&\*(L"wall clock\*(R" clock and, if available, the monotonic clock (to avoid time |
|
|
2161 | jumps). |
|
|
2162 | .PP |
|
|
2163 | Neither of these clocks is synchronised with each other or any other clock |
|
|
2164 | on the system, so \f(CW\*(C`ev_time ()\*(C'\fR might return a considerably different time |
|
|
2165 | than \f(CW\*(C`gettimeofday ()\*(C'\fR or \f(CW\*(C`time ()\*(C'\fR. On a GNU/Linux system, for example, |
|
|
2166 | a call to \f(CW\*(C`gettimeofday\*(C'\fR might return a second count that is one higher |
|
|
2167 | than a directly following call to \f(CW\*(C`time\*(C'\fR. |
|
|
2168 | .PP |
|
|
2169 | The moral of this is to only compare libev-related timestamps with |
|
|
2170 | \&\f(CW\*(C`ev_time ()\*(C'\fR and \f(CW\*(C`ev_now ()\*(C'\fR, at least if you want better precision than |
|
|
2171 | a second or so. |
|
|
2172 | .PP |
|
|
2173 | One more problem arises due to this lack of synchronisation: if libev uses |
|
|
2174 | the system monotonic clock and you compare timestamps from \f(CW\*(C`ev_time\*(C'\fR |
|
|
2175 | or \f(CW\*(C`ev_now\*(C'\fR from when you started your timer and when your callback is |
|
|
2176 | invoked, you will find that sometimes the callback is a bit \*(L"early\*(R". |
|
|
2177 | .PP |
|
|
2178 | This is because \f(CW\*(C`ev_timer\*(C'\fRs work in real time, not wall clock time, so |
|
|
2179 | libev makes sure your callback is not invoked before the delay happened, |
|
|
2180 | \&\fImeasured according to the real time\fR, not the system clock. |
|
|
2181 | .PP |
|
|
2182 | If your timeouts are based on a physical timescale (e.g. \*(L"time out this |
|
|
2183 | connection after 100 seconds\*(R") then this shouldn't bother you as it is |
|
|
2184 | exactly the right behaviour. |
|
|
2185 | .PP |
|
|
2186 | If you want to compare wall clock/system timestamps to your timers, then |
|
|
2187 | you need to use \f(CW\*(C`ev_periodic\*(C'\fRs, as these are based on the wall clock |
|
|
2188 | time, where your comparisons will always generate correct results. |
2088 | .PP |
2189 | .PP |
2089 | \fIThe special problems of suspended animation\fR |
2190 | \fIThe special problems of suspended animation\fR |
2090 | .IX Subsection "The special problems of suspended animation" |
2191 | .IX Subsection "The special problems of suspended animation" |
2091 | .PP |
2192 | .PP |
2092 | When you leave the server world it is quite customary to hit machines that |
2193 | When you leave the server world it is quite customary to hit machines that |
… | |
… | |
2136 | trigger at exactly 10 second intervals. If, however, your program cannot |
2237 | trigger at exactly 10 second intervals. If, however, your program cannot |
2137 | keep up with the timer (because it takes longer than those 10 seconds to |
2238 | keep up with the timer (because it takes longer than those 10 seconds to |
2138 | do stuff) the timer will not fire more than once per event loop iteration. |
2239 | do stuff) the timer will not fire more than once per event loop iteration. |
2139 | .IP "ev_timer_again (loop, ev_timer *)" 4 |
2240 | .IP "ev_timer_again (loop, ev_timer *)" 4 |
2140 | .IX Item "ev_timer_again (loop, ev_timer *)" |
2241 | .IX Item "ev_timer_again (loop, ev_timer *)" |
2141 | This will act as if the timer timed out and restart it again if it is |
2242 | This will act as if the timer timed out, and restarts it again if it is |
2142 | repeating. The exact semantics are: |
2243 | repeating. It basically works like calling \f(CW\*(C`ev_timer_stop\*(C'\fR, updating the |
|
|
2244 | timeout to the \f(CW\*(C`repeat\*(C'\fR value and calling \f(CW\*(C`ev_timer_start\*(C'\fR. |
2143 | .Sp |
2245 | .Sp |
|
|
2246 | The exact semantics are as in the following rules, all of which will be |
|
|
2247 | applied to the watcher: |
|
|
2248 | .RS 4 |
2144 | If the timer is pending, its pending status is cleared. |
2249 | .IP "If the timer is pending, the pending status is always cleared." 4 |
2145 | .Sp |
2250 | .IX Item "If the timer is pending, the pending status is always cleared." |
|
|
2251 | .PD 0 |
2146 | If the timer is started but non-repeating, stop it (as if it timed out). |
2252 | .IP "If the timer is started but non-repeating, stop it (as if it timed out, without invoking it)." 4 |
2147 | .Sp |
2253 | .IX Item "If the timer is started but non-repeating, stop it (as if it timed out, without invoking it)." |
2148 | If the timer is repeating, either start it if necessary (with the |
2254 | .ie n .IP "If the timer is repeating, make the ""repeat"" value the new timeout and start the timer, if necessary." 4 |
2149 | \&\f(CW\*(C`repeat\*(C'\fR value), or reset the running timer to the \f(CW\*(C`repeat\*(C'\fR value. |
2255 | .el .IP "If the timer is repeating, make the \f(CWrepeat\fR value the new timeout and start the timer, if necessary." 4 |
|
|
2256 | .IX Item "If the timer is repeating, make the repeat value the new timeout and start the timer, if necessary." |
|
|
2257 | .RE |
|
|
2258 | .RS 4 |
|
|
2259 | .PD |
2150 | .Sp |
2260 | .Sp |
2151 | This sounds a bit complicated, see \*(L"Be smart about timeouts\*(R", above, for a |
2261 | This sounds a bit complicated, see \*(L"Be smart about timeouts\*(R", above, for a |
2152 | usage example. |
2262 | usage example. |
|
|
2263 | .RE |
2153 | .IP "ev_tstamp ev_timer_remaining (loop, ev_timer *)" 4 |
2264 | .IP "ev_tstamp ev_timer_remaining (loop, ev_timer *)" 4 |
2154 | .IX Item "ev_tstamp ev_timer_remaining (loop, ev_timer *)" |
2265 | .IX Item "ev_tstamp ev_timer_remaining (loop, ev_timer *)" |
2155 | Returns the remaining time until a timer fires. If the timer is active, |
2266 | Returns the remaining time until a timer fires. If the timer is active, |
2156 | then this time is relative to the current event loop time, otherwise it's |
2267 | then this time is relative to the current event loop time, otherwise it's |
2157 | the timeout value currently configured. |
2268 | the timeout value currently configured. |
… | |
… | |
2277 | .Sp |
2388 | .Sp |
2278 | Another way to think about it (for the mathematically inclined) is that |
2389 | Another way to think about it (for the mathematically inclined) is that |
2279 | \&\f(CW\*(C`ev_periodic\*(C'\fR will try to run the callback in this mode at the next possible |
2390 | \&\f(CW\*(C`ev_periodic\*(C'\fR will try to run the callback in this mode at the next possible |
2280 | time where \f(CW\*(C`time = offset (mod interval)\*(C'\fR, regardless of any time jumps. |
2391 | time where \f(CW\*(C`time = offset (mod interval)\*(C'\fR, regardless of any time jumps. |
2281 | .Sp |
2392 | .Sp |
2282 | For numerical stability it is preferable that the \f(CW\*(C`offset\*(C'\fR value is near |
2393 | The \f(CW\*(C`interval\*(C'\fR \fI\s-1MUST\s0\fR be positive, and for numerical stability, the |
2283 | \&\f(CW\*(C`ev_now ()\*(C'\fR (the current time), but there is no range requirement for |
2394 | interval value should be higher than \f(CW\*(C`1/8192\*(C'\fR (which is around 100 |
2284 | this value, and in fact is often specified as zero. |
2395 | microseconds) and \f(CW\*(C`offset\*(C'\fR should be higher than \f(CW0\fR and should have |
|
|
2396 | at most a similar magnitude as the current time (say, within a factor of |
|
|
2397 | ten). Typical values for offset are, in fact, \f(CW0\fR or something between |
|
|
2398 | \&\f(CW0\fR and \f(CW\*(C`interval\*(C'\fR, which is also the recommended range. |
2285 | .Sp |
2399 | .Sp |
2286 | Note also that there is an upper limit to how often a timer can fire (\s-1CPU\s0 |
2400 | Note also that there is an upper limit to how often a timer can fire (\s-1CPU\s0 |
2287 | speed for example), so if \f(CW\*(C`interval\*(C'\fR is very small then timing stability |
2401 | speed for example), so if \f(CW\*(C`interval\*(C'\fR is very small then timing stability |
2288 | will of course deteriorate. Libev itself tries to be exact to be about one |
2402 | will of course deteriorate. Libev itself tries to be exact to be about one |
2289 | millisecond (if the \s-1OS\s0 supports it and the machine is fast enough). |
2403 | millisecond (if the \s-1OS\s0 supports it and the machine is fast enough). |
… | |
… | |
3331 | \&\f(CW\*(C`ev_async_sent\*(C'\fR calls). In fact, you could use signal watchers as a kind |
3445 | \&\f(CW\*(C`ev_async_sent\*(C'\fR calls). In fact, you could use signal watchers as a kind |
3332 | of \*(L"global async watchers\*(R" by using a watcher on an otherwise unused |
3446 | of \*(L"global async watchers\*(R" by using a watcher on an otherwise unused |
3333 | signal, and \f(CW\*(C`ev_feed_signal\*(C'\fR to signal this watcher from another thread, |
3447 | signal, and \f(CW\*(C`ev_feed_signal\*(C'\fR to signal this watcher from another thread, |
3334 | even without knowing which loop owns the signal. |
3448 | even without knowing which loop owns the signal. |
3335 | .PP |
3449 | .PP |
3336 | Unlike \f(CW\*(C`ev_signal\*(C'\fR watchers, \f(CW\*(C`ev_async\*(C'\fR works with any event loop, not |
|
|
3337 | just the default loop. |
|
|
3338 | .PP |
|
|
3339 | \fIQueueing\fR |
3450 | \fIQueueing\fR |
3340 | .IX Subsection "Queueing" |
3451 | .IX Subsection "Queueing" |
3341 | .PP |
3452 | .PP |
3342 | \&\f(CW\*(C`ev_async\*(C'\fR does not support queueing of data in any way. The reason |
3453 | \&\f(CW\*(C`ev_async\*(C'\fR does not support queueing of data in any way. The reason |
3343 | is that the author does not know of a simple (or any) algorithm for a |
3454 | is that the author does not know of a simple (or any) algorithm for a |
… | |
… | |
3437 | Unlike \f(CW\*(C`ev_feed_event\*(C'\fR, this call is safe to do from other threads, |
3548 | Unlike \f(CW\*(C`ev_feed_event\*(C'\fR, this call is safe to do from other threads, |
3438 | signal or similar contexts (see the discussion of \f(CW\*(C`EV_ATOMIC_T\*(C'\fR in the |
3549 | signal or similar contexts (see the discussion of \f(CW\*(C`EV_ATOMIC_T\*(C'\fR in the |
3439 | embedding section below on what exactly this means). |
3550 | embedding section below on what exactly this means). |
3440 | .Sp |
3551 | .Sp |
3441 | Note that, as with other watchers in libev, multiple events might get |
3552 | Note that, as with other watchers in libev, multiple events might get |
3442 | compressed into a single callback invocation (another way to look at this |
3553 | compressed into a single callback invocation (another way to look at |
3443 | is that \f(CW\*(C`ev_async\*(C'\fR watchers are level-triggered, set on \f(CW\*(C`ev_async_send\*(C'\fR, |
3554 | this is that \f(CW\*(C`ev_async\*(C'\fR watchers are level-triggered: they are set on |
3444 | reset when the event loop detects that). |
3555 | \&\f(CW\*(C`ev_async_send\*(C'\fR, reset when the event loop detects that). |
3445 | .Sp |
3556 | .Sp |
3446 | This call incurs the overhead of a system call only once per event loop |
3557 | This call incurs the overhead of at most one extra system call per event |
3447 | iteration, so while the overhead might be noticeable, it doesn't apply to |
3558 | loop iteration, if the event loop is blocked, and no syscall at all if |
3448 | repeated calls to \f(CW\*(C`ev_async_send\*(C'\fR for the same event loop. |
3559 | the event loop (or your program) is processing events. That means that |
|
|
3560 | repeated calls are basically free (there is no need to avoid calls for |
|
|
3561 | performance reasons) and that the overhead becomes smaller (typically |
|
|
3562 | zero) under load. |
3449 | .IP "bool = ev_async_pending (ev_async *)" 4 |
3563 | .IP "bool = ev_async_pending (ev_async *)" 4 |
3450 | .IX Item "bool = ev_async_pending (ev_async *)" |
3564 | .IX Item "bool = ev_async_pending (ev_async *)" |
3451 | Returns a non-zero value when \f(CW\*(C`ev_async_send\*(C'\fR has been called on the |
3565 | Returns a non-zero value when \f(CW\*(C`ev_async_send\*(C'\fR has been called on the |
3452 | watcher but the event has not yet been processed (or even noted) by the |
3566 | watcher but the event has not yet been processed (or even noted) by the |
3453 | event loop. |
3567 | event loop. |
… | |
… | |
3501 | \& ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); |
3615 | \& ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); |
3502 | .Ve |
3616 | .Ve |
3503 | .IP "ev_feed_fd_event (loop, int fd, int revents)" 4 |
3617 | .IP "ev_feed_fd_event (loop, int fd, int revents)" 4 |
3504 | .IX Item "ev_feed_fd_event (loop, int fd, int revents)" |
3618 | .IX Item "ev_feed_fd_event (loop, int fd, int revents)" |
3505 | Feed an event on the given fd, as if a file descriptor backend detected |
3619 | Feed an event on the given fd, as if a file descriptor backend detected |
3506 | the given events it. |
3620 | the given events. |
3507 | .IP "ev_feed_signal_event (loop, int signum)" 4 |
3621 | .IP "ev_feed_signal_event (loop, int signum)" 4 |
3508 | .IX Item "ev_feed_signal_event (loop, int signum)" |
3622 | .IX Item "ev_feed_signal_event (loop, int signum)" |
3509 | Feed an event as if the given signal occurred. See also \f(CW\*(C`ev_feed_signal\*(C'\fR, |
3623 | Feed an event as if the given signal occurred. See also \f(CW\*(C`ev_feed_signal\*(C'\fR, |
3510 | which is async-safe. |
3624 | which is async-safe. |
3511 | .SH "COMMON OR USEFUL IDIOMS (OR BOTH)" |
3625 | .SH "COMMON OR USEFUL IDIOMS (OR BOTH)" |
… | |
… | |
3585 | \& { |
3699 | \& { |
3586 | \& struct my_biggy big = (struct my_biggy *) |
3700 | \& struct my_biggy big = (struct my_biggy *) |
3587 | \& (((char *)w) \- offsetof (struct my_biggy, t2)); |
3701 | \& (((char *)w) \- offsetof (struct my_biggy, t2)); |
3588 | \& } |
3702 | \& } |
3589 | .Ve |
3703 | .Ve |
|
|
3704 | .SS "\s-1AVOIDING\s0 \s-1FINISHING\s0 \s-1BEFORE\s0 \s-1RETURNING\s0" |
|
|
3705 | .IX Subsection "AVOIDING FINISHING BEFORE RETURNING" |
|
|
3706 | Often you have structures like this in event-based programs: |
|
|
3707 | .PP |
|
|
3708 | .Vb 4 |
|
|
3709 | \& callback () |
|
|
3710 | \& { |
|
|
3711 | \& free (request); |
|
|
3712 | \& } |
|
|
3713 | \& |
|
|
3714 | \& request = start_new_request (..., callback); |
|
|
3715 | .Ve |
|
|
3716 | .PP |
|
|
3717 | The intent is to start some \*(L"lengthy\*(R" operation. The \f(CW\*(C`request\*(C'\fR could be |
|
|
3718 | used to cancel the operation, or do other things with it. |
|
|
3719 | .PP |
|
|
3720 | It's not uncommon to have code paths in \f(CW\*(C`start_new_request\*(C'\fR that |
|
|
3721 | immediately invoke the callback, for example, to report errors. Or you add |
|
|
3722 | some caching layer that finds that it can skip the lengthy aspects of the |
|
|
3723 | operation and simply invoke the callback with the result. |
|
|
3724 | .PP |
|
|
3725 | The problem here is that this will happen \fIbefore\fR \f(CW\*(C`start_new_request\*(C'\fR |
|
|
3726 | has returned, so \f(CW\*(C`request\*(C'\fR is not set. |
|
|
3727 | .PP |
|
|
3728 | Even if you pass the request by some safer means to the callback, you |
|
|
3729 | might want to do something to the request after starting it, such as |
|
|
3730 | canceling it, which probably isn't working so well when the callback has |
|
|
3731 | already been invoked. |
|
|
3732 | .PP |
|
|
3733 | A common way around all these issues is to make sure that |
|
|
3734 | \&\f(CW\*(C`start_new_request\*(C'\fR \fIalways\fR returns before the callback is invoked. If |
|
|
3735 | \&\f(CW\*(C`start_new_request\*(C'\fR immediately knows the result, it can artificially |
|
|
3736 | delay invoking the callback by e.g. using a \f(CW\*(C`prepare\*(C'\fR or \f(CW\*(C`idle\*(C'\fR watcher |
|
|
3737 | for example, or more sneakily, by reusing an existing (stopped) watcher |
|
|
3738 | and pushing it into the pending queue: |
|
|
3739 | .PP |
|
|
3740 | .Vb 2 |
|
|
3741 | \& ev_set_cb (watcher, callback); |
|
|
3742 | \& ev_feed_event (EV_A_ watcher, 0); |
|
|
3743 | .Ve |
|
|
3744 | .PP |
|
|
3745 | This way, \f(CW\*(C`start_new_request\*(C'\fR can safely return before the callback is |
|
|
3746 | invoked, while not delaying callback invocation too much. |
3590 | .SS "\s-1MODEL/NESTED\s0 \s-1EVENT\s0 \s-1LOOP\s0 \s-1INVOCATIONS\s0 \s-1AND\s0 \s-1EXIT\s0 \s-1CONDITIONS\s0" |
3747 | .SS "\s-1MODEL/NESTED\s0 \s-1EVENT\s0 \s-1LOOP\s0 \s-1INVOCATIONS\s0 \s-1AND\s0 \s-1EXIT\s0 \s-1CONDITIONS\s0" |
3591 | .IX Subsection "MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS" |
3748 | .IX Subsection "MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS" |
3592 | Often (especially in \s-1GUI\s0 toolkits) there are places where you have |
3749 | Often (especially in \s-1GUI\s0 toolkits) there are places where you have |
3593 | \&\fImodal\fR interaction, which is most easily implemented by recursively |
3750 | \&\fImodal\fR interaction, which is most easily implemented by recursively |
3594 | invoking \f(CW\*(C`ev_run\*(C'\fR. |
3751 | invoking \f(CW\*(C`ev_run\*(C'\fR. |
… | |
… | |
3608 | \& int exit_main_loop = 0; |
3765 | \& int exit_main_loop = 0; |
3609 | \& |
3766 | \& |
3610 | \& while (!exit_main_loop) |
3767 | \& while (!exit_main_loop) |
3611 | \& ev_run (EV_DEFAULT_ EVRUN_ONCE); |
3768 | \& ev_run (EV_DEFAULT_ EVRUN_ONCE); |
3612 | \& |
3769 | \& |
3613 | \& // in a model watcher |
3770 | \& // in a modal watcher |
3614 | \& int exit_nested_loop = 0; |
3771 | \& int exit_nested_loop = 0; |
3615 | \& |
3772 | \& |
3616 | \& while (!exit_nested_loop) |
3773 | \& while (!exit_nested_loop) |
3617 | \& ev_run (EV_A_ EVRUN_ONCE); |
3774 | \& ev_run (EV_A_ EVRUN_ONCE); |
3618 | .Ve |
3775 | .Ve |
… | |
… | |
3817 | \& } |
3974 | \& } |
3818 | .Ve |
3975 | .Ve |
3819 | .PP |
3976 | .PP |
3820 | That basically suspends the coroutine inside \f(CW\*(C`wait_for_event\*(C'\fR and |
3977 | That basically suspends the coroutine inside \f(CW\*(C`wait_for_event\*(C'\fR and |
3821 | continues the libev coroutine, which, when appropriate, switches back to |
3978 | continues the libev coroutine, which, when appropriate, switches back to |
3822 | this or any other coroutine. I am sure if you sue this your own :) |
3979 | this or any other coroutine. |
3823 | .PP |
3980 | .PP |
3824 | You can do similar tricks if you have, say, threads with an event queue \- |
3981 | You can do similar tricks if you have, say, threads with an event queue \- |
3825 | instead of storing a coroutine, you store the queue object and instead of |
3982 | instead of storing a coroutine, you store the queue object and instead of |
3826 | switching to a coroutine, you push the watcher onto the queue and notify |
3983 | switching to a coroutine, you push the watcher onto the queue and notify |
3827 | any waiters. |
3984 | any waiters. |
… | |
… | |
3915 | .el .IP "\f(CWev::io\fR, \f(CWev::timer\fR, \f(CWev::periodic\fR, \f(CWev::idle\fR, \f(CWev::sig\fR etc." 4 |
4072 | .el .IP "\f(CWev::io\fR, \f(CWev::timer\fR, \f(CWev::periodic\fR, \f(CWev::idle\fR, \f(CWev::sig\fR etc." 4 |
3916 | .IX Item "ev::io, ev::timer, ev::periodic, ev::idle, ev::sig etc." |
4073 | .IX Item "ev::io, ev::timer, ev::periodic, ev::idle, ev::sig etc." |
3917 | For each \f(CW\*(C`ev_TYPE\*(C'\fR watcher in \fIev.h\fR there is a corresponding class of |
4074 | For each \f(CW\*(C`ev_TYPE\*(C'\fR watcher in \fIev.h\fR there is a corresponding class of |
3918 | the same name in the \f(CW\*(C`ev\*(C'\fR namespace, with the exception of \f(CW\*(C`ev_signal\*(C'\fR |
4075 | the same name in the \f(CW\*(C`ev\*(C'\fR namespace, with the exception of \f(CW\*(C`ev_signal\*(C'\fR |
3919 | which is called \f(CW\*(C`ev::sig\*(C'\fR to avoid clashes with the \f(CW\*(C`signal\*(C'\fR macro |
4076 | which is called \f(CW\*(C`ev::sig\*(C'\fR to avoid clashes with the \f(CW\*(C`signal\*(C'\fR macro |
3920 | defines by many implementations. |
4077 | defined by many implementations. |
3921 | .Sp |
4078 | .Sp |
3922 | All of those classes have these methods: |
4079 | All of those classes have these methods: |
3923 | .RS 4 |
4080 | .RS 4 |
3924 | .IP "ev::TYPE::TYPE ()" 4 |
4081 | .IP "ev::TYPE::TYPE ()" 4 |
3925 | .IX Item "ev::TYPE::TYPE ()" |
4082 | .IX Item "ev::TYPE::TYPE ()" |
… | |
… | |
4056 | .PP |
4213 | .PP |
4057 | .Vb 5 |
4214 | .Vb 5 |
4058 | \& class myclass |
4215 | \& class myclass |
4059 | \& { |
4216 | \& { |
4060 | \& ev::io io ; void io_cb (ev::io &w, int revents); |
4217 | \& ev::io io ; void io_cb (ev::io &w, int revents); |
4061 | \& ev::io2 io2 ; void io2_cb (ev::io &w, int revents); |
4218 | \& ev::io io2 ; void io2_cb (ev::io &w, int revents); |
4062 | \& ev::idle idle; void idle_cb (ev::idle &w, int revents); |
4219 | \& ev::idle idle; void idle_cb (ev::idle &w, int revents); |
4063 | \& |
4220 | \& |
4064 | \& myclass (int fd) |
4221 | \& myclass (int fd) |
4065 | \& { |
4222 | \& { |
4066 | \& io .set <myclass, &myclass::io_cb > (this); |
4223 | \& io .set <myclass, &myclass::io_cb > (this); |
… | |
… | |
4105 | Roger Pack reports that using the link order \f(CW\*(C`\-lws2_32 \-lmsvcrt\-ruby\-190\*(C'\fR |
4262 | Roger Pack reports that using the link order \f(CW\*(C`\-lws2_32 \-lmsvcrt\-ruby\-190\*(C'\fR |
4106 | makes rev work even on mingw. |
4263 | makes rev work even on mingw. |
4107 | .IP "Haskell" 4 |
4264 | .IP "Haskell" 4 |
4108 | .IX Item "Haskell" |
4265 | .IX Item "Haskell" |
4109 | A haskell binding to libev is available at |
4266 | A haskell binding to libev is available at |
4110 | <http://hackage.haskell.org/cgi\-bin/hackage\-scripts/package/hlibev>. |
4267 | http://hackage.haskell.org/cgi\-bin/hackage\-scripts/package/hlibev <http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>. |
4111 | .IP "D" 4 |
4268 | .IP "D" 4 |
4112 | .IX Item "D" |
4269 | .IX Item "D" |
4113 | Leandro Lucarella has written a D language binding (\fIev.d\fR) for libev, to |
4270 | Leandro Lucarella has written a D language binding (\fIev.d\fR) for libev, to |
4114 | be found at <http://proj.llucax.com.ar/wiki/evd>. |
4271 | be found at <http://www.llucax.com.ar/proj/ev.d/index.html>. |
4115 | .IP "Ocaml" 4 |
4272 | .IP "Ocaml" 4 |
4116 | .IX Item "Ocaml" |
4273 | .IX Item "Ocaml" |
4117 | Erkki Seppala has written Ocaml bindings for libev, to be found at |
4274 | Erkki Seppala has written Ocaml bindings for libev, to be found at |
4118 | <http://modeemi.cs.tut.fi/~flux/software/ocaml\-ev/>. |
4275 | http://modeemi.cs.tut.fi/~flux/software/ocaml\-ev/ <http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. |
4119 | .IP "Lua" 4 |
4276 | .IP "Lua" 4 |
4120 | .IX Item "Lua" |
4277 | .IX Item "Lua" |
4121 | Brian Maher has written a partial interface to libev for lua (at the |
4278 | Brian Maher has written a partial interface to libev for lua (at the |
4122 | time of this writing, only \f(CW\*(C`ev_io\*(C'\fR and \f(CW\*(C`ev_timer\*(C'\fR), to be found at |
4279 | time of this writing, only \f(CW\*(C`ev_io\*(C'\fR and \f(CW\*(C`ev_timer\*(C'\fR), to be found at |
4123 | <http://github.com/brimworks/lua\-ev>. |
4280 | http://github.com/brimworks/lua\-ev <http://github.com/brimworks/lua-ev>. |
4124 | .SH "MACRO MAGIC" |
4281 | .SH "MACRO MAGIC" |
4125 | .IX Header "MACRO MAGIC" |
4282 | .IX Header "MACRO MAGIC" |
4126 | Libev can be compiled with a variety of options, the most fundamental |
4283 | Libev can be compiled with a variety of options, the most fundamental |
4127 | of which is \f(CW\*(C`EV_MULTIPLICITY\*(C'\fR. This option determines whether (most) |
4284 | of which is \f(CW\*(C`EV_MULTIPLICITY\*(C'\fR. This option determines whether (most) |
4128 | functions and callbacks have an initial \f(CW\*(C`struct ev_loop *\*(C'\fR argument. |
4285 | functions and callbacks have an initial \f(CW\*(C`struct ev_loop *\*(C'\fR argument. |
… | |
… | |
4163 | suitable for use with \f(CW\*(C`EV_A\*(C'\fR. |
4320 | suitable for use with \f(CW\*(C`EV_A\*(C'\fR. |
4164 | .ie n .IP """EV_DEFAULT"", ""EV_DEFAULT_""" 4 |
4321 | .ie n .IP """EV_DEFAULT"", ""EV_DEFAULT_""" 4 |
4165 | .el .IP "\f(CWEV_DEFAULT\fR, \f(CWEV_DEFAULT_\fR" 4 |
4322 | .el .IP "\f(CWEV_DEFAULT\fR, \f(CWEV_DEFAULT_\fR" 4 |
4166 | .IX Item "EV_DEFAULT, EV_DEFAULT_" |
4323 | .IX Item "EV_DEFAULT, EV_DEFAULT_" |
4167 | Similar to the other two macros, this gives you the value of the default |
4324 | Similar to the other two macros, this gives you the value of the default |
4168 | loop, if multiple loops are supported (\*(L"ev loop default\*(R"). |
4325 | loop, if multiple loops are supported (\*(L"ev loop default\*(R"). The default loop |
|
|
4326 | will be initialised if it isn't already initialised. |
|
|
4327 | .Sp |
|
|
4328 | For non-multiplicity builds, these macros do nothing, so you always have |
|
|
4329 | to initialise the loop somewhere. |
4169 | .ie n .IP """EV_DEFAULT_UC"", ""EV_DEFAULT_UC_""" 4 |
4330 | .ie n .IP """EV_DEFAULT_UC"", ""EV_DEFAULT_UC_""" 4 |
4170 | .el .IP "\f(CWEV_DEFAULT_UC\fR, \f(CWEV_DEFAULT_UC_\fR" 4 |
4331 | .el .IP "\f(CWEV_DEFAULT_UC\fR, \f(CWEV_DEFAULT_UC_\fR" 4 |
4171 | .IX Item "EV_DEFAULT_UC, EV_DEFAULT_UC_" |
4332 | .IX Item "EV_DEFAULT_UC, EV_DEFAULT_UC_" |
4172 | Usage identical to \f(CW\*(C`EV_DEFAULT\*(C'\fR and \f(CW\*(C`EV_DEFAULT_\*(C'\fR, but requires that the |
4333 | Usage identical to \f(CW\*(C`EV_DEFAULT\*(C'\fR and \f(CW\*(C`EV_DEFAULT_\*(C'\fR, but requires that the |
4173 | default loop has been initialised (\f(CW\*(C`UC\*(C'\fR == unchecked). Their behaviour |
4334 | default loop has been initialised (\f(CW\*(C`UC\*(C'\fR == unchecked). Their behaviour |
… | |
… | |
4328 | supported). It will also not define any of the structs usually found in |
4489 | supported). It will also not define any of the structs usually found in |
4329 | \&\fIevent.h\fR that are not directly supported by the libev core alone. |
4490 | \&\fIevent.h\fR that are not directly supported by the libev core alone. |
4330 | .Sp |
4491 | .Sp |
4331 | In standalone mode, libev will still try to automatically deduce the |
4492 | In standalone mode, libev will still try to automatically deduce the |
4332 | configuration, but has to be more conservative. |
4493 | configuration, but has to be more conservative. |
|
|
4494 | .IP "\s-1EV_USE_FLOOR\s0" 4 |
|
|
4495 | .IX Item "EV_USE_FLOOR" |
|
|
4496 | If defined to be \f(CW1\fR, libev will use the \f(CW\*(C`floor ()\*(C'\fR function for its |
|
|
4497 | periodic reschedule calculations, otherwise libev will fall back on a |
|
|
4498 | portable (slower) implementation. If you enable this, you usually have to |
|
|
4499 | link against libm or something equivalent. Enabling this when the \f(CW\*(C`floor\*(C'\fR |
|
|
4500 | function is not available will fail, so the safe default is to not enable |
|
|
4501 | this. |
4333 | .IP "\s-1EV_USE_MONOTONIC\s0" 4 |
4502 | .IP "\s-1EV_USE_MONOTONIC\s0" 4 |
4334 | .IX Item "EV_USE_MONOTONIC" |
4503 | .IX Item "EV_USE_MONOTONIC" |
4335 | If defined to be \f(CW1\fR, libev will try to detect the availability of the |
4504 | If defined to be \f(CW1\fR, libev will try to detect the availability of the |
4336 | monotonic clock option at both compile time and runtime. Otherwise no |
4505 | monotonic clock option at both compile time and runtime. Otherwise no |
4337 | use of the monotonic clock option will be attempted. If you enable this, |
4506 | use of the monotonic clock option will be attempted. If you enable this, |
… | |
… | |
4449 | .IX Item "EV_USE_INOTIFY" |
4618 | .IX Item "EV_USE_INOTIFY" |
4450 | If defined to be \f(CW1\fR, libev will compile in support for the Linux inotify |
4619 | If defined to be \f(CW1\fR, libev will compile in support for the Linux inotify |
4451 | interface to speed up \f(CW\*(C`ev_stat\*(C'\fR watchers. Its actual availability will |
4620 | interface to speed up \f(CW\*(C`ev_stat\*(C'\fR watchers. Its actual availability will |
4452 | be detected at runtime. If undefined, it will be enabled if the headers |
4621 | be detected at runtime. If undefined, it will be enabled if the headers |
4453 | indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
4622 | indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
|
|
4623 | .IP "\s-1EV_NO_SMP\s0" 4 |
|
|
4624 | .IX Item "EV_NO_SMP" |
|
|
4625 | If defined to be \f(CW1\fR, libev will assume that memory is always coherent |
|
|
4626 | between threads, that is, threads can be used, but threads never run on |
|
|
4627 | different cpus (or different cpu cores). This reduces dependencies |
|
|
4628 | and makes libev faster. |
|
|
4629 | .IP "\s-1EV_NO_THREADS\s0" 4 |
|
|
4630 | .IX Item "EV_NO_THREADS" |
|
|
4631 | If defined to be \f(CW1\fR, libev will assume that it will never be called |
|
|
4632 | from different threads, which is a stronger assumption than \f(CW\*(C`EV_NO_SMP\*(C'\fR, |
|
|
4633 | above. This reduces dependencies and makes libev faster. |
4454 | .IP "\s-1EV_ATOMIC_T\s0" 4 |
4634 | .IP "\s-1EV_ATOMIC_T\s0" 4 |
4455 | .IX Item "EV_ATOMIC_T" |
4635 | .IX Item "EV_ATOMIC_T" |
4456 | Libev requires an integer type (suitable for storing \f(CW0\fR or \f(CW1\fR) whose |
4636 | Libev requires an integer type (suitable for storing \f(CW0\fR or \f(CW1\fR) whose |
4457 | access is atomic with respect to other threads or signal contexts. No such |
4637 | access is atomic and serialised with respect to other threads or signal |
4458 | type is easily found in the C language, so you can provide your own type |
4638 | contexts. No such type is easily found in the C language, so you can |
4459 | that you know is safe for your purposes. It is used both for signal handler \*(L"locking\*(R" |
4639 | provide your own type that you know is safe for your purposes. It is used |
4460 | as well as for signal and thread safety in \f(CW\*(C`ev_async\*(C'\fR watchers. |
4640 | both for signal handler \*(L"locking\*(R" as well as for signal and thread safety |
|
|
4641 | in \f(CW\*(C`ev_async\*(C'\fR watchers. |
4461 | .Sp |
4642 | .Sp |
4462 | In the absence of this define, libev will use \f(CW\*(C`sig_atomic_t volatile\*(C'\fR |
4643 | In the absence of this define, libev will use \f(CW\*(C`sig_atomic_t volatile\*(C'\fR |
4463 | (from \fIsignal.h\fR), which is usually good enough on most platforms. |
4644 | (from \fIsignal.h\fR), which is usually good enough on most platforms, |
|
|
4645 | although strictly speaking using a type that also implies a memory fence |
|
|
4646 | is required. |
4464 | .IP "\s-1EV_H\s0 (h)" 4 |
4647 | .IP "\s-1EV_H\s0 (h)" 4 |
4465 | .IX Item "EV_H (h)" |
4648 | .IX Item "EV_H (h)" |
4466 | The name of the \fIev.h\fR header file used to include it. The default if |
4649 | The name of the \fIev.h\fR header file used to include it. The default if |
4467 | undefined is \f(CW"ev.h"\fR in \fIevent.h\fR, \fIev.c\fR and \fIev++.h\fR. This can be |
4650 | undefined is \f(CW"ev.h"\fR in \fIevent.h\fR, \fIev.c\fR and \fIev++.h\fR. This can be |
4468 | used to virtually rename the \fIev.h\fR header file in case of conflicts. |
4651 | used to virtually rename the \fIev.h\fR header file in case of conflicts. |
… | |
… | |
4486 | If undefined or defined to \f(CW1\fR, then all event-loop-specific functions |
4669 | If undefined or defined to \f(CW1\fR, then all event-loop-specific functions |
4487 | will have the \f(CW\*(C`struct ev_loop *\*(C'\fR as first argument, and you can create |
4670 | will have the \f(CW\*(C`struct ev_loop *\*(C'\fR as first argument, and you can create |
4488 | additional independent event loops. Otherwise there will be no support |
4671 | additional independent event loops. Otherwise there will be no support |
4489 | for multiple event loops and there is no first event loop pointer |
4672 | for multiple event loops and there is no first event loop pointer |
4490 | argument. Instead, all functions act on the single default loop. |
4673 | argument. Instead, all functions act on the single default loop. |
|
|
4674 | .Sp |
|
|
4675 | Note that \f(CW\*(C`EV_DEFAULT\*(C'\fR and \f(CW\*(C`EV_DEFAULT_\*(C'\fR will no longer provide a |
|
|
4676 | default loop when multiplicity is switched off \- you always have to |
|
|
4677 | initialise the loop manually in this case. |
4491 | .IP "\s-1EV_MINPRI\s0" 4 |
4678 | .IP "\s-1EV_MINPRI\s0" 4 |
4492 | .IX Item "EV_MINPRI" |
4679 | .IX Item "EV_MINPRI" |
4493 | .PD 0 |
4680 | .PD 0 |
4494 | .IP "\s-1EV_MAXPRI\s0" 4 |
4681 | .IP "\s-1EV_MAXPRI\s0" 4 |
4495 | .IX Item "EV_MAXPRI" |
4682 | .IX Item "EV_MAXPRI" |
… | |
… | |
4592 | With an intelligent-enough linker (gcc+binutils are intelligent enough |
4779 | With an intelligent-enough linker (gcc+binutils are intelligent enough |
4593 | when you use \f(CW\*(C`\-Wl,\-\-gc\-sections \-ffunction\-sections\*(C'\fR) functions unused by |
4780 | when you use \f(CW\*(C`\-Wl,\-\-gc\-sections \-ffunction\-sections\*(C'\fR) functions unused by |
4594 | your program might be left out as well \- a binary starting a timer and an |
4781 | your program might be left out as well \- a binary starting a timer and an |
4595 | I/O watcher then might come out at only 5Kb. |
4782 | I/O watcher then might come out at only 5Kb. |
4596 | .RE |
4783 | .RE |
|
|
4784 | .IP "\s-1EV_API_STATIC\s0" 4 |
|
|
4785 | .IX Item "EV_API_STATIC" |
|
|
4786 | If this symbol is defined (by default it is not), then all identifiers |
|
|
4787 | will have static linkage. This means that libev will not export any |
|
|
4788 | identifiers, and you cannot link against libev anymore. This can be useful |
|
|
4789 | when you embed libev, only want to use libev functions in a single file, |
|
|
4790 | and do not want its identifiers to be visible. |
|
|
4791 | .Sp |
|
|
4792 | To use this, define \f(CW\*(C`EV_API_STATIC\*(C'\fR and include \fIev.c\fR in the file that |
|
|
4793 | wants to use libev. |
|
|
4794 | .Sp |
|
|
4795 | This option only works when libev is compiled with a C compiler, as \*(C+ |
|
|
4796 | doesn't support the required declaration syntax. |
4597 | .IP "\s-1EV_AVOID_STDIO\s0" 4 |
4797 | .IP "\s-1EV_AVOID_STDIO\s0" 4 |
4598 | .IX Item "EV_AVOID_STDIO" |
4798 | .IX Item "EV_AVOID_STDIO" |
4599 | If this is set to \f(CW1\fR at compiletime, then libev will avoid using stdio |
4799 | If this is set to \f(CW1\fR at compiletime, then libev will avoid using stdio |
4600 | functions (printf, scanf, perror etc.). This will increase the code size |
4800 | functions (printf, scanf, perror etc.). This will increase the code size |
4601 | somewhat, but if your program doesn't otherwise depend on stdio and your |
4801 | somewhat, but if your program doesn't otherwise depend on stdio and your |
… | |
… | |
4978 | requires, and its I/O model is fundamentally incompatible with the \s-1POSIX\s0 |
5178 | requires, and its I/O model is fundamentally incompatible with the \s-1POSIX\s0 |
4979 | model. Libev still offers limited functionality on this platform in |
5179 | model. Libev still offers limited functionality on this platform in |
4980 | the form of the \f(CW\*(C`EVBACKEND_SELECT\*(C'\fR backend, and only supports socket |
5180 | the form of the \f(CW\*(C`EVBACKEND_SELECT\*(C'\fR backend, and only supports socket |
4981 | descriptors. This only applies when using Win32 natively, not when using |
5181 | descriptors. This only applies when using Win32 natively, not when using |
4982 | e.g. cygwin. Actually, it only applies to the microsofts own compilers, |
5182 | e.g. cygwin. Actually, it only applies to the microsofts own compilers, |
4983 | as every compielr comes with a slightly differently broken/incompatible |
5183 | as every compiler comes with a slightly differently broken/incompatible |
4984 | environment. |
5184 | environment. |
4985 | .PP |
5185 | .PP |
4986 | Lifting these limitations would basically require the full |
5186 | Lifting these limitations would basically require the full |
4987 | re-implementation of the I/O system. If you are into this kind of thing, |
5187 | re-implementation of the I/O system. If you are into this kind of thing, |
4988 | then note that glib does exactly that for you in a very portable way (note |
5188 | then note that glib does exactly that for you in a very portable way (note |
… | |
… | |
5124 | .IX Item "double must hold a time value in seconds with enough accuracy" |
5324 | .IX Item "double must hold a time value in seconds with enough accuracy" |
5125 | The type \f(CW\*(C`double\*(C'\fR is used to represent timestamps. It is required to |
5325 | The type \f(CW\*(C`double\*(C'\fR is used to represent timestamps. It is required to |
5126 | have at least 51 bits of mantissa (and 9 bits of exponent), which is |
5326 | have at least 51 bits of mantissa (and 9 bits of exponent), which is |
5127 | good enough for at least into the year 4000 with millisecond accuracy |
5327 | good enough for at least into the year 4000 with millisecond accuracy |
5128 | (the design goal for libev). This requirement is overfulfilled by |
5328 | (the design goal for libev). This requirement is overfulfilled by |
5129 | implementations using \s-1IEEE\s0 754, which is basically all existing ones. With |
5329 | implementations using \s-1IEEE\s0 754, which is basically all existing ones. |
|
|
5330 | .Sp |
5130 | \&\s-1IEEE\s0 754 doubles, you get microsecond accuracy until at least 2200. |
5331 | With \s-1IEEE\s0 754 doubles, you get microsecond accuracy until at least the |
|
|
5332 | year 2255 (and millisecond accuracy till the year 287396 \- by then, libev |
|
|
5333 | is either obsolete or somebody patched it to use \f(CW\*(C`long double\*(C'\fR or |
|
|
5334 | something like that, just kidding). |
5131 | .PP |
5335 | .PP |
5132 | If you know of other additional requirements drop me a note. |
5336 | If you know of other additional requirements drop me a note. |
5133 | .SH "ALGORITHMIC COMPLEXITIES" |
5337 | .SH "ALGORITHMIC COMPLEXITIES" |
5134 | .IX Header "ALGORITHMIC COMPLEXITIES" |
5338 | .IX Header "ALGORITHMIC COMPLEXITIES" |
5135 | In this section the complexities of (many of) the algorithms used inside |
5339 | In this section the complexities of (many of) the algorithms used inside |
… | |
… | |
5189 | .IX Item "Processing ev_async_send: O(number_of_async_watchers)" |
5393 | .IX Item "Processing ev_async_send: O(number_of_async_watchers)" |
5190 | .IP "Processing signals: O(max_signal_number)" 4 |
5394 | .IP "Processing signals: O(max_signal_number)" 4 |
5191 | .IX Item "Processing signals: O(max_signal_number)" |
5395 | .IX Item "Processing signals: O(max_signal_number)" |
5192 | .PD |
5396 | .PD |
5193 | Sending involves a system call \fIiff\fR there were no other \f(CW\*(C`ev_async_send\*(C'\fR |
5397 | Sending involves a system call \fIiff\fR there were no other \f(CW\*(C`ev_async_send\*(C'\fR |
5194 | calls in the current loop iteration. Checking for async and signal events |
5398 | calls in the current loop iteration and the loop is currently |
|
|
5399 | blocked. Checking for async and signal events involves iterating over all |
5195 | involves iterating over all running async watchers or all signal numbers. |
5400 | running async watchers or all signal numbers. |
5196 | .SH "PORTING FROM LIBEV 3.X TO 4.X" |
5401 | .SH "PORTING FROM LIBEV 3.X TO 4.X" |
5197 | .IX Header "PORTING FROM LIBEV 3.X TO 4.X" |
5402 | .IX Header "PORTING FROM LIBEV 3.X TO 4.X" |
5198 | The major version 4 introduced some incompatible changes to the \s-1API\s0. |
5403 | The major version 4 introduced some incompatible changes to the \s-1API\s0. |
5199 | .PP |
5404 | .PP |
5200 | At the moment, the \f(CW\*(C`ev.h\*(C'\fR header file provides compatibility definitions |
5405 | At the moment, the \f(CW\*(C`ev.h\*(C'\fR header file provides compatibility definitions |