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

Comparing libev/ev.pod (file contents):
Revision 1.159 by root, Thu May 22 02:44:57 2008 UTC vs.
Revision 1.161 by root, Sat May 24 03:08:03 2008 UTC

113Libev represents time as a single floating point number, representing the 113Libev represents time as a single floating point number, representing the
114(fractional) number of seconds since the (POSIX) epoch (somewhere near 114(fractional) number of seconds since the (POSIX) epoch (somewhere near
115the beginning of 1970, details are complicated, don't ask). This type is 115the beginning of 1970, details are complicated, don't ask). This type is
116called C<ev_tstamp>, which is what you should use too. It usually aliases 116called C<ev_tstamp>, which is what you should use too. It usually aliases
117to the C<double> type in C, and when you need to do any calculations on 117to the C<double> type in C, and when you need to do any calculations on
118it, you should treat it as some floatingpoint value. Unlike the name 118it, you should treat it as some floating point value. Unlike the name
119component C<stamp> might indicate, it is also used for time differences 119component C<stamp> might indicate, it is also used for time differences
120throughout libev. 120throughout libev.
121
122=head1 ERROR HANDLING
123
124Libev knows three classes of errors: operating system errors, usage errors
125and internal errors (bugs).
126
127When libev catches an operating system error it cannot handle (for example
128a system call indicating a condition libev cannot fix), it calls the callback
129set via C<ev_set_syserr_cb>, which is supposed to fix the problem or
130abort. The default is to print a diagnostic message and to call C<abort
131()>.
132
133When libev detects a usage error such as a negative timer interval, then
134it will print a diagnostic message and abort (via the C<assert> mechanism,
135so C<NDEBUG> will disable this checking): these are programming errors in
136the libev caller and need to be fixed there.
137
138Libev also has a few internal error-checking C<assert>ions, and also has
139extensive consistency checking code. These do not trigger under normal
140circumstances, as they indicate either a bug in libev or worse.
141
121 142
122=head1 GLOBAL FUNCTIONS 143=head1 GLOBAL FUNCTIONS
123 144
124These functions can be called anytime, even before initialising the 145These functions can be called anytime, even before initialising the
125library in any way. 146library in any way.
134 155
135=item ev_sleep (ev_tstamp interval) 156=item ev_sleep (ev_tstamp interval)
136 157
137Sleep for the given interval: The current thread will be blocked until 158Sleep for the given interval: The current thread will be blocked until
138either it is interrupted or the given time interval has passed. Basically 159either it is interrupted or the given time interval has passed. Basically
139this is a subsecond-resolution C<sleep ()>. 160this is a sub-second-resolution C<sleep ()>.
140 161
141=item int ev_version_major () 162=item int ev_version_major ()
142 163
143=item int ev_version_minor () 164=item int ev_version_minor ()
144 165
179=item unsigned int ev_recommended_backends () 200=item unsigned int ev_recommended_backends ()
180 201
181Return the set of all backends compiled into this binary of libev and also 202Return the set of all backends compiled into this binary of libev and also
182recommended for this platform. This set is often smaller than the one 203recommended for this platform. This set is often smaller than the one
183returned by C<ev_supported_backends>, as for example kqueue is broken on 204returned by C<ev_supported_backends>, as for example kqueue is broken on
184most BSDs and will not be autodetected unless you explicitly request it 205most BSDs and will not be auto-detected unless you explicitly request it
185(assuming you know what you are doing). This is the set of backends that 206(assuming you know what you are doing). This is the set of backends that
186libev will probe for if you specify no backends explicitly. 207libev will probe for if you specify no backends explicitly.
187 208
188=item unsigned int ev_embeddable_backends () 209=item unsigned int ev_embeddable_backends ()
189 210
231 ... 252 ...
232 ev_set_allocator (persistent_realloc); 253 ev_set_allocator (persistent_realloc);
233 254
234=item ev_set_syserr_cb (void (*cb)(const char *msg)); 255=item ev_set_syserr_cb (void (*cb)(const char *msg));
235 256
236Set the callback function to call on a retryable syscall error (such 257Set the callback function to call on a retryable system call error (such
237as failed select, poll, epoll_wait). The message is a printable string 258as failed select, poll, epoll_wait). The message is a printable string
238indicating the system call or subsystem causing the problem. If this 259indicating the system call or subsystem causing the problem. If this
239callback is set, then libev will expect it to remedy the sitution, no 260callback is set, then libev will expect it to remedy the situation, no
240matter what, when it returns. That is, libev will generally retry the 261matter what, when it returns. That is, libev will generally retry the
241requested operation, or, if the condition doesn't go away, do bad stuff 262requested operation, or, if the condition doesn't go away, do bad stuff
242(such as abort). 263(such as abort).
243 264
244Example: This is basically the same thing that libev does internally, too. 265Example: This is basically the same thing that libev does internally, too.
277from multiple threads, you have to lock (note also that this is unlikely, 298from multiple threads, you have to lock (note also that this is unlikely,
278as loops cannot bes hared easily between threads anyway). 299as loops cannot bes hared easily between threads anyway).
279 300
280The default loop is the only loop that can handle C<ev_signal> and 301The default loop is the only loop that can handle C<ev_signal> and
281C<ev_child> watchers, and to do this, it always registers a handler 302C<ev_child> watchers, and to do this, it always registers a handler
282for C<SIGCHLD>. If this is a problem for your app you can either 303for C<SIGCHLD>. If this is a problem for your application you can either
283create a dynamic loop with C<ev_loop_new> that doesn't do that, or you 304create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
284can simply overwrite the C<SIGCHLD> signal handler I<after> calling 305can simply overwrite the C<SIGCHLD> signal handler I<after> calling
285C<ev_default_init>. 306C<ev_default_init>.
286 307
287The flags argument can be used to specify special behaviour or specific 308The flags argument can be used to specify special behaviour or specific
296The default flags value. Use this if you have no clue (it's the right 317The default flags value. Use this if you have no clue (it's the right
297thing, believe me). 318thing, believe me).
298 319
299=item C<EVFLAG_NOENV> 320=item C<EVFLAG_NOENV>
300 321
301If this flag bit is ored into the flag value (or the program runs setuid 322If this flag bit is or'ed into the flag value (or the program runs setuid
302or setgid) then libev will I<not> look at the environment variable 323or setgid) then libev will I<not> look at the environment variable
303C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 324C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
304override the flags completely if it is found in the environment. This is 325override the flags completely if it is found in the environment. This is
305useful to try out specific backends to test their performance, or to work 326useful to try out specific backends to test their performance, or to work
306around bugs. 327around bugs.
313 334
314This works by calling C<getpid ()> on every iteration of the loop, 335This works by calling C<getpid ()> on every iteration of the loop,
315and thus this might slow down your event loop if you do a lot of loop 336and thus this might slow down your event loop if you do a lot of loop
316iterations and little real work, but is usually not noticeable (on my 337iterations and little real work, but is usually not noticeable (on my
317GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 338GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
318without a syscall and thus I<very> fast, but my GNU/Linux system also has 339without a system call and thus I<very> fast, but my GNU/Linux system also has
319C<pthread_atfork> which is even faster). 340C<pthread_atfork> which is even faster).
320 341
321The big advantage of this flag is that you can forget about fork (and 342The big advantage of this flag is that you can forget about fork (and
322forget about forgetting to tell libev about forking) when you use this 343forget about forgetting to tell libev about forking) when you use this
323flag. 344flag.
324 345
325This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS> 346This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
326environment variable. 347environment variable.
327 348
328=item C<EVBACKEND_SELECT> (value 1, portable select backend) 349=item C<EVBACKEND_SELECT> (value 1, portable select backend)
329 350
330This is your standard select(2) backend. Not I<completely> standard, as 351This is your standard select(2) backend. Not I<completely> standard, as
332but if that fails, expect a fairly low limit on the number of fds when 353but if that fails, expect a fairly low limit on the number of fds when
333using this backend. It doesn't scale too well (O(highest_fd)), but its 354using this backend. It doesn't scale too well (O(highest_fd)), but its
334usually the fastest backend for a low number of (low-numbered :) fds. 355usually the fastest backend for a low number of (low-numbered :) fds.
335 356
336To get good performance out of this backend you need a high amount of 357To get good performance out of this backend you need a high amount of
337parallelity (most of the file descriptors should be busy). If you are 358parallelism (most of the file descriptors should be busy). If you are
338writing a server, you should C<accept ()> in a loop to accept as many 359writing a server, you should C<accept ()> in a loop to accept as many
339connections as possible during one iteration. You might also want to have 360connections as possible during one iteration. You might also want to have
340a look at C<ev_set_io_collect_interval ()> to increase the amount of 361a look at C<ev_set_io_collect_interval ()> to increase the amount of
341readiness notifications you get per iteration. 362readiness notifications you get per iteration.
342 363
354For few fds, this backend is a bit little slower than poll and select, 375For few fds, this backend is a bit little slower than poll and select,
355but it scales phenomenally better. While poll and select usually scale 376but it scales phenomenally better. While poll and select usually scale
356like O(total_fds) where n is the total number of fds (or the highest fd), 377like O(total_fds) where n is the total number of fds (or the highest fd),
357epoll scales either O(1) or O(active_fds). The epoll design has a number 378epoll scales either O(1) or O(active_fds). The epoll design has a number
358of shortcomings, such as silently dropping events in some hard-to-detect 379of shortcomings, such as silently dropping events in some hard-to-detect
359cases and requiring a syscall per fd change, no fork support and bad 380cases and requiring a system call per fd change, no fork support and bad
360support for dup. 381support for dup.
361 382
362While stopping, setting and starting an I/O watcher in the same iteration 383While stopping, setting and starting an I/O watcher in the same iteration
363will result in some caching, there is still a syscall per such incident 384will result in some caching, there is still a system call per such incident
364(because the fd could point to a different file description now), so its 385(because the fd could point to a different file description now), so its
365best to avoid that. Also, C<dup ()>'ed file descriptors might not work 386best to avoid that. Also, C<dup ()>'ed file descriptors might not work
366very well if you register events for both fds. 387very well if you register events for both fds.
367 388
368Please note that epoll sometimes generates spurious notifications, so you 389Please note that epoll sometimes generates spurious notifications, so you
371 392
372Best performance from this backend is achieved by not unregistering all 393Best performance from this backend is achieved by not unregistering all
373watchers for a file descriptor until it has been closed, if possible, i.e. 394watchers for a file descriptor until it has been closed, if possible, i.e.
374keep at least one watcher active per fd at all times. 395keep at least one watcher active per fd at all times.
375 396
376While nominally embeddeble in other event loops, this feature is broken in 397While nominally embeddable in other event loops, this feature is broken in
377all kernel versions tested so far. 398all kernel versions tested so far.
378 399
379=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 400=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
380 401
381Kqueue deserves special mention, as at the time of this writing, it 402Kqueue deserves special mention, as at the time of this writing, it
382was broken on all BSDs except NetBSD (usually it doesn't work reliably 403was broken on all BSDs except NetBSD (usually it doesn't work reliably
383with anything but sockets and pipes, except on Darwin, where of course 404with anything but sockets and pipes, except on Darwin, where of course
384it's completely useless). For this reason it's not being "autodetected" 405it's completely useless). For this reason it's not being "auto-detected"
385unless you explicitly specify it explicitly in the flags (i.e. using 406unless you explicitly specify it explicitly in the flags (i.e. using
386C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) 407C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
387system like NetBSD. 408system like NetBSD.
388 409
389You still can embed kqueue into a normal poll or select backend and use it 410You still can embed kqueue into a normal poll or select backend and use it
391the target platform). See C<ev_embed> watchers for more info. 412the target platform). See C<ev_embed> watchers for more info.
392 413
393It scales in the same way as the epoll backend, but the interface to the 414It scales in the same way as the epoll backend, but the interface to the
394kernel is more efficient (which says nothing about its actual speed, of 415kernel is more efficient (which says nothing about its actual speed, of
395course). While stopping, setting and starting an I/O watcher does never 416course). While stopping, setting and starting an I/O watcher does never
396cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to 417cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
397two event changes per incident, support for C<fork ()> is very bad and it 418two event changes per incident, support for C<fork ()> is very bad and it
398drops fds silently in similarly hard-to-detect cases. 419drops fds silently in similarly hard-to-detect cases.
399 420
400This backend usually performs well under most conditions. 421This backend usually performs well under most conditions.
401 422
416=item C<EVBACKEND_PORT> (value 32, Solaris 10) 437=item C<EVBACKEND_PORT> (value 32, Solaris 10)
417 438
418This uses the Solaris 10 event port mechanism. As with everything on Solaris, 439This uses the Solaris 10 event port mechanism. As with everything on Solaris,
419it's really slow, but it still scales very well (O(active_fds)). 440it's really slow, but it still scales very well (O(active_fds)).
420 441
421Please note that solaris event ports can deliver a lot of spurious 442Please note that Solaris event ports can deliver a lot of spurious
422notifications, so you need to use non-blocking I/O or other means to avoid 443notifications, so you need to use non-blocking I/O or other means to avoid
423blocking when no data (or space) is available. 444blocking when no data (or space) is available.
424 445
425While this backend scales well, it requires one system call per active 446While this backend scales well, it requires one system call per active
426file descriptor per loop iteration. For small and medium numbers of file 447file descriptor per loop iteration. For small and medium numbers of file
439 460
440It is definitely not recommended to use this flag. 461It is definitely not recommended to use this flag.
441 462
442=back 463=back
443 464
444If one or more of these are ored into the flags value, then only these 465If one or more of these are or'ed into the flags value, then only these
445backends will be tried (in the reverse order as listed here). If none are 466backends will be tried (in the reverse order as listed here). If none are
446specified, all backends in C<ev_recommended_backends ()> will be tried. 467specified, all backends in C<ev_recommended_backends ()> will be tried.
447 468
448The most typical usage is like this: 469The most typical usage is like this:
449 470
481=item ev_default_destroy () 502=item ev_default_destroy ()
482 503
483Destroys the default loop again (frees all memory and kernel state 504Destroys the default loop again (frees all memory and kernel state
484etc.). None of the active event watchers will be stopped in the normal 505etc.). None of the active event watchers will be stopped in the normal
485sense, so e.g. C<ev_is_active> might still return true. It is your 506sense, so e.g. C<ev_is_active> might still return true. It is your
486responsibility to either stop all watchers cleanly yoursef I<before> 507responsibility to either stop all watchers cleanly yourself I<before>
487calling this function, or cope with the fact afterwards (which is usually 508calling this function, or cope with the fact afterwards (which is usually
488the easiest thing, you can just ignore the watchers and/or C<free ()> them 509the easiest thing, you can just ignore the watchers and/or C<free ()> them
489for example). 510for example).
490 511
491Note that certain global state, such as signal state, will not be freed by 512Note that certain global state, such as signal state, will not be freed by
572A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 593A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
573those events and any outstanding ones, but will not block your process in 594those events and any outstanding ones, but will not block your process in
574case there are no events and will return after one iteration of the loop. 595case there are no events and will return after one iteration of the loop.
575 596
576A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 597A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
577neccessary) and will handle those and any outstanding ones. It will block 598necessary) and will handle those and any outstanding ones. It will block
578your process until at least one new event arrives, and will return after 599your process until at least one new event arrives, and will return after
579one iteration of the loop. This is useful if you are waiting for some 600one iteration of the loop. This is useful if you are waiting for some
580external event in conjunction with something not expressible using other 601external event in conjunction with something not expressible using other
581libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is 602libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
582usually a better approach for this kind of thing. 603usually a better approach for this kind of thing.
683to spend more time collecting timeouts, at the expense of increased 704to spend more time collecting timeouts, at the expense of increased
684latency (the watcher callback will be called later). C<ev_io> watchers 705latency (the watcher callback will be called later). C<ev_io> watchers
685will not be affected. Setting this to a non-null value will not introduce 706will not be affected. Setting this to a non-null value will not introduce
686any overhead in libev. 707any overhead in libev.
687 708
688Many (busy) programs can usually benefit by setting the io collect 709Many (busy) programs can usually benefit by setting the I/O collect
689interval to a value near C<0.1> or so, which is often enough for 710interval to a value near C<0.1> or so, which is often enough for
690interactive servers (of course not for games), likewise for timeouts. It 711interactive servers (of course not for games), likewise for timeouts. It
691usually doesn't make much sense to set it to a lower value than C<0.01>, 712usually doesn't make much sense to set it to a lower value than C<0.01>,
692as this approsaches the timing granularity of most systems. 713as this approaches the timing granularity of most systems.
693 714
694=item ev_loop_verify (loop) 715=item ev_loop_verify (loop)
695 716
696This function only does something when C<EV_VERIFY> support has been 717This function only does something when C<EV_VERIFY> support has been
697compiled in. It tries to go through all internal structures and checks 718compiled in. It tries to go through all internal structures and checks
728watcher structures (and it is usually a bad idea to do this on the stack, 749watcher structures (and it is usually a bad idea to do this on the stack,
729although this can sometimes be quite valid). 750although this can sometimes be quite valid).
730 751
731Each watcher structure must be initialised by a call to C<ev_init 752Each watcher structure must be initialised by a call to C<ev_init
732(watcher *, callback)>, which expects a callback to be provided. This 753(watcher *, callback)>, which expects a callback to be provided. This
733callback gets invoked each time the event occurs (or, in the case of io 754callback gets invoked each time the event occurs (or, in the case of I/O
734watchers, each time the event loop detects that the file descriptor given 755watchers, each time the event loop detects that the file descriptor given
735is readable and/or writable). 756is readable and/or writable).
736 757
737Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro 758Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
738with arguments specific to this watcher type. There is also a macro 759with arguments specific to this watcher type. There is also a macro
814 835
815The given async watcher has been asynchronously notified (see C<ev_async>). 836The given async watcher has been asynchronously notified (see C<ev_async>).
816 837
817=item C<EV_ERROR> 838=item C<EV_ERROR>
818 839
819An unspecified error has occured, the watcher has been stopped. This might 840An unspecified error has occurred, the watcher has been stopped. This might
820happen because the watcher could not be properly started because libev 841happen because the watcher could not be properly started because libev
821ran out of memory, a file descriptor was found to be closed or any other 842ran out of memory, a file descriptor was found to be closed or any other
822problem. You best act on it by reporting the problem and somehow coping 843problem. You best act on it by reporting the problem and somehow coping
823with the watcher being stopped. 844with the watcher being stopped.
824 845
825Libev will usually signal a few "dummy" events together with an error, 846Libev will usually signal a few "dummy" events together with an error,
826for example it might indicate that a fd is readable or writable, and if 847for example it might indicate that a fd is readable or writable, and if
827your callbacks is well-written it can just attempt the operation and cope 848your callbacks is well-written it can just attempt the operation and cope
828with the error from read() or write(). This will not work in multithreaded 849with the error from read() or write(). This will not work in multi-threaded
829programs, though, so beware. 850programs, though, so beware.
830 851
831=back 852=back
832 853
833=head2 GENERIC WATCHER FUNCTIONS 854=head2 GENERIC WATCHER FUNCTIONS
863Although some watcher types do not have type-specific arguments 884Although some watcher types do not have type-specific arguments
864(e.g. C<ev_prepare>) you still need to call its C<set> macro. 885(e.g. C<ev_prepare>) you still need to call its C<set> macro.
865 886
866=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args]) 887=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
867 888
868This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro 889This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
869calls into a single call. This is the most convinient method to initialise 890calls into a single call. This is the most convenient method to initialise
870a watcher. The same limitations apply, of course. 891a watcher. The same limitations apply, of course.
871 892
872=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 893=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
873 894
874Starts (activates) the given watcher. Only active watchers will receive 895Starts (activates) the given watcher. Only active watchers will receive
1046 1067
1047Another thing you have to watch out for is that it is quite easy to 1068Another thing you have to watch out for is that it is quite easy to
1048receive "spurious" readiness notifications, that is your callback might 1069receive "spurious" readiness notifications, that is your callback might
1049be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1070be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1050because there is no data. Not only are some backends known to create a 1071because there is no data. Not only are some backends known to create a
1051lot of those (for example solaris ports), it is very easy to get into 1072lot of those (for example Solaris ports), it is very easy to get into
1052this situation even with a relatively standard program structure. Thus 1073this situation even with a relatively standard program structure. Thus
1053it is best to always use non-blocking I/O: An extra C<read>(2) returning 1074it is best to always use non-blocking I/O: An extra C<read>(2) returning
1054C<EAGAIN> is far preferable to a program hanging until some data arrives. 1075C<EAGAIN> is far preferable to a program hanging until some data arrives.
1055 1076
1056If you cannot run the fd in non-blocking mode (for example you should not 1077If you cannot run the fd in non-blocking mode (for example you should not
1057play around with an Xlib connection), then you have to seperately re-test 1078play around with an Xlib connection), then you have to separately re-test
1058whether a file descriptor is really ready with a known-to-be good interface 1079whether a file descriptor is really ready with a known-to-be good interface
1059such as poll (fortunately in our Xlib example, Xlib already does this on 1080such as poll (fortunately in our Xlib example, Xlib already does this on
1060its own, so its quite safe to use). 1081its own, so its quite safe to use).
1061 1082
1062=head3 The special problem of disappearing file descriptors 1083=head3 The special problem of disappearing file descriptors
1122=item ev_io_init (ev_io *, callback, int fd, int events) 1143=item ev_io_init (ev_io *, callback, int fd, int events)
1123 1144
1124=item ev_io_set (ev_io *, int fd, int events) 1145=item ev_io_set (ev_io *, int fd, int events)
1125 1146
1126Configures an C<ev_io> watcher. The C<fd> is the file descriptor to 1147Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1127rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or 1148receive events for and events is either C<EV_READ>, C<EV_WRITE> or
1128C<EV_READ | EV_WRITE> to receive the given events. 1149C<EV_READ | EV_WRITE> to receive the given events.
1129 1150
1130=item int fd [read-only] 1151=item int fd [read-only]
1131 1152
1132The file descriptor being watched. 1153The file descriptor being watched.
1162 1183
1163Timer watchers are simple relative timers that generate an event after a 1184Timer watchers are simple relative timers that generate an event after a
1164given time, and optionally repeating in regular intervals after that. 1185given time, and optionally repeating in regular intervals after that.
1165 1186
1166The timers are based on real time, that is, if you register an event that 1187The timers are based on real time, that is, if you register an event that
1167times out after an hour and you reset your system clock to january last 1188times out after an hour and you reset your system clock to January last
1168year, it will still time out after (roughly) and hour. "Roughly" because 1189year, it will still time out after (roughly) and hour. "Roughly" because
1169detecting time jumps is hard, and some inaccuracies are unavoidable (the 1190detecting time jumps is hard, and some inaccuracies are unavoidable (the
1170monotonic clock option helps a lot here). 1191monotonic clock option helps a lot here).
1171 1192
1172The relative timeouts are calculated relative to the C<ev_now ()> 1193The relative timeouts are calculated relative to the C<ev_now ()>
1175you suspect event processing to be delayed and you I<need> to base the timeout 1196you suspect event processing to be delayed and you I<need> to base the timeout
1176on the current time, use something like this to adjust for this: 1197on the current time, use something like this to adjust for this:
1177 1198
1178 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1199 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1179 1200
1180The callback is guarenteed to be invoked only after its timeout has passed, 1201The callback is guaranteed to be invoked only after its timeout has passed,
1181but if multiple timers become ready during the same loop iteration then 1202but if multiple timers become ready during the same loop iteration then
1182order of execution is undefined. 1203order of execution is undefined.
1183 1204
1184=head3 Watcher-Specific Functions and Data Members 1205=head3 Watcher-Specific Functions and Data Members
1185 1206
1206This will act as if the timer timed out and restart it again if it is 1227This will act as if the timer timed out and restart it again if it is
1207repeating. The exact semantics are: 1228repeating. The exact semantics are:
1208 1229
1209If the timer is pending, its pending status is cleared. 1230If the timer is pending, its pending status is cleared.
1210 1231
1211If the timer is started but nonrepeating, stop it (as if it timed out). 1232If the timer is started but non-repeating, stop it (as if it timed out).
1212 1233
1213If the timer is repeating, either start it if necessary (with the 1234If the timer is repeating, either start it if necessary (with the
1214C<repeat> value), or reset the running timer to the C<repeat> value. 1235C<repeat> value), or reset the running timer to the C<repeat> value.
1215 1236
1216This sounds a bit complicated, but here is a useful and typical 1237This sounds a bit complicated, but here is a useful and typical
1217example: Imagine you have a tcp connection and you want a so-called idle 1238example: Imagine you have a TCP connection and you want a so-called idle
1218timeout, that is, you want to be called when there have been, say, 60 1239timeout, that is, you want to be called when there have been, say, 60
1219seconds of inactivity on the socket. The easiest way to do this is to 1240seconds of inactivity on the socket. The easiest way to do this is to
1220configure an C<ev_timer> with a C<repeat> value of C<60> and then call 1241configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1221C<ev_timer_again> each time you successfully read or write some data. If 1242C<ev_timer_again> each time you successfully read or write some data. If
1222you go into an idle state where you do not expect data to travel on the 1243you go into an idle state where you do not expect data to travel on the
1283 1304
1284Periodic watchers are also timers of a kind, but they are very versatile 1305Periodic watchers are also timers of a kind, but they are very versatile
1285(and unfortunately a bit complex). 1306(and unfortunately a bit complex).
1286 1307
1287Unlike C<ev_timer>'s, they are not based on real time (or relative time) 1308Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1288but on wallclock time (absolute time). You can tell a periodic watcher 1309but on wall clock time (absolute time). You can tell a periodic watcher
1289to trigger after some specific point in time. For example, if you tell a 1310to trigger after some specific point in time. For example, if you tell a
1290periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () 1311periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now ()
1291+ 10.>, that is, an absolute time not a delay) and then reset your system 1312+ 10.>, that is, an absolute time not a delay) and then reset your system
1292clock to january of the previous year, then it will take more than year 1313clock to January of the previous year, then it will take more than year
1293to trigger the event (unlike an C<ev_timer>, which would still trigger 1314to trigger the event (unlike an C<ev_timer>, which would still trigger
1294roughly 10 seconds later as it uses a relative timeout). 1315roughly 10 seconds later as it uses a relative timeout).
1295 1316
1296C<ev_periodic>s can also be used to implement vastly more complex timers, 1317C<ev_periodic>s can also be used to implement vastly more complex timers,
1297such as triggering an event on each "midnight, local time", or other 1318such as triggering an event on each "midnight, local time", or other
1298complicated, rules. 1319complicated, rules.
1299 1320
1300As with timers, the callback is guarenteed to be invoked only when the 1321As with timers, the callback is guaranteed to be invoked only when the
1301time (C<at>) has passed, but if multiple periodic timers become ready 1322time (C<at>) has passed, but if multiple periodic timers become ready
1302during the same loop iteration then order of execution is undefined. 1323during the same loop iteration then order of execution is undefined.
1303 1324
1304=head3 Watcher-Specific Functions and Data Members 1325=head3 Watcher-Specific Functions and Data Members
1305 1326
1314 1335
1315=over 4 1336=over 4
1316 1337
1317=item * absolute timer (at = time, interval = reschedule_cb = 0) 1338=item * absolute timer (at = time, interval = reschedule_cb = 0)
1318 1339
1319In this configuration the watcher triggers an event after the wallclock 1340In this configuration the watcher triggers an event after the wall clock
1320time C<at> has passed and doesn't repeat. It will not adjust when a time 1341time C<at> has passed and doesn't repeat. It will not adjust when a time
1321jump occurs, that is, if it is to be run at January 1st 2011 then it will 1342jump occurs, that is, if it is to be run at January 1st 2011 then it will
1322run when the system time reaches or surpasses this time. 1343run when the system time reaches or surpasses this time.
1323 1344
1324=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) 1345=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1332the hour: 1353the hour:
1333 1354
1334 ev_periodic_set (&periodic, 0., 3600., 0); 1355 ev_periodic_set (&periodic, 0., 3600., 0);
1335 1356
1336This doesn't mean there will always be 3600 seconds in between triggers, 1357This doesn't mean there will always be 3600 seconds in between triggers,
1337but only that the the callback will be called when the system time shows a 1358but only that the callback will be called when the system time shows a
1338full hour (UTC), or more correctly, when the system time is evenly divisible 1359full hour (UTC), or more correctly, when the system time is evenly divisible
1339by 3600. 1360by 3600.
1340 1361
1341Another way to think about it (for the mathematically inclined) is that 1362Another way to think about it (for the mathematically inclined) is that
1342C<ev_periodic> will try to run the callback in this mode at the next possible 1363C<ev_periodic> will try to run the callback in this mode at the next possible
1344 1365
1345For numerical stability it is preferable that the C<at> value is near 1366For numerical stability it is preferable that the C<at> value is near
1346C<ev_now ()> (the current time), but there is no range requirement for 1367C<ev_now ()> (the current time), but there is no range requirement for
1347this value, and in fact is often specified as zero. 1368this value, and in fact is often specified as zero.
1348 1369
1349Note also that there is an upper limit to how often a timer can fire (cpu 1370Note also that there is an upper limit to how often a timer can fire (CPU
1350speed for example), so if C<interval> is very small then timing stability 1371speed for example), so if C<interval> is very small then timing stability
1351will of course detoriate. Libev itself tries to be exact to be about one 1372will of course deteriorate. Libev itself tries to be exact to be about one
1352millisecond (if the OS supports it and the machine is fast enough). 1373millisecond (if the OS supports it and the machine is fast enough).
1353 1374
1354=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) 1375=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1355 1376
1356In this mode the values for C<interval> and C<at> are both being 1377In this mode the values for C<interval> and C<at> are both being
1425 1446
1426=head3 Examples 1447=head3 Examples
1427 1448
1428Example: Call a callback every hour, or, more precisely, whenever the 1449Example: Call a callback every hour, or, more precisely, whenever the
1429system clock is divisible by 3600. The callback invocation times have 1450system clock is divisible by 3600. The callback invocation times have
1430potentially a lot of jittering, but good long-term stability. 1451potentially a lot of jitter, but good long-term stability.
1431 1452
1432 static void 1453 static void
1433 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1454 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1434 { 1455 {
1435 ... its now a full hour (UTC, or TAI or whatever your clock follows) 1456 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1472as you don't register any with libev). Similarly, when the last signal 1493as you don't register any with libev). Similarly, when the last signal
1473watcher for a signal is stopped libev will reset the signal handler to 1494watcher for a signal is stopped libev will reset the signal handler to
1474SIG_DFL (regardless of what it was set to before). 1495SIG_DFL (regardless of what it was set to before).
1475 1496
1476If possible and supported, libev will install its handlers with 1497If possible and supported, libev will install its handlers with
1477C<SA_RESTART> behaviour enabled, so syscalls should not be unduly 1498C<SA_RESTART> behaviour enabled, so system calls should not be unduly
1478interrupted. If you have a problem with syscalls getting interrupted by 1499interrupted. If you have a problem with system calls getting interrupted by
1479signals you can block all signals in an C<ev_check> watcher and unblock 1500signals you can block all signals in an C<ev_check> watcher and unblock
1480them in an C<ev_prepare> watcher. 1501them in an C<ev_prepare> watcher.
1481 1502
1482=head3 Watcher-Specific Functions and Data Members 1503=head3 Watcher-Specific Functions and Data Members
1483 1504
1518is permissible to install a child watcher I<after> the child has been 1539is permissible to install a child watcher I<after> the child has been
1519forked (which implies it might have already exited), as long as the event 1540forked (which implies it might have already exited), as long as the event
1520loop isn't entered (or is continued from a watcher). 1541loop isn't entered (or is continued from a watcher).
1521 1542
1522Only the default event loop is capable of handling signals, and therefore 1543Only the default event loop is capable of handling signals, and therefore
1523you can only rgeister child watchers in the default event loop. 1544you can only register child watchers in the default event loop.
1524 1545
1525=head3 Process Interaction 1546=head3 Process Interaction
1526 1547
1527Libev grabs C<SIGCHLD> as soon as the default event loop is 1548Libev grabs C<SIGCHLD> as soon as the default event loop is
1528initialised. This is necessary to guarantee proper behaviour even if 1549initialised. This is necessary to guarantee proper behaviour even if
1529the first child watcher is started after the child exits. The occurance 1550the first child watcher is started after the child exits. The occurrence
1530of C<SIGCHLD> is recorded asynchronously, but child reaping is done 1551of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1531synchronously as part of the event loop processing. Libev always reaps all 1552synchronously as part of the event loop processing. Libev always reaps all
1532children, even ones not watched. 1553children, even ones not watched.
1533 1554
1534=head3 Overriding the Built-In Processing 1555=head3 Overriding the Built-In Processing
1603 } 1624 }
1604 1625
1605 1626
1606=head2 C<ev_stat> - did the file attributes just change? 1627=head2 C<ev_stat> - did the file attributes just change?
1607 1628
1608This watches a filesystem path for attribute changes. That is, it calls 1629This watches a file system path for attribute changes. That is, it calls
1609C<stat> regularly (or when the OS says it changed) and sees if it changed 1630C<stat> regularly (or when the OS says it changed) and sees if it changed
1610compared to the last time, invoking the callback if it did. 1631compared to the last time, invoking the callback if it did.
1611 1632
1612The path does not need to exist: changing from "path exists" to "path does 1633The path does not need to exist: changing from "path exists" to "path does
1613not exist" is a status change like any other. The condition "path does 1634not exist" is a status change like any other. The condition "path does
1647disabled large file support, you get the 32 bit version of the stat 1668disabled large file support, you get the 32 bit version of the stat
1648structure. When using the library from programs that change the ABI to 1669structure. When using the library from programs that change the ABI to
1649use 64 bit file offsets the programs will fail. In that case you have to 1670use 64 bit file offsets the programs will fail. In that case you have to
1650compile libev with the same flags to get binary compatibility. This is 1671compile libev with the same flags to get binary compatibility. This is
1651obviously the case with any flags that change the ABI, but the problem is 1672obviously the case with any flags that change the ABI, but the problem is
1652most noticably with ev_stat and largefile support. 1673most noticeably with ev_stat and large file support.
1653 1674
1654=head3 Inotify 1675=head3 Inotify
1655 1676
1656When C<inotify (7)> support has been compiled into libev (generally only 1677When C<inotify (7)> support has been compiled into libev (generally only
1657available on Linux) and present at runtime, it will be used to speed up 1678available on Linux) and present at runtime, it will be used to speed up
1667implement this functionality, due to the requirement of having a file 1688implement this functionality, due to the requirement of having a file
1668descriptor open on the object at all times). 1689descriptor open on the object at all times).
1669 1690
1670=head3 The special problem of stat time resolution 1691=head3 The special problem of stat time resolution
1671 1692
1672The C<stat ()> syscall only supports full-second resolution portably, and 1693The C<stat ()> system call only supports full-second resolution portably, and
1673even on systems where the resolution is higher, many filesystems still 1694even on systems where the resolution is higher, many file systems still
1674only support whole seconds. 1695only support whole seconds.
1675 1696
1676That means that, if the time is the only thing that changes, you can 1697That means that, if the time is the only thing that changes, you can
1677easily miss updates: on the first update, C<ev_stat> detects a change and 1698easily miss updates: on the first update, C<ev_stat> detects a change and
1678calls your callback, which does something. When there is another update 1699calls your callback, which does something. When there is another update
1738 1759
1739The specified interval. 1760The specified interval.
1740 1761
1741=item const char *path [read-only] 1762=item const char *path [read-only]
1742 1763
1743The filesystem path that is being watched. 1764The file system path that is being watched.
1744 1765
1745=back 1766=back
1746 1767
1747=head3 Examples 1768=head3 Examples
1748 1769
1874 1895
1875This is done by examining in each prepare call which file descriptors need 1896This is done by examining in each prepare call which file descriptors need
1876to be watched by the other library, registering C<ev_io> watchers for 1897to be watched by the other library, registering C<ev_io> watchers for
1877them and starting an C<ev_timer> watcher for any timeouts (many libraries 1898them and starting an C<ev_timer> watcher for any timeouts (many libraries
1878provide just this functionality). Then, in the check watcher you check for 1899provide just this functionality). Then, in the check watcher you check for
1879any events that occured (by checking the pending status of all watchers 1900any events that occurred (by checking the pending status of all watchers
1880and stopping them) and call back into the library. The I/O and timer 1901and stopping them) and call back into the library. The I/O and timer
1881callbacks will never actually be called (but must be valid nevertheless, 1902callbacks will never actually be called (but must be valid nevertheless,
1882because you never know, you know?). 1903because you never know, you know?).
1883 1904
1884As another example, the Perl Coro module uses these hooks to integrate 1905As another example, the Perl Coro module uses these hooks to integrate
1986 2007
1987Method 2: This would be just like method 1, but you run C<adns_afterpoll> 2008Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1988in the prepare watcher and would dispose of the check watcher. 2009in the prepare watcher and would dispose of the check watcher.
1989 2010
1990Method 3: If the module to be embedded supports explicit event 2011Method 3: If the module to be embedded supports explicit event
1991notification (adns does), you can also make use of the actual watcher 2012notification (libadns does), you can also make use of the actual watcher
1992callbacks, and only destroy/create the watchers in the prepare watcher. 2013callbacks, and only destroy/create the watchers in the prepare watcher.
1993 2014
1994 static void 2015 static void
1995 timer_cb (EV_P_ ev_timer *w, int revents) 2016 timer_cb (EV_P_ ev_timer *w, int revents)
1996 { 2017 {
2011 } 2032 }
2012 2033
2013 // do not ever call adns_afterpoll 2034 // do not ever call adns_afterpoll
2014 2035
2015Method 4: Do not use a prepare or check watcher because the module you 2036Method 4: Do not use a prepare or check watcher because the module you
2016want to embed is too inflexible to support it. Instead, youc na override 2037want to embed is too inflexible to support it. Instead, you can override
2017their poll function. The drawback with this solution is that the main 2038their poll function. The drawback with this solution is that the main
2018loop is now no longer controllable by EV. The C<Glib::EV> module does 2039loop is now no longer controllable by EV. The C<Glib::EV> module does
2019this. 2040this.
2020 2041
2021 static gint 2042 static gint
2105 2126
2106Configures the watcher to embed the given loop, which must be 2127Configures the watcher to embed the given loop, which must be
2107embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 2128embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
2108invoked automatically, otherwise it is the responsibility of the callback 2129invoked automatically, otherwise it is the responsibility of the callback
2109to invoke it (it will continue to be called until the sweep has been done, 2130to invoke it (it will continue to be called until the sweep has been done,
2110if you do not want thta, you need to temporarily stop the embed watcher). 2131if you do not want that, you need to temporarily stop the embed watcher).
2111 2132
2112=item ev_embed_sweep (loop, ev_embed *) 2133=item ev_embed_sweep (loop, ev_embed *)
2113 2134
2114Make a single, non-blocking sweep over the embedded loop. This works 2135Make a single, non-blocking sweep over the embedded loop. This works
2115similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2136similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
2116apropriate way for embedded loops. 2137appropriate way for embedded loops.
2117 2138
2118=item struct ev_loop *other [read-only] 2139=item struct ev_loop *other [read-only]
2119 2140
2120The embedded event loop. 2141The embedded event loop.
2121 2142
2123 2144
2124=head3 Examples 2145=head3 Examples
2125 2146
2126Example: Try to get an embeddable event loop and embed it into the default 2147Example: Try to get an embeddable event loop and embed it into the default
2127event loop. If that is not possible, use the default loop. The default 2148event loop. If that is not possible, use the default loop. The default
2128loop is stored in C<loop_hi>, while the mebeddable loop is stored in 2149loop is stored in C<loop_hi>, while the embeddable loop is stored in
2129C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be 2150C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
2130used). 2151used).
2131 2152
2132 struct ev_loop *loop_hi = ev_default_init (0); 2153 struct ev_loop *loop_hi = ev_default_init (0);
2133 struct ev_loop *loop_lo = 0; 2154 struct ev_loop *loop_lo = 0;
2134 struct ev_embed embed; 2155 struct ev_embed embed;
2228 2249
2229=item queueing from a signal handler context 2250=item queueing from a signal handler context
2230 2251
2231To implement race-free queueing, you simply add to the queue in the signal 2252To implement race-free queueing, you simply add to the queue in the signal
2232handler but you block the signal handler in the watcher callback. Here is an example that does that for 2253handler but you block the signal handler in the watcher callback. Here is an example that does that for
2233some fictitiuous SIGUSR1 handler: 2254some fictitious SIGUSR1 handler:
2234 2255
2235 static ev_async mysig; 2256 static ev_async mysig;
2236 2257
2237 static void 2258 static void
2238 sigusr1_handler (void) 2259 sigusr1_handler (void)
2312=item ev_async_send (loop, ev_async *) 2333=item ev_async_send (loop, ev_async *)
2313 2334
2314Sends/signals/activates the given C<ev_async> watcher, that is, feeds 2335Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2315an C<EV_ASYNC> event on the watcher into the event loop. Unlike 2336an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2316C<ev_feed_event>, this call is safe to do in other threads, signal or 2337C<ev_feed_event>, this call is safe to do in other threads, signal or
2317similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding 2338similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2318section below on what exactly this means). 2339section below on what exactly this means).
2319 2340
2320This call incurs the overhead of a syscall only once per loop iteration, 2341This call incurs the overhead of a system call only once per loop iteration,
2321so while the overhead might be noticable, it doesn't apply to repeated 2342so while the overhead might be noticeable, it doesn't apply to repeated
2322calls to C<ev_async_send>. 2343calls to C<ev_async_send>.
2323 2344
2324=item bool = ev_async_pending (ev_async *) 2345=item bool = ev_async_pending (ev_async *)
2325 2346
2326Returns a non-zero value when C<ev_async_send> has been called on the 2347Returns a non-zero value when C<ev_async_send> has been called on the
2328event loop. 2349event loop.
2329 2350
2330C<ev_async_send> sets a flag in the watcher and wakes up the loop. When 2351C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
2331the loop iterates next and checks for the watcher to have become active, 2352the loop iterates next and checks for the watcher to have become active,
2332it will reset the flag again. C<ev_async_pending> can be used to very 2353it will reset the flag again. C<ev_async_pending> can be used to very
2333quickly check wether invoking the loop might be a good idea. 2354quickly check whether invoking the loop might be a good idea.
2334 2355
2335Not that this does I<not> check wether the watcher itself is pending, only 2356Not that this does I<not> check whether the watcher itself is pending, only
2336wether it has been requested to make this watcher pending. 2357whether it has been requested to make this watcher pending.
2337 2358
2338=back 2359=back
2339 2360
2340 2361
2341=head1 OTHER FUNCTIONS 2362=head1 OTHER FUNCTIONS
2352or timeout without having to allocate/configure/start/stop/free one or 2373or timeout without having to allocate/configure/start/stop/free one or
2353more watchers yourself. 2374more watchers yourself.
2354 2375
2355If C<fd> is less than 0, then no I/O watcher will be started and events 2376If C<fd> is less than 0, then no I/O watcher will be started and events
2356is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and 2377is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
2357C<events> set will be craeted and started. 2378C<events> set will be created and started.
2358 2379
2359If C<timeout> is less than 0, then no timeout watcher will be 2380If C<timeout> is less than 0, then no timeout watcher will be
2360started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 2381started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2361repeat = 0) will be started. While C<0> is a valid timeout, it is of 2382repeat = 0) will be started. While C<0> is a valid timeout, it is of
2362dubious value. 2383dubious value.
2387Feed an event on the given fd, as if a file descriptor backend detected 2408Feed an event on the given fd, as if a file descriptor backend detected
2388the given events it. 2409the given events it.
2389 2410
2390=item ev_feed_signal_event (ev_loop *loop, int signum) 2411=item ev_feed_signal_event (ev_loop *loop, int signum)
2391 2412
2392Feed an event as if the given signal occured (C<loop> must be the default 2413Feed an event as if the given signal occurred (C<loop> must be the default
2393loop!). 2414loop!).
2394 2415
2395=back 2416=back
2396 2417
2397 2418
2426=back 2447=back
2427 2448
2428=head1 C++ SUPPORT 2449=head1 C++ SUPPORT
2429 2450
2430Libev comes with some simplistic wrapper classes for C++ that mainly allow 2451Libev comes with some simplistic wrapper classes for C++ that mainly allow
2431you to use some convinience methods to start/stop watchers and also change 2452you to use some convenience methods to start/stop watchers and also change
2432the callback model to a model using method callbacks on objects. 2453the callback model to a model using method callbacks on objects.
2433 2454
2434To use it, 2455To use it,
2435 2456
2436 #include <ev++.h> 2457 #include <ev++.h>
2537=item w->set (struct ev_loop *) 2558=item w->set (struct ev_loop *)
2538 2559
2539Associates a different C<struct ev_loop> with this watcher. You can only 2560Associates a different C<struct ev_loop> with this watcher. You can only
2540do this when the watcher is inactive (and not pending either). 2561do this when the watcher is inactive (and not pending either).
2541 2562
2542=item w->set ([args]) 2563=item w->set ([arguments])
2543 2564
2544Basically the same as C<ev_TYPE_set>, with the same args. Must be 2565Basically the same as C<ev_TYPE_set>, with the same arguments. Must be
2545called at least once. Unlike the C counterpart, an active watcher gets 2566called at least once. Unlike the C counterpart, an active watcher gets
2546automatically stopped and restarted when reconfiguring it with this 2567automatically stopped and restarted when reconfiguring it with this
2547method. 2568method.
2548 2569
2549=item w->start () 2570=item w->start ()
2591 2612
2592 2613
2593=head1 OTHER LANGUAGE BINDINGS 2614=head1 OTHER LANGUAGE BINDINGS
2594 2615
2595Libev does not offer other language bindings itself, but bindings for a 2616Libev does not offer other language bindings itself, but bindings for a
2596numbe rof languages exist in the form of third-party packages. If you know 2617number of languages exist in the form of third-party packages. If you know
2597any interesting language binding in addition to the ones listed here, drop 2618any interesting language binding in addition to the ones listed here, drop
2598me a note. 2619me a note.
2599 2620
2600=over 4 2621=over 4
2601 2622
2611L<http://software.schmorp.de/pkg/EV>. 2632L<http://software.schmorp.de/pkg/EV>.
2612 2633
2613=item Ruby 2634=item Ruby
2614 2635
2615Tony Arcieri has written a ruby extension that offers access to a subset 2636Tony Arcieri has written a ruby extension that offers access to a subset
2616of the libev API and adds filehandle abstractions, asynchronous DNS and 2637of the libev API and adds file handle abstractions, asynchronous DNS and
2617more on top of it. It can be found via gem servers. Its homepage is at 2638more on top of it. It can be found via gem servers. Its homepage is at
2618L<http://rev.rubyforge.org/>. 2639L<http://rev.rubyforge.org/>.
2619 2640
2620=item D 2641=item D
2621 2642
2625=back 2646=back
2626 2647
2627 2648
2628=head1 MACRO MAGIC 2649=head1 MACRO MAGIC
2629 2650
2630Libev can be compiled with a variety of options, the most fundamantal 2651Libev can be compiled with a variety of options, the most fundamental
2631of which is C<EV_MULTIPLICITY>. This option determines whether (most) 2652of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2632functions and callbacks have an initial C<struct ev_loop *> argument. 2653functions and callbacks have an initial C<struct ev_loop *> argument.
2633 2654
2634To make it easier to write programs that cope with either variant, the 2655To make it easier to write programs that cope with either variant, the
2635following macros are defined: 2656following macros are defined:
2709libev somewhere in your source tree). 2730libev somewhere in your source tree).
2710 2731
2711=head2 FILESETS 2732=head2 FILESETS
2712 2733
2713Depending on what features you need you need to include one or more sets of files 2734Depending on what features you need you need to include one or more sets of files
2714in your app. 2735in your application.
2715 2736
2716=head3 CORE EVENT LOOP 2737=head3 CORE EVENT LOOP
2717 2738
2718To include only the libev core (all the C<ev_*> functions), with manual 2739To include only the libev core (all the C<ev_*> functions), with manual
2719configuration (no autoconf): 2740configuration (no autoconf):
2770 event.h 2791 event.h
2771 event.c 2792 event.c
2772 2793
2773=head3 AUTOCONF SUPPORT 2794=head3 AUTOCONF SUPPORT
2774 2795
2775Instead of using C<EV_STANDALONE=1> and providing your config in 2796Instead of using C<EV_STANDALONE=1> and providing your configuration in
2776whatever way you want, you can also C<m4_include([libev.m4])> in your 2797whatever way you want, you can also C<m4_include([libev.m4])> in your
2777F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then 2798F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2778include F<config.h> and configure itself accordingly. 2799include F<config.h> and configure itself accordingly.
2779 2800
2780For this of course you need the m4 file: 2801For this of course you need the m4 file:
2782 libev.m4 2803 libev.m4
2783 2804
2784=head2 PREPROCESSOR SYMBOLS/MACROS 2805=head2 PREPROCESSOR SYMBOLS/MACROS
2785 2806
2786Libev can be configured via a variety of preprocessor symbols you have to 2807Libev can be configured via a variety of preprocessor symbols you have to
2787define before including any of its files. The default in the absense of 2808define before including any of its files. The default in the absence of
2788autoconf is noted for every option. 2809autoconf is noted for every option.
2789 2810
2790=over 4 2811=over 4
2791 2812
2792=item EV_STANDALONE 2813=item EV_STANDALONE
2798F<event.h> that are not directly supported by the libev core alone. 2819F<event.h> that are not directly supported by the libev core alone.
2799 2820
2800=item EV_USE_MONOTONIC 2821=item EV_USE_MONOTONIC
2801 2822
2802If defined to be C<1>, libev will try to detect the availability of the 2823If defined to be C<1>, libev will try to detect the availability of the
2803monotonic clock option at both compiletime and runtime. Otherwise no use 2824monotonic clock option at both compile time and runtime. Otherwise no use
2804of the monotonic clock option will be attempted. If you enable this, you 2825of the monotonic clock option will be attempted. If you enable this, you
2805usually have to link against librt or something similar. Enabling it when 2826usually have to link against librt or something similar. Enabling it when
2806the functionality isn't available is safe, though, although you have 2827the functionality isn't available is safe, though, although you have
2807to make sure you link against any libraries where the C<clock_gettime> 2828to make sure you link against any libraries where the C<clock_gettime>
2808function is hiding in (often F<-lrt>). 2829function is hiding in (often F<-lrt>).
2809 2830
2810=item EV_USE_REALTIME 2831=item EV_USE_REALTIME
2811 2832
2812If defined to be C<1>, libev will try to detect the availability of the 2833If defined to be C<1>, libev will try to detect the availability of the
2813realtime clock option at compiletime (and assume its availability at 2834real-time clock option at compile time (and assume its availability at
2814runtime if successful). Otherwise no use of the realtime clock option will 2835runtime if successful). Otherwise no use of the real-time clock option will
2815be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2836be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2816(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the 2837(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2817note about libraries in the description of C<EV_USE_MONOTONIC>, though. 2838note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2818 2839
2819=item EV_USE_NANOSLEEP 2840=item EV_USE_NANOSLEEP
28302.7 or newer, otherwise disabled. 28512.7 or newer, otherwise disabled.
2831 2852
2832=item EV_USE_SELECT 2853=item EV_USE_SELECT
2833 2854
2834If undefined or defined to be C<1>, libev will compile in support for the 2855If undefined or defined to be C<1>, libev will compile in support for the
2835C<select>(2) backend. No attempt at autodetection will be done: if no 2856C<select>(2) backend. No attempt at auto-detection will be done: if no
2836other method takes over, select will be it. Otherwise the select backend 2857other method takes over, select will be it. Otherwise the select backend
2837will not be compiled in. 2858will not be compiled in.
2838 2859
2839=item EV_SELECT_USE_FD_SET 2860=item EV_SELECT_USE_FD_SET
2840 2861
2841If defined to C<1>, then the select backend will use the system C<fd_set> 2862If defined to C<1>, then the select backend will use the system C<fd_set>
2842structure. This is useful if libev doesn't compile due to a missing 2863structure. This is useful if libev doesn't compile due to a missing
2843C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on 2864C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on
2844exotic systems. This usually limits the range of file descriptors to some 2865exotic systems. This usually limits the range of file descriptors to some
2845low limit such as 1024 or might have other limitations (winsocket only 2866low limit such as 1024 or might have other limitations (winsocket only
2846allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might 2867allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2847influence the size of the C<fd_set> used. 2868influence the size of the C<fd_set> used.
2848 2869
2897otherwise another method will be used as fallback. This is the preferred 2918otherwise another method will be used as fallback. This is the preferred
2898backend for Solaris 10 systems. 2919backend for Solaris 10 systems.
2899 2920
2900=item EV_USE_DEVPOLL 2921=item EV_USE_DEVPOLL
2901 2922
2902reserved for future expansion, works like the USE symbols above. 2923Reserved for future expansion, works like the USE symbols above.
2903 2924
2904=item EV_USE_INOTIFY 2925=item EV_USE_INOTIFY
2905 2926
2906If defined to be C<1>, libev will compile in support for the Linux inotify 2927If defined to be C<1>, libev will compile in support for the Linux inotify
2907interface to speed up C<ev_stat> watchers. Its actual availability will 2928interface to speed up C<ev_stat> watchers. Its actual availability will
2914access is atomic with respect to other threads or signal contexts. No such 2935access is atomic with respect to other threads or signal contexts. No such
2915type is easily found in the C language, so you can provide your own type 2936type is easily found in the C language, so you can provide your own type
2916that you know is safe for your purposes. It is used both for signal handler "locking" 2937that you know is safe for your purposes. It is used both for signal handler "locking"
2917as well as for signal and thread safety in C<ev_async> watchers. 2938as well as for signal and thread safety in C<ev_async> watchers.
2918 2939
2919In the absense of this define, libev will use C<sig_atomic_t volatile> 2940In the absence of this define, libev will use C<sig_atomic_t volatile>
2920(from F<signal.h>), which is usually good enough on most platforms. 2941(from F<signal.h>), which is usually good enough on most platforms.
2921 2942
2922=item EV_H 2943=item EV_H
2923 2944
2924The name of the F<ev.h> header file used to include it. The default if 2945The name of the F<ev.h> header file used to include it. The default if
2963When doing priority-based operations, libev usually has to linearly search 2984When doing priority-based operations, libev usually has to linearly search
2964all the priorities, so having many of them (hundreds) uses a lot of space 2985all the priorities, so having many of them (hundreds) uses a lot of space
2965and time, so using the defaults of five priorities (-2 .. +2) is usually 2986and time, so using the defaults of five priorities (-2 .. +2) is usually
2966fine. 2987fine.
2967 2988
2968If your embedding app does not need any priorities, defining these both to 2989If your embedding application does not need any priorities, defining these both to
2969C<0> will save some memory and cpu. 2990C<0> will save some memory and CPU.
2970 2991
2971=item EV_PERIODIC_ENABLE 2992=item EV_PERIODIC_ENABLE
2972 2993
2973If undefined or defined to be C<1>, then periodic timers are supported. If 2994If undefined or defined to be C<1>, then periodic timers are supported. If
2974defined to be C<0>, then they are not. Disabling them saves a few kB of 2995defined to be C<0>, then they are not. Disabling them saves a few kB of
3002 3023
3003=item EV_MINIMAL 3024=item EV_MINIMAL
3004 3025
3005If you need to shave off some kilobytes of code at the expense of some 3026If you need to shave off some kilobytes of code at the expense of some
3006speed, define this symbol to C<1>. Currently this is used to override some 3027speed, define this symbol to C<1>. Currently this is used to override some
3007inlining decisions, saves roughly 30% codesize of amd64. It also selects a 3028inlining decisions, saves roughly 30% code size on amd64. It also selects a
3008much smaller 2-heap for timer management over the default 4-heap. 3029much smaller 2-heap for timer management over the default 4-heap.
3009 3030
3010=item EV_PID_HASHSIZE 3031=item EV_PID_HASHSIZE
3011 3032
3012C<ev_child> watchers use a small hash table to distribute workload by 3033C<ev_child> watchers use a small hash table to distribute workload by
3025=item EV_USE_4HEAP 3046=item EV_USE_4HEAP
3026 3047
3027Heaps are not very cache-efficient. To improve the cache-efficiency of the 3048Heaps are not very cache-efficient. To improve the cache-efficiency of the
3028timer and periodics heap, libev uses a 4-heap when this symbol is defined 3049timer and periodics heap, libev uses a 4-heap when this symbol is defined
3029to C<1>. The 4-heap uses more complicated (longer) code but has 3050to C<1>. The 4-heap uses more complicated (longer) code but has
3030noticably faster performance with many (thousands) of watchers. 3051noticeably faster performance with many (thousands) of watchers.
3031 3052
3032The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 3053The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3033(disabled). 3054(disabled).
3034 3055
3035=item EV_HEAP_CACHE_AT 3056=item EV_HEAP_CACHE_AT
3037Heaps are not very cache-efficient. To improve the cache-efficiency of the 3058Heaps are not very cache-efficient. To improve the cache-efficiency of the
3038timer and periodics heap, libev can cache the timestamp (I<at>) within 3059timer and periodics heap, libev can cache the timestamp (I<at>) within
3039the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 3060the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3040which uses 8-12 bytes more per watcher and a few hundred bytes more code, 3061which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3041but avoids random read accesses on heap changes. This improves performance 3062but avoids random read accesses on heap changes. This improves performance
3042noticably with with many (hundreds) of watchers. 3063noticeably with with many (hundreds) of watchers.
3043 3064
3044The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 3065The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3045(disabled). 3066(disabled).
3046 3067
3047=item EV_VERIFY 3068=item EV_VERIFY
3083avoid the C<struct ev_loop *> as first argument in all cases, or to use 3104avoid the C<struct ev_loop *> as first argument in all cases, or to use
3084method calls instead of plain function calls in C++. 3105method calls instead of plain function calls in C++.
3085 3106
3086=head2 EXPORTED API SYMBOLS 3107=head2 EXPORTED API SYMBOLS
3087 3108
3088If you need to re-export the API (e.g. via a dll) and you need a list of 3109If you need to re-export the API (e.g. via a DLL) and you need a list of
3089exported symbols, you can use the provided F<Symbol.*> files which list 3110exported symbols, you can use the provided F<Symbol.*> files which list
3090all public symbols, one per line: 3111all public symbols, one per line:
3091 3112
3092 Symbols.ev for libev proper 3113 Symbols.ev for libev proper
3093 Symbols.event for the libevent emulation 3114 Symbols.event for the libevent emulation
3094 3115
3095This can also be used to rename all public symbols to avoid clashes with 3116This can also be used to rename all public symbols to avoid clashes with
3096multiple versions of libev linked together (which is obviously bad in 3117multiple versions of libev linked together (which is obviously bad in
3097itself, but sometimes it is inconvinient to avoid this). 3118itself, but sometimes it is inconvenient to avoid this).
3098 3119
3099A sed command like this will create wrapper C<#define>'s that you need to 3120A sed command like this will create wrapper C<#define>'s that you need to
3100include before including F<ev.h>: 3121include before including F<ev.h>:
3101 3122
3102 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h 3123 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
3141 3162
3142=head1 THREADS AND COROUTINES 3163=head1 THREADS AND COROUTINES
3143 3164
3144=head2 THREADS 3165=head2 THREADS
3145 3166
3146Libev itself is completely threadsafe, but it uses no locking. This 3167Libev itself is completely thread-safe, but it uses no locking. This
3147means that you can use as many loops as you want in parallel, as long as 3168means that you can use as many loops as you want in parallel, as long as
3148only one thread ever calls into one libev function with the same loop 3169only one thread ever calls into one libev function with the same loop
3149parameter. 3170parameter.
3150 3171
3151Or put differently: calls with different loop parameters can be done in 3172Or put differently: calls with different loop parameters can be done in
3158help you but by giving some generic advice: 3179help you but by giving some generic advice:
3159 3180
3160=over 4 3181=over 4
3161 3182
3162=item * most applications have a main thread: use the default libev loop 3183=item * most applications have a main thread: use the default libev loop
3163in that thread, or create a seperate thread running only the default loop. 3184in that thread, or create a separate thread running only the default loop.
3164 3185
3165This helps integrating other libraries or software modules that use libev 3186This helps integrating other libraries or software modules that use libev
3166themselves and don't care/know about threading. 3187themselves and don't care/know about threading.
3167 3188
3168=item * one loop per thread is usually a good model. 3189=item * one loop per thread is usually a good model.
3169 3190
3170Doing this is almost never wrong, sometimes a better-performance model 3191Doing this is almost never wrong, sometimes a better-performance model
3171exists, but it is always a good start. 3192exists, but it is always a good start.
3172 3193
3173=item * other models exist, such as the leader/follower pattern, where one 3194=item * other models exist, such as the leader/follower pattern, where one
3174loop is handed through multiple threads in a kind of round-robbin fashion. 3195loop is handed through multiple threads in a kind of round-robin fashion.
3175 3196
3176Chosing a model is hard - look around, learn, know that usually you cna do 3197Choosing a model is hard - look around, learn, know that usually you can do
3177better than you currently do :-) 3198better than you currently do :-)
3178 3199
3179=item * often you need to talk to some other thread which blocks in the 3200=item * often you need to talk to some other thread which blocks in the
3180event loop - C<ev_async> watchers can be used to wake them up from other 3201event loop - C<ev_async> watchers can be used to wake them up from other
3181threads safely (or from signal contexts...). 3202threads safely (or from signal contexts...).
3182 3203
3183=back 3204=back
3184 3205
3185=head2 COROUTINES 3206=head2 COROUTINES
3186 3207
3187Libev is much more accomodating to coroutines ("cooperative threads"): 3208Libev is much more accommodating to coroutines ("cooperative threads"):
3188libev fully supports nesting calls to it's functions from different 3209libev fully supports nesting calls to it's functions from different
3189coroutines (e.g. you can call C<ev_loop> on the same loop from two 3210coroutines (e.g. you can call C<ev_loop> on the same loop from two
3190different coroutines and switch freely between both coroutines running the 3211different coroutines and switch freely between both coroutines running the
3191loop, as long as you don't confuse yourself). The only exception is that 3212loop, as long as you don't confuse yourself). The only exception is that
3192you must not do this from C<ev_periodic> reschedule callbacks. 3213you must not do this from C<ev_periodic> reschedule callbacks.
3240 3261
3241=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 3262=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
3242 3263
3243A change means an I/O watcher gets started or stopped, which requires 3264A change means an I/O watcher gets started or stopped, which requires
3244libev to recalculate its status (and possibly tell the kernel, depending 3265libev to recalculate its status (and possibly tell the kernel, depending
3245on backend and wether C<ev_io_set> was used). 3266on backend and whether C<ev_io_set> was used).
3246 3267
3247=item Activating one watcher (putting it into the pending state): O(1) 3268=item Activating one watcher (putting it into the pending state): O(1)
3248 3269
3249=item Priority handling: O(number_of_priorities) 3270=item Priority handling: O(number_of_priorities)
3250 3271
3257 3278
3258=item Processing ev_async_send: O(number_of_async_watchers) 3279=item Processing ev_async_send: O(number_of_async_watchers)
3259 3280
3260=item Processing signals: O(max_signal_number) 3281=item Processing signals: O(max_signal_number)
3261 3282
3262Sending involves a syscall I<iff> there were no other C<ev_async_send> 3283Sending involves a system call I<iff> there were no other C<ev_async_send>
3263calls in the current loop iteration. Checking for async and signal events 3284calls in the current loop iteration. Checking for async and signal events
3264involves iterating over all running async watchers or all signal numbers. 3285involves iterating over all running async watchers or all signal numbers.
3265 3286
3266=back 3287=back
3267 3288
3287the abysmal performance of winsockets, using a large number of sockets 3308the abysmal performance of winsockets, using a large number of sockets
3288is not recommended (and not reasonable). If your program needs to use 3309is not recommended (and not reasonable). If your program needs to use
3289more than a hundred or so sockets, then likely it needs to use a totally 3310more than a hundred or so sockets, then likely it needs to use a totally
3290different implementation for windows, as libev offers the POSIX readiness 3311different implementation for windows, as libev offers the POSIX readiness
3291notification model, which cannot be implemented efficiently on windows 3312notification model, which cannot be implemented efficiently on windows
3292(microsoft monopoly games). 3313(Microsoft monopoly games).
3293 3314
3294=over 4 3315=over 4
3295 3316
3296=item The winsocket select function 3317=item The winsocket select function
3297 3318
3298The winsocket C<select> function doesn't follow POSIX in that it requires 3319The winsocket C<select> function doesn't follow POSIX in that it
3299socket I<handles> and not socket I<file descriptors>. This makes select 3320requires socket I<handles> and not socket I<file descriptors> (it is
3300very inefficient, and also requires a mapping from file descriptors 3321also extremely buggy). This makes select very inefficient, and also
3301to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>, 3322requires a mapping from file descriptors to socket handles. See the
3302C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor 3323discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and
3303symbols for more info. 3324C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.
3304 3325
3305The configuration for a "naked" win32 using the microsoft runtime 3326The configuration for a "naked" win32 using the Microsoft runtime
3306libraries and raw winsocket select is: 3327libraries and raw winsocket select is:
3307 3328
3308 #define EV_USE_SELECT 1 3329 #define EV_USE_SELECT 1
3309 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 3330 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3310 3331
3315 3336
3316Windows has numerous arbitrary (and low) limits on things. 3337Windows has numerous arbitrary (and low) limits on things.
3317 3338
3318Early versions of winsocket's select only supported waiting for a maximum 3339Early versions of winsocket's select only supported waiting for a maximum
3319of C<64> handles (probably owning to the fact that all windows kernels 3340of C<64> handles (probably owning to the fact that all windows kernels
3320can only wait for C<64> things at the same time internally; microsoft 3341can only wait for C<64> things at the same time internally; Microsoft
3321recommends spawning a chain of threads and wait for 63 handles and the 3342recommends spawning a chain of threads and wait for 63 handles and the
3322previous thread in each. Great). 3343previous thread in each. Great).
3323 3344
3324Newer versions support more handles, but you need to define C<FD_SETSIZE> 3345Newer versions support more handles, but you need to define C<FD_SETSIZE>
3325to some high number (e.g. C<2048>) before compiling the winsocket select 3346to some high number (e.g. C<2048>) before compiling the winsocket select
3326call (which might be in libev or elsewhere, for example, perl does its own 3347call (which might be in libev or elsewhere, for example, perl does its own
3327select emulation on windows). 3348select emulation on windows).
3328 3349
3329Another limit is the number of file descriptors in the microsoft runtime 3350Another limit is the number of file descriptors in the Microsoft runtime
3330libraries, which by default is C<64> (there must be a hidden I<64> fetish 3351libraries, which by default is C<64> (there must be a hidden I<64> fetish
3331or something like this inside microsoft). You can increase this by calling 3352or something like this inside Microsoft). You can increase this by calling
3332C<_setmaxstdio>, which can increase this limit to C<2048> (another 3353C<_setmaxstdio>, which can increase this limit to C<2048> (another
3333arbitrary limit), but is broken in many versions of the microsoft runtime 3354arbitrary limit), but is broken in many versions of the Microsoft runtime
3334libraries. 3355libraries.
3335 3356
3336This might get you to about C<512> or C<2048> sockets (depending on 3357This might get you to about C<512> or C<2048> sockets (depending on
3337windows version and/or the phase of the moon). To get more, you need to 3358windows version and/or the phase of the moon). To get more, you need to
3338wrap all I/O functions and provide your own fd management, but the cost of 3359wrap all I/O functions and provide your own fd management, but the cost of
3386=back 3407=back
3387 3408
3388If you know of other additional requirements drop me a note. 3409If you know of other additional requirements drop me a note.
3389 3410
3390 3411
3412=head1 COMPILER WARNINGS
3413
3414Depending on your compiler and compiler settings, you might get no or a
3415lot of warnings when compiling libev code. Some people are apparently
3416scared by this.
3417
3418However, these are unavoidable for many reasons. For one, each compiler
3419has different warnings, and each user has different tastes regarding
3420warning options. "Warn-free" code therefore cannot be a goal except when
3421targeting a specific compiler and compiler-version.
3422
3423Another reason is that some compiler warnings require elaborate
3424workarounds, or other changes to the code that make it less clear and less
3425maintainable.
3426
3427And of course, some compiler warnings are just plain stupid, or simply
3428wrong (because they don't actually warn about the condition their message
3429seems to warn about).
3430
3431While libev is written to generate as few warnings as possible,
3432"warn-free" code is not a goal, and it is recommended not to build libev
3433with any compiler warnings enabled unless you are prepared to cope with
3434them (e.g. by ignoring them). Remember that warnings are just that:
3435warnings, not errors, or proof of bugs.
3436
3437
3391=head1 VALGRIND 3438=head1 VALGRIND
3392 3439
3393Valgrind has a special section here because it is a popular tool that is 3440Valgrind has a special section here because it is a popular tool that is
3394highly useful, but valgrind reports are very hard to interpret. 3441highly useful, but valgrind reports are very hard to interpret.
3395 3442
3398 3445
3399 ==2274== definitely lost: 0 bytes in 0 blocks. 3446 ==2274== definitely lost: 0 bytes in 0 blocks.
3400 ==2274== possibly lost: 0 bytes in 0 blocks. 3447 ==2274== possibly lost: 0 bytes in 0 blocks.
3401 ==2274== still reachable: 256 bytes in 1 blocks. 3448 ==2274== still reachable: 256 bytes in 1 blocks.
3402 3449
3403then there is no memory leak. Similarly, under some circumstances, 3450Then there is no memory leak. Similarly, under some circumstances,
3404valgrind might report kernel bugs as if it were a bug in libev, or it 3451valgrind might report kernel bugs as if it were a bug in libev, or it
3405might be confused (it is a very good tool, but only a tool). 3452might be confused (it is a very good tool, but only a tool).
3406 3453
3407If you are unsure about something, feel free to contact the mailing list 3454If you are unsure about something, feel free to contact the mailing list
3408with the full valgrind report and an explanation on why you think this is 3455with the full valgrind report and an explanation on why you think this is

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines