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.121 by root, Mon Jan 28 12:13:54 2008 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.
249flags. If that is troubling you, check C<ev_backend ()> afterwards). 260flags. If that is troubling you, check C<ev_backend ()> afterwards).
250 261
251If you don't know what event loop to use, use the one returned from this 262If you don't know what event loop to use, use the one returned from this
252function. 263function.
253 264
265The default loop is the only loop that can handle C<ev_signal> and
266C<ev_child> watchers, and to do this, it always registers a handler
267for C<SIGCHLD>. If this is a problem for your app you can either
268create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
269can simply overwrite the C<SIGCHLD> signal handler I<after> calling
270C<ev_default_init>.
271
254The flags argument can be used to specify special behaviour or specific 272The flags argument can be used to specify special behaviour or specific
255backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). 273backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
256 274
257The following flags are supported: 275The following flags are supported:
258 276
295=item C<EVBACKEND_SELECT> (value 1, portable select backend) 313=item C<EVBACKEND_SELECT> (value 1, portable select backend)
296 314
297This is your standard select(2) backend. Not I<completely> standard, as 315This 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, 316libev 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 317but 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 318using this backend. It doesn't scale too well (O(highest_fd)), but its
301the fastest backend for a low number of fds. 319usually the fastest backend for a low number of (low-numbered :) fds.
320
321To get good performance out of this backend you need a high amount of
322parallelity (most of the file descriptors should be busy). If you are
323writing a server, you should C<accept ()> in a loop to accept as many
324connections as possible during one iteration. You might also want to have
325a look at C<ev_set_io_collect_interval ()> to increase the amount of
326readyness notifications you get per iteration.
302 327
303=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) 328=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
304 329
305And this is your standard poll(2) backend. It's more complicated than 330And this is your standard poll(2) backend. It's more complicated
306select, but handles sparse fds better and has no artificial limit on the 331than select, but handles sparse fds better and has no artificial
307number of fds you can use (except it will slow down considerably with a 332limit 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). 333considerably with a lot of inactive fds). It scales similarly to select,
334i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
335performance tips.
309 336
310=item C<EVBACKEND_EPOLL> (value 4, Linux) 337=item C<EVBACKEND_EPOLL> (value 4, Linux)
311 338
312For few fds, this backend is a bit little slower than poll and select, 339For 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 340but 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 341like O(total_fds) where n is the total number of fds (or the highest fd),
315either O(1) or O(active_fds). 342epoll scales either O(1) or O(active_fds). The epoll design has a number
343of shortcomings, such as silently dropping events in some hard-to-detect
344cases and rewiring a syscall per fd change, no fork support and bad
345support for dup.
316 346
317While stopping and starting an I/O watcher in the same iteration will 347While stopping, setting and starting an I/O watcher in the same iteration
318result in some caching, there is still a syscall per such incident 348will 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 349(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 350best to avoid that. Also, C<dup ()>'ed file descriptors might not work
321well if you register events for both fds. 351very well if you register events for both fds.
322 352
323Please note that epoll sometimes generates spurious notifications, so you 353Please 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 354need to use non-blocking I/O or other means to avoid blocking when no data
325(or space) is available. 355(or space) is available.
326 356
357Best performance from this backend is achieved by not unregistering all
358watchers for a file descriptor until it has been closed, if possible, i.e.
359keep at least one watcher active per fd at all times.
360
361While nominally embeddeble in other event loops, this feature is broken in
362all kernel versions tested so far.
363
327=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 364=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
328 365
329Kqueue deserves special mention, as at the time of this writing, it 366Kqueue deserves special mention, as at the time of this writing, it
330was broken on all BSDs except NetBSD (usually it doesn't work with 367was broken on all BSDs except NetBSD (usually it doesn't work reliably
331anything but sockets and pipes, except on Darwin, where of course its 368with anything but sockets and pipes, except on Darwin, where of course
332completely useless). For this reason its not being "autodetected" 369it's completely useless). For this reason it's not being "autodetected"
333unless you explicitly specify it explicitly in the flags (i.e. using 370unless you explicitly specify it explicitly in the flags (i.e. using
334C<EVBACKEND_KQUEUE>). 371C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
372system like NetBSD.
373
374You still can embed kqueue into a normal poll or select backend and use it
375only for sockets (after having made sure that sockets work with kqueue on
376the target platform). See C<ev_embed> watchers for more info.
335 377
336It scales in the same way as the epoll backend, but the interface to the 378It 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 379kernel is more efficient (which says nothing about its actual speed, of
338course). While starting and stopping an I/O watcher does not cause an 380course). 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 381cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
340incident, so its best to avoid that. 382two event changes per incident, support for C<fork ()> is very bad and it
383drops fds silently in similarly hard-to-detect cases.
384
385This backend usually performs well under most conditions.
386
387While nominally embeddable in other event loops, this doesn't work
388everywhere, so you might need to test for this. And since it is broken
389almost everywhere, you should only use it when you have a lot of sockets
390(for which it usually works), by embedding it into another event loop
391(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for
392sockets.
341 393
342=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 394=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
343 395
344This is not implemented yet (and might never be). 396This is not implemented yet (and might never be, unless you send me an
397implementation). According to reports, C</dev/poll> only supports sockets
398and is not embeddable, which would limit the usefulness of this backend
399immensely.
345 400
346=item C<EVBACKEND_PORT> (value 32, Solaris 10) 401=item C<EVBACKEND_PORT> (value 32, Solaris 10)
347 402
348This uses the Solaris 10 port mechanism. As with everything on Solaris, 403This 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)). 404it's really slow, but it still scales very well (O(active_fds)).
350 405
351Please note that solaris ports can result in a lot of spurious 406Please 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 407notifications, so you need to use non-blocking I/O or other means to avoid
353blocking when no data (or space) is available. 408blocking when no data (or space) is available.
409
410While this backend scales well, it requires one system call per active
411file descriptor per loop iteration. For small and medium numbers of file
412descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
413might perform better.
414
415On the positive side, ignoring the spurious readyness notifications, this
416backend actually performed to specification in all tests and is fully
417embeddable, which is a rare feat among the OS-specific backends.
354 418
355=item C<EVBACKEND_ALL> 419=item C<EVBACKEND_ALL>
356 420
357Try all backends (even potentially broken ones that wouldn't be tried 421Try 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 422with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
359C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 423C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
360 424
425It is definitely not recommended to use this flag.
426
361=back 427=back
362 428
363If one or more of these are ored into the flags value, then only these 429If 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 430backends will be tried (in the reverse order as listed here). If none are
365specified, most compiled-in backend will be tried, usually in reverse 431specified, all backends in C<ev_recommended_backends ()> will be tried.
366order of their flag values :)
367 432
368The most typical usage is like this: 433The most typical usage is like this:
369 434
370 if (!ev_default_loop (0)) 435 if (!ev_default_loop (0))
371 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 436 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
399Destroys the default loop again (frees all memory and kernel state 464Destroys the default loop again (frees all memory and kernel state
400etc.). None of the active event watchers will be stopped in the normal 465etc.). 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 466sense, so e.g. C<ev_is_active> might still return true. It is your
402responsibility to either stop all watchers cleanly yoursef I<before> 467responsibility to either stop all watchers cleanly yoursef I<before>
403calling this function, or cope with the fact afterwards (which is usually 468calling 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 469the easiest thing, you can just ignore the watchers and/or C<free ()> them
405for example). 470for example).
471
472Note that certain global state, such as signal state, will not be freed by
473this function, and related watchers (such as signal and child watchers)
474would need to be stopped manually.
475
476In general it is not advisable to call this function except in the
477rare occasion where you really need to free e.g. the signal handling
478pipe fds. If you need dynamically allocated loops it is better to use
479C<ev_loop_new> and C<ev_loop_destroy>).
406 480
407=item ev_loop_destroy (loop) 481=item ev_loop_destroy (loop)
408 482
409Like C<ev_default_destroy>, but destroys an event loop created by an 483Like C<ev_default_destroy>, but destroys an event loop created by an
410earlier call to C<ev_loop_new>. 484earlier call to C<ev_loop_new>.
411 485
412=item ev_default_fork () 486=item ev_default_fork ()
413 487
488This function sets a flag that causes subsequent C<ev_loop> iterations
414This function reinitialises the kernel state for backends that have 489to reinitialise the kernel state for backends that have one. Despite the
415one. Despite the name, you can call it anytime, but it makes most sense 490name, you can call it anytime, but it makes most sense after forking, in
416after forking, in either the parent or child process (or both, but that 491the child process (or both child and parent, but that again makes little
417again makes little sense). 492sense). You I<must> call it in the child before using any of the libev
493functions, and it will only take effect at the next C<ev_loop> iteration.
418 494
419You I<must> call this function in the child process after forking if and 495On the other hand, you only need to call this function in the child
420only if you want to use the event library in both processes. If you just 496process if and only if you want to use the event library in the child. If
421fork+exec, you don't have to call it. 497you just fork+exec, you don't have to call it at all.
422 498
423The function itself is quite fast and it's usually not a problem to call 499The function itself is quite fast and it's usually not a problem to call
424it just in case after a fork. To make this easy, the function will fit in 500it just in case after a fork. To make this easy, the function will fit in
425quite nicely into a call to C<pthread_atfork>: 501quite nicely into a call to C<pthread_atfork>:
426 502
427 pthread_atfork (0, 0, ev_default_fork); 503 pthread_atfork (0, 0, ev_default_fork);
428
429At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
430without calling this function, so if you force one of those backends you
431do not need to care.
432 504
433=item ev_loop_fork (loop) 505=item ev_loop_fork (loop)
434 506
435Like C<ev_default_fork>, but acts on an event loop created by 507Like C<ev_default_fork>, but acts on an event loop created by
436C<ev_loop_new>. Yes, you have to call this on every allocated event loop 508C<ev_loop_new>. Yes, you have to call this on every allocated event loop
455 527
456Returns the current "event loop time", which is the time the event loop 528Returns the current "event loop time", which is the time the event loop
457received events and started processing them. This timestamp does not 529received events and started processing them. This timestamp does not
458change as long as callbacks are being processed, and this is also the base 530change 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 531time used for relative timers. You can treat it as the timestamp of the
460event occuring (or more correctly, libev finding out about it). 532event occurring (or more correctly, libev finding out about it).
461 533
462=item ev_loop (loop, int flags) 534=item ev_loop (loop, int flags)
463 535
464Finally, this is it, the event handler. This function usually is called 536Finally, this is it, the event handler. This function usually is called
465after you initialised all your watchers and you want to start handling 537after you initialised all your watchers and you want to start handling
487usually a better approach for this kind of thing. 559usually a better approach for this kind of thing.
488 560
489Here are the gory details of what C<ev_loop> does: 561Here are the gory details of what C<ev_loop> does:
490 562
491 - Before the first iteration, call any pending watchers. 563 - Before the first iteration, call any pending watchers.
492 * If there are no active watchers (reference count is zero), return. 564 * If EVFLAG_FORKCHECK was used, check for a fork.
493 - Queue all prepare watchers and then call all outstanding watchers. 565 - If a fork was detected, queue and call all fork watchers.
566 - Queue and call all prepare watchers.
494 - If we have been forked, recreate the kernel state. 567 - If we have been forked, recreate the kernel state.
495 - Update the kernel state with all outstanding changes. 568 - Update the kernel state with all outstanding changes.
496 - Update the "event loop time". 569 - Update the "event loop time".
497 - Calculate for how long to block. 570 - Calculate for how long to sleep or block, if at all
571 (active idle watchers, EVLOOP_NONBLOCK or not having
572 any active watchers at all will result in not sleeping).
573 - Sleep if the I/O and timer collect interval say so.
498 - Block the process, waiting for any events. 574 - Block the process, waiting for any events.
499 - Queue all outstanding I/O (fd) events. 575 - Queue all outstanding I/O (fd) events.
500 - Update the "event loop time" and do time jump handling. 576 - Update the "event loop time" and do time jump handling.
501 - Queue all outstanding timers. 577 - Queue all outstanding timers.
502 - Queue all outstanding periodics. 578 - Queue all outstanding periodics.
503 - If no events are pending now, queue all idle watchers. 579 - If no events are pending now, queue all idle watchers.
504 - Queue all check watchers. 580 - Queue all check watchers.
505 - Call all queued watchers in reverse order (i.e. check watchers first). 581 - 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 582 Signals and child watchers are implemented as I/O watchers, and will
507 be handled here by queueing them when their watcher gets executed. 583 be handled here by queueing them when their watcher gets executed.
508 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 584 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
509 were used, return, otherwise continue with step *. 585 were used, or there are no active watchers, return, otherwise
586 continue with step *.
510 587
511Example: Queue some jobs and then loop until no events are outsanding 588Example: Queue some jobs and then loop until no events are outstanding
512anymore. 589anymore.
513 590
514 ... queue jobs here, make sure they register event watchers as long 591 ... queue jobs here, make sure they register event watchers as long
515 ... as they still have work to do (even an idle watcher will do..) 592 ... as they still have work to do (even an idle watcher will do..)
516 ev_loop (my_loop, 0); 593 ev_loop (my_loop, 0);
520 597
521Can be used to make a call to C<ev_loop> return early (but only after it 598Can be used to make a call to C<ev_loop> return early (but only after it
522has processed all outstanding events). The C<how> argument must be either 599has processed all outstanding events). The C<how> argument must be either
523C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 600C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
524C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 601C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
602
603This "unloop state" will be cleared when entering C<ev_loop> again.
525 604
526=item ev_ref (loop) 605=item ev_ref (loop)
527 606
528=item ev_unref (loop) 607=item ev_unref (loop)
529 608
534returning, ev_unref() after starting, and ev_ref() before stopping it. For 613returning, ev_unref() after starting, and ev_ref() before stopping it. For
535example, libev itself uses this for its internal signal pipe: It is not 614example, libev itself uses this for its internal signal pipe: It is not
536visible to the libev user and should not keep C<ev_loop> from exiting if 615visible to the libev user and should not keep C<ev_loop> from exiting if
537no event watchers registered by it are active. It is also an excellent 616no event watchers registered by it are active. It is also an excellent
538way to do this for generic recurring timers or from within third-party 617way to do this for generic recurring timers or from within third-party
539libraries. Just remember to I<unref after start> and I<ref before stop>. 618libraries. Just remember to I<unref after start> and I<ref before stop>
619(but only if the watcher wasn't active before, or was active before,
620respectively).
540 621
541Example: Create a signal watcher, but keep it from keeping C<ev_loop> 622Example: Create a signal watcher, but keep it from keeping C<ev_loop>
542running when nothing else is active. 623running when nothing else is active.
543 624
544 struct ev_signal exitsig; 625 struct ev_signal exitsig;
548 629
549Example: For some weird reason, unregister the above signal handler again. 630Example: For some weird reason, unregister the above signal handler again.
550 631
551 ev_ref (loop); 632 ev_ref (loop);
552 ev_signal_stop (loop, &exitsig); 633 ev_signal_stop (loop, &exitsig);
634
635=item ev_set_io_collect_interval (loop, ev_tstamp interval)
636
637=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
638
639These advanced functions influence the time that libev will spend waiting
640for events. Both are by default C<0>, meaning that libev will try to
641invoke timer/periodic callbacks and I/O callbacks with minimum latency.
642
643Setting these to a higher value (the C<interval> I<must> be >= C<0>)
644allows libev to delay invocation of I/O and timer/periodic callbacks to
645increase efficiency of loop iterations.
646
647The background is that sometimes your program runs just fast enough to
648handle one (or very few) event(s) per loop iteration. While this makes
649the program responsive, it also wastes a lot of CPU time to poll for new
650events, especially with backends like C<select ()> which have a high
651overhead for the actual polling but can deliver many events at once.
652
653By setting a higher I<io collect interval> you allow libev to spend more
654time collecting I/O events, so you can handle more events per iteration,
655at the cost of increasing latency. Timeouts (both C<ev_periodic> and
656C<ev_timer>) will be not affected. Setting this to a non-null value will
657introduce an additional C<ev_sleep ()> call into most loop iterations.
658
659Likewise, by setting a higher I<timeout collect interval> you allow libev
660to spend more time collecting timeouts, at the expense of increased
661latency (the watcher callback will be called later). C<ev_io> watchers
662will not be affected. Setting this to a non-null value will not introduce
663any overhead in libev.
664
665Many (busy) programs can usually benefit by setting the io collect
666interval to a value near C<0.1> or so, which is often enough for
667interactive servers (of course not for games), likewise for timeouts. It
668usually doesn't make much sense to set it to a lower value than C<0.01>,
669as this approsaches the timing granularity of most systems.
553 670
554=back 671=back
555 672
556 673
557=head1 ANATOMY OF A WATCHER 674=head1 ANATOMY OF A WATCHER
883In general you can register as many read and/or write event watchers per 1000In 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 1001fd 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 1002descriptors to non-blocking mode is also usually a good idea (but not
886required if you know what you are doing). 1003required if you know what you are doing).
887 1004
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 1005If 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 1006(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
896C<EVBACKEND_POLL>). 1007C<EVBACKEND_POLL>).
897 1008
898Another thing you have to watch out for is that it is quite easy to 1009Another 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 1019play 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 1020whether 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 1021such as poll (fortunately in our Xlib example, Xlib already does this on
911its own, so its quite safe to use). 1022its own, so its quite safe to use).
912 1023
1024=head3 The special problem of disappearing file descriptors
1025
1026Some backends (e.g. kqueue, epoll) need to be told about closing a file
1027descriptor (either by calling C<close> explicitly or by any other means,
1028such as C<dup>). The reason is that you register interest in some file
1029descriptor, but when it goes away, the operating system will silently drop
1030this interest. If another file descriptor with the same number then is
1031registered with libev, there is no efficient way to see that this is, in
1032fact, a different file descriptor.
1033
1034To avoid having to explicitly tell libev about such cases, libev follows
1035the following policy: Each time C<ev_io_set> is being called, libev
1036will assume that this is potentially a new file descriptor, otherwise
1037it is assumed that the file descriptor stays the same. That means that
1038you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
1039descriptor even if the file descriptor number itself did not change.
1040
1041This is how one would do it normally anyway, the important point is that
1042the libev application should not optimise around libev but should leave
1043optimisations to libev.
1044
1045=head3 The special problem of dup'ed file descriptors
1046
1047Some backends (e.g. epoll), cannot register events for file descriptors,
1048but only events for the underlying file descriptions. That means when you
1049have C<dup ()>'ed file descriptors or weirder constellations, and register
1050events for them, only one file descriptor might actually receive events.
1051
1052There is no workaround possible except not registering events
1053for potentially C<dup ()>'ed file descriptors, or to resort to
1054C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1055
1056=head3 The special problem of fork
1057
1058Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1059useless behaviour. Libev fully supports fork, but needs to be told about
1060it in the child.
1061
1062To support fork in your programs, you either have to call
1063C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1064enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1065C<EVBACKEND_POLL>.
1066
1067
1068=head3 Watcher-Specific Functions
1069
913=over 4 1070=over 4
914 1071
915=item ev_io_init (ev_io *, callback, int fd, int events) 1072=item ev_io_init (ev_io *, callback, int fd, int events)
916 1073
917=item ev_io_set (ev_io *, int fd, int events) 1074=item ev_io_set (ev_io *, int fd, int events)
927=item int events [read-only] 1084=item int events [read-only]
928 1085
929The events being watched. 1086The events being watched.
930 1087
931=back 1088=back
1089
1090=head3 Examples
932 1091
933Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1092Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
934readable, but only once. Since it is likely line-buffered, you could 1093readable, but only once. Since it is likely line-buffered, you could
935attempt to read a whole line in the callback. 1094attempt to read a whole line in the callback.
936 1095
969 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1128 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
970 1129
971The callback is guarenteed to be invoked only when its timeout has passed, 1130The callback is guarenteed to be invoked only when its timeout has passed,
972but if multiple timers become ready during the same loop iteration then 1131but if multiple timers become ready during the same loop iteration then
973order of execution is undefined. 1132order of execution is undefined.
1133
1134=head3 Watcher-Specific Functions and Data Members
974 1135
975=over 4 1136=over 4
976 1137
977=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1138=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
978 1139
1032or C<ev_timer_again> is called and determines the next timeout (if any), 1193or C<ev_timer_again> is called and determines the next timeout (if any),
1033which is also when any modifications are taken into account. 1194which is also when any modifications are taken into account.
1034 1195
1035=back 1196=back
1036 1197
1198=head3 Examples
1199
1037Example: Create a timer that fires after 60 seconds. 1200Example: Create a timer that fires after 60 seconds.
1038 1201
1039 static void 1202 static void
1040 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1203 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1041 { 1204 {
1074but on wallclock time (absolute time). You can tell a periodic watcher 1237but 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 1238to 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 () 1239periodic 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 1240+ 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 1241take 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 1242roughly 10 seconds later).
1080again).
1081 1243
1082They can also be used to implement vastly more complex timers, such as 1244They can also be used to implement vastly more complex timers, such as
1083triggering an event on eahc midnight, local time. 1245triggering an event on each midnight, local time or other, complicated,
1246rules.
1084 1247
1085As with timers, the callback is guarenteed to be invoked only when the 1248As 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 1249time (C<at>) has been passed, but if multiple periodic timers become ready
1087during the same loop iteration then order of execution is undefined. 1250during the same loop iteration then order of execution is undefined.
1088 1251
1252=head3 Watcher-Specific Functions and Data Members
1253
1089=over 4 1254=over 4
1090 1255
1091=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) 1256=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1092 1257
1093=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) 1258=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 1260Lots of arguments, lets sort it out... There are basically three modes of
1096operation, and we will explain them from simplest to complex: 1261operation, and we will explain them from simplest to complex:
1097 1262
1098=over 4 1263=over 4
1099 1264
1100=item * absolute timer (interval = reschedule_cb = 0) 1265=item * absolute timer (at = time, interval = reschedule_cb = 0)
1101 1266
1102In this configuration the watcher triggers an event at the wallclock time 1267In 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, 1268C<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 1269that is, if it is to be run at January 1st 2011 then it will run when the
1105system time reaches or surpasses this time. 1270system time reaches or surpasses this time.
1106 1271
1107=item * non-repeating interval timer (interval > 0, reschedule_cb = 0) 1272=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1108 1273
1109In this mode the watcher will always be scheduled to time out at the next 1274In 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 1275C<at + N * interval> time (for some integer N, which can also be negative)
1111of any time jumps. 1276and then repeat, regardless of any time jumps.
1112 1277
1113This can be used to create timers that do not drift with respect to system 1278This can be used to create timers that do not drift with respect to system
1114time: 1279time:
1115 1280
1116 ev_periodic_set (&periodic, 0., 3600., 0); 1281 ev_periodic_set (&periodic, 0., 3600., 0);
1122 1287
1123Another way to think about it (for the mathematically inclined) is that 1288Another 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 1289C<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. 1290time where C<time = at (mod interval)>, regardless of any time jumps.
1126 1291
1292For numerical stability it is preferable that the C<at> value is near
1293C<ev_now ()> (the current time), but there is no range requirement for
1294this value.
1295
1127=item * manual reschedule mode (reschedule_cb = callback) 1296=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1128 1297
1129In this mode the values for C<interval> and C<at> are both being 1298In this mode the values for C<interval> and C<at> are both being
1130ignored. Instead, each time the periodic watcher gets scheduled, the 1299ignored. Instead, each time the periodic watcher gets scheduled, the
1131reschedule callback will be called with the watcher as first, and the 1300reschedule callback will be called with the watcher as first, and the
1132current time as second argument. 1301current time as second argument.
1133 1302
1134NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1303NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1135ever, or make any event loop modifications>. If you need to stop it, 1304ever, 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 1305return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1137starting a prepare watcher). 1306starting an C<ev_prepare> watcher, which is legal).
1138 1307
1139Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 1308Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1140ev_tstamp now)>, e.g.: 1309ev_tstamp now)>, e.g.:
1141 1310
1142 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1311 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1165Simply stops and restarts the periodic watcher again. This is only useful 1334Simply stops and restarts the periodic watcher again. This is only useful
1166when you changed some parameters or the reschedule callback would return 1335when 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 1336a different time than the last time it was called (e.g. in a crond like
1168program when the crontabs have changed). 1337program when the crontabs have changed).
1169 1338
1339=item ev_tstamp offset [read-write]
1340
1341When repeating, this contains the offset value, otherwise this is the
1342absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1343
1344Can be modified any time, but changes only take effect when the periodic
1345timer fires or C<ev_periodic_again> is being called.
1346
1170=item ev_tstamp interval [read-write] 1347=item ev_tstamp interval [read-write]
1171 1348
1172The current interval value. Can be modified any time, but changes only 1349The 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 1350take effect when the periodic timer fires or C<ev_periodic_again> is being
1174called. 1351called.
1177 1354
1178The current reschedule callback, or C<0>, if this functionality is 1355The current reschedule callback, or C<0>, if this functionality is
1179switched off. Can be changed any time, but changes only take effect when 1356switched off. Can be changed any time, but changes only take effect when
1180the periodic timer fires or C<ev_periodic_again> is being called. 1357the periodic timer fires or C<ev_periodic_again> is being called.
1181 1358
1359=item ev_tstamp at [read-only]
1360
1361When active, contains the absolute time that the watcher is supposed to
1362trigger next.
1363
1182=back 1364=back
1365
1366=head3 Examples
1183 1367
1184Example: Call a callback every hour, or, more precisely, whenever the 1368Example: Call a callback every hour, or, more precisely, whenever the
1185system clock is divisible by 3600. The callback invocation times have 1369system clock is divisible by 3600. The callback invocation times have
1186potentially a lot of jittering, but good long-term stability. 1370potentially a lot of jittering, but good long-term stability.
1187 1371
1227with the kernel (thus it coexists with your own signal handlers as long 1411with 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 1412as 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 1413watcher for a signal is stopped libev will reset the signal handler to
1230SIG_DFL (regardless of what it was set to before). 1414SIG_DFL (regardless of what it was set to before).
1231 1415
1416=head3 Watcher-Specific Functions and Data Members
1417
1232=over 4 1418=over 4
1233 1419
1234=item ev_signal_init (ev_signal *, callback, int signum) 1420=item ev_signal_init (ev_signal *, callback, int signum)
1235 1421
1236=item ev_signal_set (ev_signal *, int signum) 1422=item ev_signal_set (ev_signal *, int signum)
1248=head2 C<ev_child> - watch out for process status changes 1434=head2 C<ev_child> - watch out for process status changes
1249 1435
1250Child watchers trigger when your process receives a SIGCHLD in response to 1436Child watchers trigger when your process receives a SIGCHLD in response to
1251some child status changes (most typically when a child of yours dies). 1437some child status changes (most typically when a child of yours dies).
1252 1438
1439=head3 Watcher-Specific Functions and Data Members
1440
1253=over 4 1441=over 4
1254 1442
1255=item ev_child_init (ev_child *, callback, int pid) 1443=item ev_child_init (ev_child *, callback, int pid, int trace)
1256 1444
1257=item ev_child_set (ev_child *, int pid) 1445=item ev_child_set (ev_child *, int pid, int trace)
1258 1446
1259Configures the watcher to wait for status changes of process C<pid> (or 1447Configures the watcher to wait for status changes of process C<pid> (or
1260I<any> process if C<pid> is specified as C<0>). The callback can look 1448I<any> process if C<pid> is specified as C<0>). The callback can look
1261at the C<rstatus> member of the C<ev_child> watcher structure to see 1449at the C<rstatus> member of the C<ev_child> watcher structure to see
1262the status word (use the macros from C<sys/wait.h> and see your systems 1450the status word (use the macros from C<sys/wait.h> and see your systems
1263C<waitpid> documentation). The C<rpid> member contains the pid of the 1451C<waitpid> documentation). The C<rpid> member contains the pid of the
1264process causing the status change. 1452process causing the status change. C<trace> must be either C<0> (only
1453activate the watcher when the process terminates) or C<1> (additionally
1454activate the watcher when the process is stopped or continued).
1265 1455
1266=item int pid [read-only] 1456=item int pid [read-only]
1267 1457
1268The process id this watcher watches out for, or C<0>, meaning any process id. 1458The process id this watcher watches out for, or C<0>, meaning any process id.
1269 1459
1275 1465
1276The process exit/trace status caused by C<rpid> (see your systems 1466The process exit/trace status caused by C<rpid> (see your systems
1277C<waitpid> and C<sys/wait.h> documentation for details). 1467C<waitpid> and C<sys/wait.h> documentation for details).
1278 1468
1279=back 1469=back
1470
1471=head3 Examples
1280 1472
1281Example: Try to exit cleanly on SIGINT and SIGTERM. 1473Example: Try to exit cleanly on SIGINT and SIGTERM.
1282 1474
1283 static void 1475 static void
1284 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1476 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1325semantics of C<ev_stat> watchers, which means that libev sometimes needs 1517semantics of C<ev_stat> watchers, which means that libev sometimes needs
1326to fall back to regular polling again even with inotify, but changes are 1518to fall back to regular polling again even with inotify, but changes are
1327usually detected immediately, and if the file exists there will be no 1519usually detected immediately, and if the file exists there will be no
1328polling. 1520polling.
1329 1521
1522=head3 Inotify
1523
1524When C<inotify (7)> support has been compiled into libev (generally only
1525available on Linux) and present at runtime, it will be used to speed up
1526change detection where possible. The inotify descriptor will be created lazily
1527when the first C<ev_stat> watcher is being started.
1528
1529Inotify presense does not change the semantics of C<ev_stat> watchers
1530except that changes might be detected earlier, and in some cases, to avoid
1531making regular C<stat> calls. Even in the presense of inotify support
1532there are many cases where libev has to resort to regular C<stat> polling.
1533
1534(There is no support for kqueue, as apparently it cannot be used to
1535implement this functionality, due to the requirement of having a file
1536descriptor open on the object at all times).
1537
1538=head3 The special problem of stat time resolution
1539
1540The C<stat ()> syscall only supports full-second resolution portably, and
1541even on systems where the resolution is higher, many filesystems still
1542only support whole seconds.
1543
1544That means that, if the time is the only thing that changes, you might
1545miss updates: on the first update, C<ev_stat> detects a change and calls
1546your callback, which does something. When there is another update within
1547the same second, C<ev_stat> will be unable to detect it.
1548
1549The solution to this is to delay acting on a change for a second (or till
1550the next second boundary), using a roughly one-second delay C<ev_timer>
1551(C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01>
1552is added to work around small timing inconsistencies of some operating
1553systems.
1554
1555=head3 Watcher-Specific Functions and Data Members
1556
1330=over 4 1557=over 4
1331 1558
1332=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) 1559=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1333 1560
1334=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval) 1561=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
1369=item const char *path [read-only] 1596=item const char *path [read-only]
1370 1597
1371The filesystem path that is being watched. 1598The filesystem path that is being watched.
1372 1599
1373=back 1600=back
1601
1602=head3 Examples
1374 1603
1375Example: Watch C</etc/passwd> for attribute changes. 1604Example: Watch C</etc/passwd> for attribute changes.
1376 1605
1377 static void 1606 static void
1378 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) 1607 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1391 } 1620 }
1392 1621
1393 ... 1622 ...
1394 ev_stat passwd; 1623 ev_stat passwd;
1395 1624
1396 ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); 1625 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1397 ev_stat_start (loop, &passwd); 1626 ev_stat_start (loop, &passwd);
1627
1628Example: Like above, but additionally use a one-second delay so we do not
1629miss updates (however, frequent updates will delay processing, too, so
1630one might do the work both on C<ev_stat> callback invocation I<and> on
1631C<ev_timer> callback invocation).
1632
1633 static ev_stat passwd;
1634 static ev_timer timer;
1635
1636 static void
1637 timer_cb (EV_P_ ev_timer *w, int revents)
1638 {
1639 ev_timer_stop (EV_A_ w);
1640
1641 /* now it's one second after the most recent passwd change */
1642 }
1643
1644 static void
1645 stat_cb (EV_P_ ev_stat *w, int revents)
1646 {
1647 /* reset the one-second timer */
1648 ev_timer_again (EV_A_ &timer);
1649 }
1650
1651 ...
1652 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1653 ev_stat_start (loop, &passwd);
1654 ev_timer_init (&timer, timer_cb, 0., 1.01);
1398 1655
1399 1656
1400=head2 C<ev_idle> - when you've got nothing better to do... 1657=head2 C<ev_idle> - when you've got nothing better to do...
1401 1658
1402Idle watchers trigger events when no other events of the same or higher 1659Idle watchers trigger events when no other events of the same or higher
1416Apart from keeping your process non-blocking (which is a useful 1673Apart from keeping your process non-blocking (which is a useful
1417effect on its own sometimes), idle watchers are a good place to do 1674effect on its own sometimes), idle watchers are a good place to do
1418"pseudo-background processing", or delay processing stuff to after the 1675"pseudo-background processing", or delay processing stuff to after the
1419event loop has handled all outstanding events. 1676event loop has handled all outstanding events.
1420 1677
1678=head3 Watcher-Specific Functions and Data Members
1679
1421=over 4 1680=over 4
1422 1681
1423=item ev_idle_init (ev_signal *, callback) 1682=item ev_idle_init (ev_signal *, callback)
1424 1683
1425Initialises and configures the idle watcher - it has no parameters of any 1684Initialises 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, 1685kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1427believe me. 1686believe me.
1428 1687
1429=back 1688=back
1689
1690=head3 Examples
1430 1691
1431Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the 1692Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1432callback, free it. Also, use no error checking, as usual. 1693callback, free it. Also, use no error checking, as usual.
1433 1694
1434 static void 1695 static void
1435 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) 1696 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1436 { 1697 {
1437 free (w); 1698 free (w);
1438 // now do something you wanted to do when the program has 1699 // now do something you wanted to do when the program has
1439 // no longer asnything immediate to do. 1700 // no longer anything immediate to do.
1440 } 1701 }
1441 1702
1442 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); 1703 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1443 ev_idle_init (idle_watcher, idle_cb); 1704 ev_idle_init (idle_watcher, idle_cb);
1444 ev_idle_start (loop, idle_cb); 1705 ev_idle_start (loop, idle_cb);
1486 1747
1487It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 1748It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1488priority, to ensure that they are being run before any other watchers 1749priority, to ensure that they are being run before any other watchers
1489after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers, 1750after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1490too) should not activate ("feed") events into libev. While libev fully 1751too) should not activate ("feed") events into libev. While libev fully
1491supports this, they will be called before other C<ev_check> watchers did 1752supports 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 1753did 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 1754(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 1755state until their C<ev_check> watcher ran (always remind yourself to
1495others). 1756coexist peacefully with others).
1757
1758=head3 Watcher-Specific Functions and Data Members
1496 1759
1497=over 4 1760=over 4
1498 1761
1499=item ev_prepare_init (ev_prepare *, callback) 1762=item ev_prepare_init (ev_prepare *, callback)
1500 1763
1503Initialises and configures the prepare or check watcher - they have no 1766Initialises 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> 1767parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1505macros, but using them is utterly, utterly and completely pointless. 1768macros, but using them is utterly, utterly and completely pointless.
1506 1769
1507=back 1770=back
1771
1772=head3 Examples
1508 1773
1509There are a number of principal ways to embed other event loops or modules 1774There 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 1775into 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 1776(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> 1777use for an actually working example. Another Perl module named C<EV::Glib>
1681portable one. 1946portable one.
1682 1947
1683So when you want to use this feature you will always have to be prepared 1948So 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 1949that 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 1950this is to have a separate variables for your embeddable loop, try to
1686create it, and if that fails, use the normal loop for everything: 1951create it, and if that fails, use the normal loop for everything.
1952
1953=head3 Watcher-Specific Functions and Data Members
1954
1955=over 4
1956
1957=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1958
1959=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1960
1961Configures the watcher to embed the given loop, which must be
1962embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1963invoked automatically, otherwise it is the responsibility of the callback
1964to invoke it (it will continue to be called until the sweep has been done,
1965if you do not want thta, you need to temporarily stop the embed watcher).
1966
1967=item ev_embed_sweep (loop, ev_embed *)
1968
1969Make a single, non-blocking sweep over the embedded loop. This works
1970similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1971apropriate way for embedded loops.
1972
1973=item struct ev_loop *other [read-only]
1974
1975The embedded event loop.
1976
1977=back
1978
1979=head3 Examples
1980
1981Example: Try to get an embeddable event loop and embed it into the default
1982event loop. If that is not possible, use the default loop. The default
1983loop is stored in C<loop_hi>, while the mebeddable loop is stored in
1984C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be
1985used).
1687 1986
1688 struct ev_loop *loop_hi = ev_default_init (0); 1987 struct ev_loop *loop_hi = ev_default_init (0);
1689 struct ev_loop *loop_lo = 0; 1988 struct ev_loop *loop_lo = 0;
1690 struct ev_embed embed; 1989 struct ev_embed embed;
1691 1990
1702 ev_embed_start (loop_hi, &embed); 2001 ev_embed_start (loop_hi, &embed);
1703 } 2002 }
1704 else 2003 else
1705 loop_lo = loop_hi; 2004 loop_lo = loop_hi;
1706 2005
1707=over 4 2006Example: Check if kqueue is available but not recommended and create
2007a kqueue backend for use with sockets (which usually work with any
2008kqueue implementation). Store the kqueue/socket-only event loop in
2009C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
1708 2010
1709=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 2011 struct ev_loop *loop = ev_default_init (0);
2012 struct ev_loop *loop_socket = 0;
2013 struct ev_embed embed;
2014
2015 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2016 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2017 {
2018 ev_embed_init (&embed, 0, loop_socket);
2019 ev_embed_start (loop, &embed);
2020 }
1710 2021
1711=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 2022 if (!loop_socket)
2023 loop_socket = loop;
1712 2024
1713Configures the watcher to embed the given loop, which must be 2025 // 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 2026
1731 2027
1732=head2 C<ev_fork> - the audacity to resume the event loop after a fork 2028=head2 C<ev_fork> - the audacity to resume the event loop after a fork
1733 2029
1734Fork watchers are called when a C<fork ()> was detected (usually because 2030Fork watchers are called when a C<fork ()> was detected (usually because
1737event loop blocks next and before C<ev_check> watchers are being called, 2033event 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 2034and 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 2035C<ev_default_fork> cheats and calls it in the wrong process, the fork
1740handlers will be invoked, too, of course. 2036handlers will be invoked, too, of course.
1741 2037
2038=head3 Watcher-Specific Functions and Data Members
2039
1742=over 4 2040=over 4
1743 2041
1744=item ev_fork_init (ev_signal *, callback) 2042=item ev_fork_init (ev_signal *, callback)
1745 2043
1746Initialises and configures the fork watcher - it has no parameters of any 2044Initialises and configures the fork watcher - it has no parameters of any
1962 2260
1963=item w->stop () 2261=item w->stop ()
1964 2262
1965Stops the watcher if it is active. Again, no C<loop> argument. 2263Stops the watcher if it is active. Again, no C<loop> argument.
1966 2264
1967=item w->again () C<ev::timer>, C<ev::periodic> only 2265=item w->again () (C<ev::timer>, C<ev::periodic> only)
1968 2266
1969For C<ev::timer> and C<ev::periodic>, this invokes the corresponding 2267For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1970C<ev_TYPE_again> function. 2268C<ev_TYPE_again> function.
1971 2269
1972=item w->sweep () C<ev::embed> only 2270=item w->sweep () (C<ev::embed> only)
1973 2271
1974Invokes C<ev_embed_sweep>. 2272Invokes C<ev_embed_sweep>.
1975 2273
1976=item w->update () C<ev::stat> only 2274=item w->update () (C<ev::stat> only)
1977 2275
1978Invokes C<ev_stat_stat>. 2276Invokes C<ev_stat_stat>.
1979 2277
1980=back 2278=back
1981 2279
1984Example: Define a class with an IO and idle watcher, start one of them in 2282Example: Define a class with an IO and idle watcher, start one of them in
1985the constructor. 2283the constructor.
1986 2284
1987 class myclass 2285 class myclass
1988 { 2286 {
1989 ev_io io; void io_cb (ev::io &w, int revents); 2287 ev::io io; void io_cb (ev::io &w, int revents);
1990 ev_idle idle void idle_cb (ev::idle &w, int revents); 2288 ev:idle idle void idle_cb (ev::idle &w, int revents);
1991 2289
1992 myclass (); 2290 myclass (int fd)
1993 }
1994
1995 myclass::myclass (int fd)
1996 { 2291 {
1997 io .set <myclass, &myclass::io_cb > (this); 2292 io .set <myclass, &myclass::io_cb > (this);
1998 idle.set <myclass, &myclass::idle_cb> (this); 2293 idle.set <myclass, &myclass::idle_cb> (this);
1999 2294
2000 io.start (fd, ev::READ); 2295 io.start (fd, ev::READ);
2296 }
2001 } 2297 };
2002 2298
2003 2299
2004=head1 MACRO MAGIC 2300=head1 MACRO MAGIC
2005 2301
2006Libev can be compiled with a variety of options, the most fundemantal is 2302Libev can be compiled with a variety of options, the most fundamantal
2007C<EV_MULTIPLICITY>. This option determines whether (most) functions and 2303of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2008callbacks have an initial C<struct ev_loop *> argument. 2304functions and callbacks have an initial C<struct ev_loop *> argument.
2009 2305
2010To make it easier to write programs that cope with either variant, the 2306To make it easier to write programs that cope with either variant, the
2011following macros are defined: 2307following macros are defined:
2012 2308
2013=over 4 2309=over 4
2067Libev can (and often is) directly embedded into host 2363Libev can (and often is) directly embedded into host
2068applications. Examples of applications that embed it include the Deliantra 2364applications. Examples of applications that embed it include the Deliantra
2069Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2365Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2070and rxvt-unicode. 2366and rxvt-unicode.
2071 2367
2072The goal is to enable you to just copy the neecssary files into your 2368The 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 2369source 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 2370you can easily upgrade by simply copying (or having a checked-out copy of
2075libev somewhere in your source tree). 2371libev somewhere in your source tree).
2076 2372
2077=head2 FILESETS 2373=head2 FILESETS
2167 2463
2168If defined to be C<1>, libev will try to detect the availability of the 2464If 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 2465monotonic clock option at both compiletime and runtime. Otherwise no use
2170of the monotonic clock option will be attempted. If you enable this, you 2466of the monotonic clock option will be attempted. If you enable this, you
2171usually have to link against librt or something similar. Enabling it when 2467usually have to link against librt or something similar. Enabling it when
2172the functionality isn't available is safe, though, althoguh you have 2468the functionality isn't available is safe, though, although you have
2173to make sure you link against any libraries where the C<clock_gettime> 2469to make sure you link against any libraries where the C<clock_gettime>
2174function is hiding in (often F<-lrt>). 2470function is hiding in (often F<-lrt>).
2175 2471
2176=item EV_USE_REALTIME 2472=item EV_USE_REALTIME
2177 2473
2178If defined to be C<1>, libev will try to detect the availability of the 2474If defined to be C<1>, libev will try to detect the availability of the
2179realtime clock option at compiletime (and assume its availability at 2475realtime clock option at compiletime (and assume its availability at
2180runtime if successful). Otherwise no use of the realtime clock option will 2476runtime if successful). Otherwise no use of the realtime clock option will
2181be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2477be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2182(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2478(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2183in the description of C<EV_USE_MONOTONIC>, though. 2479note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2480
2481=item EV_USE_NANOSLEEP
2482
2483If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2484and will use it for delays. Otherwise it will use C<select ()>.
2184 2485
2185=item EV_USE_SELECT 2486=item EV_USE_SELECT
2186 2487
2187If undefined or defined to be C<1>, libev will compile in support for the 2488If 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 2489C<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 2507wants osf handles on win32 (this is the case when the select to
2207be used is the winsock select). This means that it will call 2508be 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, 2509C<_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 2510it is assumed that all these functions actually work on fds, even
2210on win32. Should not be defined on non-win32 platforms. 2511on win32. Should not be defined on non-win32 platforms.
2512
2513=item EV_FD_TO_WIN32_HANDLE
2514
2515If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
2516file descriptors to socket handles. When not defining this symbol (the
2517default), then libev will call C<_get_osfhandle>, which is usually
2518correct. In some cases, programs use their own file descriptor management,
2519in which case they can provide this function to map fds to socket handles.
2211 2520
2212=item EV_USE_POLL 2521=item EV_USE_POLL
2213 2522
2214If defined to be C<1>, libev will compile in support for the C<poll>(2) 2523If 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 2524backend. Otherwise it will be enabled on non-win32 platforms. It
2252be detected at runtime. 2561be detected at runtime.
2253 2562
2254=item EV_H 2563=item EV_H
2255 2564
2256The name of the F<ev.h> header file used to include it. The default if 2565The 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 2566undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
2258can be used to virtually rename the F<ev.h> header file in case of conflicts. 2567used to virtually rename the F<ev.h> header file in case of conflicts.
2259 2568
2260=item EV_CONFIG_H 2569=item EV_CONFIG_H
2261 2570
2262If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 2571If 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 2572F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2264C<EV_H>, above. 2573C<EV_H>, above.
2265 2574
2266=item EV_EVENT_H 2575=item EV_EVENT_H
2267 2576
2268Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 2577Similarly 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. 2578of how the F<event.h> header can be found, the default is C<"event.h">.
2270 2579
2271=item EV_PROTOTYPES 2580=item EV_PROTOTYPES
2272 2581
2273If defined to be C<0>, then F<ev.h> will not define any function 2582If 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 2583prototypes, 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 2649than enough. If you need to manage thousands of children you might want to
2341increase this value (I<must> be a power of two). 2650increase this value (I<must> be a power of two).
2342 2651
2343=item EV_INOTIFY_HASHSIZE 2652=item EV_INOTIFY_HASHSIZE
2344 2653
2345C<ev_staz> watchers use a small hash table to distribute workload by 2654C<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>), 2655inotify 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> 2656usually 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 2657watchers you might want to increase this value (I<must> be a power of
2349two). 2658two).
2350 2659
2367 2676
2368=item ev_set_cb (ev, cb) 2677=item ev_set_cb (ev, cb)
2369 2678
2370Can be used to change the callback member declaration in each watcher, 2679Can 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 2680and 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 2681definition and a statement, respectively. See the F<ev.h> header file for
2373their default definitions. One possible use for overriding these is to 2682their 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 2683avoid the C<struct ev_loop *> as first argument in all cases, or to use
2375method calls instead of plain function calls in C++. 2684method calls instead of plain function calls in C++.
2685
2686=head2 EXPORTED API SYMBOLS
2687
2688If you need to re-export the API (e.g. via a dll) and you need a list of
2689exported symbols, you can use the provided F<Symbol.*> files which list
2690all public symbols, one per line:
2691
2692 Symbols.ev for libev proper
2693 Symbols.event for the libevent emulation
2694
2695This can also be used to rename all public symbols to avoid clashes with
2696multiple versions of libev linked together (which is obviously bad in
2697itself, but sometimes it is inconvinient to avoid this).
2698
2699A sed command like this will create wrapper C<#define>'s that you need to
2700include before including F<ev.h>:
2701
2702 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2703
2704This would create a file F<wrap.h> which essentially looks like this:
2705
2706 #define ev_backend myprefix_ev_backend
2707 #define ev_check_start myprefix_ev_check_start
2708 #define ev_check_stop myprefix_ev_check_stop
2709 ...
2376 2710
2377=head2 EXAMPLES 2711=head2 EXAMPLES
2378 2712
2379For a real-world example of a program the includes libev 2713For a real-world example of a program the includes libev
2380verbatim, you can have a look at the EV perl module 2714verbatim, you can have a look at the EV perl module
2421 2755
2422=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2756=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2423 2757
2424This means that, when you have a watcher that triggers in one hour and 2758This 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 2759there are 100 watchers that would trigger before that then inserting will
2426have to skip those 100 watchers. 2760have to skip roughly seven (C<ld 100>) of these watchers.
2427 2761
2428=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2762=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2429 2763
2430That means that for changing a timer costs less than removing/adding them 2764That 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. 2765as only the relative motion in the event queue has to be paid for.
2432 2766
2433=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2767=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2434 2768
2435These just add the watcher into an array or at the head of a list. 2769These just add the watcher into an array or at the head of a list.
2770
2436=item Stopping check/prepare/idle watchers: O(1) 2771=item Stopping check/prepare/idle watchers: O(1)
2437 2772
2438=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 2773=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2439 2774
2440These watchers are stored in lists then need to be walked to find the 2775These 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 2776correct watcher to remove. The lists are usually short (you don't usually
2442have many watchers waiting for the same fd or signal). 2777have many watchers waiting for the same fd or signal).
2443 2778
2444=item Finding the next timer per loop iteration: O(1) 2779=item Finding the next timer in each loop iteration: O(1)
2780
2781By virtue of using a binary heap, the next timer is always found at the
2782beginning of the storage array.
2445 2783
2446=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2784=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2447 2785
2448A change means an I/O watcher gets started or stopped, which requires 2786A change means an I/O watcher gets started or stopped, which requires
2449libev to recalculate its status (and possibly tell the kernel). 2787libev to recalculate its status (and possibly tell the kernel, depending
2788on backend and wether C<ev_io_set> was used).
2450 2789
2451=item Activating one watcher: O(1) 2790=item Activating one watcher (putting it into the pending state): O(1)
2452 2791
2453=item Priority handling: O(number_of_priorities) 2792=item Priority handling: O(number_of_priorities)
2454 2793
2455Priorities are implemented by allocating some space for each 2794Priorities are implemented by allocating some space for each
2456priority. When doing priority-based operations, libev usually has to 2795priority. When doing priority-based operations, libev usually has to
2457linearly search all the priorities. 2796linearly search all the priorities, but starting/stopping and activating
2797watchers becomes O(1) w.r.t. prioritiy handling.
2458 2798
2459=back 2799=back
2460 2800
2461 2801
2802=head1 Win32 platform limitations and workarounds
2803
2804Win32 doesn't support any of the standards (e.g. POSIX) that libev
2805requires, and its I/O model is fundamentally incompatible with the POSIX
2806model. Libev still offers limited functionality on this platform in
2807the form of the C<EVBACKEND_SELECT> backend, and only supports socket
2808descriptors. This only applies when using Win32 natively, not when using
2809e.g. cygwin.
2810
2811There is no supported compilation method available on windows except
2812embedding it into other applications.
2813
2814Due to the many, low, and arbitrary limits on the win32 platform and the
2815abysmal performance of winsockets, using a large number of sockets is not
2816recommended (and not reasonable). If your program needs to use more than
2817a hundred or so sockets, then likely it needs to use a totally different
2818implementation for windows, as libev offers the POSIX model, which cannot
2819be implemented efficiently on windows (microsoft monopoly games).
2820
2821=over 4
2822
2823=item The winsocket select function
2824
2825The winsocket C<select> function doesn't follow POSIX in that it requires
2826socket I<handles> and not socket I<file descriptors>. This makes select
2827very inefficient, and also requires a mapping from file descriptors
2828to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>,
2829C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor
2830symbols for more info.
2831
2832The configuration for a "naked" win32 using the microsoft runtime
2833libraries and raw winsocket select is:
2834
2835 #define EV_USE_SELECT 1
2836 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
2837
2838Note that winsockets handling of fd sets is O(n), so you can easily get a
2839complexity in the O(n²) range when using win32.
2840
2841=item Limited number of file descriptors
2842
2843Windows has numerous arbitrary (and low) limits on things. Early versions
2844of winsocket's select only supported waiting for a max. of C<64> handles
2845(probably owning to the fact that all windows kernels can only wait for
2846C<64> things at the same time internally; microsoft recommends spawning a
2847chain of threads and wait for 63 handles and the previous thread in each).
2848
2849Newer versions support more handles, but you need to define C<FD_SETSIZE>
2850to some high number (e.g. C<2048>) before compiling the winsocket select
2851call (which might be in libev or elsewhere, for example, perl does its own
2852select emulation on windows).
2853
2854Another limit is the number of file descriptors in the microsoft runtime
2855libraries, which by default is C<64> (there must be a hidden I<64> fetish
2856or something like this inside microsoft). You can increase this by calling
2857C<_setmaxstdio>, which can increase this limit to C<2048> (another
2858arbitrary limit), but is broken in many versions of the microsoft runtime
2859libraries.
2860
2861This might get you to about C<512> or C<2048> sockets (depending on
2862windows version and/or the phase of the moon). To get more, you need to
2863wrap all I/O functions and provide your own fd management, but the cost of
2864calling select (O(n²)) will likely make this unworkable.
2865
2866=back
2867
2868
2462=head1 AUTHOR 2869=head1 AUTHOR
2463 2870
2464Marc Lehmann <libev@schmorp.de>. 2871Marc Lehmann <libev@schmorp.de>.
2465 2872

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines