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

Comparing libev/ev.pod (file contents):
Revision 1.87 by root, Tue Dec 18 01:37:46 2007 UTC vs.
Revision 1.116 by root, Mon Dec 31 01:34:09 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
115 115
116Returns 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
117C<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
118you actually want to know. 118you actually want to know.
119 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
120=item int ev_version_major () 126=item int ev_version_major ()
121 127
122=item int ev_version_minor () 128=item int ev_version_minor ()
123 129
124You can find out the major and minor ABI version numbers of the library 130You can find out the major and minor ABI version numbers of the library
300=item C<EVBACKEND_SELECT> (value 1, portable select backend) 306=item C<EVBACKEND_SELECT> (value 1, portable select backend)
301 307
302This is your standard select(2) backend. Not I<completely> standard, as 308This is your standard select(2) backend. Not I<completely> standard, as
303libev 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,
304but 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
305using 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
306the 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.
307 320
308=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)
309 322
310And this is your standard poll(2) backend. It's more complicated than 323And this is your standard poll(2) backend. It's more complicated
311select, but handles sparse fds better and has no artificial limit on the 324than select, but handles sparse fds better and has no artificial
312number 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
313lot 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.
314 329
315=item C<EVBACKEND_EPOLL> (value 4, Linux) 330=item C<EVBACKEND_EPOLL> (value 4, Linux)
316 331
317For 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,
318but it scales phenomenally better. While poll and select usually scale like 333but it scales phenomenally better. While poll and select usually scale
319O(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),
320either 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.
321 339
322While 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
323result in some caching, there is still a syscall per such incident 341will result in some caching, there is still a syscall per such incident
324(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
325best 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
326well if you register events for both fds. 344very well if you register events for both fds.
327 345
328Please note that epoll sometimes generates spurious notifications, so you 346Please note that epoll sometimes generates spurious notifications, so you
329need 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
330(or space) is available. 348(or space) is available.
331 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
332=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 357=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
333 358
334Kqueue deserves special mention, as at the time of this writing, it 359Kqueue deserves special mention, as at the time of this writing, it
335was 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
336anything but sockets and pipes, except on Darwin, where of course its 361with anything but sockets and pipes, except on Darwin, where of course
337completely useless). For this reason its not being "autodetected" 362it's completely useless). For this reason it's not being "autodetected"
338unless you explicitly specify it explicitly in the flags (i.e. using 363unless you explicitly specify it explicitly in the flags (i.e. using
339C<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.
340 370
341It 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
342kernel is more efficient (which says nothing about its actual speed, of 372kernel is more efficient (which says nothing about its actual speed, of
343course). While starting and stopping an I/O watcher does not cause an 373course). While stopping, setting and starting an I/O watcher does never
344extra 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
345incident, 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.
346 386
347=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 387=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
348 388
349This 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.
350 393
351=item C<EVBACKEND_PORT> (value 32, Solaris 10) 394=item C<EVBACKEND_PORT> (value 32, Solaris 10)
352 395
353This uses the Solaris 10 port mechanism. As with everything on Solaris, 396This uses the Solaris 10 event port mechanism. As with everything on Solaris,
354it'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)).
355 398
356Please note that solaris ports can result in a lot of spurious 399Please note that solaris event ports can deliver a lot of spurious
357notifications, 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
358blocking 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.
359 407
360=item C<EVBACKEND_ALL> 408=item C<EVBACKEND_ALL>
361 409
362Try all backends (even potentially broken ones that wouldn't be tried 410Try all backends (even potentially broken ones that wouldn't be tried
363with 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
364C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 412C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
413
414It is definitely not recommended to use this flag.
365 415
366=back 416=back
367 417
368If 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
369backends 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
407responsibility to either stop all watchers cleanly yoursef I<before> 457responsibility to either stop all watchers cleanly yoursef I<before>
408calling this function, or cope with the fact afterwards (which is usually 458calling this function, or cope with the fact afterwards (which is usually
409the easiest thing, you can just ignore the watchers and/or C<free ()> them 459the easiest thing, you can just ignore the watchers and/or C<free ()> them
410for example). 460for example).
411 461
412Not that certain global state, such as signal state, will not be freed by 462Note that certain global state, such as signal state, will not be freed by
413this function, and related watchers (such as signal and child watchers) 463this function, and related watchers (such as signal and child watchers)
414would need to be stopped manually. 464would need to be stopped manually.
415 465
416In general it is not advisable to call this function except in the 466In general it is not advisable to call this function except in the
417rare occasion where you really need to free e.g. the signal handling 467rare occasion where you really need to free e.g. the signal handling
469 519
470Returns 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
471received events and started processing them. This timestamp does not 521received events and started processing them. This timestamp does not
472change 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
473time 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
474event occuring (or more correctly, libev finding out about it). 524event occurring (or more correctly, libev finding out about it).
475 525
476=item ev_loop (loop, int flags) 526=item ev_loop (loop, int flags)
477 527
478Finally, this is it, the event handler. This function usually is called 528Finally, this is it, the event handler. This function usually is called
479after you initialised all your watchers and you want to start handling 529after you initialised all your watchers and you want to start handling
501usually a better approach for this kind of thing. 551usually a better approach for this kind of thing.
502 552
503Here are the gory details of what C<ev_loop> does: 553Here are the gory details of what C<ev_loop> does:
504 554
505 - Before the first iteration, call any pending watchers. 555 - Before the first iteration, call any pending watchers.
506 * If there are no active watchers (reference count is zero), return. 556 * If EVFLAG_FORKCHECK was used, check for a fork.
507 - 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.
508 - If we have been forked, recreate the kernel state. 559 - If we have been forked, recreate the kernel state.
509 - Update the kernel state with all outstanding changes. 560 - Update the kernel state with all outstanding changes.
510 - Update the "event loop time". 561 - Update the "event loop time".
511 - 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.
512 - Block the process, waiting for any events. 566 - Block the process, waiting for any events.
513 - Queue all outstanding I/O (fd) events. 567 - Queue all outstanding I/O (fd) events.
514 - Update the "event loop time" and do time jump handling. 568 - Update the "event loop time" and do time jump handling.
515 - Queue all outstanding timers. 569 - Queue all outstanding timers.
516 - Queue all outstanding periodics. 570 - Queue all outstanding periodics.
517 - If no events are pending now, queue all idle watchers. 571 - If no events are pending now, queue all idle watchers.
518 - Queue all check watchers. 572 - Queue all check watchers.
519 - 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).
520 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
521 be handled here by queueing them when their watcher gets executed. 575 be handled here by queueing them when their watcher gets executed.
522 - 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
523 were used, return, otherwise continue with step *. 577 were used, or there are no active watchers, return, otherwise
578 continue with step *.
524 579
525Example: Queue some jobs and then loop until no events are outsanding 580Example: Queue some jobs and then loop until no events are outstanding
526anymore. 581anymore.
527 582
528 ... queue jobs here, make sure they register event watchers as long 583 ... queue jobs here, make sure they register event watchers as long
529 ... as they still have work to do (even an idle watcher will do..) 584 ... as they still have work to do (even an idle watcher will do..)
530 ev_loop (my_loop, 0); 585 ev_loop (my_loop, 0);
534 589
535Can be used to make a call to C<ev_loop> return early (but only after it 590Can be used to make a call to C<ev_loop> return early (but only after it
536has processed all outstanding events). The C<how> argument must be either 591has processed all outstanding events). The C<how> argument must be either
537C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 592C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
538C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 593C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
594
595This "unloop state" will be cleared when entering C<ev_loop> again.
539 596
540=item ev_ref (loop) 597=item ev_ref (loop)
541 598
542=item ev_unref (loop) 599=item ev_unref (loop)
543 600
548returning, ev_unref() after starting, and ev_ref() before stopping it. For 605returning, ev_unref() after starting, and ev_ref() before stopping it. For
549example, libev itself uses this for its internal signal pipe: It is not 606example, libev itself uses this for its internal signal pipe: It is not
550visible to the libev user and should not keep C<ev_loop> from exiting if 607visible to the libev user and should not keep C<ev_loop> from exiting if
551no event watchers registered by it are active. It is also an excellent 608no event watchers registered by it are active. It is also an excellent
552way to do this for generic recurring timers or from within third-party 609way to do this for generic recurring timers or from within third-party
553libraries. Just remember to I<unref after start> and I<ref before stop>. 610libraries. Just remember to I<unref after start> and I<ref before stop>
611(but only if the watcher wasn't active before, or was active before,
612respectively).
554 613
555Example: Create a signal watcher, but keep it from keeping C<ev_loop> 614Example: Create a signal watcher, but keep it from keeping C<ev_loop>
556running when nothing else is active. 615running when nothing else is active.
557 616
558 struct ev_signal exitsig; 617 struct ev_signal exitsig;
562 621
563Example: For some weird reason, unregister the above signal handler again. 622Example: For some weird reason, unregister the above signal handler again.
564 623
565 ev_ref (loop); 624 ev_ref (loop);
566 ev_signal_stop (loop, &exitsig); 625 ev_signal_stop (loop, &exitsig);
626
627=item ev_set_io_collect_interval (loop, ev_tstamp interval)
628
629=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
630
631These advanced functions influence the time that libev will spend waiting
632for events. Both are by default C<0>, meaning that libev will try to
633invoke timer/periodic callbacks and I/O callbacks with minimum latency.
634
635Setting these to a higher value (the C<interval> I<must> be >= C<0>)
636allows libev to delay invocation of I/O and timer/periodic callbacks to
637increase efficiency of loop iterations.
638
639The background is that sometimes your program runs just fast enough to
640handle one (or very few) event(s) per loop iteration. While this makes
641the program responsive, it also wastes a lot of CPU time to poll for new
642events, especially with backends like C<select ()> which have a high
643overhead for the actual polling but can deliver many events at once.
644
645By setting a higher I<io collect interval> you allow libev to spend more
646time collecting I/O events, so you can handle more events per iteration,
647at the cost of increasing latency. Timeouts (both C<ev_periodic> and
648C<ev_timer>) will be not affected. Setting this to a non-null value will
649introduce an additional C<ev_sleep ()> call into most loop iterations.
650
651Likewise, by setting a higher I<timeout collect interval> you allow libev
652to spend more time collecting timeouts, at the expense of increased
653latency (the watcher callback will be called later). C<ev_io> watchers
654will not be affected. Setting this to a non-null value will not introduce
655any overhead in libev.
656
657Many (busy) programs can usually benefit by setting the io collect
658interval to a value near C<0.1> or so, which is often enough for
659interactive servers (of course not for games), likewise for timeouts. It
660usually doesn't make much sense to set it to a lower value than C<0.01>,
661as this approsaches the timing granularity of most systems.
567 662
568=back 663=back
569 664
570 665
571=head1 ANATOMY OF A WATCHER 666=head1 ANATOMY OF A WATCHER
897In general you can register as many read and/or write event watchers per 992In general you can register as many read and/or write event watchers per
898fd as you want (as long as you don't confuse yourself). Setting all file 993fd as you want (as long as you don't confuse yourself). Setting all file
899descriptors to non-blocking mode is also usually a good idea (but not 994descriptors to non-blocking mode is also usually a good idea (but not
900required if you know what you are doing). 995required if you know what you are doing).
901 996
902You have to be careful with dup'ed file descriptors, though. Some backends
903(the linux epoll backend is a notable example) cannot handle dup'ed file
904descriptors correctly if you register interest in two or more fds pointing
905to the same underlying file/socket/etc. description (that is, they share
906the same underlying "file open").
907
908If you must do this, then force the use of a known-to-be-good backend 997If you must do this, then force the use of a known-to-be-good backend
909(at the time of this writing, this includes only C<EVBACKEND_SELECT> and 998(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
910C<EVBACKEND_POLL>). 999C<EVBACKEND_POLL>).
911 1000
912Another thing you have to watch out for is that it is quite easy to 1001Another thing you have to watch out for is that it is quite easy to
924such as poll (fortunately in our Xlib example, Xlib already does this on 1013such as poll (fortunately in our Xlib example, Xlib already does this on
925its own, so its quite safe to use). 1014its own, so its quite safe to use).
926 1015
927=head3 The special problem of disappearing file descriptors 1016=head3 The special problem of disappearing file descriptors
928 1017
929Some backends (e.g kqueue, epoll) need to be told about closing a file 1018Some backends (e.g. kqueue, epoll) need to be told about closing a file
930descriptor (either by calling C<close> explicitly or by any other means, 1019descriptor (either by calling C<close> explicitly or by any other means,
931such as C<dup>). The reason is that you register interest in some file 1020such as C<dup>). The reason is that you register interest in some file
932descriptor, but when it goes away, the operating system will silently drop 1021descriptor, but when it goes away, the operating system will silently drop
933this interest. If another file descriptor with the same number then is 1022this interest. If another file descriptor with the same number then is
934registered with libev, there is no efficient way to see that this is, in 1023registered with libev, there is no efficient way to see that this is, in
943 1032
944This is how one would do it normally anyway, the important point is that 1033This is how one would do it normally anyway, the important point is that
945the libev application should not optimise around libev but should leave 1034the libev application should not optimise around libev but should leave
946optimisations to libev. 1035optimisations to libev.
947 1036
1037=head3 The special problem of dup'ed file descriptors
1038
1039Some backends (e.g. epoll), cannot register events for file descriptors,
1040but only events for the underlying file descriptions. That means when you
1041have C<dup ()>'ed file descriptors or weirder constellations, and register
1042events for them, only one file descriptor might actually receive events.
1043
1044There is no workaround possible except not registering events
1045for potentially C<dup ()>'ed file descriptors, or to resort to
1046C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1047
1048=head3 The special problem of fork
1049
1050Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1051useless behaviour. Libev fully supports fork, but needs to be told about
1052it in the child.
1053
1054To support fork in your programs, you either have to call
1055C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1056enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1057C<EVBACKEND_POLL>.
1058
948 1059
949=head3 Watcher-Specific Functions 1060=head3 Watcher-Specific Functions
950 1061
951=over 4 1062=over 4
952 1063
965=item int events [read-only] 1076=item int events [read-only]
966 1077
967The events being watched. 1078The events being watched.
968 1079
969=back 1080=back
1081
1082=head3 Examples
970 1083
971Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1084Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
972readable, but only once. Since it is likely line-buffered, you could 1085readable, but only once. Since it is likely line-buffered, you could
973attempt to read a whole line in the callback. 1086attempt to read a whole line in the callback.
974 1087
1072or C<ev_timer_again> is called and determines the next timeout (if any), 1185or C<ev_timer_again> is called and determines the next timeout (if any),
1073which is also when any modifications are taken into account. 1186which is also when any modifications are taken into account.
1074 1187
1075=back 1188=back
1076 1189
1190=head3 Examples
1191
1077Example: Create a timer that fires after 60 seconds. 1192Example: Create a timer that fires after 60 seconds.
1078 1193
1079 static void 1194 static void
1080 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1195 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1081 { 1196 {
1238When active, contains the absolute time that the watcher is supposed to 1353When active, contains the absolute time that the watcher is supposed to
1239trigger next. 1354trigger next.
1240 1355
1241=back 1356=back
1242 1357
1358=head3 Examples
1359
1243Example: Call a callback every hour, or, more precisely, whenever the 1360Example: Call a callback every hour, or, more precisely, whenever the
1244system clock is divisible by 3600. The callback invocation times have 1361system clock is divisible by 3600. The callback invocation times have
1245potentially a lot of jittering, but good long-term stability. 1362potentially a lot of jittering, but good long-term stability.
1246 1363
1247 static void 1364 static void
1338 1455
1339The process exit/trace status caused by C<rpid> (see your systems 1456The process exit/trace status caused by C<rpid> (see your systems
1340C<waitpid> and C<sys/wait.h> documentation for details). 1457C<waitpid> and C<sys/wait.h> documentation for details).
1341 1458
1342=back 1459=back
1460
1461=head3 Examples
1343 1462
1344Example: Try to exit cleanly on SIGINT and SIGTERM. 1463Example: Try to exit cleanly on SIGINT and SIGTERM.
1345 1464
1346 static void 1465 static void
1347 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1466 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1388semantics of C<ev_stat> watchers, which means that libev sometimes needs 1507semantics of C<ev_stat> watchers, which means that libev sometimes needs
1389to fall back to regular polling again even with inotify, but changes are 1508to fall back to regular polling again even with inotify, but changes are
1390usually detected immediately, and if the file exists there will be no 1509usually detected immediately, and if the file exists there will be no
1391polling. 1510polling.
1392 1511
1512=head3 Inotify
1513
1514When C<inotify (7)> support has been compiled into libev (generally only
1515available on Linux) and present at runtime, it will be used to speed up
1516change detection where possible. The inotify descriptor will be created lazily
1517when the first C<ev_stat> watcher is being started.
1518
1519Inotify presense does not change the semantics of C<ev_stat> watchers
1520except that changes might be detected earlier, and in some cases, to avoid
1521making regular C<stat> calls. Even in the presense of inotify support
1522there are many cases where libev has to resort to regular C<stat> polling.
1523
1524(There is no support for kqueue, as apparently it cannot be used to
1525implement this functionality, due to the requirement of having a file
1526descriptor open on the object at all times).
1527
1528=head3 The special problem of stat time resolution
1529
1530The C<stat ()> syscall only supports full-second resolution portably, and
1531even on systems where the resolution is higher, many filesystems still
1532only support whole seconds.
1533
1534That means that, if the time is the only thing that changes, you might
1535miss updates: on the first update, C<ev_stat> detects a change and calls
1536your callback, which does something. When there is another update within
1537the same second, C<ev_stat> will be unable to detect it.
1538
1539The solution to this is to delay acting on a change for a second (or till
1540the next second boundary), using a roughly one-second delay C<ev_timer>
1541(C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01>
1542is added to work around small timing inconsistencies of some operating
1543systems.
1544
1393=head3 Watcher-Specific Functions and Data Members 1545=head3 Watcher-Specific Functions and Data Members
1394 1546
1395=over 4 1547=over 4
1396 1548
1397=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) 1549=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1434=item const char *path [read-only] 1586=item const char *path [read-only]
1435 1587
1436The filesystem path that is being watched. 1588The filesystem path that is being watched.
1437 1589
1438=back 1590=back
1591
1592=head3 Examples
1439 1593
1440Example: Watch C</etc/passwd> for attribute changes. 1594Example: Watch C</etc/passwd> for attribute changes.
1441 1595
1442 static void 1596 static void
1443 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) 1597 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1456 } 1610 }
1457 1611
1458 ... 1612 ...
1459 ev_stat passwd; 1613 ev_stat passwd;
1460 1614
1461 ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); 1615 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1462 ev_stat_start (loop, &passwd); 1616 ev_stat_start (loop, &passwd);
1617
1618Example: Like above, but additionally use a one-second delay so we do not
1619miss updates (however, frequent updates will delay processing, too, so
1620one might do the work both on C<ev_stat> callback invocation I<and> on
1621C<ev_timer> callback invocation).
1622
1623 static ev_stat passwd;
1624 static ev_timer timer;
1625
1626 static void
1627 timer_cb (EV_P_ ev_timer *w, int revents)
1628 {
1629 ev_timer_stop (EV_A_ w);
1630
1631 /* now it's one second after the most recent passwd change */
1632 }
1633
1634 static void
1635 stat_cb (EV_P_ ev_stat *w, int revents)
1636 {
1637 /* reset the one-second timer */
1638 ev_timer_again (EV_A_ &timer);
1639 }
1640
1641 ...
1642 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1643 ev_stat_start (loop, &passwd);
1644 ev_timer_init (&timer, timer_cb, 0., 1.01);
1463 1645
1464 1646
1465=head2 C<ev_idle> - when you've got nothing better to do... 1647=head2 C<ev_idle> - when you've got nothing better to do...
1466 1648
1467Idle watchers trigger events when no other events of the same or higher 1649Idle watchers trigger events when no other events of the same or higher
1492Initialises and configures the idle watcher - it has no parameters of any 1674Initialises and configures the idle watcher - it has no parameters of any
1493kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, 1675kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1494believe me. 1676believe me.
1495 1677
1496=back 1678=back
1679
1680=head3 Examples
1497 1681
1498Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the 1682Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1499callback, free it. Also, use no error checking, as usual. 1683callback, free it. Also, use no error checking, as usual.
1500 1684
1501 static void 1685 static void
1553 1737
1554It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 1738It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1555priority, to ensure that they are being run before any other watchers 1739priority, to ensure that they are being run before any other watchers
1556after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers, 1740after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1557too) should not activate ("feed") events into libev. While libev fully 1741too) should not activate ("feed") events into libev. While libev fully
1558supports this, they will be called before other C<ev_check> watchers did 1742supports this, they will be called before other C<ev_check> watchers
1559their job. As C<ev_check> watchers are often used to embed other event 1743did their job. As C<ev_check> watchers are often used to embed other
1560loops those other event loops might be in an unusable state until their 1744(non-libev) event loops those other event loops might be in an unusable
1561C<ev_check> watcher ran (always remind yourself to coexist peacefully with 1745state until their C<ev_check> watcher ran (always remind yourself to
1562others). 1746coexist peacefully with others).
1563 1747
1564=head3 Watcher-Specific Functions and Data Members 1748=head3 Watcher-Specific Functions and Data Members
1565 1749
1566=over 4 1750=over 4
1567 1751
1572Initialises and configures the prepare or check watcher - they have no 1756Initialises and configures the prepare or check watcher - they have no
1573parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 1757parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1574macros, but using them is utterly, utterly and completely pointless. 1758macros, but using them is utterly, utterly and completely pointless.
1575 1759
1576=back 1760=back
1761
1762=head3 Examples
1577 1763
1578There are a number of principal ways to embed other event loops or modules 1764There are a number of principal ways to embed other event loops or modules
1579into libev. Here are some ideas on how to include libadns into libev 1765into libev. Here are some ideas on how to include libadns into libev
1580(there is a Perl module named C<EV::ADNS> that does this, which you could 1766(there is a Perl module named C<EV::ADNS> that does this, which you could
1581use for an actually working example. Another Perl module named C<EV::Glib> 1767use for an actually working example. Another Perl module named C<EV::Glib>
1750portable one. 1936portable one.
1751 1937
1752So when you want to use this feature you will always have to be prepared 1938So when you want to use this feature you will always have to be prepared
1753that you cannot get an embeddable loop. The recommended way to get around 1939that you cannot get an embeddable loop. The recommended way to get around
1754this is to have a separate variables for your embeddable loop, try to 1940this is to have a separate variables for your embeddable loop, try to
1755create it, and if that fails, use the normal loop for everything: 1941create it, and if that fails, use the normal loop for everything.
1942
1943=head3 Watcher-Specific Functions and Data Members
1944
1945=over 4
1946
1947=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1948
1949=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1950
1951Configures the watcher to embed the given loop, which must be
1952embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1953invoked automatically, otherwise it is the responsibility of the callback
1954to invoke it (it will continue to be called until the sweep has been done,
1955if you do not want thta, you need to temporarily stop the embed watcher).
1956
1957=item ev_embed_sweep (loop, ev_embed *)
1958
1959Make a single, non-blocking sweep over the embedded loop. This works
1960similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1961apropriate way for embedded loops.
1962
1963=item struct ev_loop *other [read-only]
1964
1965The embedded event loop.
1966
1967=back
1968
1969=head3 Examples
1970
1971Example: Try to get an embeddable event loop and embed it into the default
1972event loop. If that is not possible, use the default loop. The default
1973loop is stored in C<loop_hi>, while the mebeddable loop is stored in
1974C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be
1975used).
1756 1976
1757 struct ev_loop *loop_hi = ev_default_init (0); 1977 struct ev_loop *loop_hi = ev_default_init (0);
1758 struct ev_loop *loop_lo = 0; 1978 struct ev_loop *loop_lo = 0;
1759 struct ev_embed embed; 1979 struct ev_embed embed;
1760 1980
1771 ev_embed_start (loop_hi, &embed); 1991 ev_embed_start (loop_hi, &embed);
1772 } 1992 }
1773 else 1993 else
1774 loop_lo = loop_hi; 1994 loop_lo = loop_hi;
1775 1995
1776=head3 Watcher-Specific Functions and Data Members 1996Example: Check if kqueue is available but not recommended and create
1997a kqueue backend for use with sockets (which usually work with any
1998kqueue implementation). Store the kqueue/socket-only event loop in
1999C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
1777 2000
1778=over 4 2001 struct ev_loop *loop = ev_default_init (0);
2002 struct ev_loop *loop_socket = 0;
2003 struct ev_embed embed;
2004
2005 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2006 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2007 {
2008 ev_embed_init (&embed, 0, loop_socket);
2009 ev_embed_start (loop, &embed);
2010 }
1779 2011
1780=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 2012 if (!loop_socket)
2013 loop_socket = loop;
1781 2014
1782=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 2015 // now use loop_socket for all sockets, and loop for everything else
1783
1784Configures the watcher to embed the given loop, which must be
1785embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1786invoked automatically, otherwise it is the responsibility of the callback
1787to invoke it (it will continue to be called until the sweep has been done,
1788if you do not want thta, you need to temporarily stop the embed watcher).
1789
1790=item ev_embed_sweep (loop, ev_embed *)
1791
1792Make a single, non-blocking sweep over the embedded loop. This works
1793similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1794apropriate way for embedded loops.
1795
1796=item struct ev_loop *loop [read-only]
1797
1798The embedded event loop.
1799
1800=back
1801 2016
1802 2017
1803=head2 C<ev_fork> - the audacity to resume the event loop after a fork 2018=head2 C<ev_fork> - the audacity to resume the event loop after a fork
1804 2019
1805Fork watchers are called when a C<fork ()> was detected (usually because 2020Fork watchers are called when a C<fork ()> was detected (usually because
2140Libev can (and often is) directly embedded into host 2355Libev can (and often is) directly embedded into host
2141applications. Examples of applications that embed it include the Deliantra 2356applications. Examples of applications that embed it include the Deliantra
2142Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2357Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2143and rxvt-unicode. 2358and rxvt-unicode.
2144 2359
2145The goal is to enable you to just copy the neecssary files into your 2360The goal is to enable you to just copy the necessary files into your
2146source directory without having to change even a single line in them, so 2361source directory without having to change even a single line in them, so
2147you can easily upgrade by simply copying (or having a checked-out copy of 2362you can easily upgrade by simply copying (or having a checked-out copy of
2148libev somewhere in your source tree). 2363libev somewhere in your source tree).
2149 2364
2150=head2 FILESETS 2365=head2 FILESETS
2240 2455
2241If defined to be C<1>, libev will try to detect the availability of the 2456If defined to be C<1>, libev will try to detect the availability of the
2242monotonic clock option at both compiletime and runtime. Otherwise no use 2457monotonic clock option at both compiletime and runtime. Otherwise no use
2243of the monotonic clock option will be attempted. If you enable this, you 2458of the monotonic clock option will be attempted. If you enable this, you
2244usually have to link against librt or something similar. Enabling it when 2459usually have to link against librt or something similar. Enabling it when
2245the functionality isn't available is safe, though, althoguh you have 2460the functionality isn't available is safe, though, although you have
2246to make sure you link against any libraries where the C<clock_gettime> 2461to make sure you link against any libraries where the C<clock_gettime>
2247function is hiding in (often F<-lrt>). 2462function is hiding in (often F<-lrt>).
2248 2463
2249=item EV_USE_REALTIME 2464=item EV_USE_REALTIME
2250 2465
2251If defined to be C<1>, libev will try to detect the availability of the 2466If defined to be C<1>, libev will try to detect the availability of the
2252realtime clock option at compiletime (and assume its availability at 2467realtime clock option at compiletime (and assume its availability at
2253runtime if successful). Otherwise no use of the realtime clock option will 2468runtime if successful). Otherwise no use of the realtime clock option will
2254be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2469be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2255(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2470(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2256in the description of C<EV_USE_MONOTONIC>, though. 2471note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2472
2473=item EV_USE_NANOSLEEP
2474
2475If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2476and will use it for delays. Otherwise it will use C<select ()>.
2257 2477
2258=item EV_USE_SELECT 2478=item EV_USE_SELECT
2259 2479
2260If undefined or defined to be C<1>, libev will compile in support for the 2480If undefined or defined to be C<1>, libev will compile in support for the
2261C<select>(2) backend. No attempt at autodetection will be done: if no 2481C<select>(2) backend. No attempt at autodetection will be done: if no
2279wants osf handles on win32 (this is the case when the select to 2499wants osf handles on win32 (this is the case when the select to
2280be used is the winsock select). This means that it will call 2500be used is the winsock select). This means that it will call
2281C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 2501C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2282it is assumed that all these functions actually work on fds, even 2502it is assumed that all these functions actually work on fds, even
2283on win32. Should not be defined on non-win32 platforms. 2503on win32. Should not be defined on non-win32 platforms.
2504
2505=item EV_FD_TO_WIN32_HANDLE
2506
2507If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
2508file descriptors to socket handles. When not defining this symbol (the
2509default), then libev will call C<_get_osfhandle>, which is usually
2510correct. In some cases, programs use their own file descriptor management,
2511in which case they can provide this function to map fds to socket handles.
2284 2512
2285=item EV_USE_POLL 2513=item EV_USE_POLL
2286 2514
2287If defined to be C<1>, libev will compile in support for the C<poll>(2) 2515If defined to be C<1>, libev will compile in support for the C<poll>(2)
2288backend. Otherwise it will be enabled on non-win32 platforms. It 2516backend. Otherwise it will be enabled on non-win32 platforms. It
2325be detected at runtime. 2553be detected at runtime.
2326 2554
2327=item EV_H 2555=item EV_H
2328 2556
2329The name of the F<ev.h> header file used to include it. The default if 2557The name of the F<ev.h> header file used to include it. The default if
2330undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This 2558undefined is C<"ev.h"> in F<event.h> and F<ev.c>. This can be used to
2331can be used to virtually rename the F<ev.h> header file in case of conflicts. 2559virtually rename the F<ev.h> header file in case of conflicts.
2332 2560
2333=item EV_CONFIG_H 2561=item EV_CONFIG_H
2334 2562
2335If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 2563If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2336F<ev.c>'s idea of where to find the F<config.h> file, similarly to 2564F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2337C<EV_H>, above. 2565C<EV_H>, above.
2338 2566
2339=item EV_EVENT_H 2567=item EV_EVENT_H
2340 2568
2341Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 2569Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2342of how the F<event.h> header can be found. 2570of how the F<event.h> header can be found, the dfeault is C<"event.h">.
2343 2571
2344=item EV_PROTOTYPES 2572=item EV_PROTOTYPES
2345 2573
2346If defined to be C<0>, then F<ev.h> will not define any function 2574If defined to be C<0>, then F<ev.h> will not define any function
2347prototypes, but still define all the structs and other symbols. This is 2575prototypes, but still define all the structs and other symbols. This is
2413than enough. If you need to manage thousands of children you might want to 2641than enough. If you need to manage thousands of children you might want to
2414increase this value (I<must> be a power of two). 2642increase this value (I<must> be a power of two).
2415 2643
2416=item EV_INOTIFY_HASHSIZE 2644=item EV_INOTIFY_HASHSIZE
2417 2645
2418C<ev_staz> watchers use a small hash table to distribute workload by 2646C<ev_stat> watchers use a small hash table to distribute workload by
2419inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 2647inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2420usually more than enough. If you need to manage thousands of C<ev_stat> 2648usually more than enough. If you need to manage thousands of C<ev_stat>
2421watchers you might want to increase this value (I<must> be a power of 2649watchers you might want to increase this value (I<must> be a power of
2422two). 2650two).
2423 2651
2440 2668
2441=item ev_set_cb (ev, cb) 2669=item ev_set_cb (ev, cb)
2442 2670
2443Can be used to change the callback member declaration in each watcher, 2671Can be used to change the callback member declaration in each watcher,
2444and the way callbacks are invoked and set. Must expand to a struct member 2672and the way callbacks are invoked and set. Must expand to a struct member
2445definition and a statement, respectively. See the F<ev.v> header file for 2673definition and a statement, respectively. See the F<ev.h> header file for
2446their default definitions. One possible use for overriding these is to 2674their default definitions. One possible use for overriding these is to
2447avoid the C<struct ev_loop *> as first argument in all cases, or to use 2675avoid the C<struct ev_loop *> as first argument in all cases, or to use
2448method calls instead of plain function calls in C++. 2676method calls instead of plain function calls in C++.
2677
2678=head2 EXPORTED API SYMBOLS
2679
2680If you need to re-export the API (e.g. via a dll) and you need a list of
2681exported symbols, you can use the provided F<Symbol.*> files which list
2682all public symbols, one per line:
2683
2684 Symbols.ev for libev proper
2685 Symbols.event for the libevent emulation
2686
2687This can also be used to rename all public symbols to avoid clashes with
2688multiple versions of libev linked together (which is obviously bad in
2689itself, but sometimes it is inconvinient to avoid this).
2690
2691A sed command like this will create wrapper C<#define>'s that you need to
2692include before including F<ev.h>:
2693
2694 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2695
2696This would create a file F<wrap.h> which essentially looks like this:
2697
2698 #define ev_backend myprefix_ev_backend
2699 #define ev_check_start myprefix_ev_check_start
2700 #define ev_check_stop myprefix_ev_check_stop
2701 ...
2449 2702
2450=head2 EXAMPLES 2703=head2 EXAMPLES
2451 2704
2452For a real-world example of a program the includes libev 2705For a real-world example of a program the includes libev
2453verbatim, you can have a look at the EV perl module 2706verbatim, you can have a look at the EV perl module
2494 2747
2495=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2748=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2496 2749
2497This means that, when you have a watcher that triggers in one hour and 2750This means that, when you have a watcher that triggers in one hour and
2498there are 100 watchers that would trigger before that then inserting will 2751there are 100 watchers that would trigger before that then inserting will
2499have to skip those 100 watchers. 2752have to skip roughly seven (C<ld 100>) of these watchers.
2500 2753
2501=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2754=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2502 2755
2503That means that for changing a timer costs less than removing/adding them 2756That means that changing a timer costs less than removing/adding them
2504as only the relative motion in the event queue has to be paid for. 2757as only the relative motion in the event queue has to be paid for.
2505 2758
2506=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2759=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2507 2760
2508These just add the watcher into an array or at the head of a list. 2761These just add the watcher into an array or at the head of a list.
2762
2509=item Stopping check/prepare/idle watchers: O(1) 2763=item Stopping check/prepare/idle watchers: O(1)
2510 2764
2511=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 2765=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2512 2766
2513These watchers are stored in lists then need to be walked to find the 2767These watchers are stored in lists then need to be walked to find the
2514correct watcher to remove. The lists are usually short (you don't usually 2768correct watcher to remove. The lists are usually short (you don't usually
2515have many watchers waiting for the same fd or signal). 2769have many watchers waiting for the same fd or signal).
2516 2770
2517=item Finding the next timer per loop iteration: O(1) 2771=item Finding the next timer in each loop iteration: O(1)
2772
2773By virtue of using a binary heap, the next timer is always found at the
2774beginning of the storage array.
2518 2775
2519=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2776=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2520 2777
2521A change means an I/O watcher gets started or stopped, which requires 2778A change means an I/O watcher gets started or stopped, which requires
2522libev to recalculate its status (and possibly tell the kernel). 2779libev to recalculate its status (and possibly tell the kernel, depending
2780on backend and wether C<ev_io_set> was used).
2523 2781
2524=item Activating one watcher: O(1) 2782=item Activating one watcher (putting it into the pending state): O(1)
2525 2783
2526=item Priority handling: O(number_of_priorities) 2784=item Priority handling: O(number_of_priorities)
2527 2785
2528Priorities are implemented by allocating some space for each 2786Priorities are implemented by allocating some space for each
2529priority. When doing priority-based operations, libev usually has to 2787priority. When doing priority-based operations, libev usually has to
2530linearly search all the priorities. 2788linearly search all the priorities, but starting/stopping and activating
2789watchers becomes O(1) w.r.t. prioritiy handling.
2531 2790
2532=back 2791=back
2533 2792
2534 2793
2794=head1 Win32 platform limitations and workarounds
2795
2796Win32 doesn't support any of the standards (e.g. POSIX) that libev
2797requires, and its I/O model is fundamentally incompatible with the POSIX
2798model. Libev still offers limited functionality on this platform in
2799the form of the C<EVBACKEND_SELECT> backend, and only supports socket
2800descriptors. This only applies when using Win32 natively, not when using
2801e.g. cygwin.
2802
2803There is no supported compilation method available on windows except
2804embedding it into other applications.
2805
2806Due to the many, low, and arbitrary limits on the win32 platform and the
2807abysmal performance of winsockets, using a large number of sockets is not
2808recommended (and not reasonable). If your program needs to use more than
2809a hundred or so sockets, then likely it needs to use a totally different
2810implementation for windows, as libev offers the POSIX model, which cannot
2811be implemented efficiently on windows (microsoft monopoly games).
2812
2813=over 4
2814
2815=item The winsocket select function
2816
2817The winsocket C<select> function doesn't follow POSIX in that it requires
2818socket I<handles> and not socket I<file descriptors>. This makes select
2819very inefficient, and also requires a mapping from file descriptors
2820to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>,
2821C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor
2822symbols for more info.
2823
2824The configuration for a "naked" win32 using the microsoft runtime
2825libraries and raw winsocket select is:
2826
2827 #define EV_USE_SELECT 1
2828 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
2829
2830Note that winsockets handling of fd sets is O(n), so you can easily get a
2831complexity in the O(n²) range when using win32.
2832
2833=item Limited number of file descriptors
2834
2835Windows has numerous arbitrary (and low) limits on things. Early versions
2836of winsocket's select only supported waiting for a max. of C<64> handles
2837(probably owning to the fact that all windows kernels can only wait for
2838C<64> things at the same time internally; microsoft recommends spawning a
2839chain of threads and wait for 63 handles and the previous thread in each).
2840
2841Newer versions support more handles, but you need to define C<FD_SETSIZE>
2842to some high number (e.g. C<2048>) before compiling the winsocket select
2843call (which might be in libev or elsewhere, for example, perl does its own
2844select emulation on windows).
2845
2846Another limit is the number of file descriptors in the microsoft runtime
2847libraries, which by default is C<64> (there must be a hidden I<64> fetish
2848or something like this inside microsoft). You can increase this by calling
2849C<_setmaxstdio>, which can increase this limit to C<2048> (another
2850arbitrary limit), but is broken in many versions of the microsoft runtime
2851libraries.
2852
2853This might get you to about C<512> or C<2048> sockets (depending on
2854windows version and/or the phase of the moon). To get more, you need to
2855wrap all I/O functions and provide your own fd management, but the cost of
2856calling select (O(n²)) will likely make this unworkable.
2857
2858=back
2859
2860
2535=head1 AUTHOR 2861=head1 AUTHOR
2536 2862
2537Marc Lehmann <libev@schmorp.de>. 2863Marc Lehmann <libev@schmorp.de>.
2538 2864

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines