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

Comparing libev/ev.pod (file contents):
Revision 1.77 by root, Sat Dec 8 22:11:14 2007 UTC vs.
Revision 1.113 by root, Mon Dec 31 01:30:53 2007 UTC

… …
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 #include <ev.h> 7 #include <ev.h>
8 8
9=head1 EXAMPLE PROGRAM 9=head2 EXAMPLE PROGRAM
10 10
11 #include <ev.h> 11 #include <ev.h>
12 12
13 ev_io stdin_watcher; 13 ev_io stdin_watcher;
14 ev_timer timeout_watcher; 14 ev_timer timeout_watcher;
… …
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.
… …
65You register interest in certain events by registering so-called I<event 65You register interest in certain events by registering so-called I<event
66watchers>, which are relatively small C structures you initialise with the 66watchers>, which are relatively small C structures you initialise with the
67details of the event, and then hand it over to libev by I<starting> the 67details of the event, and then hand it over to libev by I<starting> the
68watcher. 68watcher.
69 69
70=head1 FEATURES 70=head2 FEATURES
71 71
72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
74for file descriptor events (C<ev_io>), the Linux C<inotify> interface 74for file descriptor events (C<ev_io>), the Linux C<inotify> interface
75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
… …
82 82
83It also is quite fast (see this 83It also is quite fast (see this
84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
85for example). 85for example).
86 86
87=head1 CONVENTIONS 87=head2 CONVENTIONS
88 88
89Libev is very configurable. In this manual the default configuration will 89Libev is very configurable. In this manual the default configuration will
90be described, which supports multiple event loops. For more info about 90be described, which supports multiple event loops. For more info about
91various configuration options please have a look at B<EMBED> section in 91various configuration options please have a look at B<EMBED> section in
92this manual. If libev was configured without support for multiple event 92this manual. If libev was configured without support for multiple event
93loops, then all functions taking an initial argument of name C<loop> 93loops, then all functions taking an initial argument of name C<loop>
94(which is always of type C<struct ev_loop *>) will not have this argument. 94(which is always of type C<struct ev_loop *>) will not have this argument.
95 95
96=head1 TIME REPRESENTATION 96=head2 TIME REPRESENTATION
97 97
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
… …
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
491 - Before the first iteration, call any pending watchers. 555 - Before the first iteration, call any pending watchers.
492 * If there are no active watchers (reference count is zero), return. 556 * If EVFLAG_FORKCHECK was used, check for a fork.
493 - Queue all prepare watchers and then call all outstanding watchers. 557 - If a fork was detected, queue and call all fork watchers.
558 - Queue and call all prepare watchers.
494 - If we have been forked, recreate the kernel state. 559 - If we have been forked, recreate the kernel state.
495 - Update the kernel state with all outstanding changes. 560 - Update the kernel state with all outstanding changes.
496 - Update the "event loop time". 561 - Update the "event loop time".
497 - Calculate for how long to block. 562 - Calculate for how long to sleep or block, if at all
563 (active idle watchers, EVLOOP_NONBLOCK or not having
564 any active watchers at all will result in not sleeping).
565 - Sleep if the I/O and timer collect interval say so.
498 - Block the process, waiting for any events. 566 - Block the process, waiting for any events.
499 - Queue all outstanding I/O (fd) events. 567 - Queue all outstanding I/O (fd) events.
500 - Update the "event loop time" and do time jump handling. 568 - Update the "event loop time" and do time jump handling.
501 - Queue all outstanding timers. 569 - Queue all outstanding timers.
502 - Queue all outstanding periodics. 570 - Queue all outstanding periodics.
503 - If no events are pending now, queue all idle watchers. 571 - If no events are pending now, queue all idle watchers.
504 - Queue all check watchers. 572 - Queue all check watchers.
505 - Call all queued watchers in reverse order (i.e. check watchers first). 573 - Call all queued watchers in reverse order (i.e. check watchers first).
506 Signals and child watchers are implemented as I/O watchers, and will 574 Signals and child watchers are implemented as I/O watchers, and will
507 be handled here by queueing them when their watcher gets executed. 575 be handled here by queueing them when their watcher gets executed.
508 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 576 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
509 were used, return, otherwise continue with step *. 577 were used, or there are no active watchers, return, otherwise
578 continue with step *.
510 579
511Example: Queue some jobs and then loop until no events are outsanding 580Example: Queue some jobs and then loop until no events are outsanding
512anymore. 581anymore.
513 582
514 ... queue jobs here, make sure they register event watchers as long 583 ... queue jobs here, make sure they register event watchers as long
… …
549Example: For some weird reason, unregister the above signal handler again. 618Example: For some weird reason, unregister the above signal handler again.
550 619
551 ev_ref (loop); 620 ev_ref (loop);
552 ev_signal_stop (loop, &exitsig); 621 ev_signal_stop (loop, &exitsig);
553 622
623=item ev_set_io_collect_interval (loop, ev_tstamp interval)
624
625=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
626
627These advanced functions influence the time that libev will spend waiting
628for events. Both are by default C<0>, meaning that libev will try to
629invoke timer/periodic callbacks and I/O callbacks with minimum latency.
630
631Setting these to a higher value (the C<interval> I<must> be >= C<0>)
632allows libev to delay invocation of I/O and timer/periodic callbacks to
633increase efficiency of loop iterations.
634
635The background is that sometimes your program runs just fast enough to
636handle one (or very few) event(s) per loop iteration. While this makes
637the program responsive, it also wastes a lot of CPU time to poll for new
638events, especially with backends like C<select ()> which have a high
639overhead for the actual polling but can deliver many events at once.
640
641By setting a higher I<io collect interval> you allow libev to spend more
642time collecting I/O events, so you can handle more events per iteration,
643at the cost of increasing latency. Timeouts (both C<ev_periodic> and
644C<ev_timer>) will be not affected. Setting this to a non-null value will
645introduce an additional C<ev_sleep ()> call into most loop iterations.
646
647Likewise, by setting a higher I<timeout collect interval> you allow libev
648to spend more time collecting timeouts, at the expense of increased
649latency (the watcher callback will be called later). C<ev_io> watchers
650will not be affected. Setting this to a non-null value will not introduce
651any overhead in libev.
652
653Many (busy) programs can usually benefit by setting the io collect
654interval to a value near C<0.1> or so, which is often enough for
655interactive servers (of course not for games), likewise for timeouts. It
656usually doesn't make much sense to set it to a lower value than C<0.01>,
657as this approsaches the timing granularity of most systems.
658
554=back 659=back
555 660
556 661
557=head1 ANATOMY OF A WATCHER 662=head1 ANATOMY OF A WATCHER
558 663
… …
883In general you can register as many read and/or write event watchers per 988In general you can register as many read and/or write event watchers per
884fd as you want (as long as you don't confuse yourself). Setting all file 989fd as you want (as long as you don't confuse yourself). Setting all file
885descriptors to non-blocking mode is also usually a good idea (but not 990descriptors to non-blocking mode is also usually a good idea (but not
886required if you know what you are doing). 991required if you know what you are doing).
887 992
888You have to be careful with dup'ed file descriptors, though. Some backends
889(the linux epoll backend is a notable example) cannot handle dup'ed file
890descriptors correctly if you register interest in two or more fds pointing
891to the same underlying file/socket/etc. description (that is, they share
892the same underlying "file open").
893
894If you must do this, then force the use of a known-to-be-good backend 993If you must do this, then force the use of a known-to-be-good backend
895(at the time of this writing, this includes only C<EVBACKEND_SELECT> and 994(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
896C<EVBACKEND_POLL>). 995C<EVBACKEND_POLL>).
897 996
898Another thing you have to watch out for is that it is quite easy to 997Another thing you have to watch out for is that it is quite easy to
… …
908play around with an Xlib connection), then you have to seperately re-test 1007play around with an Xlib connection), then you have to seperately re-test
909whether a file descriptor is really ready with a known-to-be good interface 1008whether a file descriptor is really ready with a known-to-be good interface
910such as poll (fortunately in our Xlib example, Xlib already does this on 1009such as poll (fortunately in our Xlib example, Xlib already does this on
911its own, so its quite safe to use). 1010its own, so its quite safe to use).
912 1011
1012=head3 The special problem of disappearing file descriptors
1013
1014Some backends (e.g. kqueue, epoll) need to be told about closing a file
1015descriptor (either by calling C<close> explicitly or by any other means,
1016such as C<dup>). The reason is that you register interest in some file
1017descriptor, but when it goes away, the operating system will silently drop
1018this interest. If another file descriptor with the same number then is
1019registered with libev, there is no efficient way to see that this is, in
1020fact, a different file descriptor.
1021
1022To avoid having to explicitly tell libev about such cases, libev follows
1023the following policy: Each time C<ev_io_set> is being called, libev
1024will assume that this is potentially a new file descriptor, otherwise
1025it is assumed that the file descriptor stays the same. That means that
1026you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
1027descriptor even if the file descriptor number itself did not change.
1028
1029This is how one would do it normally anyway, the important point is that
1030the libev application should not optimise around libev but should leave
1031optimisations to libev.
1032
1033=head3 The special problem of dup'ed file descriptors
1034
1035Some backends (e.g. epoll), cannot register events for file descriptors,
1036but only events for the underlying file descriptions. That means when you
1037have C<dup ()>'ed file descriptors or weirder constellations, and register
1038events for them, only one file descriptor might actually receive events.
1039
1040There is no workaround possible except not registering events
1041for potentially C<dup ()>'ed file descriptors, or to resort to
1042C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1043
1044=head3 The special problem of fork
1045
1046Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1047useless behaviour. Libev fully supports fork, but needs to be told about
1048it in the child.
1049
1050To support fork in your programs, you either have to call
1051C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1052enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1053C<EVBACKEND_POLL>.
1054
1055
1056=head3 Watcher-Specific Functions
1057
913=over 4 1058=over 4
914 1059
915=item ev_io_init (ev_io *, callback, int fd, int events) 1060=item ev_io_init (ev_io *, callback, int fd, int events)
916 1061
917=item ev_io_set (ev_io *, int fd, int events) 1062=item ev_io_set (ev_io *, int fd, int events)
… …
927=item int events [read-only] 1072=item int events [read-only]
928 1073
929The events being watched. 1074The events being watched.
930 1075
931=back 1076=back
1077
1078=head3 Examples
932 1079
933Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1080Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
934readable, but only once. Since it is likely line-buffered, you could 1081readable, but only once. Since it is likely line-buffered, you could
935attempt to read a whole line in the callback. 1082attempt to read a whole line in the callback.
936 1083
… …
969 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1116 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
970 1117
971The callback is guarenteed to be invoked only when its timeout has passed, 1118The callback is guarenteed to be invoked only when its timeout has passed,
972but if multiple timers become ready during the same loop iteration then 1119but if multiple timers become ready during the same loop iteration then
973order of execution is undefined. 1120order of execution is undefined.
1121
1122=head3 Watcher-Specific Functions and Data Members
974 1123
975=over 4 1124=over 4
976 1125
977=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1126=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
978 1127
… …
1032or C<ev_timer_again> is called and determines the next timeout (if any), 1181or C<ev_timer_again> is called and determines the next timeout (if any),
1033which is also when any modifications are taken into account. 1182which is also when any modifications are taken into account.
1034 1183
1035=back 1184=back
1036 1185
1186=head3 Examples
1187
1037Example: Create a timer that fires after 60 seconds. 1188Example: Create a timer that fires after 60 seconds.
1038 1189
1039 static void 1190 static void
1040 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1191 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1041 { 1192 {
… …
1074but on wallclock time (absolute time). You can tell a periodic watcher 1225but on wallclock time (absolute time). You can tell a periodic watcher
1075to trigger "at" some specific point in time. For example, if you tell a 1226to trigger "at" some specific point in time. For example, if you tell a
1076periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () 1227periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
1077+ 10.>) and then reset your system clock to the last year, then it will 1228+ 10.>) and then reset your system clock to the last year, then it will
1078take a year to trigger the event (unlike an C<ev_timer>, which would trigger 1229take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1079roughly 10 seconds later and of course not if you reset your system time 1230roughly 10 seconds later).
1080again).
1081 1231
1082They can also be used to implement vastly more complex timers, such as 1232They can also be used to implement vastly more complex timers, such as
1083triggering an event on eahc midnight, local time. 1233triggering an event on each midnight, local time or other, complicated,
1234rules.
1084 1235
1085As with timers, the callback is guarenteed to be invoked only when the 1236As with timers, the callback is guarenteed to be invoked only when the
1086time (C<at>) has been passed, but if multiple periodic timers become ready 1237time (C<at>) has been passed, but if multiple periodic timers become ready
1087during the same loop iteration then order of execution is undefined. 1238during the same loop iteration then order of execution is undefined.
1088 1239
1240=head3 Watcher-Specific Functions and Data Members
1241
1089=over 4 1242=over 4
1090 1243
1091=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) 1244=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1092 1245
1093=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) 1246=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
… …
1095Lots of arguments, lets sort it out... There are basically three modes of 1248Lots of arguments, lets sort it out... There are basically three modes of
1096operation, and we will explain them from simplest to complex: 1249operation, and we will explain them from simplest to complex:
1097 1250
1098=over 4 1251=over 4
1099 1252
1100=item * absolute timer (interval = reschedule_cb = 0) 1253=item * absolute timer (at = time, interval = reschedule_cb = 0)
1101 1254
1102In this configuration the watcher triggers an event at the wallclock time 1255In this configuration the watcher triggers an event at the wallclock time
1103C<at> and doesn't repeat. It will not adjust when a time jump occurs, 1256C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1104that is, if it is to be run at January 1st 2011 then it will run when the 1257that is, if it is to be run at January 1st 2011 then it will run when the
1105system time reaches or surpasses this time. 1258system time reaches or surpasses this time.
1106 1259
1107=item * non-repeating interval timer (interval > 0, reschedule_cb = 0) 1260=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1108 1261
1109In this mode the watcher will always be scheduled to time out at the next 1262In this mode the watcher will always be scheduled to time out at the next
1110C<at + N * interval> time (for some integer N) and then repeat, regardless 1263C<at + N * interval> time (for some integer N, which can also be negative)
1111of any time jumps. 1264and then repeat, regardless of any time jumps.
1112 1265
1113This can be used to create timers that do not drift with respect to system 1266This can be used to create timers that do not drift with respect to system
1114time: 1267time:
1115 1268
1116 ev_periodic_set (&periodic, 0., 3600., 0); 1269 ev_periodic_set (&periodic, 0., 3600., 0);
… …
1122 1275
1123Another way to think about it (for the mathematically inclined) is that 1276Another way to think about it (for the mathematically inclined) is that
1124C<ev_periodic> will try to run the callback in this mode at the next possible 1277C<ev_periodic> will try to run the callback in this mode at the next possible
1125time where C<time = at (mod interval)>, regardless of any time jumps. 1278time where C<time = at (mod interval)>, regardless of any time jumps.
1126 1279
1280For numerical stability it is preferable that the C<at> value is near
1281C<ev_now ()> (the current time), but there is no range requirement for
1282this value.
1283
1127=item * manual reschedule mode (reschedule_cb = callback) 1284=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1128 1285
1129In this mode the values for C<interval> and C<at> are both being 1286In this mode the values for C<interval> and C<at> are both being
1130ignored. Instead, each time the periodic watcher gets scheduled, the 1287ignored. Instead, each time the periodic watcher gets scheduled, the
1131reschedule callback will be called with the watcher as first, and the 1288reschedule callback will be called with the watcher as first, and the
1132current time as second argument. 1289current time as second argument.
1133 1290
1134NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1291NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1135ever, or make any event loop modifications>. If you need to stop it, 1292ever, or make any event loop modifications>. If you need to stop it,
1136return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by 1293return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1137starting a prepare watcher). 1294starting an C<ev_prepare> watcher, which is legal).
1138 1295
1139Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 1296Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1140ev_tstamp now)>, e.g.: 1297ev_tstamp now)>, e.g.:
1141 1298
1142 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1299 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
… …
1165Simply stops and restarts the periodic watcher again. This is only useful 1322Simply stops and restarts the periodic watcher again. This is only useful
1166when you changed some parameters or the reschedule callback would return 1323when you changed some parameters or the reschedule callback would return
1167a different time than the last time it was called (e.g. in a crond like 1324a different time than the last time it was called (e.g. in a crond like
1168program when the crontabs have changed). 1325program when the crontabs have changed).
1169 1326
1327=item ev_tstamp offset [read-write]
1328
1329When repeating, this contains the offset value, otherwise this is the
1330absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1331
1332Can be modified any time, but changes only take effect when the periodic
1333timer fires or C<ev_periodic_again> is being called.
1334
1170=item ev_tstamp interval [read-write] 1335=item ev_tstamp interval [read-write]
1171 1336
1172The current interval value. Can be modified any time, but changes only 1337The current interval value. Can be modified any time, but changes only
1173take effect when the periodic timer fires or C<ev_periodic_again> is being 1338take effect when the periodic timer fires or C<ev_periodic_again> is being
1174called. 1339called.
… …
1177 1342
1178The current reschedule callback, or C<0>, if this functionality is 1343The current reschedule callback, or C<0>, if this functionality is
1179switched off. Can be changed any time, but changes only take effect when 1344switched off. Can be changed any time, but changes only take effect when
1180the periodic timer fires or C<ev_periodic_again> is being called. 1345the periodic timer fires or C<ev_periodic_again> is being called.
1181 1346
1347=item ev_tstamp at [read-only]
1348
1349When active, contains the absolute time that the watcher is supposed to
1350trigger next.
1351
1182=back 1352=back
1353
1354=head3 Examples
1183 1355
1184Example: Call a callback every hour, or, more precisely, whenever the 1356Example: Call a callback every hour, or, more precisely, whenever the
1185system clock is divisible by 3600. The callback invocation times have 1357system clock is divisible by 3600. The callback invocation times have
1186potentially a lot of jittering, but good long-term stability. 1358potentially a lot of jittering, but good long-term stability.
1187 1359
… …
1227with the kernel (thus it coexists with your own signal handlers as long 1399with the kernel (thus it coexists with your own signal handlers as long
1228as you don't register any with libev). Similarly, when the last signal 1400as you don't register any with libev). Similarly, when the last signal
1229watcher for a signal is stopped libev will reset the signal handler to 1401watcher for a signal is stopped libev will reset the signal handler to
1230SIG_DFL (regardless of what it was set to before). 1402SIG_DFL (regardless of what it was set to before).
1231 1403
1404=head3 Watcher-Specific Functions and Data Members
1405
1232=over 4 1406=over 4
1233 1407
1234=item ev_signal_init (ev_signal *, callback, int signum) 1408=item ev_signal_init (ev_signal *, callback, int signum)
1235 1409
1236=item ev_signal_set (ev_signal *, int signum) 1410=item ev_signal_set (ev_signal *, int signum)
… …
1247 1421
1248=head2 C<ev_child> - watch out for process status changes 1422=head2 C<ev_child> - watch out for process status changes
1249 1423
1250Child watchers trigger when your process receives a SIGCHLD in response to 1424Child watchers trigger when your process receives a SIGCHLD in response to
1251some child status changes (most typically when a child of yours dies). 1425some child status changes (most typically when a child of yours dies).
1426
1427=head3 Watcher-Specific Functions and Data Members
1252 1428
1253=over 4 1429=over 4
1254 1430
1255=item ev_child_init (ev_child *, callback, int pid) 1431=item ev_child_init (ev_child *, callback, int pid)
1256 1432
… …
1275 1451
1276The process exit/trace status caused by C<rpid> (see your systems 1452The process exit/trace status caused by C<rpid> (see your systems
1277C<waitpid> and C<sys/wait.h> documentation for details). 1453C<waitpid> and C<sys/wait.h> documentation for details).
1278 1454
1279=back 1455=back
1456
1457=head3 Examples
1280 1458
1281Example: Try to exit cleanly on SIGINT and SIGTERM. 1459Example: Try to exit cleanly on SIGINT and SIGTERM.
1282 1460
1283 static void 1461 static void
1284 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1462 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
… …
1325semantics of C<ev_stat> watchers, which means that libev sometimes needs 1503semantics of C<ev_stat> watchers, which means that libev sometimes needs
1326to fall back to regular polling again even with inotify, but changes are 1504to fall back to regular polling again even with inotify, but changes are
1327usually detected immediately, and if the file exists there will be no 1505usually detected immediately, and if the file exists there will be no
1328polling. 1506polling.
1329 1507
1508=head3 Inotify
1509
1510When C<inotify (7)> support has been compiled into libev (generally only
1511available on Linux) and present at runtime, it will be used to speed up
1512change detection where possible. The inotify descriptor will be created lazily
1513when the first C<ev_stat> watcher is being started.
1514
1515Inotify presense does not change the semantics of C<ev_stat> watchers
1516except that changes might be detected earlier, and in some cases, to avoid
1517making regular C<stat> calls. Even in the presense of inotify support
1518there are many cases where libev has to resort to regular C<stat> polling.
1519
1520(There is no support for kqueue, as apparently it cannot be used to
1521implement this functionality, due to the requirement of having a file
1522descriptor open on the object at all times).
1523
1524=head3 The special problem of stat time resolution
1525
1526The C<stat ()> syscall only supports full-second resolution portably, and
1527even on systems where the resolution is higher, many filesystems still
1528only support whole seconds.
1529
1530That means that, if the time is the only thing that changes, you might
1531miss updates: on the first update, C<ev_stat> detects a change and calls
1532your callback, which does something. When there is another update within
1533the same second, C<ev_stat> will be unable to detect it.
1534
1535The solution to this is to delay acting on a change for a second (or till
1536the next second boundary), using a roughly one-second delay C<ev_timer>
1537(C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01>
1538is added to work around small timing inconsistencies of some operating
1539systems.
1540
1541=head3 Watcher-Specific Functions and Data Members
1542
1330=over 4 1543=over 4
1331 1544
1332=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) 1545=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1333 1546
1334=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval) 1547=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
… …
1369=item const char *path [read-only] 1582=item const char *path [read-only]
1370 1583
1371The filesystem path that is being watched. 1584The filesystem path that is being watched.
1372 1585
1373=back 1586=back
1587
1588=head3 Examples
1374 1589
1375Example: Watch C</etc/passwd> for attribute changes. 1590Example: Watch C</etc/passwd> for attribute changes.
1376 1591
1377 static void 1592 static void
1378 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) 1593 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
… …
1391 } 1606 }
1392 1607
1393 ... 1608 ...
1394 ev_stat passwd; 1609 ev_stat passwd;
1395 1610
1396 ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); 1611 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1397 ev_stat_start (loop, &passwd); 1612 ev_stat_start (loop, &passwd);
1613
1614Example: Like above, but additionally use a one-second delay so we do not
1615miss updates (however, frequent updates will delay processing, too, so
1616one might do the work both on C<ev_stat> callback invocation I<and> on
1617C<ev_timer> callback invocation).
1618
1619 static ev_stat passwd;
1620 static ev_timer timer;
1621
1622 static void
1623 timer_cb (EV_P_ ev_timer *w, int revents)
1624 {
1625 ev_timer_stop (EV_A_ w);
1626
1627 /* now it's one second after the most recent passwd change */
1628 }
1629
1630 static void
1631 stat_cb (EV_P_ ev_stat *w, int revents)
1632 {
1633 /* reset the one-second timer */
1634 ev_timer_again (EV_A_ &timer);
1635 }
1636
1637 ...
1638 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1639 ev_stat_start (loop, &passwd);
1640 ev_timer_init (&timer, timer_cb, 0., 1.01);
1398 1641
1399 1642
1400=head2 C<ev_idle> - when you've got nothing better to do... 1643=head2 C<ev_idle> - when you've got nothing better to do...
1401 1644
1402Idle watchers trigger events when no other events of the same or higher 1645Idle watchers trigger events when no other events of the same or higher
… …
1416Apart from keeping your process non-blocking (which is a useful 1659Apart from keeping your process non-blocking (which is a useful
1417effect on its own sometimes), idle watchers are a good place to do 1660effect on its own sometimes), idle watchers are a good place to do
1418"pseudo-background processing", or delay processing stuff to after the 1661"pseudo-background processing", or delay processing stuff to after the
1419event loop has handled all outstanding events. 1662event loop has handled all outstanding events.
1420 1663
1664=head3 Watcher-Specific Functions and Data Members
1665
1421=over 4 1666=over 4
1422 1667
1423=item ev_idle_init (ev_signal *, callback) 1668=item ev_idle_init (ev_signal *, callback)
1424 1669
1425Initialises and configures the idle watcher - it has no parameters of any 1670Initialises and configures the idle watcher - it has no parameters of any
1426kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, 1671kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1427believe me. 1672believe me.
1428 1673
1429=back 1674=back
1675
1676=head3 Examples
1430 1677
1431Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the 1678Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1432callback, free it. Also, use no error checking, as usual. 1679callback, free it. Also, use no error checking, as usual.
1433 1680
1434 static void 1681 static void
… …
1486 1733
1487It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 1734It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1488priority, to ensure that they are being run before any other watchers 1735priority, to ensure that they are being run before any other watchers
1489after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers, 1736after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1490too) should not activate ("feed") events into libev. While libev fully 1737too) should not activate ("feed") events into libev. While libev fully
1491supports this, they will be called before other C<ev_check> watchers did 1738supports this, they will be called before other C<ev_check> watchers
1492their job. As C<ev_check> watchers are often used to embed other event 1739did their job. As C<ev_check> watchers are often used to embed other
1493loops those other event loops might be in an unusable state until their 1740(non-libev) event loops those other event loops might be in an unusable
1494C<ev_check> watcher ran (always remind yourself to coexist peacefully with 1741state until their C<ev_check> watcher ran (always remind yourself to
1495others). 1742coexist peacefully with others).
1743
1744=head3 Watcher-Specific Functions and Data Members
1496 1745
1497=over 4 1746=over 4
1498 1747
1499=item ev_prepare_init (ev_prepare *, callback) 1748=item ev_prepare_init (ev_prepare *, callback)
1500 1749
… …
1503Initialises and configures the prepare or check watcher - they have no 1752Initialises and configures the prepare or check watcher - they have no
1504parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 1753parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1505macros, but using them is utterly, utterly and completely pointless. 1754macros, but using them is utterly, utterly and completely pointless.
1506 1755
1507=back 1756=back
1757
1758=head3 Examples
1508 1759
1509There are a number of principal ways to embed other event loops or modules 1760There are a number of principal ways to embed other event loops or modules
1510into libev. Here are some ideas on how to include libadns into libev 1761into libev. Here are some ideas on how to include libadns into libev
1511(there is a Perl module named C<EV::ADNS> that does this, which you could 1762(there is a Perl module named C<EV::ADNS> that does this, which you could
1512use for an actually working example. Another Perl module named C<EV::Glib> 1763use for an actually working example. Another Perl module named C<EV::Glib>
… …
1681portable one. 1932portable one.
1682 1933
1683So when you want to use this feature you will always have to be prepared 1934So when you want to use this feature you will always have to be prepared
1684that you cannot get an embeddable loop. The recommended way to get around 1935that you cannot get an embeddable loop. The recommended way to get around
1685this is to have a separate variables for your embeddable loop, try to 1936this is to have a separate variables for your embeddable loop, try to
1686create it, and if that fails, use the normal loop for everything: 1937create it, and if that fails, use the normal loop for everything.
1938
1939=head3 Watcher-Specific Functions and Data Members
1940
1941=over 4
1942
1943=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1944
1945=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1946
1947Configures the watcher to embed the given loop, which must be
1948embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1949invoked automatically, otherwise it is the responsibility of the callback
1950to invoke it (it will continue to be called until the sweep has been done,
1951if you do not want thta, you need to temporarily stop the embed watcher).
1952
1953=item ev_embed_sweep (loop, ev_embed *)
1954
1955Make a single, non-blocking sweep over the embedded loop. This works
1956similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1957apropriate way for embedded loops.
1958
1959=item struct ev_loop *other [read-only]
1960
1961The embedded event loop.
1962
1963=back
1964
1965=head3 Examples
1966
1967Example: Try to get an embeddable event loop and embed it into the default
1968event loop. If that is not possible, use the default loop. The default
1969loop is stored in C<loop_hi>, while the mebeddable loop is stored in
1970C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be
1971used).
1687 1972
1688 struct ev_loop *loop_hi = ev_default_init (0); 1973 struct ev_loop *loop_hi = ev_default_init (0);
1689 struct ev_loop *loop_lo = 0; 1974 struct ev_loop *loop_lo = 0;
1690 struct ev_embed embed; 1975 struct ev_embed embed;
1691 1976
… …
1702 ev_embed_start (loop_hi, &embed); 1987 ev_embed_start (loop_hi, &embed);
1703 } 1988 }
1704 else 1989 else
1705 loop_lo = loop_hi; 1990 loop_lo = loop_hi;
1706 1991
1707=over 4 1992Example: Check if kqueue is available but not recommended and create
1993a kqueue backend for use with sockets (which usually work with any
1994kqueue implementation). Store the kqueue/socket-only event loop in
1995C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
1708 1996
1709=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 1997 struct ev_loop *loop = ev_default_init (0);
1998 struct ev_loop *loop_socket = 0;
1999 struct ev_embed embed;
2000
2001 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2002 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2003 {
2004 ev_embed_init (&embed, 0, loop_socket);
2005 ev_embed_start (loop, &embed);
2006 }
1710 2007
1711=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 2008 if (!loop_socket)
2009 loop_socket = loop;
1712 2010
1713Configures the watcher to embed the given loop, which must be 2011 // now use loop_socket for all sockets, and loop for everything else
1714embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1715invoked automatically, otherwise it is the responsibility of the callback
1716to invoke it (it will continue to be called until the sweep has been done,
1717if you do not want thta, you need to temporarily stop the embed watcher).
1718
1719=item ev_embed_sweep (loop, ev_embed *)
1720
1721Make a single, non-blocking sweep over the embedded loop. This works
1722similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1723apropriate way for embedded loops.
1724
1725=item struct ev_loop *loop [read-only]
1726
1727The embedded event loop.
1728
1729=back
1730 2012
1731 2013
1732=head2 C<ev_fork> - the audacity to resume the event loop after a fork 2014=head2 C<ev_fork> - the audacity to resume the event loop after a fork
1733 2015
1734Fork watchers are called when a C<fork ()> was detected (usually because 2016Fork watchers are called when a C<fork ()> was detected (usually because
… …
1737event loop blocks next and before C<ev_check> watchers are being called, 2019event loop blocks next and before C<ev_check> watchers are being called,
1738and only in the child after the fork. If whoever good citizen calling 2020and only in the child after the fork. If whoever good citizen calling
1739C<ev_default_fork> cheats and calls it in the wrong process, the fork 2021C<ev_default_fork> cheats and calls it in the wrong process, the fork
1740handlers will be invoked, too, of course. 2022handlers will be invoked, too, of course.
1741 2023
2024=head3 Watcher-Specific Functions and Data Members
2025
1742=over 4 2026=over 4
1743 2027
1744=item ev_fork_init (ev_signal *, callback) 2028=item ev_fork_init (ev_signal *, callback)
1745 2029
1746Initialises and configures the fork watcher - it has no parameters of any 2030Initialises and configures the fork watcher - it has no parameters of any
… …
1962 2246
1963=item w->stop () 2247=item w->stop ()
1964 2248
1965Stops the watcher if it is active. Again, no C<loop> argument. 2249Stops the watcher if it is active. Again, no C<loop> argument.
1966 2250
1967=item w->again () C<ev::timer>, C<ev::periodic> only 2251=item w->again () (C<ev::timer>, C<ev::periodic> only)
1968 2252
1969For C<ev::timer> and C<ev::periodic>, this invokes the corresponding 2253For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1970C<ev_TYPE_again> function. 2254C<ev_TYPE_again> function.
1971 2255
1972=item w->sweep () C<ev::embed> only 2256=item w->sweep () (C<ev::embed> only)
1973 2257
1974Invokes C<ev_embed_sweep>. 2258Invokes C<ev_embed_sweep>.
1975 2259
1976=item w->update () C<ev::stat> only 2260=item w->update () (C<ev::stat> only)
1977 2261
1978Invokes C<ev_stat_stat>. 2262Invokes C<ev_stat_stat>.
1979 2263
1980=back 2264=back
1981 2265
… …
2001 } 2285 }
2002 2286
2003 2287
2004=head1 MACRO MAGIC 2288=head1 MACRO MAGIC
2005 2289
2006Libev can be compiled with a variety of options, the most fundemantal is 2290Libev can be compiled with a variety of options, the most fundamantal
2007C<EV_MULTIPLICITY>. This option determines whether (most) functions and 2291of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2008callbacks have an initial C<struct ev_loop *> argument. 2292functions and callbacks have an initial C<struct ev_loop *> argument.
2009 2293
2010To make it easier to write programs that cope with either variant, the 2294To make it easier to write programs that cope with either variant, the
2011following macros are defined: 2295following macros are defined:
2012 2296
2013=over 4 2297=over 4
… …
2067Libev can (and often is) directly embedded into host 2351Libev can (and often is) directly embedded into host
2068applications. Examples of applications that embed it include the Deliantra 2352applications. Examples of applications that embed it include the Deliantra
2069Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2353Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2070and rxvt-unicode. 2354and rxvt-unicode.
2071 2355
2072The goal is to enable you to just copy the neecssary files into your 2356The goal is to enable you to just copy the necessary files into your
2073source directory without having to change even a single line in them, so 2357source directory without having to change even a single line in them, so
2074you can easily upgrade by simply copying (or having a checked-out copy of 2358you can easily upgrade by simply copying (or having a checked-out copy of
2075libev somewhere in your source tree). 2359libev somewhere in your source tree).
2076 2360
2077=head2 FILESETS 2361=head2 FILESETS
… …
2167 2451
2168If defined to be C<1>, libev will try to detect the availability of the 2452If defined to be C<1>, libev will try to detect the availability of the
2169monotonic clock option at both compiletime and runtime. Otherwise no use 2453monotonic clock option at both compiletime and runtime. Otherwise no use
2170of the monotonic clock option will be attempted. If you enable this, you 2454of the monotonic clock option will be attempted. If you enable this, you
2171usually have to link against librt or something similar. Enabling it when 2455usually have to link against librt or something similar. Enabling it when
2172the functionality isn't available is safe, though, althoguh you have 2456the functionality isn't available is safe, though, although you have
2173to make sure you link against any libraries where the C<clock_gettime> 2457to make sure you link against any libraries where the C<clock_gettime>
2174function is hiding in (often F<-lrt>). 2458function is hiding in (often F<-lrt>).
2175 2459
2176=item EV_USE_REALTIME 2460=item EV_USE_REALTIME
2177 2461
2178If defined to be C<1>, libev will try to detect the availability of the 2462If defined to be C<1>, libev will try to detect the availability of the
2179realtime clock option at compiletime (and assume its availability at 2463realtime clock option at compiletime (and assume its availability at
2180runtime if successful). Otherwise no use of the realtime clock option will 2464runtime if successful). Otherwise no use of the realtime clock option will
2181be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2465be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2182(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2466(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2183in the description of C<EV_USE_MONOTONIC>, though. 2467note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2468
2469=item EV_USE_NANOSLEEP
2470
2471If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2472and will use it for delays. Otherwise it will use C<select ()>.
2184 2473
2185=item EV_USE_SELECT 2474=item EV_USE_SELECT
2186 2475
2187If undefined or defined to be C<1>, libev will compile in support for the 2476If undefined or defined to be C<1>, libev will compile in support for the
2188C<select>(2) backend. No attempt at autodetection will be done: if no 2477C<select>(2) backend. No attempt at autodetection will be done: if no
… …
2206wants osf handles on win32 (this is the case when the select to 2495wants osf handles on win32 (this is the case when the select to
2207be used is the winsock select). This means that it will call 2496be used is the winsock select). This means that it will call
2208C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 2497C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2209it is assumed that all these functions actually work on fds, even 2498it is assumed that all these functions actually work on fds, even
2210on win32. Should not be defined on non-win32 platforms. 2499on win32. Should not be defined on non-win32 platforms.
2500
2501=item EV_FD_TO_WIN32_HANDLE
2502
2503If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
2504file descriptors to socket handles. When not defining this symbol (the
2505default), then libev will call C<_get_osfhandle>, which is usually
2506correct. In some cases, programs use their own file descriptor management,
2507in which case they can provide this function to map fds to socket handles.
2211 2508
2212=item EV_USE_POLL 2509=item EV_USE_POLL
2213 2510
2214If defined to be C<1>, libev will compile in support for the C<poll>(2) 2511If defined to be C<1>, libev will compile in support for the C<poll>(2)
2215backend. Otherwise it will be enabled on non-win32 platforms. It 2512backend. Otherwise it will be enabled on non-win32 platforms. It
… …
2252be detected at runtime. 2549be detected at runtime.
2253 2550
2254=item EV_H 2551=item EV_H
2255 2552
2256The name of the F<ev.h> header file used to include it. The default if 2553The name of the F<ev.h> header file used to include it. The default if
2257undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This 2554undefined is C<"ev.h"> in F<event.h> and F<ev.c>. This can be used to
2258can be used to virtually rename the F<ev.h> header file in case of conflicts. 2555virtually rename the F<ev.h> header file in case of conflicts.
2259 2556
2260=item EV_CONFIG_H 2557=item EV_CONFIG_H
2261 2558
2262If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 2559If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2263F<ev.c>'s idea of where to find the F<config.h> file, similarly to 2560F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2264C<EV_H>, above. 2561C<EV_H>, above.
2265 2562
2266=item EV_EVENT_H 2563=item EV_EVENT_H
2267 2564
2268Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 2565Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2269of how the F<event.h> header can be found. 2566of how the F<event.h> header can be found, the dfeault is C<"event.h">.
2270 2567
2271=item EV_PROTOTYPES 2568=item EV_PROTOTYPES
2272 2569
2273If defined to be C<0>, then F<ev.h> will not define any function 2570If defined to be C<0>, then F<ev.h> will not define any function
2274prototypes, but still define all the structs and other symbols. This is 2571prototypes, but still define all the structs and other symbols. This is
… …
2340than enough. If you need to manage thousands of children you might want to 2637than enough. If you need to manage thousands of children you might want to
2341increase this value (I<must> be a power of two). 2638increase this value (I<must> be a power of two).
2342 2639
2343=item EV_INOTIFY_HASHSIZE 2640=item EV_INOTIFY_HASHSIZE
2344 2641
2345C<ev_staz> watchers use a small hash table to distribute workload by 2642C<ev_stat> watchers use a small hash table to distribute workload by
2346inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 2643inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2347usually more than enough. If you need to manage thousands of C<ev_stat> 2644usually more than enough. If you need to manage thousands of C<ev_stat>
2348watchers you might want to increase this value (I<must> be a power of 2645watchers you might want to increase this value (I<must> be a power of
2349two). 2646two).
2350 2647
… …
2367 2664
2368=item ev_set_cb (ev, cb) 2665=item ev_set_cb (ev, cb)
2369 2666
2370Can be used to change the callback member declaration in each watcher, 2667Can be used to change the callback member declaration in each watcher,
2371and the way callbacks are invoked and set. Must expand to a struct member 2668and the way callbacks are invoked and set. Must expand to a struct member
2372definition and a statement, respectively. See the F<ev.v> header file for 2669definition and a statement, respectively. See the F<ev.h> header file for
2373their default definitions. One possible use for overriding these is to 2670their default definitions. One possible use for overriding these is to
2374avoid the C<struct ev_loop *> as first argument in all cases, or to use 2671avoid the C<struct ev_loop *> as first argument in all cases, or to use
2375method calls instead of plain function calls in C++. 2672method calls instead of plain function calls in C++.
2673
2674=head2 EXPORTED API SYMBOLS
2675
2676If you need to re-export the API (e.g. via a dll) and you need a list of
2677exported symbols, you can use the provided F<Symbol.*> files which list
2678all public symbols, one per line:
2679
2680 Symbols.ev for libev proper
2681 Symbols.event for the libevent emulation
2682
2683This can also be used to rename all public symbols to avoid clashes with
2684multiple versions of libev linked together (which is obviously bad in
2685itself, but sometimes it is inconvinient to avoid this).
2686
2687A sed command like this will create wrapper C<#define>'s that you need to
2688include before including F<ev.h>:
2689
2690 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2691
2692This would create a file F<wrap.h> which essentially looks like this:
2693
2694 #define ev_backend myprefix_ev_backend
2695 #define ev_check_start myprefix_ev_check_start
2696 #define ev_check_stop myprefix_ev_check_stop
2697 ...
2376 2698
2377=head2 EXAMPLES 2699=head2 EXAMPLES
2378 2700
2379For a real-world example of a program the includes libev 2701For a real-world example of a program the includes libev
2380verbatim, you can have a look at the EV perl module 2702verbatim, you can have a look at the EV perl module
… …
2421 2743
2422=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2744=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2423 2745
2424This means that, when you have a watcher that triggers in one hour and 2746This means that, when you have a watcher that triggers in one hour and
2425there are 100 watchers that would trigger before that then inserting will 2747there are 100 watchers that would trigger before that then inserting will
2426have to skip those 100 watchers. 2748have to skip roughly seven (C<ld 100>) of these watchers.
2427 2749
2428=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2750=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2429 2751
2430That means that for changing a timer costs less than removing/adding them 2752That means that changing a timer costs less than removing/adding them
2431as only the relative motion in the event queue has to be paid for. 2753as only the relative motion in the event queue has to be paid for.
2432 2754
2433=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2755=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2434 2756
2435These just add the watcher into an array or at the head of a list. 2757These just add the watcher into an array or at the head of a list.
2758
2436=item Stopping check/prepare/idle watchers: O(1) 2759=item Stopping check/prepare/idle watchers: O(1)
2437 2760
2438=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 2761=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2439 2762
2440These watchers are stored in lists then need to be walked to find the 2763These watchers are stored in lists then need to be walked to find the
2441correct watcher to remove. The lists are usually short (you don't usually 2764correct watcher to remove. The lists are usually short (you don't usually
2442have many watchers waiting for the same fd or signal). 2765have many watchers waiting for the same fd or signal).
2443 2766
2444=item Finding the next timer per loop iteration: O(1) 2767=item Finding the next timer in each loop iteration: O(1)
2768
2769By virtue of using a binary heap, the next timer is always found at the
2770beginning of the storage array.
2445 2771
2446=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2772=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2447 2773
2448A change means an I/O watcher gets started or stopped, which requires 2774A change means an I/O watcher gets started or stopped, which requires
2449libev to recalculate its status (and possibly tell the kernel). 2775libev to recalculate its status (and possibly tell the kernel, depending
2776on backend and wether C<ev_io_set> was used).
2450 2777
2451=item Activating one watcher: O(1) 2778=item Activating one watcher (putting it into the pending state): O(1)
2452 2779
2453=item Priority handling: O(number_of_priorities) 2780=item Priority handling: O(number_of_priorities)
2454 2781
2455Priorities are implemented by allocating some space for each 2782Priorities are implemented by allocating some space for each
2456priority. When doing priority-based operations, libev usually has to 2783priority. When doing priority-based operations, libev usually has to
2457linearly search all the priorities. 2784linearly search all the priorities, but starting/stopping and activating
2785watchers becomes O(1) w.r.t. prioritiy handling.
2458 2786
2459=back 2787=back
2460 2788
2461 2789
2790=head1 Win32 platform limitations and workarounds
2791
2792Win32 doesn't support any of the standards (e.g. POSIX) that libev
2793requires, and its I/O model is fundamentally incompatible with the POSIX
2794model. Libev still offers limited functionality on this platform in
2795the form of the C<EVBACKEND_SELECT> backend, and only supports socket
2796descriptors. This only applies when using Win32 natively, not when using
2797e.g. cygwin.
2798
2799There is no supported compilation method available on windows except
2800embedding it into other applications.
2801
2802Due to the many, low, and arbitrary limits on the win32 platform and the
2803abysmal performance of winsockets, using a large number of sockets is not
2804recommended (and not reasonable). If your program needs to use more than
2805a hundred or so sockets, then likely it needs to use a totally different
2806implementation for windows, as libev offers the POSIX model, which cannot
2807be implemented efficiently on windows (microsoft monopoly games).
2808
2809=over 4
2810
2811=item The winsocket select function
2812
2813The winsocket C<select> function doesn't follow POSIX in that it requires
2814socket I<handles> and not socket I<file descriptors>. This makes select
2815very inefficient, and also requires a mapping from file descriptors
2816to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>,
2817C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor
2818symbols for more info.
2819
2820The configuration for a "naked" win32 using the microsoft runtime
2821libraries and raw winsocket select is:
2822
2823 #define EV_USE_SELECT 1
2824 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
2825
2826Note that winsockets handling of fd sets is O(n), so you can easily get a
2827complexity in the O(n²) range when using win32.
2828
2829=item Limited number of file descriptors
2830
2831Windows has numerous arbitrary (and low) limits on things. Early versions
2832of winsocket's select only supported waiting for a max. of C<64> handles
2833(probably owning to the fact that all windows kernels can only wait for
2834C<64> things at the same time internally; microsoft recommends spawning a
2835chain of threads and wait for 63 handles and the previous thread in each).
2836
2837Newer versions support more handles, but you need to define C<FD_SETSIZE>
2838to some high number (e.g. C<2048>) before compiling the winsocket select
2839call (which might be in libev or elsewhere, for example, perl does its own
2840select emulation on windows).
2841
2842Another limit is the number of file descriptors in the microsoft runtime
2843libraries, which by default is C<64> (there must be a hidden I<64> fetish
2844or something like this inside microsoft). You can increase this by calling
2845C<_setmaxstdio>, which can increase this limit to C<2048> (another
2846arbitrary limit), but is broken in many versions of the microsoft runtime
2847libraries.
2848
2849This might get you to about C<512> or C<2048> sockets (depending on
2850windows version and/or the phase of the moon). To get more, you need to
2851wrap all I/O functions and provide your own fd management, but the cost of
2852calling select (O(n²)) will likely make this unworkable.
2853
2854=back
2855
2856
2462=head1 AUTHOR 2857=head1 AUTHOR
2463 2858
2464Marc Lehmann <libev@schmorp.de>. 2859Marc Lehmann <libev@schmorp.de>.
2465 2860

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines