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

Comparing libev/ev.pod (file contents):
Revision 1.246 by root, Thu Jul 2 12:08:55 2009 UTC vs.
Revision 1.312 by root, Thu Oct 21 15:14:49 2010 UTC

26 puts ("stdin ready"); 26 puts ("stdin ready");
27 // for one-shot events, one must manually stop the watcher 27 // for one-shot events, one must manually stop the watcher
28 // with its corresponding stop function. 28 // with its corresponding stop function.
29 ev_io_stop (EV_A_ w); 29 ev_io_stop (EV_A_ w);
30 30
31 // this causes all nested ev_loop's to stop iterating 31 // this causes all nested ev_run's to stop iterating
32 ev_unloop (EV_A_ EVUNLOOP_ALL); 32 ev_break (EV_A_ EVBREAK_ALL);
33 } 33 }
34 34
35 // another callback, this time for a time-out 35 // another callback, this time for a time-out
36 static void 36 static void
37 timeout_cb (EV_P_ ev_timer *w, int revents) 37 timeout_cb (EV_P_ ev_timer *w, int revents)
38 { 38 {
39 puts ("timeout"); 39 puts ("timeout");
40 // this causes the innermost ev_loop to stop iterating 40 // this causes the innermost ev_run to stop iterating
41 ev_unloop (EV_A_ EVUNLOOP_ONE); 41 ev_break (EV_A_ EVBREAK_ONE);
42 } 42 }
43 43
44 int 44 int
45 main (void) 45 main (void)
46 { 46 {
56 // simple non-repeating 5.5 second timeout 56 // simple non-repeating 5.5 second timeout
57 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); 57 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
58 ev_timer_start (loop, &timeout_watcher); 58 ev_timer_start (loop, &timeout_watcher);
59 59
60 // now wait for events to arrive 60 // now wait for events to arrive
61 ev_loop (loop, 0); 61 ev_run (loop, 0);
62 62
63 // unloop was called, so exit 63 // unloop was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
75While this document tries to be as complete as possible in documenting 75While this document tries to be as complete as possible in documenting
76libev, its usage and the rationale behind its design, it is not a tutorial 76libev, its usage and the rationale behind its design, it is not a tutorial
77on event-based programming, nor will it introduce event-based programming 77on event-based programming, nor will it introduce event-based programming
78with libev. 78with libev.
79 79
80Familarity with event based programming techniques in general is assumed 80Familiarity with event based programming techniques in general is assumed
81throughout this document. 81throughout this document.
82 82
83=head1 ABOUT LIBEV 83=head1 ABOUT LIBEV
84 84
85Libev is an event loop: you register interest in certain events (such as a 85Libev is an event loop: you register interest in certain events (such as a
98=head2 FEATURES 98=head2 FEATURES
99 99
100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
102for file descriptor events (C<ev_io>), the Linux C<inotify> interface 102for file descriptor events (C<ev_io>), the Linux C<inotify> interface
103(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 103(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
104with customised rescheduling (C<ev_periodic>), synchronous signals 104inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
105(C<ev_signal>), process status change events (C<ev_child>), and event 105timers (C<ev_timer>), absolute timers with customised rescheduling
106watchers dealing with the event loop mechanism itself (C<ev_idle>, 106(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
107C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as 107change events (C<ev_child>), and event watchers dealing with the event
108file watchers (C<ev_stat>) and even limited support for fork events 108loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
109(C<ev_fork>). 109C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
110limited support for fork events (C<ev_fork>).
110 111
111It also is quite fast (see this 112It also is quite fast (see this
112L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 113L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
113for example). 114for example).
114 115
117Libev is very configurable. In this manual the default (and most common) 118Libev is very configurable. In this manual the default (and most common)
118configuration will be described, which supports multiple event loops. For 119configuration will be described, which supports multiple event loops. For
119more info about various configuration options please have a look at 120more info about various configuration options please have a look at
120B<EMBED> section in this manual. If libev was configured without support 121B<EMBED> section in this manual. If libev was configured without support
121for multiple event loops, then all functions taking an initial argument of 122for multiple event loops, then all functions taking an initial argument of
122name C<loop> (which is always of type C<ev_loop *>) will not have 123name C<loop> (which is always of type C<struct ev_loop *>) will not have
123this argument. 124this argument.
124 125
125=head2 TIME REPRESENTATION 126=head2 TIME REPRESENTATION
126 127
127Libev represents time as a single floating point number, representing 128Libev represents time as a single floating point number, representing
128the (fractional) number of seconds since the (POSIX) epoch (somewhere 129the (fractional) number of seconds since the (POSIX) epoch (in practise
129near the beginning of 1970, details are complicated, don't ask). This 130somewhere near the beginning of 1970, details are complicated, don't
130type is called C<ev_tstamp>, which is what you should use too. It usually 131ask). This type is called C<ev_tstamp>, which is what you should use
131aliases to the C<double> type in C. When you need to do any calculations 132too. It usually aliases to the C<double> type in C. When you need to do
132on it, you should treat it as some floating point value. Unlike the name 133any calculations on it, you should treat it as some floating point value.
134
133component C<stamp> might indicate, it is also used for time differences 135Unlike the name component C<stamp> might indicate, it is also used for
134throughout libev. 136time differences (e.g. delays) throughout libev.
135 137
136=head1 ERROR HANDLING 138=head1 ERROR HANDLING
137 139
138Libev knows three classes of errors: operating system errors, usage errors 140Libev knows three classes of errors: operating system errors, usage errors
139and internal errors (bugs). 141and internal errors (bugs).
190as this indicates an incompatible change. Minor versions are usually 192as this indicates an incompatible change. Minor versions are usually
191compatible to older versions, so a larger minor version alone is usually 193compatible to older versions, so a larger minor version alone is usually
192not a problem. 194not a problem.
193 195
194Example: Make sure we haven't accidentally been linked against the wrong 196Example: Make sure we haven't accidentally been linked against the wrong
195version. 197version (note, however, that this will not detect ABI mismatches :).
196 198
197 assert (("libev version mismatch", 199 assert (("libev version mismatch",
198 ev_version_major () == EV_VERSION_MAJOR 200 ev_version_major () == EV_VERSION_MAJOR
199 && ev_version_minor () >= EV_VERSION_MINOR)); 201 && ev_version_minor () >= EV_VERSION_MINOR));
200 202
290 292
291=back 293=back
292 294
293=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 295=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
294 296
295An event loop is described by a C<struct ev_loop *> (the C<struct> 297An event loop is described by a C<struct ev_loop *> (the C<struct> is
296is I<not> optional in this case, as there is also an C<ev_loop> 298I<not> optional in this case unless libev 3 compatibility is disabled, as
297I<function>). 299libev 3 had an C<ev_loop> function colliding with the struct name).
298 300
299The library knows two types of such loops, the I<default> loop, which 301The library knows two types of such loops, the I<default> loop, which
300supports signals and child events, and dynamically created loops which do 302supports signals and child events, and dynamically created event loops
301not. 303which do not.
302 304
303=over 4 305=over 4
304 306
305=item struct ev_loop *ev_default_loop (unsigned int flags) 307=item struct ev_loop *ev_default_loop (unsigned int flags)
306 308
344useful to try out specific backends to test their performance, or to work 346useful to try out specific backends to test their performance, or to work
345around bugs. 347around bugs.
346 348
347=item C<EVFLAG_FORKCHECK> 349=item C<EVFLAG_FORKCHECK>
348 350
349Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after 351Instead of calling C<ev_loop_fork> manually after a fork, you can also
350a fork, you can also make libev check for a fork in each iteration by 352make libev check for a fork in each iteration by enabling this flag.
351enabling this flag.
352 353
353This works by calling C<getpid ()> on every iteration of the loop, 354This works by calling C<getpid ()> on every iteration of the loop,
354and thus this might slow down your event loop if you do a lot of loop 355and thus this might slow down your event loop if you do a lot of loop
355iterations and little real work, but is usually not noticeable (on my 356iterations and little real work, but is usually not noticeable (on my
356GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 357GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
362flag. 363flag.
363 364
364This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 365This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
365environment variable. 366environment variable.
366 367
368=item C<EVFLAG_NOINOTIFY>
369
370When this flag is specified, then libev will not attempt to use the
371I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
372testing, this flag can be useful to conserve inotify file descriptors, as
373otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374
375=item C<EVFLAG_SIGNALFD>
376
377When this flag is specified, then libev will attempt to use the
378I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API
379delivers signals synchronously, which makes it both faster and might make
380it possible to get the queued signal data. It can also simplify signal
381handling with threads, as long as you properly block signals in your
382threads that are not interested in handling them.
383
384Signalfd will not be used by default as this changes your signal mask, and
385there are a lot of shoddy libraries and programs (glib's threadpool for
386example) that can't properly initialise their signal masks.
387
367=item C<EVBACKEND_SELECT> (value 1, portable select backend) 388=item C<EVBACKEND_SELECT> (value 1, portable select backend)
368 389
369This is your standard select(2) backend. Not I<completely> standard, as 390This is your standard select(2) backend. Not I<completely> standard, as
370libev tries to roll its own fd_set with no limits on the number of fds, 391libev tries to roll its own fd_set with no limits on the number of fds,
371but if that fails, expect a fairly low limit on the number of fds when 392but if that fails, expect a fairly low limit on the number of fds when
394 415
395This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 416This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
396C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 417C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
397 418
398=item C<EVBACKEND_EPOLL> (value 4, Linux) 419=item C<EVBACKEND_EPOLL> (value 4, Linux)
420
421Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
422kernels).
399 423
400For few fds, this backend is a bit little slower than poll and select, 424For few fds, this backend is a bit little slower than poll and select,
401but it scales phenomenally better. While poll and select usually scale 425but it scales phenomenally better. While poll and select usually scale
402like O(total_fds) where n is the total number of fds (or the highest fd), 426like O(total_fds) where n is the total number of fds (or the highest fd),
403epoll scales either O(1) or O(active_fds). 427epoll scales either O(1) or O(active_fds).
415of course I<doesn't>, and epoll just loves to report events for totally 439of course I<doesn't>, and epoll just loves to report events for totally
416I<different> file descriptors (even already closed ones, so one cannot 440I<different> file descriptors (even already closed ones, so one cannot
417even remove them from the set) than registered in the set (especially 441even remove them from the set) than registered in the set (especially
418on SMP systems). Libev tries to counter these spurious notifications by 442on SMP systems). Libev tries to counter these spurious notifications by
419employing an additional generation counter and comparing that against the 443employing an additional generation counter and comparing that against the
420events to filter out spurious ones, recreating the set when required. 444events to filter out spurious ones, recreating the set when required. Last
445not least, it also refuses to work with some file descriptors which work
446perfectly fine with C<select> (files, many character devices...).
421 447
422While stopping, setting and starting an I/O watcher in the same iteration 448While stopping, setting and starting an I/O watcher in the same iteration
423will result in some caching, there is still a system call per such 449will result in some caching, there is still a system call per such
424incident (because the same I<file descriptor> could point to a different 450incident (because the same I<file descriptor> could point to a different
425I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 451I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
518 544
519It is definitely not recommended to use this flag. 545It is definitely not recommended to use this flag.
520 546
521=back 547=back
522 548
523If one or more of these are or'ed into the flags value, then only these 549If one or more of the backend flags are or'ed into the flags value,
524backends will be tried (in the reverse order as listed here). If none are 550then only these backends will be tried (in the reverse order as listed
525specified, all backends in C<ev_recommended_backends ()> will be tried. 551here). If none are specified, all backends in C<ev_recommended_backends
552()> will be tried.
526 553
527Example: This is the most typical usage. 554Example: This is the most typical usage.
528 555
529 if (!ev_default_loop (0)) 556 if (!ev_default_loop (0))
530 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 557 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
542 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); 569 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
543 570
544=item struct ev_loop *ev_loop_new (unsigned int flags) 571=item struct ev_loop *ev_loop_new (unsigned int flags)
545 572
546Similar to C<ev_default_loop>, but always creates a new event loop that is 573Similar to C<ev_default_loop>, but always creates a new event loop that is
547always distinct from the default loop. Unlike the default loop, it cannot 574always distinct from the default loop.
548handle signal and child watchers, and attempts to do so will be greeted by
549undefined behaviour (or a failed assertion if assertions are enabled).
550 575
551Note that this function I<is> thread-safe, and the recommended way to use 576Note that this function I<is> thread-safe, and one common way to use
552libev with threads is indeed to create one loop per thread, and using the 577libev with threads is indeed to create one loop per thread, and using the
553default loop in the "main" or "initial" thread. 578default loop in the "main" or "initial" thread.
554 579
555Example: Try to create a event loop that uses epoll and nothing else. 580Example: Try to create a event loop that uses epoll and nothing else.
556 581
558 if (!epoller) 583 if (!epoller)
559 fatal ("no epoll found here, maybe it hides under your chair"); 584 fatal ("no epoll found here, maybe it hides under your chair");
560 585
561=item ev_default_destroy () 586=item ev_default_destroy ()
562 587
563Destroys the default loop again (frees all memory and kernel state 588Destroys the default loop (frees all memory and kernel state etc.). None
564etc.). None of the active event watchers will be stopped in the normal 589of the active event watchers will be stopped in the normal sense, so
565sense, so e.g. C<ev_is_active> might still return true. It is your 590e.g. C<ev_is_active> might still return true. It is your responsibility to
566responsibility to either stop all watchers cleanly yourself I<before> 591either stop all watchers cleanly yourself I<before> calling this function,
567calling this function, or cope with the fact afterwards (which is usually 592or cope with the fact afterwards (which is usually the easiest thing, you
568the easiest thing, you can just ignore the watchers and/or C<free ()> them 593can just ignore the watchers and/or C<free ()> them for example).
569for example).
570 594
571Note that certain global state, such as signal state (and installed signal 595Note that certain global state, such as signal state (and installed signal
572handlers), will not be freed by this function, and related watchers (such 596handlers), will not be freed by this function, and related watchers (such
573as signal and child watchers) would need to be stopped manually. 597as signal and child watchers) would need to be stopped manually.
574 598
575In general it is not advisable to call this function except in the 599In general it is not advisable to call this function except in the
576rare occasion where you really need to free e.g. the signal handling 600rare occasion where you really need to free e.g. the signal handling
577pipe fds. If you need dynamically allocated loops it is better to use 601pipe fds. If you need dynamically allocated loops it is better to use
578C<ev_loop_new> and C<ev_loop_destroy>). 602C<ev_loop_new> and C<ev_loop_destroy>.
579 603
580=item ev_loop_destroy (loop) 604=item ev_loop_destroy (loop)
581 605
582Like C<ev_default_destroy>, but destroys an event loop created by an 606Like C<ev_default_destroy>, but destroys an event loop created by an
583earlier call to C<ev_loop_new>. 607earlier call to C<ev_loop_new>.
584 608
585=item ev_default_fork () 609=item ev_default_fork ()
586 610
587This function sets a flag that causes subsequent C<ev_loop> iterations 611This function sets a flag that causes subsequent C<ev_run> iterations
588to reinitialise the kernel state for backends that have one. Despite the 612to reinitialise the kernel state for backends that have one. Despite the
589name, you can call it anytime, but it makes most sense after forking, in 613name, you can call it anytime, but it makes most sense after forking, in
590the child process (or both child and parent, but that again makes little 614the child process (or both child and parent, but that again makes little
591sense). You I<must> call it in the child before using any of the libev 615sense). You I<must> call it in the child before using any of the libev
592functions, and it will only take effect at the next C<ev_loop> iteration. 616functions, and it will only take effect at the next C<ev_run> iteration.
617
618Again, you I<have> to call it on I<any> loop that you want to re-use after
619a fork, I<even if you do not plan to use the loop in the parent>. This is
620because some kernel interfaces *cough* I<kqueue> *cough* do funny things
621during fork.
593 622
594On the other hand, you only need to call this function in the child 623On the other hand, you only need to call this function in the child
595process if and only if you want to use the event library in the child. If 624process if and only if you want to use the event loop in the child. If
596you just fork+exec, you don't have to call it at all. 625you just fork+exec or create a new loop in the child, you don't have to
626call it at all (in fact, C<epoll> is so badly broken that it makes a
627difference, but libev will usually detect this case on its own and do a
628costly reset of the backend).
597 629
598The function itself is quite fast and it's usually not a problem to call 630The function itself is quite fast and it's usually not a problem to call
599it just in case after a fork. To make this easy, the function will fit in 631it just in case after a fork. To make this easy, the function will fit in
600quite nicely into a call to C<pthread_atfork>: 632quite nicely into a call to C<pthread_atfork>:
601 633
603 635
604=item ev_loop_fork (loop) 636=item ev_loop_fork (loop)
605 637
606Like C<ev_default_fork>, but acts on an event loop created by 638Like C<ev_default_fork>, but acts on an event loop created by
607C<ev_loop_new>. Yes, you have to call this on every allocated event loop 639C<ev_loop_new>. Yes, you have to call this on every allocated event loop
608after fork that you want to re-use in the child, and how you do this is 640after fork that you want to re-use in the child, and how you keep track of
609entirely your own problem. 641them is entirely your own problem.
610 642
611=item int ev_is_default_loop (loop) 643=item int ev_is_default_loop (loop)
612 644
613Returns true when the given loop is, in fact, the default loop, and false 645Returns true when the given loop is, in fact, the default loop, and false
614otherwise. 646otherwise.
615 647
616=item unsigned int ev_loop_count (loop) 648=item unsigned int ev_iteration (loop)
617 649
618Returns the count of loop iterations for the loop, which is identical to 650Returns the current iteration count for the event loop, which is identical
619the number of times libev did poll for new events. It starts at C<0> and 651to the number of times libev did poll for new events. It starts at C<0>
620happily wraps around with enough iterations. 652and happily wraps around with enough iterations.
621 653
622This value can sometimes be useful as a generation counter of sorts (it 654This value can sometimes be useful as a generation counter of sorts (it
623"ticks" the number of loop iterations), as it roughly corresponds with 655"ticks" the number of loop iterations), as it roughly corresponds with
624C<ev_prepare> and C<ev_check> calls. 656C<ev_prepare> and C<ev_check> calls - and is incremented between the
657prepare and check phases.
658
659=item unsigned int ev_depth (loop)
660
661Returns the number of times C<ev_run> was entered minus the number of
662times C<ev_run> was exited, in other words, the recursion depth.
663
664Outside C<ev_run>, this number is zero. In a callback, this number is
665C<1>, unless C<ev_run> was invoked recursively (or from another thread),
666in which case it is higher.
667
668Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread
669etc.), doesn't count as "exit" - consider this as a hint to avoid such
670ungentleman-like behaviour unless it's really convenient.
625 671
626=item unsigned int ev_backend (loop) 672=item unsigned int ev_backend (loop)
627 673
628Returns one of the C<EVBACKEND_*> flags indicating the event backend in 674Returns one of the C<EVBACKEND_*> flags indicating the event backend in
629use. 675use.
638 684
639=item ev_now_update (loop) 685=item ev_now_update (loop)
640 686
641Establishes the current time by querying the kernel, updating the time 687Establishes the current time by querying the kernel, updating the time
642returned by C<ev_now ()> in the progress. This is a costly operation and 688returned by C<ev_now ()> in the progress. This is a costly operation and
643is usually done automatically within C<ev_loop ()>. 689is usually done automatically within C<ev_run ()>.
644 690
645This function is rarely useful, but when some event callback runs for a 691This function is rarely useful, but when some event callback runs for a
646very long time without entering the event loop, updating libev's idea of 692very long time without entering the event loop, updating libev's idea of
647the current time is a good idea. 693the current time is a good idea.
648 694
650 696
651=item ev_suspend (loop) 697=item ev_suspend (loop)
652 698
653=item ev_resume (loop) 699=item ev_resume (loop)
654 700
655These two functions suspend and resume a loop, for use when the loop is 701These two functions suspend and resume an event loop, for use when the
656not used for a while and timeouts should not be processed. 702loop is not used for a while and timeouts should not be processed.
657 703
658A typical use case would be an interactive program such as a game: When 704A typical use case would be an interactive program such as a game: When
659the user presses C<^Z> to suspend the game and resumes it an hour later it 705the user presses C<^Z> to suspend the game and resumes it an hour later it
660would be best to handle timeouts as if no time had actually passed while 706would be best to handle timeouts as if no time had actually passed while
661the program was suspended. This can be achieved by calling C<ev_suspend> 707the program was suspended. This can be achieved by calling C<ev_suspend>
663C<ev_resume> directly afterwards to resume timer processing. 709C<ev_resume> directly afterwards to resume timer processing.
664 710
665Effectively, all C<ev_timer> watchers will be delayed by the time spend 711Effectively, all C<ev_timer> watchers will be delayed by the time spend
666between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers 712between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
667will be rescheduled (that is, they will lose any events that would have 713will be rescheduled (that is, they will lose any events that would have
668occured while suspended). 714occurred while suspended).
669 715
670After calling C<ev_suspend> you B<must not> call I<any> function on the 716After calling C<ev_suspend> you B<must not> call I<any> function on the
671given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> 717given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
672without a previous call to C<ev_suspend>. 718without a previous call to C<ev_suspend>.
673 719
674Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 720Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
675event loop time (see C<ev_now_update>). 721event loop time (see C<ev_now_update>).
676 722
677=item ev_loop (loop, int flags) 723=item ev_run (loop, int flags)
678 724
679Finally, this is it, the event handler. This function usually is called 725Finally, this is it, the event handler. This function usually is called
680after you initialised all your watchers and you want to start handling 726after you have initialised all your watchers and you want to start
681events. 727handling events. It will ask the operating system for any new events, call
728the watcher callbacks, an then repeat the whole process indefinitely: This
729is why event loops are called I<loops>.
682 730
683If the flags argument is specified as C<0>, it will not return until 731If the flags argument is specified as C<0>, it will keep handling events
684either no event watchers are active anymore or C<ev_unloop> was called. 732until either no event watchers are active anymore or C<ev_break> was
733called.
685 734
686Please note that an explicit C<ev_unloop> is usually better than 735Please note that an explicit C<ev_break> is usually better than
687relying on all watchers to be stopped when deciding when a program has 736relying on all watchers to be stopped when deciding when a program has
688finished (especially in interactive programs), but having a program 737finished (especially in interactive programs), but having a program
689that automatically loops as long as it has to and no longer by virtue 738that automatically loops as long as it has to and no longer by virtue
690of relying on its watchers stopping correctly, that is truly a thing of 739of relying on its watchers stopping correctly, that is truly a thing of
691beauty. 740beauty.
692 741
693A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 742A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
694those events and any already outstanding ones, but will not block your 743those events and any already outstanding ones, but will not wait and
695process in case there are no events and will return after one iteration of 744block your process in case there are no events and will return after one
696the loop. 745iteration of the loop. This is sometimes useful to poll and handle new
746events while doing lengthy calculations, to keep the program responsive.
697 747
698A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 748A flags value of C<EVRUN_ONCE> will look for new events (waiting if
699necessary) and will handle those and any already outstanding ones. It 749necessary) and will handle those and any already outstanding ones. It
700will block your process until at least one new event arrives (which could 750will block your process until at least one new event arrives (which could
701be an event internal to libev itself, so there is no guarantee that a 751be an event internal to libev itself, so there is no guarantee that a
702user-registered callback will be called), and will return after one 752user-registered callback will be called), and will return after one
703iteration of the loop. 753iteration of the loop.
704 754
705This is useful if you are waiting for some external event in conjunction 755This is useful if you are waiting for some external event in conjunction
706with something not expressible using other libev watchers (i.e. "roll your 756with something not expressible using other libev watchers (i.e. "roll your
707own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 757own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
708usually a better approach for this kind of thing. 758usually a better approach for this kind of thing.
709 759
710Here are the gory details of what C<ev_loop> does: 760Here are the gory details of what C<ev_run> does:
711 761
762 - Increment loop depth.
763 - Reset the ev_break status.
712 - Before the first iteration, call any pending watchers. 764 - Before the first iteration, call any pending watchers.
765 LOOP:
713 * If EVFLAG_FORKCHECK was used, check for a fork. 766 - If EVFLAG_FORKCHECK was used, check for a fork.
714 - If a fork was detected (by any means), queue and call all fork watchers. 767 - If a fork was detected (by any means), queue and call all fork watchers.
715 - Queue and call all prepare watchers. 768 - Queue and call all prepare watchers.
769 - If ev_break was called, goto FINISH.
716 - If we have been forked, detach and recreate the kernel state 770 - If we have been forked, detach and recreate the kernel state
717 as to not disturb the other process. 771 as to not disturb the other process.
718 - Update the kernel state with all outstanding changes. 772 - Update the kernel state with all outstanding changes.
719 - Update the "event loop time" (ev_now ()). 773 - Update the "event loop time" (ev_now ()).
720 - Calculate for how long to sleep or block, if at all 774 - Calculate for how long to sleep or block, if at all
721 (active idle watchers, EVLOOP_NONBLOCK or not having 775 (active idle watchers, EVRUN_NOWAIT or not having
722 any active watchers at all will result in not sleeping). 776 any active watchers at all will result in not sleeping).
723 - Sleep if the I/O and timer collect interval say so. 777 - Sleep if the I/O and timer collect interval say so.
778 - Increment loop iteration counter.
724 - Block the process, waiting for any events. 779 - Block the process, waiting for any events.
725 - Queue all outstanding I/O (fd) events. 780 - Queue all outstanding I/O (fd) events.
726 - Update the "event loop time" (ev_now ()), and do time jump adjustments. 781 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
727 - Queue all expired timers. 782 - Queue all expired timers.
728 - Queue all expired periodics. 783 - Queue all expired periodics.
729 - Unless any events are pending now, queue all idle watchers. 784 - Queue all idle watchers with priority higher than that of pending events.
730 - Queue all check watchers. 785 - Queue all check watchers.
731 - Call all queued watchers in reverse order (i.e. check watchers first). 786 - Call all queued watchers in reverse order (i.e. check watchers first).
732 Signals and child watchers are implemented as I/O watchers, and will 787 Signals and child watchers are implemented as I/O watchers, and will
733 be handled here by queueing them when their watcher gets executed. 788 be handled here by queueing them when their watcher gets executed.
734 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 789 - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
735 were used, or there are no active watchers, return, otherwise 790 were used, or there are no active watchers, goto FINISH, otherwise
736 continue with step *. 791 continue with step LOOP.
792 FINISH:
793 - Reset the ev_break status iff it was EVBREAK_ONE.
794 - Decrement the loop depth.
795 - Return.
737 796
738Example: Queue some jobs and then loop until no events are outstanding 797Example: Queue some jobs and then loop until no events are outstanding
739anymore. 798anymore.
740 799
741 ... queue jobs here, make sure they register event watchers as long 800 ... queue jobs here, make sure they register event watchers as long
742 ... as they still have work to do (even an idle watcher will do..) 801 ... as they still have work to do (even an idle watcher will do..)
743 ev_loop (my_loop, 0); 802 ev_run (my_loop, 0);
744 ... jobs done or somebody called unloop. yeah! 803 ... jobs done or somebody called unloop. yeah!
745 804
746=item ev_unloop (loop, how) 805=item ev_break (loop, how)
747 806
748Can be used to make a call to C<ev_loop> return early (but only after it 807Can be used to make a call to C<ev_run> return early (but only after it
749has processed all outstanding events). The C<how> argument must be either 808has processed all outstanding events). The C<how> argument must be either
750C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 809C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
751C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 810C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
752 811
753This "unloop state" will be cleared when entering C<ev_loop> again. 812This "unloop state" will be cleared when entering C<ev_run> again.
754 813
755It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. 814It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO##
756 815
757=item ev_ref (loop) 816=item ev_ref (loop)
758 817
759=item ev_unref (loop) 818=item ev_unref (loop)
760 819
761Ref/unref can be used to add or remove a reference count on the event 820Ref/unref can be used to add or remove a reference count on the event
762loop: Every watcher keeps one reference, and as long as the reference 821loop: Every watcher keeps one reference, and as long as the reference
763count is nonzero, C<ev_loop> will not return on its own. 822count is nonzero, C<ev_run> will not return on its own.
764 823
765If you have a watcher you never unregister that should not keep C<ev_loop> 824This is useful when you have a watcher that you never intend to
766from returning, call ev_unref() after starting, and ev_ref() before 825unregister, but that nevertheless should not keep C<ev_run> from
826returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
767stopping it. 827before stopping it.
768 828
769As an example, libev itself uses this for its internal signal pipe: It 829As an example, libev itself uses this for its internal signal pipe: It
770is not visible to the libev user and should not keep C<ev_loop> from 830is not visible to the libev user and should not keep C<ev_run> from
771exiting if no event watchers registered by it are active. It is also an 831exiting if no event watchers registered by it are active. It is also an
772excellent way to do this for generic recurring timers or from within 832excellent way to do this for generic recurring timers or from within
773third-party libraries. Just remember to I<unref after start> and I<ref 833third-party libraries. Just remember to I<unref after start> and I<ref
774before stop> (but only if the watcher wasn't active before, or was active 834before stop> (but only if the watcher wasn't active before, or was active
775before, respectively. Note also that libev might stop watchers itself 835before, respectively. Note also that libev might stop watchers itself
776(e.g. non-repeating timers) in which case you have to C<ev_ref> 836(e.g. non-repeating timers) in which case you have to C<ev_ref>
777in the callback). 837in the callback).
778 838
779Example: Create a signal watcher, but keep it from keeping C<ev_loop> 839Example: Create a signal watcher, but keep it from keeping C<ev_run>
780running when nothing else is active. 840running when nothing else is active.
781 841
782 ev_signal exitsig; 842 ev_signal exitsig;
783 ev_signal_init (&exitsig, sig_cb, SIGINT); 843 ev_signal_init (&exitsig, sig_cb, SIGINT);
784 ev_signal_start (loop, &exitsig); 844 ev_signal_start (loop, &exitsig);
829usually doesn't make much sense to set it to a lower value than C<0.01>, 889usually doesn't make much sense to set it to a lower value than C<0.01>,
830as this approaches the timing granularity of most systems. Note that if 890as this approaches the timing granularity of most systems. Note that if
831you do transactions with the outside world and you can't increase the 891you do transactions with the outside world and you can't increase the
832parallelity, then this setting will limit your transaction rate (if you 892parallelity, then this setting will limit your transaction rate (if you
833need to poll once per transaction and the I/O collect interval is 0.01, 893need to poll once per transaction and the I/O collect interval is 0.01,
834then you can't do more than 100 transations per second). 894then you can't do more than 100 transactions per second).
835 895
836Setting the I<timeout collect interval> can improve the opportunity for 896Setting the I<timeout collect interval> can improve the opportunity for
837saving power, as the program will "bundle" timer callback invocations that 897saving power, as the program will "bundle" timer callback invocations that
838are "near" in time together, by delaying some, thus reducing the number of 898are "near" in time together, by delaying some, thus reducing the number of
839times the process sleeps and wakes up again. Another useful technique to 899times the process sleeps and wakes up again. Another useful technique to
844more often than 100 times per second: 904more often than 100 times per second:
845 905
846 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1); 906 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
847 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); 907 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
848 908
909=item ev_invoke_pending (loop)
910
911This call will simply invoke all pending watchers while resetting their
912pending state. Normally, C<ev_run> does this automatically when required,
913but when overriding the invoke callback this call comes handy.
914
915=item int ev_pending_count (loop)
916
917Returns the number of pending watchers - zero indicates that no watchers
918are pending.
919
920=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
921
922This overrides the invoke pending functionality of the loop: Instead of
923invoking all pending watchers when there are any, C<ev_run> will call
924this callback instead. This is useful, for example, when you want to
925invoke the actual watchers inside another context (another thread etc.).
926
927If you want to reset the callback, use C<ev_invoke_pending> as new
928callback.
929
930=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
931
932Sometimes you want to share the same loop between multiple threads. This
933can be done relatively simply by putting mutex_lock/unlock calls around
934each call to a libev function.
935
936However, C<ev_run> can run an indefinite time, so it is not feasible
937to wait for it to return. One way around this is to wake up the event
938loop via C<ev_break> and C<av_async_send>, another way is to set these
939I<release> and I<acquire> callbacks on the loop.
940
941When set, then C<release> will be called just before the thread is
942suspended waiting for new events, and C<acquire> is called just
943afterwards.
944
945Ideally, C<release> will just call your mutex_unlock function, and
946C<acquire> will just call the mutex_lock function again.
947
948While event loop modifications are allowed between invocations of
949C<release> and C<acquire> (that's their only purpose after all), no
950modifications done will affect the event loop, i.e. adding watchers will
951have no effect on the set of file descriptors being watched, or the time
952waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
953to take note of any changes you made.
954
955In theory, threads executing C<ev_run> will be async-cancel safe between
956invocations of C<release> and C<acquire>.
957
958See also the locking example in the C<THREADS> section later in this
959document.
960
961=item ev_set_userdata (loop, void *data)
962
963=item ev_userdata (loop)
964
965Set and retrieve a single C<void *> associated with a loop. When
966C<ev_set_userdata> has never been called, then C<ev_userdata> returns
967C<0.>
968
969These two functions can be used to associate arbitrary data with a loop,
970and are intended solely for the C<invoke_pending_cb>, C<release> and
971C<acquire> callbacks described above, but of course can be (ab-)used for
972any other purpose as well.
973
849=item ev_loop_verify (loop) 974=item ev_verify (loop)
850 975
851This function only does something when C<EV_VERIFY> support has been 976This function only does something when C<EV_VERIFY> support has been
852compiled in, which is the default for non-minimal builds. It tries to go 977compiled in, which is the default for non-minimal builds. It tries to go
853through all internal structures and checks them for validity. If anything 978through all internal structures and checks them for validity. If anything
854is found to be inconsistent, it will print an error message to standard 979is found to be inconsistent, it will print an error message to standard
865 990
866In the following description, uppercase C<TYPE> in names stands for the 991In the following description, uppercase C<TYPE> in names stands for the
867watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer 992watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
868watchers and C<ev_io_start> for I/O watchers. 993watchers and C<ev_io_start> for I/O watchers.
869 994
870A watcher is a structure that you create and register to record your 995A watcher is an opaque structure that you allocate and register to record
871interest in some event. For instance, if you want to wait for STDIN to 996your interest in some event. To make a concrete example, imagine you want
872become readable, you would create an C<ev_io> watcher for that: 997to wait for STDIN to become readable, you would create an C<ev_io> watcher
998for that:
873 999
874 static void my_cb (struct ev_loop *loop, ev_io *w, int revents) 1000 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
875 { 1001 {
876 ev_io_stop (w); 1002 ev_io_stop (w);
877 ev_unloop (loop, EVUNLOOP_ALL); 1003 ev_break (loop, EVBREAK_ALL);
878 } 1004 }
879 1005
880 struct ev_loop *loop = ev_default_loop (0); 1006 struct ev_loop *loop = ev_default_loop (0);
881 1007
882 ev_io stdin_watcher; 1008 ev_io stdin_watcher;
883 1009
884 ev_init (&stdin_watcher, my_cb); 1010 ev_init (&stdin_watcher, my_cb);
885 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 1011 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
886 ev_io_start (loop, &stdin_watcher); 1012 ev_io_start (loop, &stdin_watcher);
887 1013
888 ev_loop (loop, 0); 1014 ev_run (loop, 0);
889 1015
890As you can see, you are responsible for allocating the memory for your 1016As you can see, you are responsible for allocating the memory for your
891watcher structures (and it is I<usually> a bad idea to do this on the 1017watcher structures (and it is I<usually> a bad idea to do this on the
892stack). 1018stack).
893 1019
894Each watcher has an associated watcher structure (called C<struct ev_TYPE> 1020Each watcher has an associated watcher structure (called C<struct ev_TYPE>
895or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). 1021or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
896 1022
897Each watcher structure must be initialised by a call to C<ev_init 1023Each watcher structure must be initialised by a call to C<ev_init (watcher
898(watcher *, callback)>, which expects a callback to be provided. This 1024*, callback)>, which expects a callback to be provided. This callback is
899callback gets invoked each time the event occurs (or, in the case of I/O 1025invoked each time the event occurs (or, in the case of I/O watchers, each
900watchers, each time the event loop detects that the file descriptor given 1026time the event loop detects that the file descriptor given is readable
901is readable and/or writable). 1027and/or writable).
902 1028
903Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> 1029Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
904macro to configure it, with arguments specific to the watcher type. There 1030macro to configure it, with arguments specific to the watcher type. There
905is also a macro to combine initialisation and setting in one call: C<< 1031is also a macro to combine initialisation and setting in one call: C<<
906ev_TYPE_init (watcher *, callback, ...) >>. 1032ev_TYPE_init (watcher *, callback, ...) >>.
929=item C<EV_WRITE> 1055=item C<EV_WRITE>
930 1056
931The file descriptor in the C<ev_io> watcher has become readable and/or 1057The file descriptor in the C<ev_io> watcher has become readable and/or
932writable. 1058writable.
933 1059
934=item C<EV_TIMEOUT> 1060=item C<EV_TIMER>
935 1061
936The C<ev_timer> watcher has timed out. 1062The C<ev_timer> watcher has timed out.
937 1063
938=item C<EV_PERIODIC> 1064=item C<EV_PERIODIC>
939 1065
957 1083
958=item C<EV_PREPARE> 1084=item C<EV_PREPARE>
959 1085
960=item C<EV_CHECK> 1086=item C<EV_CHECK>
961 1087
962All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts 1088All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
963to gather new events, and all C<ev_check> watchers are invoked just after 1089to gather new events, and all C<ev_check> watchers are invoked just after
964C<ev_loop> has gathered them, but before it invokes any callbacks for any 1090C<ev_run> has gathered them, but before it invokes any callbacks for any
965received events. Callbacks of both watcher types can start and stop as 1091received events. Callbacks of both watcher types can start and stop as
966many watchers as they want, and all of them will be taken into account 1092many watchers as they want, and all of them will be taken into account
967(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1093(for example, a C<ev_prepare> watcher might start an idle watcher to keep
968C<ev_loop> from blocking). 1094C<ev_run> from blocking).
969 1095
970=item C<EV_EMBED> 1096=item C<EV_EMBED>
971 1097
972The embedded event loop specified in the C<ev_embed> watcher needs attention. 1098The embedded event loop specified in the C<ev_embed> watcher needs attention.
973 1099
1004programs, though, as the fd could already be closed and reused for another 1130programs, though, as the fd could already be closed and reused for another
1005thing, so beware. 1131thing, so beware.
1006 1132
1007=back 1133=back
1008 1134
1135=head2 WATCHER STATES
1136
1137There are various watcher states mentioned throughout this manual -
1138active, pending and so on. In this section these states and the rules to
1139transition between them will be described in more detail - and while these
1140rules might look complicated, they usually do "the right thing".
1141
1142=over 4
1143
1144=item initialiased
1145
1146Before a watcher can be registered with the event looop it has to be
1147initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1148C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1149
1150In this state it is simply some block of memory that is suitable for use
1151in an event loop. It can be moved around, freed, reused etc. at will.
1152
1153=item started/running/active
1154
1155Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1156property of the event loop, and is actively waiting for events. While in
1157this state it cannot be accessed (except in a few documented ways), moved,
1158freed or anything else - the only legal thing is to keep a pointer to it,
1159and call libev functions on it that are documented to work on active watchers.
1160
1161=item pending
1162
1163If a watcher is active and libev determines that an event it is interested
1164in has occurred (such as a timer expiring), it will become pending. It will
1165stay in this pending state until either it is stopped or its callback is
1166about to be invoked, so it is not normally pending inside the watcher
1167callback.
1168
1169The watcher might or might not be active while it is pending (for example,
1170an expired non-repeating timer can be pending but no longer active). If it
1171is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1172but it is still property of the event loop at this time, so cannot be
1173moved, freed or reused. And if it is active the rules described in the
1174previous item still apply.
1175
1176It is also possible to feed an event on a watcher that is not active (e.g.
1177via C<ev_feed_event>), in which case it becomes pending without being
1178active.
1179
1180=item stopped
1181
1182A watcher can be stopped implicitly by libev (in which case it might still
1183be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1184latter will clear any pending state the watcher might be in, regardless
1185of whether it was active or not, so stopping a watcher explicitly before
1186freeing it is often a good idea.
1187
1188While stopped (and not pending) the watcher is essentially in the
1189initialised state, that is it can be reused, moved, modified in any way
1190you wish.
1191
1192=back
1193
1009=head2 GENERIC WATCHER FUNCTIONS 1194=head2 GENERIC WATCHER FUNCTIONS
1010 1195
1011=over 4 1196=over 4
1012 1197
1013=item C<ev_init> (ev_TYPE *watcher, callback) 1198=item C<ev_init> (ev_TYPE *watcher, callback)
1029 1214
1030 ev_io w; 1215 ev_io w;
1031 ev_init (&w, my_cb); 1216 ev_init (&w, my_cb);
1032 ev_io_set (&w, STDIN_FILENO, EV_READ); 1217 ev_io_set (&w, STDIN_FILENO, EV_READ);
1033 1218
1034=item C<ev_TYPE_set> (ev_TYPE *, [args]) 1219=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1035 1220
1036This macro initialises the type-specific parts of a watcher. You need to 1221This macro initialises the type-specific parts of a watcher. You need to
1037call C<ev_init> at least once before you call this macro, but you can 1222call C<ev_init> at least once before you call this macro, but you can
1038call C<ev_TYPE_set> any number of times. You must not, however, call this 1223call C<ev_TYPE_set> any number of times. You must not, however, call this
1039macro on a watcher that is active (it can be pending, however, which is a 1224macro on a watcher that is active (it can be pending, however, which is a
1052 1237
1053Example: Initialise and set an C<ev_io> watcher in one step. 1238Example: Initialise and set an C<ev_io> watcher in one step.
1054 1239
1055 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); 1240 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1056 1241
1057=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 1242=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1058 1243
1059Starts (activates) the given watcher. Only active watchers will receive 1244Starts (activates) the given watcher. Only active watchers will receive
1060events. If the watcher is already active nothing will happen. 1245events. If the watcher is already active nothing will happen.
1061 1246
1062Example: Start the C<ev_io> watcher that is being abused as example in this 1247Example: Start the C<ev_io> watcher that is being abused as example in this
1063whole section. 1248whole section.
1064 1249
1065 ev_io_start (EV_DEFAULT_UC, &w); 1250 ev_io_start (EV_DEFAULT_UC, &w);
1066 1251
1067=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 1252=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1068 1253
1069Stops the given watcher if active, and clears the pending status (whether 1254Stops the given watcher if active, and clears the pending status (whether
1070the watcher was active or not). 1255the watcher was active or not).
1071 1256
1072It is possible that stopped watchers are pending - for example, 1257It is possible that stopped watchers are pending - for example,
1097=item ev_cb_set (ev_TYPE *watcher, callback) 1282=item ev_cb_set (ev_TYPE *watcher, callback)
1098 1283
1099Change the callback. You can change the callback at virtually any time 1284Change the callback. You can change the callback at virtually any time
1100(modulo threads). 1285(modulo threads).
1101 1286
1102=item ev_set_priority (ev_TYPE *watcher, priority) 1287=item ev_set_priority (ev_TYPE *watcher, int priority)
1103 1288
1104=item int ev_priority (ev_TYPE *watcher) 1289=item int ev_priority (ev_TYPE *watcher)
1105 1290
1106Set and query the priority of the watcher. The priority is a small 1291Set and query the priority of the watcher. The priority is a small
1107integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> 1292integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1138returns its C<revents> bitset (as if its callback was invoked). If the 1323returns its C<revents> bitset (as if its callback was invoked). If the
1139watcher isn't pending it does nothing and returns C<0>. 1324watcher isn't pending it does nothing and returns C<0>.
1140 1325
1141Sometimes it can be useful to "poll" a watcher instead of waiting for its 1326Sometimes it can be useful to "poll" a watcher instead of waiting for its
1142callback to be invoked, which can be accomplished with this function. 1327callback to be invoked, which can be accomplished with this function.
1328
1329=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1330
1331Feeds the given event set into the event loop, as if the specified event
1332had happened for the specified watcher (which must be a pointer to an
1333initialised but not necessarily started event watcher). Obviously you must
1334not free the watcher as long as it has pending events.
1335
1336Stopping the watcher, letting libev invoke it, or calling
1337C<ev_clear_pending> will clear the pending event, even if the watcher was
1338not started in the first place.
1339
1340See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1341functions that do not need a watcher.
1143 1342
1144=back 1343=back
1145 1344
1146 1345
1147=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1346=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1258 1457
1259For example, to emulate how many other event libraries handle priorities, 1458For example, to emulate how many other event libraries handle priorities,
1260you can associate an C<ev_idle> watcher to each such watcher, and in 1459you can associate an C<ev_idle> watcher to each such watcher, and in
1261the normal watcher callback, you just start the idle watcher. The real 1460the normal watcher callback, you just start the idle watcher. The real
1262processing is done in the idle watcher callback. This causes libev to 1461processing is done in the idle watcher callback. This causes libev to
1263continously poll and process kernel event data for the watcher, but when 1462continuously poll and process kernel event data for the watcher, but when
1264the lock-out case is known to be rare (which in turn is rare :), this is 1463the lock-out case is known to be rare (which in turn is rare :), this is
1265workable. 1464workable.
1266 1465
1267Usually, however, the lock-out model implemented that way will perform 1466Usually, however, the lock-out model implemented that way will perform
1268miserably under the type of load it was designed to handle. In that case, 1467miserably under the type of load it was designed to handle. In that case,
1282 { 1481 {
1283 // stop the I/O watcher, we received the event, but 1482 // stop the I/O watcher, we received the event, but
1284 // are not yet ready to handle it. 1483 // are not yet ready to handle it.
1285 ev_io_stop (EV_A_ w); 1484 ev_io_stop (EV_A_ w);
1286 1485
1287 // start the idle watcher to ahndle the actual event. 1486 // start the idle watcher to handle the actual event.
1288 // it will not be executed as long as other watchers 1487 // it will not be executed as long as other watchers
1289 // with the default priority are receiving events. 1488 // with the default priority are receiving events.
1290 ev_idle_start (EV_A_ &idle); 1489 ev_idle_start (EV_A_ &idle);
1291 } 1490 }
1292 1491
1346 1545
1347If you cannot use non-blocking mode, then force the use of a 1546If you cannot use non-blocking mode, then force the use of a
1348known-to-be-good backend (at the time of this writing, this includes only 1547known-to-be-good backend (at the time of this writing, this includes only
1349C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file 1548C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1350descriptors for which non-blocking operation makes no sense (such as 1549descriptors for which non-blocking operation makes no sense (such as
1351files) - libev doesn't guarentee any specific behaviour in that case. 1550files) - libev doesn't guarantee any specific behaviour in that case.
1352 1551
1353Another thing you have to watch out for is that it is quite easy to 1552Another thing you have to watch out for is that it is quite easy to
1354receive "spurious" readiness notifications, that is your callback might 1553receive "spurious" readiness notifications, that is your callback might
1355be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1554be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1356because there is no data. Not only are some backends known to create a 1555because there is no data. Not only are some backends known to create a
1421 1620
1422So when you encounter spurious, unexplained daemon exits, make sure you 1621So when you encounter spurious, unexplained daemon exits, make sure you
1423ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1622ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1424somewhere, as that would have given you a big clue). 1623somewhere, as that would have given you a big clue).
1425 1624
1625=head3 The special problem of accept()ing when you can't
1626
1627Many implementations of the POSIX C<accept> function (for example,
1628found in post-2004 Linux) have the peculiar behaviour of not removing a
1629connection from the pending queue in all error cases.
1630
1631For example, larger servers often run out of file descriptors (because
1632of resource limits), causing C<accept> to fail with C<ENFILE> but not
1633rejecting the connection, leading to libev signalling readiness on
1634the next iteration again (the connection still exists after all), and
1635typically causing the program to loop at 100% CPU usage.
1636
1637Unfortunately, the set of errors that cause this issue differs between
1638operating systems, there is usually little the app can do to remedy the
1639situation, and no known thread-safe method of removing the connection to
1640cope with overload is known (to me).
1641
1642One of the easiest ways to handle this situation is to just ignore it
1643- when the program encounters an overload, it will just loop until the
1644situation is over. While this is a form of busy waiting, no OS offers an
1645event-based way to handle this situation, so it's the best one can do.
1646
1647A better way to handle the situation is to log any errors other than
1648C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
1649messages, and continue as usual, which at least gives the user an idea of
1650what could be wrong ("raise the ulimit!"). For extra points one could stop
1651the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
1652usage.
1653
1654If your program is single-threaded, then you could also keep a dummy file
1655descriptor for overload situations (e.g. by opening F</dev/null>), and
1656when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
1657close that fd, and create a new dummy fd. This will gracefully refuse
1658clients under typical overload conditions.
1659
1660The last way to handle it is to simply log the error and C<exit>, as
1661is often done with C<malloc> failures, but this results in an easy
1662opportunity for a DoS attack.
1426 1663
1427=head3 Watcher-Specific Functions 1664=head3 Watcher-Specific Functions
1428 1665
1429=over 4 1666=over 4
1430 1667
1462 ... 1699 ...
1463 struct ev_loop *loop = ev_default_init (0); 1700 struct ev_loop *loop = ev_default_init (0);
1464 ev_io stdin_readable; 1701 ev_io stdin_readable;
1465 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1702 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1466 ev_io_start (loop, &stdin_readable); 1703 ev_io_start (loop, &stdin_readable);
1467 ev_loop (loop, 0); 1704 ev_run (loop, 0);
1468 1705
1469 1706
1470=head2 C<ev_timer> - relative and optionally repeating timeouts 1707=head2 C<ev_timer> - relative and optionally repeating timeouts
1471 1708
1472Timer watchers are simple relative timers that generate an event after a 1709Timer watchers are simple relative timers that generate an event after a
1480 1717
1481The callback is guaranteed to be invoked only I<after> its timeout has 1718The callback is guaranteed to be invoked only I<after> its timeout has
1482passed (not I<at>, so on systems with very low-resolution clocks this 1719passed (not I<at>, so on systems with very low-resolution clocks this
1483might introduce a small delay). If multiple timers become ready during the 1720might introduce a small delay). If multiple timers become ready during the
1484same loop iteration then the ones with earlier time-out values are invoked 1721same loop iteration then the ones with earlier time-out values are invoked
1485before ones with later time-out values (but this is no longer true when a 1722before ones of the same priority with later time-out values (but this is
1486callback calls C<ev_loop> recursively). 1723no longer true when a callback calls C<ev_run> recursively).
1487 1724
1488=head3 Be smart about timeouts 1725=head3 Be smart about timeouts
1489 1726
1490Many real-world problems involve some kind of timeout, usually for error 1727Many real-world problems involve some kind of timeout, usually for error
1491recovery. A typical example is an HTTP request - if the other side hangs, 1728recovery. A typical example is an HTTP request - if the other side hangs,
1577 ev_tstamp timeout = last_activity + 60.; 1814 ev_tstamp timeout = last_activity + 60.;
1578 1815
1579 // if last_activity + 60. is older than now, we did time out 1816 // if last_activity + 60. is older than now, we did time out
1580 if (timeout < now) 1817 if (timeout < now)
1581 { 1818 {
1582 // timeout occured, take action 1819 // timeout occurred, take action
1583 } 1820 }
1584 else 1821 else
1585 { 1822 {
1586 // callback was invoked, but there was some activity, re-arm 1823 // callback was invoked, but there was some activity, re-arm
1587 // the watcher to fire in last_activity + 60, which is 1824 // the watcher to fire in last_activity + 60, which is
1609to the current time (meaning we just have some activity :), then call the 1846to the current time (meaning we just have some activity :), then call the
1610callback, which will "do the right thing" and start the timer: 1847callback, which will "do the right thing" and start the timer:
1611 1848
1612 ev_init (timer, callback); 1849 ev_init (timer, callback);
1613 last_activity = ev_now (loop); 1850 last_activity = ev_now (loop);
1614 callback (loop, timer, EV_TIMEOUT); 1851 callback (loop, timer, EV_TIMER);
1615 1852
1616And when there is some activity, simply store the current time in 1853And when there is some activity, simply store the current time in
1617C<last_activity>, no libev calls at all: 1854C<last_activity>, no libev calls at all:
1618 1855
1619 last_actiivty = ev_now (loop); 1856 last_activity = ev_now (loop);
1620 1857
1621This technique is slightly more complex, but in most cases where the 1858This technique is slightly more complex, but in most cases where the
1622time-out is unlikely to be triggered, much more efficient. 1859time-out is unlikely to be triggered, much more efficient.
1623 1860
1624Changing the timeout is trivial as well (if it isn't hard-coded in the 1861Changing the timeout is trivial as well (if it isn't hard-coded in the
1662 1899
1663=head3 The special problem of time updates 1900=head3 The special problem of time updates
1664 1901
1665Establishing the current time is a costly operation (it usually takes at 1902Establishing the current time is a costly operation (it usually takes at
1666least two system calls): EV therefore updates its idea of the current 1903least two system calls): EV therefore updates its idea of the current
1667time only before and after C<ev_loop> collects new events, which causes a 1904time only before and after C<ev_run> collects new events, which causes a
1668growing difference between C<ev_now ()> and C<ev_time ()> when handling 1905growing difference between C<ev_now ()> and C<ev_time ()> when handling
1669lots of events in one iteration. 1906lots of events in one iteration.
1670 1907
1671The relative timeouts are calculated relative to the C<ev_now ()> 1908The relative timeouts are calculated relative to the C<ev_now ()>
1672time. This is usually the right thing as this timestamp refers to the time 1909time. This is usually the right thing as this timestamp refers to the time
1678 1915
1679If the event loop is suspended for a long time, you can also force an 1916If the event loop is suspended for a long time, you can also force an
1680update of the time returned by C<ev_now ()> by calling C<ev_now_update 1917update of the time returned by C<ev_now ()> by calling C<ev_now_update
1681()>. 1918()>.
1682 1919
1920=head3 The special problems of suspended animation
1921
1922When you leave the server world it is quite customary to hit machines that
1923can suspend/hibernate - what happens to the clocks during such a suspend?
1924
1925Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1926all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1927to run until the system is suspended, but they will not advance while the
1928system is suspended. That means, on resume, it will be as if the program
1929was frozen for a few seconds, but the suspend time will not be counted
1930towards C<ev_timer> when a monotonic clock source is used. The real time
1931clock advanced as expected, but if it is used as sole clocksource, then a
1932long suspend would be detected as a time jump by libev, and timers would
1933be adjusted accordingly.
1934
1935I would not be surprised to see different behaviour in different between
1936operating systems, OS versions or even different hardware.
1937
1938The other form of suspend (job control, or sending a SIGSTOP) will see a
1939time jump in the monotonic clocks and the realtime clock. If the program
1940is suspended for a very long time, and monotonic clock sources are in use,
1941then you can expect C<ev_timer>s to expire as the full suspension time
1942will be counted towards the timers. When no monotonic clock source is in
1943use, then libev will again assume a timejump and adjust accordingly.
1944
1945It might be beneficial for this latter case to call C<ev_suspend>
1946and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1947deterministic behaviour in this case (you can do nothing against
1948C<SIGSTOP>).
1949
1683=head3 Watcher-Specific Functions and Data Members 1950=head3 Watcher-Specific Functions and Data Members
1684 1951
1685=over 4 1952=over 4
1686 1953
1687=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1954=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1713C<repeat> value), or reset the running timer to the C<repeat> value. 1980C<repeat> value), or reset the running timer to the C<repeat> value.
1714 1981
1715This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 1982This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1716usage example. 1983usage example.
1717 1984
1985=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1986
1987Returns the remaining time until a timer fires. If the timer is active,
1988then this time is relative to the current event loop time, otherwise it's
1989the timeout value currently configured.
1990
1991That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1992C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
1993will return C<4>. When the timer expires and is restarted, it will return
1994roughly C<7> (likely slightly less as callback invocation takes some time,
1995too), and so on.
1996
1718=item ev_tstamp repeat [read-write] 1997=item ev_tstamp repeat [read-write]
1719 1998
1720The current C<repeat> value. Will be used each time the watcher times out 1999The current C<repeat> value. Will be used each time the watcher times out
1721or C<ev_timer_again> is called, and determines the next timeout (if any), 2000or C<ev_timer_again> is called, and determines the next timeout (if any),
1722which is also when any modifications are taken into account. 2001which is also when any modifications are taken into account.
1747 } 2026 }
1748 2027
1749 ev_timer mytimer; 2028 ev_timer mytimer;
1750 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2029 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1751 ev_timer_again (&mytimer); /* start timer */ 2030 ev_timer_again (&mytimer); /* start timer */
1752 ev_loop (loop, 0); 2031 ev_run (loop, 0);
1753 2032
1754 // and in some piece of code that gets executed on any "activity": 2033 // and in some piece of code that gets executed on any "activity":
1755 // reset the timeout to start ticking again at 10 seconds 2034 // reset the timeout to start ticking again at 10 seconds
1756 ev_timer_again (&mytimer); 2035 ev_timer_again (&mytimer);
1757 2036
1783 2062
1784As with timers, the callback is guaranteed to be invoked only when the 2063As with timers, the callback is guaranteed to be invoked only when the
1785point in time where it is supposed to trigger has passed. If multiple 2064point in time where it is supposed to trigger has passed. If multiple
1786timers become ready during the same loop iteration then the ones with 2065timers become ready during the same loop iteration then the ones with
1787earlier time-out values are invoked before ones with later time-out values 2066earlier time-out values are invoked before ones with later time-out values
1788(but this is no longer true when a callback calls C<ev_loop> recursively). 2067(but this is no longer true when a callback calls C<ev_run> recursively).
1789 2068
1790=head3 Watcher-Specific Functions and Data Members 2069=head3 Watcher-Specific Functions and Data Members
1791 2070
1792=over 4 2071=over 4
1793 2072
1921Example: Call a callback every hour, or, more precisely, whenever the 2200Example: Call a callback every hour, or, more precisely, whenever the
1922system time is divisible by 3600. The callback invocation times have 2201system time is divisible by 3600. The callback invocation times have
1923potentially a lot of jitter, but good long-term stability. 2202potentially a lot of jitter, but good long-term stability.
1924 2203
1925 static void 2204 static void
1926 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2205 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
1927 { 2206 {
1928 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2207 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1929 } 2208 }
1930 2209
1931 ev_periodic hourly_tick; 2210 ev_periodic hourly_tick;
1957Signal watchers will trigger an event when the process receives a specific 2236Signal watchers will trigger an event when the process receives a specific
1958signal one or more times. Even though signals are very asynchronous, libev 2237signal one or more times. Even though signals are very asynchronous, libev
1959will try it's best to deliver signals synchronously, i.e. as part of the 2238will try it's best to deliver signals synchronously, i.e. as part of the
1960normal event processing, like any other event. 2239normal event processing, like any other event.
1961 2240
1962If you want signals asynchronously, just use C<sigaction> as you would 2241If you want signals to be delivered truly asynchronously, just use
1963do without libev and forget about sharing the signal. You can even use 2242C<sigaction> as you would do without libev and forget about sharing
1964C<ev_async> from a signal handler to synchronously wake up an event loop. 2243the signal. You can even use C<ev_async> from a signal handler to
2244synchronously wake up an event loop.
1965 2245
1966You can configure as many watchers as you like per signal. Only when the 2246You can configure as many watchers as you like for the same signal, but
2247only within the same loop, i.e. you can watch for C<SIGINT> in your
2248default loop and for C<SIGIO> in another loop, but you cannot watch for
2249C<SIGINT> in both the default loop and another loop at the same time. At
2250the moment, C<SIGCHLD> is permanently tied to the default loop.
2251
1967first watcher gets started will libev actually register a signal handler 2252When the first watcher gets started will libev actually register something
1968with the kernel (thus it coexists with your own signal handlers as long as 2253with the kernel (thus it coexists with your own signal handlers as long as
1969you don't register any with libev for the same signal). Similarly, when 2254you don't register any with libev for the same signal).
1970the last signal watcher for a signal is stopped, libev will reset the
1971signal handler to SIG_DFL (regardless of what it was set to before).
1972 2255
1973If possible and supported, libev will install its handlers with 2256If possible and supported, libev will install its handlers with
1974C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2257C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1975interrupted. If you have a problem with system calls getting interrupted by 2258not be unduly interrupted. If you have a problem with system calls getting
1976signals you can block all signals in an C<ev_check> watcher and unblock 2259interrupted by signals you can block all signals in an C<ev_check> watcher
1977them in an C<ev_prepare> watcher. 2260and unblock them in an C<ev_prepare> watcher.
2261
2262=head3 The special problem of inheritance over fork/execve/pthread_create
2263
2264Both the signal mask (C<sigprocmask>) and the signal disposition
2265(C<sigaction>) are unspecified after starting a signal watcher (and after
2266stopping it again), that is, libev might or might not block the signal,
2267and might or might not set or restore the installed signal handler.
2268
2269While this does not matter for the signal disposition (libev never
2270sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2271C<execve>), this matters for the signal mask: many programs do not expect
2272certain signals to be blocked.
2273
2274This means that before calling C<exec> (from the child) you should reset
2275the signal mask to whatever "default" you expect (all clear is a good
2276choice usually).
2277
2278The simplest way to ensure that the signal mask is reset in the child is
2279to install a fork handler with C<pthread_atfork> that resets it. That will
2280catch fork calls done by libraries (such as the libc) as well.
2281
2282In current versions of libev, the signal will not be blocked indefinitely
2283unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
2284the window of opportunity for problems, it will not go away, as libev
2285I<has> to modify the signal mask, at least temporarily.
2286
2287So I can't stress this enough: I<If you do not reset your signal mask when
2288you expect it to be empty, you have a race condition in your code>. This
2289is not a libev-specific thing, this is true for most event libraries.
1978 2290
1979=head3 Watcher-Specific Functions and Data Members 2291=head3 Watcher-Specific Functions and Data Members
1980 2292
1981=over 4 2293=over 4
1982 2294
1998Example: Try to exit cleanly on SIGINT. 2310Example: Try to exit cleanly on SIGINT.
1999 2311
2000 static void 2312 static void
2001 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2313 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2002 { 2314 {
2003 ev_unloop (loop, EVUNLOOP_ALL); 2315 ev_break (loop, EVBREAK_ALL);
2004 } 2316 }
2005 2317
2006 ev_signal signal_watcher; 2318 ev_signal signal_watcher;
2007 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2319 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2008 ev_signal_start (loop, &signal_watcher); 2320 ev_signal_start (loop, &signal_watcher);
2020in the next callback invocation is not. 2332in the next callback invocation is not.
2021 2333
2022Only the default event loop is capable of handling signals, and therefore 2334Only the default event loop is capable of handling signals, and therefore
2023you can only register child watchers in the default event loop. 2335you can only register child watchers in the default event loop.
2024 2336
2337Due to some design glitches inside libev, child watchers will always be
2338handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2339libev)
2340
2025=head3 Process Interaction 2341=head3 Process Interaction
2026 2342
2027Libev grabs C<SIGCHLD> as soon as the default event loop is 2343Libev grabs C<SIGCHLD> as soon as the default event loop is
2028initialised. This is necessary to guarantee proper behaviour even if 2344initialised. This is necessary to guarantee proper behaviour even if the
2029the first child watcher is started after the child exits. The occurrence 2345first child watcher is started after the child exits. The occurrence
2030of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2346of C<SIGCHLD> is recorded asynchronously, but child reaping is done
2031synchronously as part of the event loop processing. Libev always reaps all 2347synchronously as part of the event loop processing. Libev always reaps all
2032children, even ones not watched. 2348children, even ones not watched.
2033 2349
2034=head3 Overriding the Built-In Processing 2350=head3 Overriding the Built-In Processing
2044=head3 Stopping the Child Watcher 2360=head3 Stopping the Child Watcher
2045 2361
2046Currently, the child watcher never gets stopped, even when the 2362Currently, the child watcher never gets stopped, even when the
2047child terminates, so normally one needs to stop the watcher in the 2363child terminates, so normally one needs to stop the watcher in the
2048callback. Future versions of libev might stop the watcher automatically 2364callback. Future versions of libev might stop the watcher automatically
2049when a child exit is detected. 2365when a child exit is detected (calling C<ev_child_stop> twice is not a
2366problem).
2050 2367
2051=head3 Watcher-Specific Functions and Data Members 2368=head3 Watcher-Specific Functions and Data Members
2052 2369
2053=over 4 2370=over 4
2054 2371
2389 2706
2390Prepare and check watchers are usually (but not always) used in pairs: 2707Prepare and check watchers are usually (but not always) used in pairs:
2391prepare watchers get invoked before the process blocks and check watchers 2708prepare watchers get invoked before the process blocks and check watchers
2392afterwards. 2709afterwards.
2393 2710
2394You I<must not> call C<ev_loop> or similar functions that enter 2711You I<must not> call C<ev_run> or similar functions that enter
2395the current event loop from either C<ev_prepare> or C<ev_check> 2712the current event loop from either C<ev_prepare> or C<ev_check>
2396watchers. Other loops than the current one are fine, however. The 2713watchers. Other loops than the current one are fine, however. The
2397rationale behind this is that you do not need to check for recursion in 2714rationale behind this is that you do not need to check for recursion in
2398those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2715those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2399C<ev_check> so if you have one watcher of each kind they will always be 2716C<ev_check> so if you have one watcher of each kind they will always be
2567 2884
2568 if (timeout >= 0) 2885 if (timeout >= 0)
2569 // create/start timer 2886 // create/start timer
2570 2887
2571 // poll 2888 // poll
2572 ev_loop (EV_A_ 0); 2889 ev_run (EV_A_ 0);
2573 2890
2574 // stop timer again 2891 // stop timer again
2575 if (timeout >= 0) 2892 if (timeout >= 0)
2576 ev_timer_stop (EV_A_ &to); 2893 ev_timer_stop (EV_A_ &to);
2577 2894
2655if you do not want that, you need to temporarily stop the embed watcher). 2972if you do not want that, you need to temporarily stop the embed watcher).
2656 2973
2657=item ev_embed_sweep (loop, ev_embed *) 2974=item ev_embed_sweep (loop, ev_embed *)
2658 2975
2659Make a single, non-blocking sweep over the embedded loop. This works 2976Make a single, non-blocking sweep over the embedded loop. This works
2660similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2977similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2661appropriate way for embedded loops. 2978appropriate way for embedded loops.
2662 2979
2663=item struct ev_loop *other [read-only] 2980=item struct ev_loop *other [read-only]
2664 2981
2665The embedded event loop. 2982The embedded event loop.
2725C<ev_default_fork> cheats and calls it in the wrong process, the fork 3042C<ev_default_fork> cheats and calls it in the wrong process, the fork
2726handlers will be invoked, too, of course. 3043handlers will be invoked, too, of course.
2727 3044
2728=head3 The special problem of life after fork - how is it possible? 3045=head3 The special problem of life after fork - how is it possible?
2729 3046
2730Most uses of C<fork()> consist of forking, then some simple calls to ste 3047Most uses of C<fork()> consist of forking, then some simple calls to set
2731up/change the process environment, followed by a call to C<exec()>. This 3048up/change the process environment, followed by a call to C<exec()>. This
2732sequence should be handled by libev without any problems. 3049sequence should be handled by libev without any problems.
2733 3050
2734This changes when the application actually wants to do event handling 3051This changes when the application actually wants to do event handling
2735in the child, or both parent in child, in effect "continuing" after the 3052in the child, or both parent in child, in effect "continuing" after the
2769believe me. 3086believe me.
2770 3087
2771=back 3088=back
2772 3089
2773 3090
2774=head2 C<ev_async> - how to wake up another event loop 3091=head2 C<ev_async> - how to wake up an event loop
2775 3092
2776In general, you cannot use an C<ev_loop> from multiple threads or other 3093In general, you cannot use an C<ev_run> from multiple threads or other
2777asynchronous sources such as signal handlers (as opposed to multiple event 3094asynchronous sources such as signal handlers (as opposed to multiple event
2778loops - those are of course safe to use in different threads). 3095loops - those are of course safe to use in different threads).
2779 3096
2780Sometimes, however, you need to wake up another event loop you do not 3097Sometimes, however, you need to wake up an event loop you do not control,
2781control, for example because it belongs to another thread. This is what 3098for example because it belongs to another thread. This is what C<ev_async>
2782C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3099watchers do: as long as the C<ev_async> watcher is active, you can signal
2783can signal it by calling C<ev_async_send>, which is thread- and signal 3100it by calling C<ev_async_send>, which is thread- and signal safe.
2784safe.
2785 3101
2786This functionality is very similar to C<ev_signal> watchers, as signals, 3102This functionality is very similar to C<ev_signal> watchers, as signals,
2787too, are asynchronous in nature, and signals, too, will be compressed 3103too, are asynchronous in nature, and signals, too, will be compressed
2788(i.e. the number of callback invocations may be less than the number of 3104(i.e. the number of callback invocations may be less than the number of
2789C<ev_async_sent> calls). 3105C<ev_async_sent> calls).
2794=head3 Queueing 3110=head3 Queueing
2795 3111
2796C<ev_async> does not support queueing of data in any way. The reason 3112C<ev_async> does not support queueing of data in any way. The reason
2797is that the author does not know of a simple (or any) algorithm for a 3113is that the author does not know of a simple (or any) algorithm for a
2798multiple-writer-single-reader queue that works in all cases and doesn't 3114multiple-writer-single-reader queue that works in all cases and doesn't
2799need elaborate support such as pthreads. 3115need elaborate support such as pthreads or unportable memory access
3116semantics.
2800 3117
2801That means that if you want to queue data, you have to provide your own 3118That means that if you want to queue data, you have to provide your own
2802queue. But at least I can tell you how to implement locking around your 3119queue. But at least I can tell you how to implement locking around your
2803queue: 3120queue:
2804 3121
2943 3260
2944If C<timeout> is less than 0, then no timeout watcher will be 3261If C<timeout> is less than 0, then no timeout watcher will be
2945started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 3262started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2946repeat = 0) will be started. C<0> is a valid timeout. 3263repeat = 0) will be started. C<0> is a valid timeout.
2947 3264
2948The callback has the type C<void (*cb)(int revents, void *arg)> and gets 3265The callback has the type C<void (*cb)(int revents, void *arg)> and is
2949passed an C<revents> set like normal event callbacks (a combination of 3266passed an C<revents> set like normal event callbacks (a combination of
2950C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 3267C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
2951value passed to C<ev_once>. Note that it is possible to receive I<both> 3268value passed to C<ev_once>. Note that it is possible to receive I<both>
2952a timeout and an io event at the same time - you probably should give io 3269a timeout and an io event at the same time - you probably should give io
2953events precedence. 3270events precedence.
2954 3271
2955Example: wait up to ten seconds for data to appear on STDIN_FILENO. 3272Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2956 3273
2957 static void stdin_ready (int revents, void *arg) 3274 static void stdin_ready (int revents, void *arg)
2958 { 3275 {
2959 if (revents & EV_READ) 3276 if (revents & EV_READ)
2960 /* stdin might have data for us, joy! */; 3277 /* stdin might have data for us, joy! */;
2961 else if (revents & EV_TIMEOUT) 3278 else if (revents & EV_TIMER)
2962 /* doh, nothing entered */; 3279 /* doh, nothing entered */;
2963 } 3280 }
2964 3281
2965 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3282 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2966 3283
2967=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2968
2969Feeds the given event set into the event loop, as if the specified event
2970had happened for the specified watcher (which must be a pointer to an
2971initialised but not necessarily started event watcher).
2972
2973=item ev_feed_fd_event (struct ev_loop *, int fd, int revents) 3284=item ev_feed_fd_event (loop, int fd, int revents)
2974 3285
2975Feed an event on the given fd, as if a file descriptor backend detected 3286Feed an event on the given fd, as if a file descriptor backend detected
2976the given events it. 3287the given events it.
2977 3288
2978=item ev_feed_signal_event (struct ev_loop *loop, int signum) 3289=item ev_feed_signal_event (loop, int signum)
2979 3290
2980Feed an event as if the given signal occurred (C<loop> must be the default 3291Feed an event as if the given signal occurred (C<loop> must be the default
2981loop!). 3292loop!).
2982 3293
2983=back 3294=back
3063 3374
3064=over 4 3375=over 4
3065 3376
3066=item ev::TYPE::TYPE () 3377=item ev::TYPE::TYPE ()
3067 3378
3068=item ev::TYPE::TYPE (struct ev_loop *) 3379=item ev::TYPE::TYPE (loop)
3069 3380
3070=item ev::TYPE::~TYPE 3381=item ev::TYPE::~TYPE
3071 3382
3072The constructor (optionally) takes an event loop to associate the watcher 3383The constructor (optionally) takes an event loop to associate the watcher
3073with. If it is omitted, it will use C<EV_DEFAULT>. 3384with. If it is omitted, it will use C<EV_DEFAULT>.
3106 myclass obj; 3417 myclass obj;
3107 ev::io iow; 3418 ev::io iow;
3108 iow.set <myclass, &myclass::io_cb> (&obj); 3419 iow.set <myclass, &myclass::io_cb> (&obj);
3109 3420
3110=item w->set (object *) 3421=item w->set (object *)
3111
3112This is an B<experimental> feature that might go away in a future version.
3113 3422
3114This is a variation of a method callback - leaving out the method to call 3423This is a variation of a method callback - leaving out the method to call
3115will default the method to C<operator ()>, which makes it possible to use 3424will default the method to C<operator ()>, which makes it possible to use
3116functor objects without having to manually specify the C<operator ()> all 3425functor objects without having to manually specify the C<operator ()> all
3117the time. Incidentally, you can then also leave out the template argument 3426the time. Incidentally, you can then also leave out the template argument
3150Example: Use a plain function as callback. 3459Example: Use a plain function as callback.
3151 3460
3152 static void io_cb (ev::io &w, int revents) { } 3461 static void io_cb (ev::io &w, int revents) { }
3153 iow.set <io_cb> (); 3462 iow.set <io_cb> ();
3154 3463
3155=item w->set (struct ev_loop *) 3464=item w->set (loop)
3156 3465
3157Associates a different C<struct ev_loop> with this watcher. You can only 3466Associates a different C<struct ev_loop> with this watcher. You can only
3158do this when the watcher is inactive (and not pending either). 3467do this when the watcher is inactive (and not pending either).
3159 3468
3160=item w->set ([arguments]) 3469=item w->set ([arguments])
3161 3470
3162Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3471Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3163called at least once. Unlike the C counterpart, an active watcher gets 3472method or a suitable start method must be called at least once. Unlike the
3164automatically stopped and restarted when reconfiguring it with this 3473C counterpart, an active watcher gets automatically stopped and restarted
3165method. 3474when reconfiguring it with this method.
3166 3475
3167=item w->start () 3476=item w->start ()
3168 3477
3169Starts the watcher. Note that there is no C<loop> argument, as the 3478Starts the watcher. Note that there is no C<loop> argument, as the
3170constructor already stores the event loop. 3479constructor already stores the event loop.
3171 3480
3481=item w->start ([arguments])
3482
3483Instead of calling C<set> and C<start> methods separately, it is often
3484convenient to wrap them in one call. Uses the same type of arguments as
3485the configure C<set> method of the watcher.
3486
3172=item w->stop () 3487=item w->stop ()
3173 3488
3174Stops the watcher if it is active. Again, no C<loop> argument. 3489Stops the watcher if it is active. Again, no C<loop> argument.
3175 3490
3176=item w->again () (C<ev::timer>, C<ev::periodic> only) 3491=item w->again () (C<ev::timer>, C<ev::periodic> only)
3188 3503
3189=back 3504=back
3190 3505
3191=back 3506=back
3192 3507
3193Example: Define a class with an IO and idle watcher, start one of them in 3508Example: Define a class with two I/O and idle watchers, start the I/O
3194the constructor. 3509watchers in the constructor.
3195 3510
3196 class myclass 3511 class myclass
3197 { 3512 {
3198 ev::io io ; void io_cb (ev::io &w, int revents); 3513 ev::io io ; void io_cb (ev::io &w, int revents);
3514 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3199 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3515 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3200 3516
3201 myclass (int fd) 3517 myclass (int fd)
3202 { 3518 {
3203 io .set <myclass, &myclass::io_cb > (this); 3519 io .set <myclass, &myclass::io_cb > (this);
3520 io2 .set <myclass, &myclass::io2_cb > (this);
3204 idle.set <myclass, &myclass::idle_cb> (this); 3521 idle.set <myclass, &myclass::idle_cb> (this);
3205 3522
3206 io.start (fd, ev::READ); 3523 io.set (fd, ev::WRITE); // configure the watcher
3524 io.start (); // start it whenever convenient
3525
3526 io2.start (fd, ev::READ); // set + start in one call
3207 } 3527 }
3208 }; 3528 };
3209 3529
3210 3530
3211=head1 OTHER LANGUAGE BINDINGS 3531=head1 OTHER LANGUAGE BINDINGS
3257=item Ocaml 3577=item Ocaml
3258 3578
3259Erkki Seppala has written Ocaml bindings for libev, to be found at 3579Erkki Seppala has written Ocaml bindings for libev, to be found at
3260L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3580L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3261 3581
3582=item Lua
3583
3584Brian Maher has written a partial interface to libev for lua (at the
3585time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3586L<http://github.com/brimworks/lua-ev>.
3587
3262=back 3588=back
3263 3589
3264 3590
3265=head1 MACRO MAGIC 3591=head1 MACRO MAGIC
3266 3592
3279loop argument"). The C<EV_A> form is used when this is the sole argument, 3605loop argument"). The C<EV_A> form is used when this is the sole argument,
3280C<EV_A_> is used when other arguments are following. Example: 3606C<EV_A_> is used when other arguments are following. Example:
3281 3607
3282 ev_unref (EV_A); 3608 ev_unref (EV_A);
3283 ev_timer_add (EV_A_ watcher); 3609 ev_timer_add (EV_A_ watcher);
3284 ev_loop (EV_A_ 0); 3610 ev_run (EV_A_ 0);
3285 3611
3286It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 3612It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3287which is often provided by the following macro. 3613which is often provided by the following macro.
3288 3614
3289=item C<EV_P>, C<EV_P_> 3615=item C<EV_P>, C<EV_P_>
3329 } 3655 }
3330 3656
3331 ev_check check; 3657 ev_check check;
3332 ev_check_init (&check, check_cb); 3658 ev_check_init (&check, check_cb);
3333 ev_check_start (EV_DEFAULT_ &check); 3659 ev_check_start (EV_DEFAULT_ &check);
3334 ev_loop (EV_DEFAULT_ 0); 3660 ev_run (EV_DEFAULT_ 0);
3335 3661
3336=head1 EMBEDDING 3662=head1 EMBEDDING
3337 3663
3338Libev can (and often is) directly embedded into host 3664Libev can (and often is) directly embedded into host
3339applications. Examples of applications that embed it include the Deliantra 3665applications. Examples of applications that embed it include the Deliantra
3419 libev.m4 3745 libev.m4
3420 3746
3421=head2 PREPROCESSOR SYMBOLS/MACROS 3747=head2 PREPROCESSOR SYMBOLS/MACROS
3422 3748
3423Libev can be configured via a variety of preprocessor symbols you have to 3749Libev can be configured via a variety of preprocessor symbols you have to
3424define before including any of its files. The default in the absence of 3750define before including (or compiling) any of its files. The default in
3425autoconf is documented for every option. 3751the absence of autoconf is documented for every option.
3752
3753Symbols marked with "(h)" do not change the ABI, and can have different
3754values when compiling libev vs. including F<ev.h>, so it is permissible
3755to redefine them before including F<ev.h> without breaking compatibility
3756to a compiled library. All other symbols change the ABI, which means all
3757users of libev and the libev code itself must be compiled with compatible
3758settings.
3426 3759
3427=over 4 3760=over 4
3428 3761
3762=item EV_COMPAT3 (h)
3763
3764Backwards compatibility is a major concern for libev. This is why this
3765release of libev comes with wrappers for the functions and symbols that
3766have been renamed between libev version 3 and 4.
3767
3768You can disable these wrappers (to test compatibility with future
3769versions) by defining C<EV_COMPAT3> to C<0> when compiling your
3770sources. This has the additional advantage that you can drop the C<struct>
3771from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
3772typedef in that case.
3773
3774In some future version, the default for C<EV_COMPAT3> will become C<0>,
3775and in some even more future version the compatibility code will be
3776removed completely.
3777
3429=item EV_STANDALONE 3778=item EV_STANDALONE (h)
3430 3779
3431Must always be C<1> if you do not use autoconf configuration, which 3780Must always be C<1> if you do not use autoconf configuration, which
3432keeps libev from including F<config.h>, and it also defines dummy 3781keeps libev from including F<config.h>, and it also defines dummy
3433implementations for some libevent functions (such as logging, which is not 3782implementations for some libevent functions (such as logging, which is not
3434supported). It will also not define any of the structs usually found in 3783supported). It will also not define any of the structs usually found in
3435F<event.h> that are not directly supported by the libev core alone. 3784F<event.h> that are not directly supported by the libev core alone.
3436 3785
3437In stanbdalone mode, libev will still try to automatically deduce the 3786In standalone mode, libev will still try to automatically deduce the
3438configuration, but has to be more conservative. 3787configuration, but has to be more conservative.
3439 3788
3440=item EV_USE_MONOTONIC 3789=item EV_USE_MONOTONIC
3441 3790
3442If defined to be C<1>, libev will try to detect the availability of the 3791If defined to be C<1>, libev will try to detect the availability of the
3507be used is the winsock select). This means that it will call 3856be used is the winsock select). This means that it will call
3508C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3857C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3509it is assumed that all these functions actually work on fds, even 3858it is assumed that all these functions actually work on fds, even
3510on win32. Should not be defined on non-win32 platforms. 3859on win32. Should not be defined on non-win32 platforms.
3511 3860
3512=item EV_FD_TO_WIN32_HANDLE 3861=item EV_FD_TO_WIN32_HANDLE(fd)
3513 3862
3514If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3863If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3515file descriptors to socket handles. When not defining this symbol (the 3864file descriptors to socket handles. When not defining this symbol (the
3516default), then libev will call C<_get_osfhandle>, which is usually 3865default), then libev will call C<_get_osfhandle>, which is usually
3517correct. In some cases, programs use their own file descriptor management, 3866correct. In some cases, programs use their own file descriptor management,
3518in which case they can provide this function to map fds to socket handles. 3867in which case they can provide this function to map fds to socket handles.
3868
3869=item EV_WIN32_HANDLE_TO_FD(handle)
3870
3871If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3872using the standard C<_open_osfhandle> function. For programs implementing
3873their own fd to handle mapping, overwriting this function makes it easier
3874to do so. This can be done by defining this macro to an appropriate value.
3875
3876=item EV_WIN32_CLOSE_FD(fd)
3877
3878If programs implement their own fd to handle mapping on win32, then this
3879macro can be used to override the C<close> function, useful to unregister
3880file descriptors again. Note that the replacement function has to close
3881the underlying OS handle.
3519 3882
3520=item EV_USE_POLL 3883=item EV_USE_POLL
3521 3884
3522If defined to be C<1>, libev will compile in support for the C<poll>(2) 3885If defined to be C<1>, libev will compile in support for the C<poll>(2)
3523backend. Otherwise it will be enabled on non-win32 platforms. It 3886backend. Otherwise it will be enabled on non-win32 platforms. It
3570as well as for signal and thread safety in C<ev_async> watchers. 3933as well as for signal and thread safety in C<ev_async> watchers.
3571 3934
3572In the absence of this define, libev will use C<sig_atomic_t volatile> 3935In the absence of this define, libev will use C<sig_atomic_t volatile>
3573(from F<signal.h>), which is usually good enough on most platforms. 3936(from F<signal.h>), which is usually good enough on most platforms.
3574 3937
3575=item EV_H 3938=item EV_H (h)
3576 3939
3577The name of the F<ev.h> header file used to include it. The default if 3940The name of the F<ev.h> header file used to include it. The default if
3578undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 3941undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3579used to virtually rename the F<ev.h> header file in case of conflicts. 3942used to virtually rename the F<ev.h> header file in case of conflicts.
3580 3943
3581=item EV_CONFIG_H 3944=item EV_CONFIG_H (h)
3582 3945
3583If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 3946If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3584F<ev.c>'s idea of where to find the F<config.h> file, similarly to 3947F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3585C<EV_H>, above. 3948C<EV_H>, above.
3586 3949
3587=item EV_EVENT_H 3950=item EV_EVENT_H (h)
3588 3951
3589Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 3952Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3590of how the F<event.h> header can be found, the default is C<"event.h">. 3953of how the F<event.h> header can be found, the default is C<"event.h">.
3591 3954
3592=item EV_PROTOTYPES 3955=item EV_PROTOTYPES (h)
3593 3956
3594If defined to be C<0>, then F<ev.h> will not define any function 3957If defined to be C<0>, then F<ev.h> will not define any function
3595prototypes, but still define all the structs and other symbols. This is 3958prototypes, but still define all the structs and other symbols. This is
3596occasionally useful if you want to provide your own wrapper functions 3959occasionally useful if you want to provide your own wrapper functions
3597around libev functions. 3960around libev functions.
3619fine. 3982fine.
3620 3983
3621If your embedding application does not need any priorities, defining these 3984If your embedding application does not need any priorities, defining these
3622both to C<0> will save some memory and CPU. 3985both to C<0> will save some memory and CPU.
3623 3986
3624=item EV_PERIODIC_ENABLE 3987=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
3988EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3989EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3625 3990
3626If undefined or defined to be C<1>, then periodic timers are supported. If 3991If undefined or defined to be C<1> (and the platform supports it), then
3627defined to be C<0>, then they are not. Disabling them saves a few kB of 3992the respective watcher type is supported. If defined to be C<0>, then it
3628code. 3993is not. Disabling watcher types mainly saves code size.
3629 3994
3630=item EV_IDLE_ENABLE 3995=item EV_FEATURES
3631
3632If undefined or defined to be C<1>, then idle watchers are supported. If
3633defined to be C<0>, then they are not. Disabling them saves a few kB of
3634code.
3635
3636=item EV_EMBED_ENABLE
3637
3638If undefined or defined to be C<1>, then embed watchers are supported. If
3639defined to be C<0>, then they are not. Embed watchers rely on most other
3640watcher types, which therefore must not be disabled.
3641
3642=item EV_STAT_ENABLE
3643
3644If undefined or defined to be C<1>, then stat watchers are supported. If
3645defined to be C<0>, then they are not.
3646
3647=item EV_FORK_ENABLE
3648
3649If undefined or defined to be C<1>, then fork watchers are supported. If
3650defined to be C<0>, then they are not.
3651
3652=item EV_ASYNC_ENABLE
3653
3654If undefined or defined to be C<1>, then async watchers are supported. If
3655defined to be C<0>, then they are not.
3656
3657=item EV_MINIMAL
3658 3996
3659If you need to shave off some kilobytes of code at the expense of some 3997If you need to shave off some kilobytes of code at the expense of some
3660speed, define this symbol to C<1>. Currently this is used to override some 3998speed (but with the full API), you can define this symbol to request
3661inlining decisions, saves roughly 30% code size on amd64. It also selects a 3999certain subsets of functionality. The default is to enable all features
3662much smaller 2-heap for timer management over the default 4-heap. 4000that can be enabled on the platform.
4001
4002A typical way to use this symbol is to define it to C<0> (or to a bitset
4003with some broad features you want) and then selectively re-enable
4004additional parts you want, for example if you want everything minimal,
4005but multiple event loop support, async and child watchers and the poll
4006backend, use this:
4007
4008 #define EV_FEATURES 0
4009 #define EV_MULTIPLICITY 1
4010 #define EV_USE_POLL 1
4011 #define EV_CHILD_ENABLE 1
4012 #define EV_ASYNC_ENABLE 1
4013
4014The actual value is a bitset, it can be a combination of the following
4015values:
4016
4017=over 4
4018
4019=item C<1> - faster/larger code
4020
4021Use larger code to speed up some operations.
4022
4023Currently this is used to override some inlining decisions (enlarging the
4024code size by roughly 30% on amd64).
4025
4026When optimising for size, use of compiler flags such as C<-Os> with
4027gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4028assertions.
4029
4030=item C<2> - faster/larger data structures
4031
4032Replaces the small 2-heap for timer management by a faster 4-heap, larger
4033hash table sizes and so on. This will usually further increase code size
4034and can additionally have an effect on the size of data structures at
4035runtime.
4036
4037=item C<4> - full API configuration
4038
4039This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4040enables multiplicity (C<EV_MULTIPLICITY>=1).
4041
4042=item C<8> - full API
4043
4044This enables a lot of the "lesser used" API functions. See C<ev.h> for
4045details on which parts of the API are still available without this
4046feature, and do not complain if this subset changes over time.
4047
4048=item C<16> - enable all optional watcher types
4049
4050Enables all optional watcher types. If you want to selectively enable
4051only some watcher types other than I/O and timers (e.g. prepare,
4052embed, async, child...) you can enable them manually by defining
4053C<EV_watchertype_ENABLE> to C<1> instead.
4054
4055=item C<32> - enable all backends
4056
4057This enables all backends - without this feature, you need to enable at
4058least one backend manually (C<EV_USE_SELECT> is a good choice).
4059
4060=item C<64> - enable OS-specific "helper" APIs
4061
4062Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
4063default.
4064
4065=back
4066
4067Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
4068reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
4069code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
4070watchers, timers and monotonic clock support.
4071
4072With an intelligent-enough linker (gcc+binutils are intelligent enough
4073when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4074your program might be left out as well - a binary starting a timer and an
4075I/O watcher then might come out at only 5Kb.
4076
4077=item EV_AVOID_STDIO
4078
4079If this is set to C<1> at compiletime, then libev will avoid using stdio
4080functions (printf, scanf, perror etc.). This will increase the code size
4081somewhat, but if your program doesn't otherwise depend on stdio and your
4082libc allows it, this avoids linking in the stdio library which is quite
4083big.
4084
4085Note that error messages might become less precise when this option is
4086enabled.
4087
4088=item EV_NSIG
4089
4090The highest supported signal number, +1 (or, the number of
4091signals): Normally, libev tries to deduce the maximum number of signals
4092automatically, but sometimes this fails, in which case it can be
4093specified. Also, using a lower number than detected (C<32> should be
4094good for about any system in existence) can save some memory, as libev
4095statically allocates some 12-24 bytes per signal number.
3663 4096
3664=item EV_PID_HASHSIZE 4097=item EV_PID_HASHSIZE
3665 4098
3666C<ev_child> watchers use a small hash table to distribute workload by 4099C<ev_child> watchers use a small hash table to distribute workload by
3667pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 4100pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3668than enough. If you need to manage thousands of children you might want to 4101usually more than enough. If you need to manage thousands of children you
3669increase this value (I<must> be a power of two). 4102might want to increase this value (I<must> be a power of two).
3670 4103
3671=item EV_INOTIFY_HASHSIZE 4104=item EV_INOTIFY_HASHSIZE
3672 4105
3673C<ev_stat> watchers use a small hash table to distribute workload by 4106C<ev_stat> watchers use a small hash table to distribute workload by
3674inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 4107inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3675usually more than enough. If you need to manage thousands of C<ev_stat> 4108disabled), usually more than enough. If you need to manage thousands of
3676watchers you might want to increase this value (I<must> be a power of 4109C<ev_stat> watchers you might want to increase this value (I<must> be a
3677two). 4110power of two).
3678 4111
3679=item EV_USE_4HEAP 4112=item EV_USE_4HEAP
3680 4113
3681Heaps are not very cache-efficient. To improve the cache-efficiency of the 4114Heaps are not very cache-efficient. To improve the cache-efficiency of the
3682timer and periodics heaps, libev uses a 4-heap when this symbol is defined 4115timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3683to C<1>. The 4-heap uses more complicated (longer) code but has noticeably 4116to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3684faster performance with many (thousands) of watchers. 4117faster performance with many (thousands) of watchers.
3685 4118
3686The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4119The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3687(disabled). 4120will be C<0>.
3688 4121
3689=item EV_HEAP_CACHE_AT 4122=item EV_HEAP_CACHE_AT
3690 4123
3691Heaps are not very cache-efficient. To improve the cache-efficiency of the 4124Heaps are not very cache-efficient. To improve the cache-efficiency of the
3692timer and periodics heaps, libev can cache the timestamp (I<at>) within 4125timer and periodics heaps, libev can cache the timestamp (I<at>) within
3693the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 4126the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3694which uses 8-12 bytes more per watcher and a few hundred bytes more code, 4127which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3695but avoids random read accesses on heap changes. This improves performance 4128but avoids random read accesses on heap changes. This improves performance
3696noticeably with many (hundreds) of watchers. 4129noticeably with many (hundreds) of watchers.
3697 4130
3698The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4131The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3699(disabled). 4132will be C<0>.
3700 4133
3701=item EV_VERIFY 4134=item EV_VERIFY
3702 4135
3703Controls how much internal verification (see C<ev_loop_verify ()>) will 4136Controls how much internal verification (see C<ev_verify ()>) will
3704be done: If set to C<0>, no internal verification code will be compiled 4137be done: If set to C<0>, no internal verification code will be compiled
3705in. If set to C<1>, then verification code will be compiled in, but not 4138in. If set to C<1>, then verification code will be compiled in, but not
3706called. If set to C<2>, then the internal verification code will be 4139called. If set to C<2>, then the internal verification code will be
3707called once per loop, which can slow down libev. If set to C<3>, then the 4140called once per loop, which can slow down libev. If set to C<3>, then the
3708verification code will be called very frequently, which will slow down 4141verification code will be called very frequently, which will slow down
3709libev considerably. 4142libev considerably.
3710 4143
3711The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 4144The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3712C<0>. 4145will be C<0>.
3713 4146
3714=item EV_COMMON 4147=item EV_COMMON
3715 4148
3716By default, all watchers have a C<void *data> member. By redefining 4149By default, all watchers have a C<void *data> member. By redefining
3717this macro to a something else you can include more and other types of 4150this macro to something else you can include more and other types of
3718members. You have to define it each time you include one of the files, 4151members. You have to define it each time you include one of the files,
3719though, and it must be identical each time. 4152though, and it must be identical each time.
3720 4153
3721For example, the perl EV module uses something like this: 4154For example, the perl EV module uses something like this:
3722 4155
3775file. 4208file.
3776 4209
3777The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4210The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3778that everybody includes and which overrides some configure choices: 4211that everybody includes and which overrides some configure choices:
3779 4212
3780 #define EV_MINIMAL 1 4213 #define EV_FEATURES 8
3781 #define EV_USE_POLL 0 4214 #define EV_USE_SELECT 1
3782 #define EV_MULTIPLICITY 0
3783 #define EV_PERIODIC_ENABLE 0 4215 #define EV_PREPARE_ENABLE 1
4216 #define EV_IDLE_ENABLE 1
3784 #define EV_STAT_ENABLE 0 4217 #define EV_SIGNAL_ENABLE 1
3785 #define EV_FORK_ENABLE 0 4218 #define EV_CHILD_ENABLE 1
4219 #define EV_USE_STDEXCEPT 0
3786 #define EV_CONFIG_H <config.h> 4220 #define EV_CONFIG_H <config.h>
3787 #define EV_MINPRI 0
3788 #define EV_MAXPRI 0
3789 4221
3790 #include "ev++.h" 4222 #include "ev++.h"
3791 4223
3792And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4224And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3793 4225
3853default loop and triggering an C<ev_async> watcher from the default loop 4285default loop and triggering an C<ev_async> watcher from the default loop
3854watcher callback into the event loop interested in the signal. 4286watcher callback into the event loop interested in the signal.
3855 4287
3856=back 4288=back
3857 4289
4290=head4 THREAD LOCKING EXAMPLE
4291
4292Here is a fictitious example of how to run an event loop in a different
4293thread than where callbacks are being invoked and watchers are
4294created/added/removed.
4295
4296For a real-world example, see the C<EV::Loop::Async> perl module,
4297which uses exactly this technique (which is suited for many high-level
4298languages).
4299
4300The example uses a pthread mutex to protect the loop data, a condition
4301variable to wait for callback invocations, an async watcher to notify the
4302event loop thread and an unspecified mechanism to wake up the main thread.
4303
4304First, you need to associate some data with the event loop:
4305
4306 typedef struct {
4307 mutex_t lock; /* global loop lock */
4308 ev_async async_w;
4309 thread_t tid;
4310 cond_t invoke_cv;
4311 } userdata;
4312
4313 void prepare_loop (EV_P)
4314 {
4315 // for simplicity, we use a static userdata struct.
4316 static userdata u;
4317
4318 ev_async_init (&u->async_w, async_cb);
4319 ev_async_start (EV_A_ &u->async_w);
4320
4321 pthread_mutex_init (&u->lock, 0);
4322 pthread_cond_init (&u->invoke_cv, 0);
4323
4324 // now associate this with the loop
4325 ev_set_userdata (EV_A_ u);
4326 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4327 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4328
4329 // then create the thread running ev_loop
4330 pthread_create (&u->tid, 0, l_run, EV_A);
4331 }
4332
4333The callback for the C<ev_async> watcher does nothing: the watcher is used
4334solely to wake up the event loop so it takes notice of any new watchers
4335that might have been added:
4336
4337 static void
4338 async_cb (EV_P_ ev_async *w, int revents)
4339 {
4340 // just used for the side effects
4341 }
4342
4343The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4344protecting the loop data, respectively.
4345
4346 static void
4347 l_release (EV_P)
4348 {
4349 userdata *u = ev_userdata (EV_A);
4350 pthread_mutex_unlock (&u->lock);
4351 }
4352
4353 static void
4354 l_acquire (EV_P)
4355 {
4356 userdata *u = ev_userdata (EV_A);
4357 pthread_mutex_lock (&u->lock);
4358 }
4359
4360The event loop thread first acquires the mutex, and then jumps straight
4361into C<ev_run>:
4362
4363 void *
4364 l_run (void *thr_arg)
4365 {
4366 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4367
4368 l_acquire (EV_A);
4369 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4370 ev_run (EV_A_ 0);
4371 l_release (EV_A);
4372
4373 return 0;
4374 }
4375
4376Instead of invoking all pending watchers, the C<l_invoke> callback will
4377signal the main thread via some unspecified mechanism (signals? pipe
4378writes? C<Async::Interrupt>?) and then waits until all pending watchers
4379have been called (in a while loop because a) spurious wakeups are possible
4380and b) skipping inter-thread-communication when there are no pending
4381watchers is very beneficial):
4382
4383 static void
4384 l_invoke (EV_P)
4385 {
4386 userdata *u = ev_userdata (EV_A);
4387
4388 while (ev_pending_count (EV_A))
4389 {
4390 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4391 pthread_cond_wait (&u->invoke_cv, &u->lock);
4392 }
4393 }
4394
4395Now, whenever the main thread gets told to invoke pending watchers, it
4396will grab the lock, call C<ev_invoke_pending> and then signal the loop
4397thread to continue:
4398
4399 static void
4400 real_invoke_pending (EV_P)
4401 {
4402 userdata *u = ev_userdata (EV_A);
4403
4404 pthread_mutex_lock (&u->lock);
4405 ev_invoke_pending (EV_A);
4406 pthread_cond_signal (&u->invoke_cv);
4407 pthread_mutex_unlock (&u->lock);
4408 }
4409
4410Whenever you want to start/stop a watcher or do other modifications to an
4411event loop, you will now have to lock:
4412
4413 ev_timer timeout_watcher;
4414 userdata *u = ev_userdata (EV_A);
4415
4416 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4417
4418 pthread_mutex_lock (&u->lock);
4419 ev_timer_start (EV_A_ &timeout_watcher);
4420 ev_async_send (EV_A_ &u->async_w);
4421 pthread_mutex_unlock (&u->lock);
4422
4423Note that sending the C<ev_async> watcher is required because otherwise
4424an event loop currently blocking in the kernel will have no knowledge
4425about the newly added timer. By waking up the loop it will pick up any new
4426watchers in the next event loop iteration.
4427
3858=head3 COROUTINES 4428=head3 COROUTINES
3859 4429
3860Libev is very accommodating to coroutines ("cooperative threads"): 4430Libev is very accommodating to coroutines ("cooperative threads"):
3861libev fully supports nesting calls to its functions from different 4431libev fully supports nesting calls to its functions from different
3862coroutines (e.g. you can call C<ev_loop> on the same loop from two 4432coroutines (e.g. you can call C<ev_run> on the same loop from two
3863different coroutines, and switch freely between both coroutines running the 4433different coroutines, and switch freely between both coroutines running
3864loop, as long as you don't confuse yourself). The only exception is that 4434the loop, as long as you don't confuse yourself). The only exception is
3865you must not do this from C<ev_periodic> reschedule callbacks. 4435that you must not do this from C<ev_periodic> reschedule callbacks.
3866 4436
3867Care has been taken to ensure that libev does not keep local state inside 4437Care has been taken to ensure that libev does not keep local state inside
3868C<ev_loop>, and other calls do not usually allow for coroutine switches as 4438C<ev_run>, and other calls do not usually allow for coroutine switches as
3869they do not call any callbacks. 4439they do not call any callbacks.
3870 4440
3871=head2 COMPILER WARNINGS 4441=head2 COMPILER WARNINGS
3872 4442
3873Depending on your compiler and compiler settings, you might get no or a 4443Depending on your compiler and compiler settings, you might get no or a
3884maintainable. 4454maintainable.
3885 4455
3886And of course, some compiler warnings are just plain stupid, or simply 4456And of course, some compiler warnings are just plain stupid, or simply
3887wrong (because they don't actually warn about the condition their message 4457wrong (because they don't actually warn about the condition their message
3888seems to warn about). For example, certain older gcc versions had some 4458seems to warn about). For example, certain older gcc versions had some
3889warnings that resulted an extreme number of false positives. These have 4459warnings that resulted in an extreme number of false positives. These have
3890been fixed, but some people still insist on making code warn-free with 4460been fixed, but some people still insist on making code warn-free with
3891such buggy versions. 4461such buggy versions.
3892 4462
3893While libev is written to generate as few warnings as possible, 4463While libev is written to generate as few warnings as possible,
3894"warn-free" code is not a goal, and it is recommended not to build libev 4464"warn-free" code is not a goal, and it is recommended not to build libev
3930I suggest using suppression lists. 4500I suggest using suppression lists.
3931 4501
3932 4502
3933=head1 PORTABILITY NOTES 4503=head1 PORTABILITY NOTES
3934 4504
4505=head2 GNU/LINUX 32 BIT LIMITATIONS
4506
4507GNU/Linux is the only common platform that supports 64 bit file/large file
4508interfaces but I<disables> them by default.
4509
4510That means that libev compiled in the default environment doesn't support
4511files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4512
4513Unfortunately, many programs try to work around this GNU/Linux issue
4514by enabling the large file API, which makes them incompatible with the
4515standard libev compiled for their system.
4516
4517Likewise, libev cannot enable the large file API itself as this would
4518suddenly make it incompatible to the default compile time environment,
4519i.e. all programs not using special compile switches.
4520
4521=head2 OS/X AND DARWIN BUGS
4522
4523The whole thing is a bug if you ask me - basically any system interface
4524you touch is broken, whether it is locales, poll, kqueue or even the
4525OpenGL drivers.
4526
4527=head3 C<kqueue> is buggy
4528
4529The kqueue syscall is broken in all known versions - most versions support
4530only sockets, many support pipes.
4531
4532Libev tries to work around this by not using C<kqueue> by default on
4533this rotten platform, but of course you can still ask for it when creating
4534a loop.
4535
4536=head3 C<poll> is buggy
4537
4538Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4539implementation by something calling C<kqueue> internally around the 10.5.6
4540release, so now C<kqueue> I<and> C<poll> are broken.
4541
4542Libev tries to work around this by not using C<poll> by default on
4543this rotten platform, but of course you can still ask for it when creating
4544a loop.
4545
4546=head3 C<select> is buggy
4547
4548All that's left is C<select>, and of course Apple found a way to fuck this
4549one up as well: On OS/X, C<select> actively limits the number of file
4550descriptors you can pass in to 1024 - your program suddenly crashes when
4551you use more.
4552
4553There is an undocumented "workaround" for this - defining
4554C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4555work on OS/X.
4556
4557=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4558
4559=head3 C<errno> reentrancy
4560
4561The default compile environment on Solaris is unfortunately so
4562thread-unsafe that you can't even use components/libraries compiled
4563without C<-D_REENTRANT> (as long as they use C<errno>), which, of course,
4564isn't defined by default.
4565
4566If you want to use libev in threaded environments you have to make sure
4567it's compiled with C<_REENTRANT> defined.
4568
4569=head3 Event port backend
4570
4571The scalable event interface for Solaris is called "event ports". Unfortunately,
4572this mechanism is very buggy. If you run into high CPU usage, your program
4573freezes or you get a large number of spurious wakeups, make sure you have
4574all the relevant and latest kernel patches applied. No, I don't know which
4575ones, but there are multiple ones.
4576
4577If you can't get it to work, you can try running the program by setting
4578the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4579C<select> backends.
4580
4581=head2 AIX POLL BUG
4582
4583AIX unfortunately has a broken C<poll.h> header. Libev works around
4584this by trying to avoid the poll backend altogether (i.e. it's not even
4585compiled in), which normally isn't a big problem as C<select> works fine
4586with large bitsets, and AIX is dead anyway.
4587
3935=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4588=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4589
4590=head3 General issues
3936 4591
3937Win32 doesn't support any of the standards (e.g. POSIX) that libev 4592Win32 doesn't support any of the standards (e.g. POSIX) that libev
3938requires, and its I/O model is fundamentally incompatible with the POSIX 4593requires, and its I/O model is fundamentally incompatible with the POSIX
3939model. Libev still offers limited functionality on this platform in 4594model. Libev still offers limited functionality on this platform in
3940the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4595the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3941descriptors. This only applies when using Win32 natively, not when using 4596descriptors. This only applies when using Win32 natively, not when using
3942e.g. cygwin. 4597e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4598as every compielr comes with a slightly differently broken/incompatible
4599environment.
3943 4600
3944Lifting these limitations would basically require the full 4601Lifting these limitations would basically require the full
3945re-implementation of the I/O system. If you are into these kinds of 4602re-implementation of the I/O system. If you are into this kind of thing,
3946things, then note that glib does exactly that for you in a very portable 4603then note that glib does exactly that for you in a very portable way (note
3947way (note also that glib is the slowest event library known to man). 4604also that glib is the slowest event library known to man).
3948 4605
3949There is no supported compilation method available on windows except 4606There is no supported compilation method available on windows except
3950embedding it into other applications. 4607embedding it into other applications.
3951 4608
3952Sensible signal handling is officially unsupported by Microsoft - libev 4609Sensible signal handling is officially unsupported by Microsoft - libev
3980you do I<not> compile the F<ev.c> or any other embedded source files!): 4637you do I<not> compile the F<ev.c> or any other embedded source files!):
3981 4638
3982 #include "evwrap.h" 4639 #include "evwrap.h"
3983 #include "ev.c" 4640 #include "ev.c"
3984 4641
3985=over 4
3986
3987=item The winsocket select function 4642=head3 The winsocket C<select> function
3988 4643
3989The winsocket C<select> function doesn't follow POSIX in that it 4644The winsocket C<select> function doesn't follow POSIX in that it
3990requires socket I<handles> and not socket I<file descriptors> (it is 4645requires socket I<handles> and not socket I<file descriptors> (it is
3991also extremely buggy). This makes select very inefficient, and also 4646also extremely buggy). This makes select very inefficient, and also
3992requires a mapping from file descriptors to socket handles (the Microsoft 4647requires a mapping from file descriptors to socket handles (the Microsoft
4001 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4656 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4002 4657
4003Note that winsockets handling of fd sets is O(n), so you can easily get a 4658Note that winsockets handling of fd sets is O(n), so you can easily get a
4004complexity in the O(n²) range when using win32. 4659complexity in the O(n²) range when using win32.
4005 4660
4006=item Limited number of file descriptors 4661=head3 Limited number of file descriptors
4007 4662
4008Windows has numerous arbitrary (and low) limits on things. 4663Windows has numerous arbitrary (and low) limits on things.
4009 4664
4010Early versions of winsocket's select only supported waiting for a maximum 4665Early versions of winsocket's select only supported waiting for a maximum
4011of C<64> handles (probably owning to the fact that all windows kernels 4666of C<64> handles (probably owning to the fact that all windows kernels
4026runtime libraries. This might get you to about C<512> or C<2048> sockets 4681runtime libraries. This might get you to about C<512> or C<2048> sockets
4027(depending on windows version and/or the phase of the moon). To get more, 4682(depending on windows version and/or the phase of the moon). To get more,
4028you need to wrap all I/O functions and provide your own fd management, but 4683you need to wrap all I/O functions and provide your own fd management, but
4029the cost of calling select (O(n²)) will likely make this unworkable. 4684the cost of calling select (O(n²)) will likely make this unworkable.
4030 4685
4031=back
4032
4033=head2 PORTABILITY REQUIREMENTS 4686=head2 PORTABILITY REQUIREMENTS
4034 4687
4035In addition to a working ISO-C implementation and of course the 4688In addition to a working ISO-C implementation and of course the
4036backend-specific APIs, libev relies on a few additional extensions: 4689backend-specific APIs, libev relies on a few additional extensions:
4037 4690
4075watchers. 4728watchers.
4076 4729
4077=item C<double> must hold a time value in seconds with enough accuracy 4730=item C<double> must hold a time value in seconds with enough accuracy
4078 4731
4079The type C<double> is used to represent timestamps. It is required to 4732The type C<double> is used to represent timestamps. It is required to
4080have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4733have at least 51 bits of mantissa (and 9 bits of exponent), which is
4081enough for at least into the year 4000. This requirement is fulfilled by 4734good enough for at least into the year 4000 with millisecond accuracy
4735(the design goal for libev). This requirement is overfulfilled by
4082implementations implementing IEEE 754, which is basically all existing 4736implementations using IEEE 754, which is basically all existing ones. With
4083ones. With IEEE 754 doubles, you get microsecond accuracy until at least 4737IEEE 754 doubles, you get microsecond accuracy until at least 2200.
40842200.
4085 4738
4086=back 4739=back
4087 4740
4088If you know of other additional requirements drop me a note. 4741If you know of other additional requirements drop me a note.
4089 4742
4157involves iterating over all running async watchers or all signal numbers. 4810involves iterating over all running async watchers or all signal numbers.
4158 4811
4159=back 4812=back
4160 4813
4161 4814
4815=head1 PORTING FROM LIBEV 3.X TO 4.X
4816
4817The major version 4 introduced some minor incompatible changes to the API.
4818
4819At the moment, the C<ev.h> header file tries to implement superficial
4820compatibility, so most programs should still compile. Those might be
4821removed in later versions of libev, so better update early than late.
4822
4823=over 4
4824
4825=item function/symbol renames
4826
4827A number of functions and symbols have been renamed:
4828
4829 ev_loop => ev_run
4830 EVLOOP_NONBLOCK => EVRUN_NOWAIT
4831 EVLOOP_ONESHOT => EVRUN_ONCE
4832
4833 ev_unloop => ev_break
4834 EVUNLOOP_CANCEL => EVBREAK_CANCEL
4835 EVUNLOOP_ONE => EVBREAK_ONE
4836 EVUNLOOP_ALL => EVBREAK_ALL
4837
4838 EV_TIMEOUT => EV_TIMER
4839
4840 ev_loop_count => ev_iteration
4841 ev_loop_depth => ev_depth
4842 ev_loop_verify => ev_verify
4843
4844Most functions working on C<struct ev_loop> objects don't have an
4845C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
4846associated constants have been renamed to not collide with the C<struct
4847ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4848as all other watcher types. Note that C<ev_loop_fork> is still called
4849C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4850typedef.
4851
4852=item C<EV_COMPAT3> backwards compatibility mechanism
4853
4854The backward compatibility mechanism can be controlled by
4855C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4856section.
4857
4858=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4859
4860The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4861mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4862and work, but the library code will of course be larger.
4863
4864=back
4865
4866
4162=head1 GLOSSARY 4867=head1 GLOSSARY
4163 4868
4164=over 4 4869=over 4
4165 4870
4166=item active 4871=item active
4187A change of state of some external event, such as data now being available 4892A change of state of some external event, such as data now being available
4188for reading on a file descriptor, time having passed or simply not having 4893for reading on a file descriptor, time having passed or simply not having
4189any other events happening anymore. 4894any other events happening anymore.
4190 4895
4191In libev, events are represented as single bits (such as C<EV_READ> or 4896In libev, events are represented as single bits (such as C<EV_READ> or
4192C<EV_TIMEOUT>). 4897C<EV_TIMER>).
4193 4898
4194=item event library 4899=item event library
4195 4900
4196A software package implementing an event model and loop. 4901A software package implementing an event model and loop.
4197 4902

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines