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

Comparing libev/ev.pod (file contents):
Revision 1.74 by root, Sat Dec 8 14:12:08 2007 UTC vs.
Revision 1.104 by root, Sun Dec 23 03:48:02 2007 UTC

53The newest version of this document is also available as a html-formatted 53The newest version of this document is also available as a html-formatted
54web page you might find easier to navigate when reading it for the first 54web page you might find easier to navigate when reading it for the first
55time: L<http://cvs.schmorp.de/libev/ev.html>. 55time: L<http://cvs.schmorp.de/libev/ev.html>.
56 56
57Libev is an event loop: you register interest in certain events (such as a 57Libev is an event loop: you register interest in certain events (such as a
58file descriptor being readable or a timeout occuring), and it will manage 58file descriptor being readable or a timeout occurring), and it will manage
59these event sources and provide your program with events. 59these event sources and provide your program with events.
60 60
61To do this, it must take more or less complete control over your process 61To do this, it must take more or less complete control over your process
62(or thread) by executing the I<event loop> handler, and will then 62(or thread) by executing the I<event loop> handler, and will then
63communicate events via a callback mechanism. 63communicate events via a callback mechanism.
98Libev represents time as a single floating point number, representing the 98Libev represents time as a single floating point number, representing the
99(fractional) number of seconds since the (POSIX) epoch (somewhere near 99(fractional) number of seconds since the (POSIX) epoch (somewhere near
100the beginning of 1970, details are complicated, don't ask). This type is 100the beginning of 1970, details are complicated, don't ask). This type is
101called C<ev_tstamp>, which is what you should use too. It usually aliases 101called C<ev_tstamp>, which is what you should use too. It usually aliases
102to the C<double> type in C, and when you need to do any calculations on 102to the C<double> type in C, and when you need to do any calculations on
103it, you should treat it as such. 103it, you should treat it as some floatingpoint value. Unlike the name
104component C<stamp> might indicate, it is also used for time differences
105throughout libev.
104 106
105=head1 GLOBAL FUNCTIONS 107=head1 GLOBAL FUNCTIONS
106 108
107These functions can be called anytime, even before initialising the 109These functions can be called anytime, even before initialising the
108library in any way. 110library in any way.
113 115
114Returns the current time as libev would use it. Please note that the 116Returns the current time as libev would use it. Please note that the
115C<ev_now> function is usually faster and also often returns the timestamp 117C<ev_now> function is usually faster and also often returns the timestamp
116you actually want to know. 118you actually want to know.
117 119
120=item ev_sleep (ev_tstamp interval)
121
122Sleep for the given interval: The current thread will be blocked until
123either it is interrupted or the given time interval has passed. Basically
124this is a subsecond-resolution C<sleep ()>.
125
118=item int ev_version_major () 126=item int ev_version_major ()
119 127
120=item int ev_version_minor () 128=item int ev_version_minor ()
121 129
122You can find out the major and minor version numbers of the library 130You can find out the major and minor ABI version numbers of the library
123you linked against by calling the functions C<ev_version_major> and 131you linked against by calling the functions C<ev_version_major> and
124C<ev_version_minor>. If you want, you can compare against the global 132C<ev_version_minor>. If you want, you can compare against the global
125symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the 133symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
126version of the library your program was compiled against. 134version of the library your program was compiled against.
127 135
136These version numbers refer to the ABI version of the library, not the
137release version.
138
128Usually, it's a good idea to terminate if the major versions mismatch, 139Usually, it's a good idea to terminate if the major versions mismatch,
129as this indicates an incompatible change. Minor versions are usually 140as this indicates an incompatible change. Minor versions are usually
130compatible to older versions, so a larger minor version alone is usually 141compatible to older versions, so a larger minor version alone is usually
131not a problem. 142not a problem.
132 143
133Example: Make sure we haven't accidentally been linked against the wrong 144Example: Make sure we haven't accidentally been linked against the wrong
134version. 145version.
295=item C<EVBACKEND_SELECT> (value 1, portable select backend) 306=item C<EVBACKEND_SELECT> (value 1, portable select backend)
296 307
297This is your standard select(2) backend. Not I<completely> standard, as 308This is your standard select(2) backend. Not I<completely> standard, as
298libev tries to roll its own fd_set with no limits on the number of fds, 309libev tries to roll its own fd_set with no limits on the number of fds,
299but if that fails, expect a fairly low limit on the number of fds when 310but if that fails, expect a fairly low limit on the number of fds when
300using this backend. It doesn't scale too well (O(highest_fd)), but its usually 311using this backend. It doesn't scale too well (O(highest_fd)), but its
301the fastest backend for a low number of fds. 312usually the fastest backend for a low number of (low-numbered :) fds.
313
314To get good performance out of this backend you need a high amount of
315parallelity (most of the file descriptors should be busy). If you are
316writing a server, you should C<accept ()> in a loop to accept as many
317connections as possible during one iteration. You might also want to have
318a look at C<ev_set_io_collect_interval ()> to increase the amount of
319readyness notifications you get per iteration.
302 320
303=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) 321=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
304 322
305And this is your standard poll(2) backend. It's more complicated than 323And this is your standard poll(2) backend. It's more complicated
306select, but handles sparse fds better and has no artificial limit on the 324than select, but handles sparse fds better and has no artificial
307number of fds you can use (except it will slow down considerably with a 325limit on the number of fds you can use (except it will slow down
308lot of inactive fds). It scales similarly to select, i.e. O(total_fds). 326considerably with a lot of inactive fds). It scales similarly to select,
327i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
328performance tips.
309 329
310=item C<EVBACKEND_EPOLL> (value 4, Linux) 330=item C<EVBACKEND_EPOLL> (value 4, Linux)
311 331
312For few fds, this backend is a bit little slower than poll and select, 332For few fds, this backend is a bit little slower than poll and select,
313but it scales phenomenally better. While poll and select usually scale like 333but it scales phenomenally better. While poll and select usually scale
314O(total_fds) where n is the total number of fds (or the highest fd), epoll scales 334like O(total_fds) where n is the total number of fds (or the highest fd),
315either O(1) or O(active_fds). 335epoll scales either O(1) or O(active_fds). The epoll design has a number
336of shortcomings, such as silently dropping events in some hard-to-detect
337cases and rewiring a syscall per fd change, no fork support and bad
338support for dup.
316 339
317While stopping and starting an I/O watcher in the same iteration will 340While stopping, setting and starting an I/O watcher in the same iteration
318result in some caching, there is still a syscall per such incident 341will result in some caching, there is still a syscall per such incident
319(because the fd could point to a different file description now), so its 342(because the fd could point to a different file description now), so its
320best to avoid that. Also, dup()ed file descriptors might not work very 343best to avoid that. Also, C<dup ()>'ed file descriptors might not work
321well if you register events for both fds. 344very well if you register events for both fds.
322 345
323Please note that epoll sometimes generates spurious notifications, so you 346Please note that epoll sometimes generates spurious notifications, so you
324need to use non-blocking I/O or other means to avoid blocking when no data 347need to use non-blocking I/O or other means to avoid blocking when no data
325(or space) is available. 348(or space) is available.
326 349
350Best performance from this backend is achieved by not unregistering all
351watchers for a file descriptor until it has been closed, if possible, i.e.
352keep at least one watcher active per fd at all times.
353
354While nominally embeddeble in other event loops, this feature is broken in
355all kernel versions tested so far.
356
327=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 357=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
328 358
329Kqueue deserves special mention, as at the time of this writing, it 359Kqueue deserves special mention, as at the time of this writing, it
330was broken on all BSDs except NetBSD (usually it doesn't work with 360was broken on all BSDs except NetBSD (usually it doesn't work reliably
331anything but sockets and pipes, except on Darwin, where of course its 361with anything but sockets and pipes, except on Darwin, where of course
332completely useless). For this reason its not being "autodetected" 362it's completely useless). For this reason it's not being "autodetected"
333unless you explicitly specify it explicitly in the flags (i.e. using 363unless you explicitly specify it explicitly in the flags (i.e. using
334C<EVBACKEND_KQUEUE>). 364C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
365system like NetBSD.
366
367You still can embed kqueue into a normal poll or select backend and use it
368only for sockets (after having made sure that sockets work with kqueue on
369the target platform). See C<ev_embed> watchers for more info.
335 370
336It scales in the same way as the epoll backend, but the interface to the 371It scales in the same way as the epoll backend, but the interface to the
337kernel is more efficient (which says nothing about its actual speed, of 372kernel is more efficient (which says nothing about its actual speed, of
338course). While starting and stopping an I/O watcher does not cause an 373course). While stopping, setting and starting an I/O watcher does never
339extra syscall as with epoll, it still adds up to four event changes per 374cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
340incident, so its best to avoid that. 375two event changes per incident, support for C<fork ()> is very bad and it
376drops fds silently in similarly hard-to-detect cases.
377
378This backend usually performs well under most conditions.
379
380While nominally embeddable in other event loops, this doesn't work
381everywhere, so you might need to test for this. And since it is broken
382almost everywhere, you should only use it when you have a lot of sockets
383(for which it usually works), by embedding it into another event loop
384(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for
385sockets.
341 386
342=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 387=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
343 388
344This is not implemented yet (and might never be). 389This is not implemented yet (and might never be, unless you send me an
390implementation). According to reports, C</dev/poll> only supports sockets
391and is not embeddable, which would limit the usefulness of this backend
392immensely.
345 393
346=item C<EVBACKEND_PORT> (value 32, Solaris 10) 394=item C<EVBACKEND_PORT> (value 32, Solaris 10)
347 395
348This uses the Solaris 10 port mechanism. As with everything on Solaris, 396This uses the Solaris 10 event port mechanism. As with everything on Solaris,
349it's really slow, but it still scales very well (O(active_fds)). 397it's really slow, but it still scales very well (O(active_fds)).
350 398
351Please note that solaris ports can result in a lot of spurious 399Please note that solaris event ports can deliver a lot of spurious
352notifications, so you need to use non-blocking I/O or other means to avoid 400notifications, so you need to use non-blocking I/O or other means to avoid
353blocking when no data (or space) is available. 401blocking when no data (or space) is available.
402
403While this backend scales well, it requires one system call per active
404file descriptor per loop iteration. For small and medium numbers of file
405descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
406might perform better.
354 407
355=item C<EVBACKEND_ALL> 408=item C<EVBACKEND_ALL>
356 409
357Try all backends (even potentially broken ones that wouldn't be tried 410Try all backends (even potentially broken ones that wouldn't be tried
358with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 411with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
359C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 412C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
413
414It is definitely not recommended to use this flag.
360 415
361=back 416=back
362 417
363If one or more of these are ored into the flags value, then only these 418If one or more of these are ored into the flags value, then only these
364backends will be tried (in the reverse order as given here). If none are 419backends will be tried (in the reverse order as given here). If none are
399Destroys the default loop again (frees all memory and kernel state 454Destroys the default loop again (frees all memory and kernel state
400etc.). None of the active event watchers will be stopped in the normal 455etc.). None of the active event watchers will be stopped in the normal
401sense, so e.g. C<ev_is_active> might still return true. It is your 456sense, so e.g. C<ev_is_active> might still return true. It is your
402responsibility to either stop all watchers cleanly yoursef I<before> 457responsibility to either stop all watchers cleanly yoursef I<before>
403calling this function, or cope with the fact afterwards (which is usually 458calling this function, or cope with the fact afterwards (which is usually
404the easiest thing, youc na just ignore the watchers and/or C<free ()> them 459the easiest thing, you can just ignore the watchers and/or C<free ()> them
405for example). 460for example).
461
462Note that certain global state, such as signal state, will not be freed by
463this function, and related watchers (such as signal and child watchers)
464would need to be stopped manually.
465
466In general it is not advisable to call this function except in the
467rare occasion where you really need to free e.g. the signal handling
468pipe fds. If you need dynamically allocated loops it is better to use
469C<ev_loop_new> and C<ev_loop_destroy>).
406 470
407=item ev_loop_destroy (loop) 471=item ev_loop_destroy (loop)
408 472
409Like C<ev_default_destroy>, but destroys an event loop created by an 473Like C<ev_default_destroy>, but destroys an event loop created by an
410earlier call to C<ev_loop_new>. 474earlier call to C<ev_loop_new>.
455 519
456Returns the current "event loop time", which is the time the event loop 520Returns the current "event loop time", which is the time the event loop
457received events and started processing them. This timestamp does not 521received events and started processing them. This timestamp does not
458change as long as callbacks are being processed, and this is also the base 522change as long as callbacks are being processed, and this is also the base
459time used for relative timers. You can treat it as the timestamp of the 523time used for relative timers. You can treat it as the timestamp of the
460event occuring (or more correctly, libev finding out about it). 524event occurring (or more correctly, libev finding out about it).
461 525
462=item ev_loop (loop, int flags) 526=item ev_loop (loop, int flags)
463 527
464Finally, this is it, the event handler. This function usually is called 528Finally, this is it, the event handler. This function usually is called
465after you initialised all your watchers and you want to start handling 529after you initialised all your watchers and you want to start handling
486libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is 550libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
487usually a better approach for this kind of thing. 551usually a better approach for this kind of thing.
488 552
489Here are the gory details of what C<ev_loop> does: 553Here are the gory details of what C<ev_loop> does:
490 554
555 - Before the first iteration, call any pending watchers.
491 * If there are no active watchers (reference count is zero), return. 556 * If there are no active watchers (reference count is zero), return.
492 - Queue prepare watchers and then call all outstanding watchers. 557 - Queue all prepare watchers and then call all outstanding watchers.
493 - If we have been forked, recreate the kernel state. 558 - If we have been forked, recreate the kernel state.
494 - Update the kernel state with all outstanding changes. 559 - Update the kernel state with all outstanding changes.
495 - Update the "event loop time". 560 - Update the "event loop time".
496 - Calculate for how long to block. 561 - Calculate for how long to block.
497 - Block the process, waiting for any events. 562 - Block the process, waiting for any events.
548Example: For some weird reason, unregister the above signal handler again. 613Example: For some weird reason, unregister the above signal handler again.
549 614
550 ev_ref (loop); 615 ev_ref (loop);
551 ev_signal_stop (loop, &exitsig); 616 ev_signal_stop (loop, &exitsig);
552 617
618=item ev_set_io_collect_interval (loop, ev_tstamp interval)
619
620=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
621
622These advanced functions influence the time that libev will spend waiting
623for events. Both are by default C<0>, meaning that libev will try to
624invoke timer/periodic callbacks and I/O callbacks with minimum latency.
625
626Setting these to a higher value (the C<interval> I<must> be >= C<0>)
627allows libev to delay invocation of I/O and timer/periodic callbacks to
628increase efficiency of loop iterations.
629
630The background is that sometimes your program runs just fast enough to
631handle one (or very few) event(s) per loop iteration. While this makes
632the program responsive, it also wastes a lot of CPU time to poll for new
633events, especially with backends like C<select ()> which have a high
634overhead for the actual polling but can deliver many events at once.
635
636By setting a higher I<io collect interval> you allow libev to spend more
637time collecting I/O events, so you can handle more events per iteration,
638at the cost of increasing latency. Timeouts (both C<ev_periodic> and
639C<ev_timer>) will be not affected. Setting this to a non-null value will
640introduce an additional C<ev_sleep ()> call into most loop iterations.
641
642Likewise, by setting a higher I<timeout collect interval> you allow libev
643to spend more time collecting timeouts, at the expense of increased
644latency (the watcher callback will be called later). C<ev_io> watchers
645will not be affected. Setting this to a non-null value will not introduce
646any overhead in libev.
647
648Many (busy) programs can usually benefit by setting the io collect
649interval to a value near C<0.1> or so, which is often enough for
650interactive servers (of course not for games), likewise for timeouts. It
651usually doesn't make much sense to set it to a lower value than C<0.01>,
652as this approsaches the timing granularity of most systems.
653
553=back 654=back
554 655
555 656
556=head1 ANATOMY OF A WATCHER 657=head1 ANATOMY OF A WATCHER
557 658
907play around with an Xlib connection), then you have to seperately re-test 1008play around with an Xlib connection), then you have to seperately re-test
908whether a file descriptor is really ready with a known-to-be good interface 1009whether a file descriptor is really ready with a known-to-be good interface
909such as poll (fortunately in our Xlib example, Xlib already does this on 1010such as poll (fortunately in our Xlib example, Xlib already does this on
910its own, so its quite safe to use). 1011its own, so its quite safe to use).
911 1012
1013=head3 The special problem of disappearing file descriptors
1014
1015Some backends (e.g. kqueue, epoll) need to be told about closing a file
1016descriptor (either by calling C<close> explicitly or by any other means,
1017such as C<dup>). The reason is that you register interest in some file
1018descriptor, but when it goes away, the operating system will silently drop
1019this interest. If another file descriptor with the same number then is
1020registered with libev, there is no efficient way to see that this is, in
1021fact, a different file descriptor.
1022
1023To avoid having to explicitly tell libev about such cases, libev follows
1024the following policy: Each time C<ev_io_set> is being called, libev
1025will assume that this is potentially a new file descriptor, otherwise
1026it is assumed that the file descriptor stays the same. That means that
1027you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
1028descriptor even if the file descriptor number itself did not change.
1029
1030This is how one would do it normally anyway, the important point is that
1031the libev application should not optimise around libev but should leave
1032optimisations to libev.
1033
1034=head3 The special problem of dup'ed file descriptors
1035
1036Some backends (e.g. epoll), cannot register events for file descriptors,
1037but only events for the underlying file descriptions. That means when you
1038have C<dup ()>'ed file descriptors and register events for them, only one
1039file descriptor might actually receive events.
1040
1041There is no workaround possible except not registering events
1042for potentially C<dup ()>'ed file descriptors, or to resort to
1043C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1044
1045=head3 The special problem of fork
1046
1047Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1048useless behaviour. Libev fully supports fork, but needs to be told about
1049it in the child.
1050
1051To support fork in your programs, you either have to call
1052C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1053enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1054C<EVBACKEND_POLL>.
1055
1056
1057=head3 Watcher-Specific Functions
1058
912=over 4 1059=over 4
913 1060
914=item ev_io_init (ev_io *, callback, int fd, int events) 1061=item ev_io_init (ev_io *, callback, int fd, int events)
915 1062
916=item ev_io_set (ev_io *, int fd, int events) 1063=item ev_io_set (ev_io *, int fd, int events)
968 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1115 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
969 1116
970The callback is guarenteed to be invoked only when its timeout has passed, 1117The callback is guarenteed to be invoked only when its timeout has passed,
971but if multiple timers become ready during the same loop iteration then 1118but if multiple timers become ready during the same loop iteration then
972order of execution is undefined. 1119order of execution is undefined.
1120
1121=head3 Watcher-Specific Functions and Data Members
973 1122
974=over 4 1123=over 4
975 1124
976=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1125=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
977 1126
1073but on wallclock time (absolute time). You can tell a periodic watcher 1222but on wallclock time (absolute time). You can tell a periodic watcher
1074to trigger "at" some specific point in time. For example, if you tell a 1223to trigger "at" some specific point in time. For example, if you tell a
1075periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () 1224periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
1076+ 10.>) and then reset your system clock to the last year, then it will 1225+ 10.>) and then reset your system clock to the last year, then it will
1077take a year to trigger the event (unlike an C<ev_timer>, which would trigger 1226take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1078roughly 10 seconds later and of course not if you reset your system time 1227roughly 10 seconds later).
1079again).
1080 1228
1081They can also be used to implement vastly more complex timers, such as 1229They can also be used to implement vastly more complex timers, such as
1082triggering an event on eahc midnight, local time. 1230triggering an event on each midnight, local time or other, complicated,
1231rules.
1083 1232
1084As with timers, the callback is guarenteed to be invoked only when the 1233As with timers, the callback is guarenteed to be invoked only when the
1085time (C<at>) has been passed, but if multiple periodic timers become ready 1234time (C<at>) has been passed, but if multiple periodic timers become ready
1086during the same loop iteration then order of execution is undefined. 1235during the same loop iteration then order of execution is undefined.
1087 1236
1237=head3 Watcher-Specific Functions and Data Members
1238
1088=over 4 1239=over 4
1089 1240
1090=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) 1241=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1091 1242
1092=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) 1243=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
1094Lots of arguments, lets sort it out... There are basically three modes of 1245Lots of arguments, lets sort it out... There are basically three modes of
1095operation, and we will explain them from simplest to complex: 1246operation, and we will explain them from simplest to complex:
1096 1247
1097=over 4 1248=over 4
1098 1249
1099=item * absolute timer (interval = reschedule_cb = 0) 1250=item * absolute timer (at = time, interval = reschedule_cb = 0)
1100 1251
1101In this configuration the watcher triggers an event at the wallclock time 1252In this configuration the watcher triggers an event at the wallclock time
1102C<at> and doesn't repeat. It will not adjust when a time jump occurs, 1253C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1103that is, if it is to be run at January 1st 2011 then it will run when the 1254that is, if it is to be run at January 1st 2011 then it will run when the
1104system time reaches or surpasses this time. 1255system time reaches or surpasses this time.
1105 1256
1106=item * non-repeating interval timer (interval > 0, reschedule_cb = 0) 1257=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1107 1258
1108In this mode the watcher will always be scheduled to time out at the next 1259In this mode the watcher will always be scheduled to time out at the next
1109C<at + N * interval> time (for some integer N) and then repeat, regardless 1260C<at + N * interval> time (for some integer N, which can also be negative)
1110of any time jumps. 1261and then repeat, regardless of any time jumps.
1111 1262
1112This can be used to create timers that do not drift with respect to system 1263This can be used to create timers that do not drift with respect to system
1113time: 1264time:
1114 1265
1115 ev_periodic_set (&periodic, 0., 3600., 0); 1266 ev_periodic_set (&periodic, 0., 3600., 0);
1121 1272
1122Another way to think about it (for the mathematically inclined) is that 1273Another way to think about it (for the mathematically inclined) is that
1123C<ev_periodic> will try to run the callback in this mode at the next possible 1274C<ev_periodic> will try to run the callback in this mode at the next possible
1124time where C<time = at (mod interval)>, regardless of any time jumps. 1275time where C<time = at (mod interval)>, regardless of any time jumps.
1125 1276
1277For numerical stability it is preferable that the C<at> value is near
1278C<ev_now ()> (the current time), but there is no range requirement for
1279this value.
1280
1126=item * manual reschedule mode (reschedule_cb = callback) 1281=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1127 1282
1128In this mode the values for C<interval> and C<at> are both being 1283In this mode the values for C<interval> and C<at> are both being
1129ignored. Instead, each time the periodic watcher gets scheduled, the 1284ignored. Instead, each time the periodic watcher gets scheduled, the
1130reschedule callback will be called with the watcher as first, and the 1285reschedule callback will be called with the watcher as first, and the
1131current time as second argument. 1286current time as second argument.
1132 1287
1133NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1288NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1134ever, or make any event loop modifications>. If you need to stop it, 1289ever, or make any event loop modifications>. If you need to stop it,
1135return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by 1290return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1136starting a prepare watcher). 1291starting an C<ev_prepare> watcher, which is legal).
1137 1292
1138Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 1293Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1139ev_tstamp now)>, e.g.: 1294ev_tstamp now)>, e.g.:
1140 1295
1141 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1296 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1164Simply stops and restarts the periodic watcher again. This is only useful 1319Simply stops and restarts the periodic watcher again. This is only useful
1165when you changed some parameters or the reschedule callback would return 1320when you changed some parameters or the reschedule callback would return
1166a different time than the last time it was called (e.g. in a crond like 1321a different time than the last time it was called (e.g. in a crond like
1167program when the crontabs have changed). 1322program when the crontabs have changed).
1168 1323
1324=item ev_tstamp offset [read-write]
1325
1326When repeating, this contains the offset value, otherwise this is the
1327absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1328
1329Can be modified any time, but changes only take effect when the periodic
1330timer fires or C<ev_periodic_again> is being called.
1331
1169=item ev_tstamp interval [read-write] 1332=item ev_tstamp interval [read-write]
1170 1333
1171The current interval value. Can be modified any time, but changes only 1334The current interval value. Can be modified any time, but changes only
1172take effect when the periodic timer fires or C<ev_periodic_again> is being 1335take effect when the periodic timer fires or C<ev_periodic_again> is being
1173called. 1336called.
1175=item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write] 1338=item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]
1176 1339
1177The current reschedule callback, or C<0>, if this functionality is 1340The current reschedule callback, or C<0>, if this functionality is
1178switched off. Can be changed any time, but changes only take effect when 1341switched off. Can be changed any time, but changes only take effect when
1179the periodic timer fires or C<ev_periodic_again> is being called. 1342the periodic timer fires or C<ev_periodic_again> is being called.
1343
1344=item ev_tstamp at [read-only]
1345
1346When active, contains the absolute time that the watcher is supposed to
1347trigger next.
1180 1348
1181=back 1349=back
1182 1350
1183Example: Call a callback every hour, or, more precisely, whenever the 1351Example: Call a callback every hour, or, more precisely, whenever the
1184system clock is divisible by 3600. The callback invocation times have 1352system clock is divisible by 3600. The callback invocation times have
1226with the kernel (thus it coexists with your own signal handlers as long 1394with the kernel (thus it coexists with your own signal handlers as long
1227as you don't register any with libev). Similarly, when the last signal 1395as you don't register any with libev). Similarly, when the last signal
1228watcher for a signal is stopped libev will reset the signal handler to 1396watcher for a signal is stopped libev will reset the signal handler to
1229SIG_DFL (regardless of what it was set to before). 1397SIG_DFL (regardless of what it was set to before).
1230 1398
1399=head3 Watcher-Specific Functions and Data Members
1400
1231=over 4 1401=over 4
1232 1402
1233=item ev_signal_init (ev_signal *, callback, int signum) 1403=item ev_signal_init (ev_signal *, callback, int signum)
1234 1404
1235=item ev_signal_set (ev_signal *, int signum) 1405=item ev_signal_set (ev_signal *, int signum)
1246 1416
1247=head2 C<ev_child> - watch out for process status changes 1417=head2 C<ev_child> - watch out for process status changes
1248 1418
1249Child watchers trigger when your process receives a SIGCHLD in response to 1419Child watchers trigger when your process receives a SIGCHLD in response to
1250some child status changes (most typically when a child of yours dies). 1420some child status changes (most typically when a child of yours dies).
1421
1422=head3 Watcher-Specific Functions and Data Members
1251 1423
1252=over 4 1424=over 4
1253 1425
1254=item ev_child_init (ev_child *, callback, int pid) 1426=item ev_child_init (ev_child *, callback, int pid)
1255 1427
1323reader). Inotify will be used to give hints only and should not change the 1495reader). Inotify will be used to give hints only and should not change the
1324semantics of C<ev_stat> watchers, which means that libev sometimes needs 1496semantics of C<ev_stat> watchers, which means that libev sometimes needs
1325to fall back to regular polling again even with inotify, but changes are 1497to fall back to regular polling again even with inotify, but changes are
1326usually detected immediately, and if the file exists there will be no 1498usually detected immediately, and if the file exists there will be no
1327polling. 1499polling.
1500
1501=head3 Watcher-Specific Functions and Data Members
1328 1502
1329=over 4 1503=over 4
1330 1504
1331=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) 1505=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1332 1506
1415Apart from keeping your process non-blocking (which is a useful 1589Apart from keeping your process non-blocking (which is a useful
1416effect on its own sometimes), idle watchers are a good place to do 1590effect on its own sometimes), idle watchers are a good place to do
1417"pseudo-background processing", or delay processing stuff to after the 1591"pseudo-background processing", or delay processing stuff to after the
1418event loop has handled all outstanding events. 1592event loop has handled all outstanding events.
1419 1593
1594=head3 Watcher-Specific Functions and Data Members
1595
1420=over 4 1596=over 4
1421 1597
1422=item ev_idle_init (ev_signal *, callback) 1598=item ev_idle_init (ev_signal *, callback)
1423 1599
1424Initialises and configures the idle watcher - it has no parameters of any 1600Initialises and configures the idle watcher - it has no parameters of any
1481with priority higher than or equal to the event loop and one coroutine 1657with priority higher than or equal to the event loop and one coroutine
1482of lower priority, but only once, using idle watchers to keep the event 1658of lower priority, but only once, using idle watchers to keep the event
1483loop from blocking if lower-priority coroutines are active, thus mapping 1659loop from blocking if lower-priority coroutines are active, thus mapping
1484low-priority coroutines to idle/background tasks). 1660low-priority coroutines to idle/background tasks).
1485 1661
1662It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1663priority, to ensure that they are being run before any other watchers
1664after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1665too) should not activate ("feed") events into libev. While libev fully
1666supports this, they will be called before other C<ev_check> watchers
1667did their job. As C<ev_check> watchers are often used to embed other
1668(non-libev) event loops those other event loops might be in an unusable
1669state until their C<ev_check> watcher ran (always remind yourself to
1670coexist peacefully with others).
1671
1672=head3 Watcher-Specific Functions and Data Members
1673
1486=over 4 1674=over 4
1487 1675
1488=item ev_prepare_init (ev_prepare *, callback) 1676=item ev_prepare_init (ev_prepare *, callback)
1489 1677
1490=item ev_check_init (ev_check *, callback) 1678=item ev_check_init (ev_check *, callback)
1493parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 1681parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1494macros, but using them is utterly, utterly and completely pointless. 1682macros, but using them is utterly, utterly and completely pointless.
1495 1683
1496=back 1684=back
1497 1685
1498Example: To include a library such as adns, you would add IO watchers 1686There are a number of principal ways to embed other event loops or modules
1499and a timeout watcher in a prepare handler, as required by libadns, and 1687into libev. Here are some ideas on how to include libadns into libev
1688(there is a Perl module named C<EV::ADNS> that does this, which you could
1689use for an actually working example. Another Perl module named C<EV::Glib>
1690embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV
1691into the Glib event loop).
1692
1693Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1500in a check watcher, destroy them and call into libadns. What follows is 1694and in a check watcher, destroy them and call into libadns. What follows
1501pseudo-code only of course: 1695is pseudo-code only of course. This requires you to either use a low
1696priority for the check watcher or use C<ev_clear_pending> explicitly, as
1697the callbacks for the IO/timeout watchers might not have been called yet.
1502 1698
1503 static ev_io iow [nfd]; 1699 static ev_io iow [nfd];
1504 static ev_timer tw; 1700 static ev_timer tw;
1505 1701
1506 static void 1702 static void
1507 io_cb (ev_loop *loop, ev_io *w, int revents) 1703 io_cb (ev_loop *loop, ev_io *w, int revents)
1508 { 1704 {
1509 // set the relevant poll flags
1510 // could also call adns_processreadable etc. here
1511 struct pollfd *fd = (struct pollfd *)w->data;
1512 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1513 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1514 } 1705 }
1515 1706
1516 // create io watchers for each fd and a timer before blocking 1707 // create io watchers for each fd and a timer before blocking
1517 static void 1708 static void
1518 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 1709 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1524 1715
1525 /* the callback is illegal, but won't be called as we stop during check */ 1716 /* the callback is illegal, but won't be called as we stop during check */
1526 ev_timer_init (&tw, 0, timeout * 1e-3); 1717 ev_timer_init (&tw, 0, timeout * 1e-3);
1527 ev_timer_start (loop, &tw); 1718 ev_timer_start (loop, &tw);
1528 1719
1529 // create on ev_io per pollfd 1720 // create one ev_io per pollfd
1530 for (int i = 0; i < nfd; ++i) 1721 for (int i = 0; i < nfd; ++i)
1531 { 1722 {
1532 ev_io_init (iow + i, io_cb, fds [i].fd, 1723 ev_io_init (iow + i, io_cb, fds [i].fd,
1533 ((fds [i].events & POLLIN ? EV_READ : 0) 1724 ((fds [i].events & POLLIN ? EV_READ : 0)
1534 | (fds [i].events & POLLOUT ? EV_WRITE : 0))); 1725 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1535 1726
1536 fds [i].revents = 0; 1727 fds [i].revents = 0;
1537 iow [i].data = fds + i;
1538 ev_io_start (loop, iow + i); 1728 ev_io_start (loop, iow + i);
1539 } 1729 }
1540 } 1730 }
1541 1731
1542 // stop all watchers after blocking 1732 // stop all watchers after blocking
1544 adns_check_cb (ev_loop *loop, ev_check *w, int revents) 1734 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1545 { 1735 {
1546 ev_timer_stop (loop, &tw); 1736 ev_timer_stop (loop, &tw);
1547 1737
1548 for (int i = 0; i < nfd; ++i) 1738 for (int i = 0; i < nfd; ++i)
1739 {
1740 // set the relevant poll flags
1741 // could also call adns_processreadable etc. here
1742 struct pollfd *fd = fds + i;
1743 int revents = ev_clear_pending (iow + i);
1744 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1745 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1746
1747 // now stop the watcher
1549 ev_io_stop (loop, iow + i); 1748 ev_io_stop (loop, iow + i);
1749 }
1550 1750
1551 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); 1751 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1752 }
1753
1754Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1755in the prepare watcher and would dispose of the check watcher.
1756
1757Method 3: If the module to be embedded supports explicit event
1758notification (adns does), you can also make use of the actual watcher
1759callbacks, and only destroy/create the watchers in the prepare watcher.
1760
1761 static void
1762 timer_cb (EV_P_ ev_timer *w, int revents)
1763 {
1764 adns_state ads = (adns_state)w->data;
1765 update_now (EV_A);
1766
1767 adns_processtimeouts (ads, &tv_now);
1768 }
1769
1770 static void
1771 io_cb (EV_P_ ev_io *w, int revents)
1772 {
1773 adns_state ads = (adns_state)w->data;
1774 update_now (EV_A);
1775
1776 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1777 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1778 }
1779
1780 // do not ever call adns_afterpoll
1781
1782Method 4: Do not use a prepare or check watcher because the module you
1783want to embed is too inflexible to support it. Instead, youc na override
1784their poll function. The drawback with this solution is that the main
1785loop is now no longer controllable by EV. The C<Glib::EV> module does
1786this.
1787
1788 static gint
1789 event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1790 {
1791 int got_events = 0;
1792
1793 for (n = 0; n < nfds; ++n)
1794 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1795
1796 if (timeout >= 0)
1797 // create/start timer
1798
1799 // poll
1800 ev_loop (EV_A_ 0);
1801
1802 // stop timer again
1803 if (timeout >= 0)
1804 ev_timer_stop (EV_A_ &to);
1805
1806 // stop io watchers again - their callbacks should have set
1807 for (n = 0; n < nfds; ++n)
1808 ev_io_stop (EV_A_ iow [n]);
1809
1810 return got_events;
1552 } 1811 }
1553 1812
1554 1813
1555=head2 C<ev_embed> - when one backend isn't enough... 1814=head2 C<ev_embed> - when one backend isn't enough...
1556 1815
1620 ev_embed_start (loop_hi, &embed); 1879 ev_embed_start (loop_hi, &embed);
1621 } 1880 }
1622 else 1881 else
1623 loop_lo = loop_hi; 1882 loop_lo = loop_hi;
1624 1883
1884=head3 Watcher-Specific Functions and Data Members
1885
1625=over 4 1886=over 4
1626 1887
1627=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 1888=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1628 1889
1629=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 1890=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1638 1899
1639Make a single, non-blocking sweep over the embedded loop. This works 1900Make a single, non-blocking sweep over the embedded loop. This works
1640similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 1901similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1641apropriate way for embedded loops. 1902apropriate way for embedded loops.
1642 1903
1643=item struct ev_loop *loop [read-only] 1904=item struct ev_loop *other [read-only]
1644 1905
1645The embedded event loop. 1906The embedded event loop.
1646 1907
1647=back 1908=back
1648 1909
1655event loop blocks next and before C<ev_check> watchers are being called, 1916event loop blocks next and before C<ev_check> watchers are being called,
1656and only in the child after the fork. If whoever good citizen calling 1917and only in the child after the fork. If whoever good citizen calling
1657C<ev_default_fork> cheats and calls it in the wrong process, the fork 1918C<ev_default_fork> cheats and calls it in the wrong process, the fork
1658handlers will be invoked, too, of course. 1919handlers will be invoked, too, of course.
1659 1920
1921=head3 Watcher-Specific Functions and Data Members
1922
1660=over 4 1923=over 4
1661 1924
1662=item ev_fork_init (ev_signal *, callback) 1925=item ev_fork_init (ev_signal *, callback)
1663 1926
1664Initialises and configures the fork watcher - it has no parameters of any 1927Initialises and configures the fork watcher - it has no parameters of any
1844 2107
1845 myclass obj; 2108 myclass obj;
1846 ev::io iow; 2109 ev::io iow;
1847 iow.set <myclass, &myclass::io_cb> (&obj); 2110 iow.set <myclass, &myclass::io_cb> (&obj);
1848 2111
1849=item w->set (void (*function)(watcher &w, int), void *data = 0) 2112=item w->set<function> (void *data = 0)
1850 2113
1851Also sets a callback, but uses a static method or plain function as 2114Also sets a callback, but uses a static method or plain function as
1852callback. The optional C<data> argument will be stored in the watcher's 2115callback. The optional C<data> argument will be stored in the watcher's
1853C<data> member and is free for you to use. 2116C<data> member and is free for you to use.
1854 2117
2118The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2119
1855See the method-C<set> above for more details. 2120See the method-C<set> above for more details.
2121
2122Example:
2123
2124 static void io_cb (ev::io &w, int revents) { }
2125 iow.set <io_cb> ();
1856 2126
1857=item w->set (struct ev_loop *) 2127=item w->set (struct ev_loop *)
1858 2128
1859Associates a different C<struct ev_loop> with this watcher. You can only 2129Associates a different C<struct ev_loop> with this watcher. You can only
1860do this when the watcher is inactive (and not pending either). 2130do this when the watcher is inactive (and not pending either).
1873 2143
1874=item w->stop () 2144=item w->stop ()
1875 2145
1876Stops the watcher if it is active. Again, no C<loop> argument. 2146Stops the watcher if it is active. Again, no C<loop> argument.
1877 2147
1878=item w->again () C<ev::timer>, C<ev::periodic> only 2148=item w->again () (C<ev::timer>, C<ev::periodic> only)
1879 2149
1880For C<ev::timer> and C<ev::periodic>, this invokes the corresponding 2150For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1881C<ev_TYPE_again> function. 2151C<ev_TYPE_again> function.
1882 2152
1883=item w->sweep () C<ev::embed> only 2153=item w->sweep () (C<ev::embed> only)
1884 2154
1885Invokes C<ev_embed_sweep>. 2155Invokes C<ev_embed_sweep>.
1886 2156
1887=item w->update () C<ev::stat> only 2157=item w->update () (C<ev::stat> only)
1888 2158
1889Invokes C<ev_stat_stat>. 2159Invokes C<ev_stat_stat>.
1890 2160
1891=back 2161=back
1892 2162
1912 } 2182 }
1913 2183
1914 2184
1915=head1 MACRO MAGIC 2185=head1 MACRO MAGIC
1916 2186
1917Libev can be compiled with a variety of options, the most fundemantal is 2187Libev can be compiled with a variety of options, the most fundamantal
1918C<EV_MULTIPLICITY>. This option determines whether (most) functions and 2188of which is C<EV_MULTIPLICITY>. This option determines whether (most)
1919callbacks have an initial C<struct ev_loop *> argument. 2189functions and callbacks have an initial C<struct ev_loop *> argument.
1920 2190
1921To make it easier to write programs that cope with either variant, the 2191To make it easier to write programs that cope with either variant, the
1922following macros are defined: 2192following macros are defined:
1923 2193
1924=over 4 2194=over 4
1978Libev can (and often is) directly embedded into host 2248Libev can (and often is) directly embedded into host
1979applications. Examples of applications that embed it include the Deliantra 2249applications. Examples of applications that embed it include the Deliantra
1980Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2250Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
1981and rxvt-unicode. 2251and rxvt-unicode.
1982 2252
1983The goal is to enable you to just copy the neecssary files into your 2253The goal is to enable you to just copy the necessary files into your
1984source directory without having to change even a single line in them, so 2254source directory without having to change even a single line in them, so
1985you can easily upgrade by simply copying (or having a checked-out copy of 2255you can easily upgrade by simply copying (or having a checked-out copy of
1986libev somewhere in your source tree). 2256libev somewhere in your source tree).
1987 2257
1988=head2 FILESETS 2258=head2 FILESETS
2078 2348
2079If defined to be C<1>, libev will try to detect the availability of the 2349If defined to be C<1>, libev will try to detect the availability of the
2080monotonic clock option at both compiletime and runtime. Otherwise no use 2350monotonic clock option at both compiletime and runtime. Otherwise no use
2081of the monotonic clock option will be attempted. If you enable this, you 2351of the monotonic clock option will be attempted. If you enable this, you
2082usually have to link against librt or something similar. Enabling it when 2352usually have to link against librt or something similar. Enabling it when
2083the functionality isn't available is safe, though, althoguh you have 2353the functionality isn't available is safe, though, although you have
2084to make sure you link against any libraries where the C<clock_gettime> 2354to make sure you link against any libraries where the C<clock_gettime>
2085function is hiding in (often F<-lrt>). 2355function is hiding in (often F<-lrt>).
2086 2356
2087=item EV_USE_REALTIME 2357=item EV_USE_REALTIME
2088 2358
2089If defined to be C<1>, libev will try to detect the availability of the 2359If defined to be C<1>, libev will try to detect the availability of the
2090realtime clock option at compiletime (and assume its availability at 2360realtime clock option at compiletime (and assume its availability at
2091runtime if successful). Otherwise no use of the realtime clock option will 2361runtime if successful). Otherwise no use of the realtime clock option will
2092be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2362be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2093(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2363(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2094in the description of C<EV_USE_MONOTONIC>, though. 2364note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2365
2366=item EV_USE_NANOSLEEP
2367
2368If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2369and will use it for delays. Otherwise it will use C<select ()>.
2095 2370
2096=item EV_USE_SELECT 2371=item EV_USE_SELECT
2097 2372
2098If undefined or defined to be C<1>, libev will compile in support for the 2373If undefined or defined to be C<1>, libev will compile in support for the
2099C<select>(2) backend. No attempt at autodetection will be done: if no 2374C<select>(2) backend. No attempt at autodetection will be done: if no
2251than enough. If you need to manage thousands of children you might want to 2526than enough. If you need to manage thousands of children you might want to
2252increase this value (I<must> be a power of two). 2527increase this value (I<must> be a power of two).
2253 2528
2254=item EV_INOTIFY_HASHSIZE 2529=item EV_INOTIFY_HASHSIZE
2255 2530
2256C<ev_staz> watchers use a small hash table to distribute workload by 2531C<ev_stat> watchers use a small hash table to distribute workload by
2257inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 2532inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2258usually more than enough. If you need to manage thousands of C<ev_stat> 2533usually more than enough. If you need to manage thousands of C<ev_stat>
2259watchers you might want to increase this value (I<must> be a power of 2534watchers you might want to increase this value (I<must> be a power of
2260two). 2535two).
2261 2536
2278 2553
2279=item ev_set_cb (ev, cb) 2554=item ev_set_cb (ev, cb)
2280 2555
2281Can be used to change the callback member declaration in each watcher, 2556Can be used to change the callback member declaration in each watcher,
2282and the way callbacks are invoked and set. Must expand to a struct member 2557and the way callbacks are invoked and set. Must expand to a struct member
2283definition and a statement, respectively. See the F<ev.v> header file for 2558definition and a statement, respectively. See the F<ev.h> header file for
2284their default definitions. One possible use for overriding these is to 2559their default definitions. One possible use for overriding these is to
2285avoid the C<struct ev_loop *> as first argument in all cases, or to use 2560avoid the C<struct ev_loop *> as first argument in all cases, or to use
2286method calls instead of plain function calls in C++. 2561method calls instead of plain function calls in C++.
2562
2563=head2 EXPORTED API SYMBOLS
2564
2565If you need to re-export the API (e.g. via a dll) and you need a list of
2566exported symbols, you can use the provided F<Symbol.*> files which list
2567all public symbols, one per line:
2568
2569 Symbols.ev for libev proper
2570 Symbols.event for the libevent emulation
2571
2572This can also be used to rename all public symbols to avoid clashes with
2573multiple versions of libev linked together (which is obviously bad in
2574itself, but sometimes it is inconvinient to avoid this).
2575
2576A sed command like this will create wrapper C<#define>'s that you need to
2577include before including F<ev.h>:
2578
2579 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2580
2581This would create a file F<wrap.h> which essentially looks like this:
2582
2583 #define ev_backend myprefix_ev_backend
2584 #define ev_check_start myprefix_ev_check_start
2585 #define ev_check_stop myprefix_ev_check_stop
2586 ...
2287 2587
2288=head2 EXAMPLES 2588=head2 EXAMPLES
2289 2589
2290For a real-world example of a program the includes libev 2590For a real-world example of a program the includes libev
2291verbatim, you can have a look at the EV perl module 2591verbatim, you can have a look at the EV perl module

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines