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

Comparing libev/ev.pod (file contents):
Revision 1.297 by root, Tue Jun 29 11:49:02 2010 UTC vs.
Revision 1.316 by root, Fri Oct 22 09:34:01 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
292 292
293=back 293=back
294 294
295=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 295=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
296 296
297An 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
298is 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
299I<function>). 299libev 3 had an C<ev_loop> function colliding with the struct name).
300 300
301The 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
302supports signals and child events, and dynamically created loops which do 302supports signals and child events, and dynamically created event loops
303not. 303which do not.
304 304
305=over 4 305=over 4
306 306
307=item struct ev_loop *ev_default_loop (unsigned int flags) 307=item struct ev_loop *ev_default_loop (unsigned int flags)
308 308
439of 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
440I<different> file descriptors (even already closed ones, so one cannot 440I<different> file descriptors (even already closed ones, so one cannot
441even remove them from the set) than registered in the set (especially 441even remove them from the set) than registered in the set (especially
442on SMP systems). Libev tries to counter these spurious notifications by 442on SMP systems). Libev tries to counter these spurious notifications by
443employing an additional generation counter and comparing that against the 443employing an additional generation counter and comparing that against the
444events 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...).
445 447
446While 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
447will 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
448incident (because the same I<file descriptor> could point to a different 450incident (because the same I<file descriptor> could point to a different
449I<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
604Like 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
605earlier call to C<ev_loop_new>. 607earlier call to C<ev_loop_new>.
606 608
607=item ev_default_fork () 609=item ev_default_fork ()
608 610
609This function sets a flag that causes subsequent C<ev_loop> iterations 611This function sets a flag that causes subsequent C<ev_run> iterations
610to reinitialise the kernel state for backends that have one. Despite the 612to reinitialise the kernel state for backends that have one. Despite the
611name, 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
612the 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
613sense). 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
614functions, 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.
615 617
616Again, you I<have> to call it on I<any> loop that you want to re-use after 618Again, you I<have> to call it on I<any> loop that you want to re-use after
617a fork, I<even if you do not plan to use the loop in the parent>. This is 619a fork, I<even if you do not plan to use the loop in the parent>. This is
618because some kernel interfaces *cough* I<kqueue> *cough* do funny things 620because some kernel interfaces *cough* I<kqueue> *cough* do funny things
619during fork. 621during fork.
620 622
621On 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
622process if and only if you want to use the event loop in the child. If you 624process if and only if you want to use the event loop in the child. If
623just fork+exec or create a new loop in the child, you don't have to call 625you just fork+exec or create a new loop in the child, you don't have to
624it at all. 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).
625 629
626The 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
627it 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
628quite nicely into a call to C<pthread_atfork>: 632quite nicely into a call to C<pthread_atfork>:
629 633
641Returns 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
642otherwise. 646otherwise.
643 647
644=item unsigned int ev_iteration (loop) 648=item unsigned int ev_iteration (loop)
645 649
646Returns the current iteration count for the loop, which is identical to 650Returns the current iteration count for the event loop, which is identical
647the 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>
648happily wraps around with enough iterations. 652and happily wraps around with enough iterations.
649 653
650This 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
651"ticks" the number of loop iterations), as it roughly corresponds with 655"ticks" the number of loop iterations), as it roughly corresponds with
652C<ev_prepare> and C<ev_check> calls - and is incremented between the 656C<ev_prepare> and C<ev_check> calls - and is incremented between the
653prepare and check phases. 657prepare and check phases.
654 658
655=item unsigned int ev_depth (loop) 659=item unsigned int ev_depth (loop)
656 660
657Returns the number of times C<ev_loop> was entered minus the number of 661Returns the number of times C<ev_run> was entered minus the number of
658times C<ev_loop> was exited, in other words, the recursion depth. 662times C<ev_run> was exited, in other words, the recursion depth.
659 663
660Outside C<ev_loop>, this number is zero. In a callback, this number is 664Outside C<ev_run>, this number is zero. In a callback, this number is
661C<1>, unless C<ev_loop> was invoked recursively (or from another thread), 665C<1>, unless C<ev_run> was invoked recursively (or from another thread),
662in which case it is higher. 666in which case it is higher.
663 667
664Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread 668Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread
665etc.), doesn't count as "exit" - consider this as a hint to avoid such 669etc.), doesn't count as "exit" - consider this as a hint to avoid such
666ungentleman behaviour unless it's really convenient. 670ungentleman-like behaviour unless it's really convenient.
667 671
668=item unsigned int ev_backend (loop) 672=item unsigned int ev_backend (loop)
669 673
670Returns one of the C<EVBACKEND_*> flags indicating the event backend in 674Returns one of the C<EVBACKEND_*> flags indicating the event backend in
671use. 675use.
680 684
681=item ev_now_update (loop) 685=item ev_now_update (loop)
682 686
683Establishes the current time by querying the kernel, updating the time 687Establishes the current time by querying the kernel, updating the time
684returned 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
685is usually done automatically within C<ev_loop ()>. 689is usually done automatically within C<ev_run ()>.
686 690
687This 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
688very 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
689the current time is a good idea. 693the current time is a good idea.
690 694
692 696
693=item ev_suspend (loop) 697=item ev_suspend (loop)
694 698
695=item ev_resume (loop) 699=item ev_resume (loop)
696 700
697These 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
698not used for a while and timeouts should not be processed. 702loop is not used for a while and timeouts should not be processed.
699 703
700A 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
701the 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
702would 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
703the 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>
705C<ev_resume> directly afterwards to resume timer processing. 709C<ev_resume> directly afterwards to resume timer processing.
706 710
707Effectively, 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
708between 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
709will 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
710occured while suspended). 714occurred while suspended).
711 715
712After 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
713given 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>
714without a previous call to C<ev_suspend>. 718without a previous call to C<ev_suspend>.
715 719
716Calling 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
717event loop time (see C<ev_now_update>). 721event loop time (see C<ev_now_update>).
718 722
719=item ev_loop (loop, int flags) 723=item ev_run (loop, int flags)
720 724
721Finally, this is it, the event handler. This function usually is called 725Finally, this is it, the event handler. This function usually is called
722after you have initialised all your watchers and you want to start 726after you have initialised all your watchers and you want to start
723handling events. 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>.
724 730
725If 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
726either 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.
727 734
728Please note that an explicit C<ev_unloop> is usually better than 735Please note that an explicit C<ev_break> is usually better than
729relying 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
730finished (especially in interactive programs), but having a program 737finished (especially in interactive programs), but having a program
731that 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
732of 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
733beauty. 740beauty.
734 741
735A 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
736those events and any already outstanding ones, but will not block your 743those events and any already outstanding ones, but will not wait and
737process 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
738the loop. 745iteration of the loop. This is sometimes useful to poll and handle new
746events while doing lengthy calculations, to keep the program responsive.
739 747
740A 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
741necessary) and will handle those and any already outstanding ones. It 749necessary) and will handle those and any already outstanding ones. It
742will 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
743be 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
744user-registered callback will be called), and will return after one 752user-registered callback will be called), and will return after one
745iteration of the loop. 753iteration of the loop.
746 754
747This 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
748with something not expressible using other libev watchers (i.e. "roll your 756with something not expressible using other libev watchers (i.e. "roll your
749own 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
750usually a better approach for this kind of thing. 758usually a better approach for this kind of thing.
751 759
752Here are the gory details of what C<ev_loop> does: 760Here are the gory details of what C<ev_run> does:
753 761
762 - Increment loop depth.
763 - Reset the ev_break status.
754 - Before the first iteration, call any pending watchers. 764 - Before the first iteration, call any pending watchers.
765 LOOP:
755 * If EVFLAG_FORKCHECK was used, check for a fork. 766 - If EVFLAG_FORKCHECK was used, check for a fork.
756 - 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.
757 - Queue and call all prepare watchers. 768 - Queue and call all prepare watchers.
769 - If ev_break was called, goto FINISH.
758 - If we have been forked, detach and recreate the kernel state 770 - If we have been forked, detach and recreate the kernel state
759 as to not disturb the other process. 771 as to not disturb the other process.
760 - Update the kernel state with all outstanding changes. 772 - Update the kernel state with all outstanding changes.
761 - Update the "event loop time" (ev_now ()). 773 - Update the "event loop time" (ev_now ()).
762 - Calculate for how long to sleep or block, if at all 774 - Calculate for how long to sleep or block, if at all
763 (active idle watchers, EVLOOP_NONBLOCK or not having 775 (active idle watchers, EVRUN_NOWAIT or not having
764 any active watchers at all will result in not sleeping). 776 any active watchers at all will result in not sleeping).
765 - 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.
766 - Block the process, waiting for any events. 779 - Block the process, waiting for any events.
767 - Queue all outstanding I/O (fd) events. 780 - Queue all outstanding I/O (fd) events.
768 - 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.
769 - Queue all expired timers. 782 - Queue all expired timers.
770 - Queue all expired periodics. 783 - Queue all expired periodics.
771 - Unless any events are pending now, queue all idle watchers. 784 - Queue all idle watchers with priority higher than that of pending events.
772 - Queue all check watchers. 785 - Queue all check watchers.
773 - 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).
774 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
775 be handled here by queueing them when their watcher gets executed. 788 be handled here by queueing them when their watcher gets executed.
776 - 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
777 were used, or there are no active watchers, return, otherwise 790 were used, or there are no active watchers, goto FINISH, otherwise
778 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.
779 796
780Example: Queue some jobs and then loop until no events are outstanding 797Example: Queue some jobs and then loop until no events are outstanding
781anymore. 798anymore.
782 799
783 ... queue jobs here, make sure they register event watchers as long 800 ... queue jobs here, make sure they register event watchers as long
784 ... 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..)
785 ev_loop (my_loop, 0); 802 ev_run (my_loop, 0);
786 ... jobs done or somebody called unloop. yeah! 803 ... jobs done or somebody called unloop. yeah!
787 804
788=item ev_unloop (loop, how) 805=item ev_break (loop, how)
789 806
790Can 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
791has processed all outstanding events). The C<how> argument must be either 808has processed all outstanding events). The C<how> argument must be either
792C<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
793C<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.
794 811
795This "unloop state" will be cleared when entering C<ev_loop> again. 812This "unloop state" will be cleared when entering C<ev_run> again.
796 813
797It 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##
798 815
799=item ev_ref (loop) 816=item ev_ref (loop)
800 817
801=item ev_unref (loop) 818=item ev_unref (loop)
802 819
803Ref/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
804loop: Every watcher keeps one reference, and as long as the reference 821loop: Every watcher keeps one reference, and as long as the reference
805count is nonzero, C<ev_loop> will not return on its own. 822count is nonzero, C<ev_run> will not return on its own.
806 823
807This is useful when you have a watcher that you never intend to 824This is useful when you have a watcher that you never intend to
808unregister, but that nevertheless should not keep C<ev_loop> from 825unregister, but that nevertheless should not keep C<ev_run> from
809returning. In such a case, call C<ev_unref> after starting, and C<ev_ref> 826returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
810before stopping it. 827before stopping it.
811 828
812As 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
813is 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
814exiting 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
815excellent way to do this for generic recurring timers or from within 832excellent way to do this for generic recurring timers or from within
816third-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
817before 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
818before, respectively. Note also that libev might stop watchers itself 835before, respectively. Note also that libev might stop watchers itself
819(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>
820in the callback). 837in the callback).
821 838
822Example: 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>
823running when nothing else is active. 840running when nothing else is active.
824 841
825 ev_signal exitsig; 842 ev_signal exitsig;
826 ev_signal_init (&exitsig, sig_cb, SIGINT); 843 ev_signal_init (&exitsig, sig_cb, SIGINT);
827 ev_signal_start (loop, &exitsig); 844 ev_signal_start (loop, &exitsig);
872usually 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>,
873as this approaches the timing granularity of most systems. Note that if 890as this approaches the timing granularity of most systems. Note that if
874you 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
875parallelity, then this setting will limit your transaction rate (if you 892parallelity, then this setting will limit your transaction rate (if you
876need 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,
877then you can't do more than 100 transations per second). 894then you can't do more than 100 transactions per second).
878 895
879Setting the I<timeout collect interval> can improve the opportunity for 896Setting the I<timeout collect interval> can improve the opportunity for
880saving power, as the program will "bundle" timer callback invocations that 897saving power, as the program will "bundle" timer callback invocations that
881are "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
882times the process sleeps and wakes up again. Another useful technique to 899times the process sleeps and wakes up again. Another useful technique to
890 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); 907 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
891 908
892=item ev_invoke_pending (loop) 909=item ev_invoke_pending (loop)
893 910
894This call will simply invoke all pending watchers while resetting their 911This call will simply invoke all pending watchers while resetting their
895pending state. Normally, C<ev_loop> does this automatically when required, 912pending state. Normally, C<ev_run> does this automatically when required,
896but when overriding the invoke callback this call comes handy. 913but when overriding the invoke callback this call comes handy. This
914function can be invoked from a watcher - this can be useful for example
915when you want to do some lengthy calculation and want to pass further
916event handling to another thread (you still have to make sure only one
917thread executes within C<ev_invoke_pending> or C<ev_run> of course).
897 918
898=item int ev_pending_count (loop) 919=item int ev_pending_count (loop)
899 920
900Returns the number of pending watchers - zero indicates that no watchers 921Returns the number of pending watchers - zero indicates that no watchers
901are pending. 922are pending.
902 923
903=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P)) 924=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
904 925
905This overrides the invoke pending functionality of the loop: Instead of 926This overrides the invoke pending functionality of the loop: Instead of
906invoking all pending watchers when there are any, C<ev_loop> will call 927invoking all pending watchers when there are any, C<ev_run> will call
907this callback instead. This is useful, for example, when you want to 928this callback instead. This is useful, for example, when you want to
908invoke the actual watchers inside another context (another thread etc.). 929invoke the actual watchers inside another context (another thread etc.).
909 930
910If you want to reset the callback, use C<ev_invoke_pending> as new 931If you want to reset the callback, use C<ev_invoke_pending> as new
911callback. 932callback.
914 935
915Sometimes you want to share the same loop between multiple threads. This 936Sometimes you want to share the same loop between multiple threads. This
916can be done relatively simply by putting mutex_lock/unlock calls around 937can be done relatively simply by putting mutex_lock/unlock calls around
917each call to a libev function. 938each call to a libev function.
918 939
919However, C<ev_loop> can run an indefinite time, so it is not feasible to 940However, C<ev_run> can run an indefinite time, so it is not feasible
920wait for it to return. One way around this is to wake up the loop via 941to wait for it to return. One way around this is to wake up the event
921C<ev_unloop> and C<av_async_send>, another way is to set these I<release> 942loop via C<ev_break> and C<av_async_send>, another way is to set these
922and I<acquire> callbacks on the loop. 943I<release> and I<acquire> callbacks on the loop.
923 944
924When set, then C<release> will be called just before the thread is 945When set, then C<release> will be called just before the thread is
925suspended waiting for new events, and C<acquire> is called just 946suspended waiting for new events, and C<acquire> is called just
926afterwards. 947afterwards.
927 948
930 951
931While event loop modifications are allowed between invocations of 952While event loop modifications are allowed between invocations of
932C<release> and C<acquire> (that's their only purpose after all), no 953C<release> and C<acquire> (that's their only purpose after all), no
933modifications done will affect the event loop, i.e. adding watchers will 954modifications done will affect the event loop, i.e. adding watchers will
934have no effect on the set of file descriptors being watched, or the time 955have no effect on the set of file descriptors being watched, or the time
935waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it 956waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
936to take note of any changes you made. 957to take note of any changes you made.
937 958
938In theory, threads executing C<ev_loop> will be async-cancel safe between 959In theory, threads executing C<ev_run> will be async-cancel safe between
939invocations of C<release> and C<acquire>. 960invocations of C<release> and C<acquire>.
940 961
941See also the locking example in the C<THREADS> section later in this 962See also the locking example in the C<THREADS> section later in this
942document. 963document.
943 964
952These two functions can be used to associate arbitrary data with a loop, 973These two functions can be used to associate arbitrary data with a loop,
953and are intended solely for the C<invoke_pending_cb>, C<release> and 974and are intended solely for the C<invoke_pending_cb>, C<release> and
954C<acquire> callbacks described above, but of course can be (ab-)used for 975C<acquire> callbacks described above, but of course can be (ab-)used for
955any other purpose as well. 976any other purpose as well.
956 977
957=item ev_loop_verify (loop) 978=item ev_verify (loop)
958 979
959This function only does something when C<EV_VERIFY> support has been 980This function only does something when C<EV_VERIFY> support has been
960compiled in, which is the default for non-minimal builds. It tries to go 981compiled in, which is the default for non-minimal builds. It tries to go
961through all internal structures and checks them for validity. If anything 982through all internal structures and checks them for validity. If anything
962is found to be inconsistent, it will print an error message to standard 983is found to be inconsistent, it will print an error message to standard
973 994
974In the following description, uppercase C<TYPE> in names stands for the 995In the following description, uppercase C<TYPE> in names stands for the
975watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer 996watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
976watchers and C<ev_io_start> for I/O watchers. 997watchers and C<ev_io_start> for I/O watchers.
977 998
978A watcher is a structure that you create and register to record your 999A watcher is an opaque structure that you allocate and register to record
979interest in some event. For instance, if you want to wait for STDIN to 1000your interest in some event. To make a concrete example, imagine you want
980become readable, you would create an C<ev_io> watcher for that: 1001to wait for STDIN to become readable, you would create an C<ev_io> watcher
1002for that:
981 1003
982 static void my_cb (struct ev_loop *loop, ev_io *w, int revents) 1004 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
983 { 1005 {
984 ev_io_stop (w); 1006 ev_io_stop (w);
985 ev_unloop (loop, EVUNLOOP_ALL); 1007 ev_break (loop, EVBREAK_ALL);
986 } 1008 }
987 1009
988 struct ev_loop *loop = ev_default_loop (0); 1010 struct ev_loop *loop = ev_default_loop (0);
989 1011
990 ev_io stdin_watcher; 1012 ev_io stdin_watcher;
991 1013
992 ev_init (&stdin_watcher, my_cb); 1014 ev_init (&stdin_watcher, my_cb);
993 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 1015 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
994 ev_io_start (loop, &stdin_watcher); 1016 ev_io_start (loop, &stdin_watcher);
995 1017
996 ev_loop (loop, 0); 1018 ev_run (loop, 0);
997 1019
998As you can see, you are responsible for allocating the memory for your 1020As you can see, you are responsible for allocating the memory for your
999watcher structures (and it is I<usually> a bad idea to do this on the 1021watcher structures (and it is I<usually> a bad idea to do this on the
1000stack). 1022stack).
1001 1023
1002Each watcher has an associated watcher structure (called C<struct ev_TYPE> 1024Each watcher has an associated watcher structure (called C<struct ev_TYPE>
1003or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). 1025or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
1004 1026
1005Each watcher structure must be initialised by a call to C<ev_init 1027Each watcher structure must be initialised by a call to C<ev_init (watcher
1006(watcher *, callback)>, which expects a callback to be provided. This 1028*, callback)>, which expects a callback to be provided. This callback is
1007callback gets invoked each time the event occurs (or, in the case of I/O 1029invoked each time the event occurs (or, in the case of I/O watchers, each
1008watchers, each time the event loop detects that the file descriptor given 1030time the event loop detects that the file descriptor given is readable
1009is readable and/or writable). 1031and/or writable).
1010 1032
1011Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> 1033Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
1012macro to configure it, with arguments specific to the watcher type. There 1034macro to configure it, with arguments specific to the watcher type. There
1013is also a macro to combine initialisation and setting in one call: C<< 1035is also a macro to combine initialisation and setting in one call: C<<
1014ev_TYPE_init (watcher *, callback, ...) >>. 1036ev_TYPE_init (watcher *, callback, ...) >>.
1065 1087
1066=item C<EV_PREPARE> 1088=item C<EV_PREPARE>
1067 1089
1068=item C<EV_CHECK> 1090=item C<EV_CHECK>
1069 1091
1070All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts 1092All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
1071to gather new events, and all C<ev_check> watchers are invoked just after 1093to gather new events, and all C<ev_check> watchers are invoked just after
1072C<ev_loop> has gathered them, but before it invokes any callbacks for any 1094C<ev_run> has gathered them, but before it invokes any callbacks for any
1073received events. Callbacks of both watcher types can start and stop as 1095received events. Callbacks of both watcher types can start and stop as
1074many watchers as they want, and all of them will be taken into account 1096many watchers as they want, and all of them will be taken into account
1075(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1097(for example, a C<ev_prepare> watcher might start an idle watcher to keep
1076C<ev_loop> from blocking). 1098C<ev_run> from blocking).
1077 1099
1078=item C<EV_EMBED> 1100=item C<EV_EMBED>
1079 1101
1080The embedded event loop specified in the C<ev_embed> watcher needs attention. 1102The embedded event loop specified in the C<ev_embed> watcher needs attention.
1081 1103
1109example it might indicate that a fd is readable or writable, and if your 1131example it might indicate that a fd is readable or writable, and if your
1110callbacks is well-written it can just attempt the operation and cope with 1132callbacks is well-written it can just attempt the operation and cope with
1111the error from read() or write(). This will not work in multi-threaded 1133the error from read() or write(). This will not work in multi-threaded
1112programs, though, as the fd could already be closed and reused for another 1134programs, though, as the fd could already be closed and reused for another
1113thing, so beware. 1135thing, so beware.
1136
1137=back
1138
1139=head2 WATCHER STATES
1140
1141There are various watcher states mentioned throughout this manual -
1142active, pending and so on. In this section these states and the rules to
1143transition between them will be described in more detail - and while these
1144rules might look complicated, they usually do "the right thing".
1145
1146=over 4
1147
1148=item initialiased
1149
1150Before a watcher can be registered with the event looop it has to be
1151initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1152C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1153
1154In this state it is simply some block of memory that is suitable for use
1155in an event loop. It can be moved around, freed, reused etc. at will.
1156
1157=item started/running/active
1158
1159Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1160property of the event loop, and is actively waiting for events. While in
1161this state it cannot be accessed (except in a few documented ways), moved,
1162freed or anything else - the only legal thing is to keep a pointer to it,
1163and call libev functions on it that are documented to work on active watchers.
1164
1165=item pending
1166
1167If a watcher is active and libev determines that an event it is interested
1168in has occurred (such as a timer expiring), it will become pending. It will
1169stay in this pending state until either it is stopped or its callback is
1170about to be invoked, so it is not normally pending inside the watcher
1171callback.
1172
1173The watcher might or might not be active while it is pending (for example,
1174an expired non-repeating timer can be pending but no longer active). If it
1175is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1176but it is still property of the event loop at this time, so cannot be
1177moved, freed or reused. And if it is active the rules described in the
1178previous item still apply.
1179
1180It is also possible to feed an event on a watcher that is not active (e.g.
1181via C<ev_feed_event>), in which case it becomes pending without being
1182active.
1183
1184=item stopped
1185
1186A watcher can be stopped implicitly by libev (in which case it might still
1187be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1188latter will clear any pending state the watcher might be in, regardless
1189of whether it was active or not, so stopping a watcher explicitly before
1190freeing it is often a good idea.
1191
1192While stopped (and not pending) the watcher is essentially in the
1193initialised state, that is it can be reused, moved, modified in any way
1194you wish.
1114 1195
1115=back 1196=back
1116 1197
1117=head2 GENERIC WATCHER FUNCTIONS 1198=head2 GENERIC WATCHER FUNCTIONS
1118 1199
1380 1461
1381For example, to emulate how many other event libraries handle priorities, 1462For example, to emulate how many other event libraries handle priorities,
1382you can associate an C<ev_idle> watcher to each such watcher, and in 1463you can associate an C<ev_idle> watcher to each such watcher, and in
1383the normal watcher callback, you just start the idle watcher. The real 1464the normal watcher callback, you just start the idle watcher. The real
1384processing is done in the idle watcher callback. This causes libev to 1465processing is done in the idle watcher callback. This causes libev to
1385continously poll and process kernel event data for the watcher, but when 1466continuously poll and process kernel event data for the watcher, but when
1386the lock-out case is known to be rare (which in turn is rare :), this is 1467the lock-out case is known to be rare (which in turn is rare :), this is
1387workable. 1468workable.
1388 1469
1389Usually, however, the lock-out model implemented that way will perform 1470Usually, however, the lock-out model implemented that way will perform
1390miserably under the type of load it was designed to handle. In that case, 1471miserably under the type of load it was designed to handle. In that case,
1468 1549
1469If you cannot use non-blocking mode, then force the use of a 1550If you cannot use non-blocking mode, then force the use of a
1470known-to-be-good backend (at the time of this writing, this includes only 1551known-to-be-good backend (at the time of this writing, this includes only
1471C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file 1552C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1472descriptors for which non-blocking operation makes no sense (such as 1553descriptors for which non-blocking operation makes no sense (such as
1473files) - libev doesn't guarentee any specific behaviour in that case. 1554files) - libev doesn't guarantee any specific behaviour in that case.
1474 1555
1475Another thing you have to watch out for is that it is quite easy to 1556Another thing you have to watch out for is that it is quite easy to
1476receive "spurious" readiness notifications, that is your callback might 1557receive "spurious" readiness notifications, that is your callback might
1477be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1558be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1478because there is no data. Not only are some backends known to create a 1559because there is no data. Not only are some backends known to create a
1622 ... 1703 ...
1623 struct ev_loop *loop = ev_default_init (0); 1704 struct ev_loop *loop = ev_default_init (0);
1624 ev_io stdin_readable; 1705 ev_io stdin_readable;
1625 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1706 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1626 ev_io_start (loop, &stdin_readable); 1707 ev_io_start (loop, &stdin_readable);
1627 ev_loop (loop, 0); 1708 ev_run (loop, 0);
1628 1709
1629 1710
1630=head2 C<ev_timer> - relative and optionally repeating timeouts 1711=head2 C<ev_timer> - relative and optionally repeating timeouts
1631 1712
1632Timer watchers are simple relative timers that generate an event after a 1713Timer watchers are simple relative timers that generate an event after a
1641The callback is guaranteed to be invoked only I<after> its timeout has 1722The callback is guaranteed to be invoked only I<after> its timeout has
1642passed (not I<at>, so on systems with very low-resolution clocks this 1723passed (not I<at>, so on systems with very low-resolution clocks this
1643might introduce a small delay). If multiple timers become ready during the 1724might introduce a small delay). If multiple timers become ready during the
1644same loop iteration then the ones with earlier time-out values are invoked 1725same loop iteration then the ones with earlier time-out values are invoked
1645before ones of the same priority with later time-out values (but this is 1726before ones of the same priority with later time-out values (but this is
1646no longer true when a callback calls C<ev_loop> recursively). 1727no longer true when a callback calls C<ev_run> recursively).
1647 1728
1648=head3 Be smart about timeouts 1729=head3 Be smart about timeouts
1649 1730
1650Many real-world problems involve some kind of timeout, usually for error 1731Many real-world problems involve some kind of timeout, usually for error
1651recovery. A typical example is an HTTP request - if the other side hangs, 1732recovery. A typical example is an HTTP request - if the other side hangs,
1737 ev_tstamp timeout = last_activity + 60.; 1818 ev_tstamp timeout = last_activity + 60.;
1738 1819
1739 // if last_activity + 60. is older than now, we did time out 1820 // if last_activity + 60. is older than now, we did time out
1740 if (timeout < now) 1821 if (timeout < now)
1741 { 1822 {
1742 // timeout occured, take action 1823 // timeout occurred, take action
1743 } 1824 }
1744 else 1825 else
1745 { 1826 {
1746 // callback was invoked, but there was some activity, re-arm 1827 // callback was invoked, but there was some activity, re-arm
1747 // the watcher to fire in last_activity + 60, which is 1828 // the watcher to fire in last_activity + 60, which is
1822 1903
1823=head3 The special problem of time updates 1904=head3 The special problem of time updates
1824 1905
1825Establishing the current time is a costly operation (it usually takes at 1906Establishing the current time is a costly operation (it usually takes at
1826least two system calls): EV therefore updates its idea of the current 1907least two system calls): EV therefore updates its idea of the current
1827time only before and after C<ev_loop> collects new events, which causes a 1908time only before and after C<ev_run> collects new events, which causes a
1828growing difference between C<ev_now ()> and C<ev_time ()> when handling 1909growing difference between C<ev_now ()> and C<ev_time ()> when handling
1829lots of events in one iteration. 1910lots of events in one iteration.
1830 1911
1831The relative timeouts are calculated relative to the C<ev_now ()> 1912The relative timeouts are calculated relative to the C<ev_now ()>
1832time. This is usually the right thing as this timestamp refers to the time 1913time. This is usually the right thing as this timestamp refers to the time
1949 } 2030 }
1950 2031
1951 ev_timer mytimer; 2032 ev_timer mytimer;
1952 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2033 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1953 ev_timer_again (&mytimer); /* start timer */ 2034 ev_timer_again (&mytimer); /* start timer */
1954 ev_loop (loop, 0); 2035 ev_run (loop, 0);
1955 2036
1956 // and in some piece of code that gets executed on any "activity": 2037 // and in some piece of code that gets executed on any "activity":
1957 // reset the timeout to start ticking again at 10 seconds 2038 // reset the timeout to start ticking again at 10 seconds
1958 ev_timer_again (&mytimer); 2039 ev_timer_again (&mytimer);
1959 2040
1985 2066
1986As with timers, the callback is guaranteed to be invoked only when the 2067As with timers, the callback is guaranteed to be invoked only when the
1987point in time where it is supposed to trigger has passed. If multiple 2068point in time where it is supposed to trigger has passed. If multiple
1988timers become ready during the same loop iteration then the ones with 2069timers become ready during the same loop iteration then the ones with
1989earlier time-out values are invoked before ones with later time-out values 2070earlier time-out values are invoked before ones with later time-out values
1990(but this is no longer true when a callback calls C<ev_loop> recursively). 2071(but this is no longer true when a callback calls C<ev_run> recursively).
1991 2072
1992=head3 Watcher-Specific Functions and Data Members 2073=head3 Watcher-Specific Functions and Data Members
1993 2074
1994=over 4 2075=over 4
1995 2076
2123Example: Call a callback every hour, or, more precisely, whenever the 2204Example: Call a callback every hour, or, more precisely, whenever the
2124system time is divisible by 3600. The callback invocation times have 2205system time is divisible by 3600. The callback invocation times have
2125potentially a lot of jitter, but good long-term stability. 2206potentially a lot of jitter, but good long-term stability.
2126 2207
2127 static void 2208 static void
2128 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2209 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
2129 { 2210 {
2130 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2211 ... its now a full hour (UTC, or TAI or whatever your clock follows)
2131 } 2212 }
2132 2213
2133 ev_periodic hourly_tick; 2214 ev_periodic hourly_tick;
2233Example: Try to exit cleanly on SIGINT. 2314Example: Try to exit cleanly on SIGINT.
2234 2315
2235 static void 2316 static void
2236 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2317 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2237 { 2318 {
2238 ev_unloop (loop, EVUNLOOP_ALL); 2319 ev_break (loop, EVBREAK_ALL);
2239 } 2320 }
2240 2321
2241 ev_signal signal_watcher; 2322 ev_signal signal_watcher;
2242 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2323 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2243 ev_signal_start (loop, &signal_watcher); 2324 ev_signal_start (loop, &signal_watcher);
2629 2710
2630Prepare and check watchers are usually (but not always) used in pairs: 2711Prepare and check watchers are usually (but not always) used in pairs:
2631prepare watchers get invoked before the process blocks and check watchers 2712prepare watchers get invoked before the process blocks and check watchers
2632afterwards. 2713afterwards.
2633 2714
2634You I<must not> call C<ev_loop> or similar functions that enter 2715You I<must not> call C<ev_run> or similar functions that enter
2635the current event loop from either C<ev_prepare> or C<ev_check> 2716the current event loop from either C<ev_prepare> or C<ev_check>
2636watchers. Other loops than the current one are fine, however. The 2717watchers. Other loops than the current one are fine, however. The
2637rationale behind this is that you do not need to check for recursion in 2718rationale behind this is that you do not need to check for recursion in
2638those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2719those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2639C<ev_check> so if you have one watcher of each kind they will always be 2720C<ev_check> so if you have one watcher of each kind they will always be
2807 2888
2808 if (timeout >= 0) 2889 if (timeout >= 0)
2809 // create/start timer 2890 // create/start timer
2810 2891
2811 // poll 2892 // poll
2812 ev_loop (EV_A_ 0); 2893 ev_run (EV_A_ 0);
2813 2894
2814 // stop timer again 2895 // stop timer again
2815 if (timeout >= 0) 2896 if (timeout >= 0)
2816 ev_timer_stop (EV_A_ &to); 2897 ev_timer_stop (EV_A_ &to);
2817 2898
2895if you do not want that, you need to temporarily stop the embed watcher). 2976if you do not want that, you need to temporarily stop the embed watcher).
2896 2977
2897=item ev_embed_sweep (loop, ev_embed *) 2978=item ev_embed_sweep (loop, ev_embed *)
2898 2979
2899Make a single, non-blocking sweep over the embedded loop. This works 2980Make a single, non-blocking sweep over the embedded loop. This works
2900similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2981similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2901appropriate way for embedded loops. 2982appropriate way for embedded loops.
2902 2983
2903=item struct ev_loop *other [read-only] 2984=item struct ev_loop *other [read-only]
2904 2985
2905The embedded event loop. 2986The embedded event loop.
2965C<ev_default_fork> cheats and calls it in the wrong process, the fork 3046C<ev_default_fork> cheats and calls it in the wrong process, the fork
2966handlers will be invoked, too, of course. 3047handlers will be invoked, too, of course.
2967 3048
2968=head3 The special problem of life after fork - how is it possible? 3049=head3 The special problem of life after fork - how is it possible?
2969 3050
2970Most uses of C<fork()> consist of forking, then some simple calls to ste 3051Most uses of C<fork()> consist of forking, then some simple calls to set
2971up/change the process environment, followed by a call to C<exec()>. This 3052up/change the process environment, followed by a call to C<exec()>. This
2972sequence should be handled by libev without any problems. 3053sequence should be handled by libev without any problems.
2973 3054
2974This changes when the application actually wants to do event handling 3055This changes when the application actually wants to do event handling
2975in the child, or both parent in child, in effect "continuing" after the 3056in the child, or both parent in child, in effect "continuing" after the
3009believe me. 3090believe me.
3010 3091
3011=back 3092=back
3012 3093
3013 3094
3014=head2 C<ev_async> - how to wake up another event loop 3095=head2 C<ev_async> - how to wake up an event loop
3015 3096
3016In general, you cannot use an C<ev_loop> from multiple threads or other 3097In general, you cannot use an C<ev_run> from multiple threads or other
3017asynchronous sources such as signal handlers (as opposed to multiple event 3098asynchronous sources such as signal handlers (as opposed to multiple event
3018loops - those are of course safe to use in different threads). 3099loops - those are of course safe to use in different threads).
3019 3100
3020Sometimes, however, you need to wake up another event loop you do not 3101Sometimes, however, you need to wake up an event loop you do not control,
3021control, for example because it belongs to another thread. This is what 3102for example because it belongs to another thread. This is what C<ev_async>
3022C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3103watchers do: as long as the C<ev_async> watcher is active, you can signal
3023can signal it by calling C<ev_async_send>, which is thread- and signal 3104it by calling C<ev_async_send>, which is thread- and signal safe.
3024safe.
3025 3105
3026This functionality is very similar to C<ev_signal> watchers, as signals, 3106This functionality is very similar to C<ev_signal> watchers, as signals,
3027too, are asynchronous in nature, and signals, too, will be compressed 3107too, are asynchronous in nature, and signals, too, will be compressed
3028(i.e. the number of callback invocations may be less than the number of 3108(i.e. the number of callback invocations may be less than the number of
3029C<ev_async_sent> calls). 3109C<ev_async_sent> calls).
3390Associates a different C<struct ev_loop> with this watcher. You can only 3470Associates a different C<struct ev_loop> with this watcher. You can only
3391do this when the watcher is inactive (and not pending either). 3471do this when the watcher is inactive (and not pending either).
3392 3472
3393=item w->set ([arguments]) 3473=item w->set ([arguments])
3394 3474
3395Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3475Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3396called at least once. Unlike the C counterpart, an active watcher gets 3476method or a suitable start method must be called at least once. Unlike the
3397automatically stopped and restarted when reconfiguring it with this 3477C counterpart, an active watcher gets automatically stopped and restarted
3398method. 3478when reconfiguring it with this method.
3399 3479
3400=item w->start () 3480=item w->start ()
3401 3481
3402Starts the watcher. Note that there is no C<loop> argument, as the 3482Starts the watcher. Note that there is no C<loop> argument, as the
3403constructor already stores the event loop. 3483constructor already stores the event loop.
3404 3484
3485=item w->start ([arguments])
3486
3487Instead of calling C<set> and C<start> methods separately, it is often
3488convenient to wrap them in one call. Uses the same type of arguments as
3489the configure C<set> method of the watcher.
3490
3405=item w->stop () 3491=item w->stop ()
3406 3492
3407Stops the watcher if it is active. Again, no C<loop> argument. 3493Stops the watcher if it is active. Again, no C<loop> argument.
3408 3494
3409=item w->again () (C<ev::timer>, C<ev::periodic> only) 3495=item w->again () (C<ev::timer>, C<ev::periodic> only)
3421 3507
3422=back 3508=back
3423 3509
3424=back 3510=back
3425 3511
3426Example: Define a class with an IO and idle watcher, start one of them in 3512Example: Define a class with two I/O and idle watchers, start the I/O
3427the constructor. 3513watchers in the constructor.
3428 3514
3429 class myclass 3515 class myclass
3430 { 3516 {
3431 ev::io io ; void io_cb (ev::io &w, int revents); 3517 ev::io io ; void io_cb (ev::io &w, int revents);
3518 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3432 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3519 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3433 3520
3434 myclass (int fd) 3521 myclass (int fd)
3435 { 3522 {
3436 io .set <myclass, &myclass::io_cb > (this); 3523 io .set <myclass, &myclass::io_cb > (this);
3524 io2 .set <myclass, &myclass::io2_cb > (this);
3437 idle.set <myclass, &myclass::idle_cb> (this); 3525 idle.set <myclass, &myclass::idle_cb> (this);
3438 3526
3439 io.start (fd, ev::READ); 3527 io.set (fd, ev::WRITE); // configure the watcher
3528 io.start (); // start it whenever convenient
3529
3530 io2.start (fd, ev::READ); // set + start in one call
3440 } 3531 }
3441 }; 3532 };
3442 3533
3443 3534
3444=head1 OTHER LANGUAGE BINDINGS 3535=head1 OTHER LANGUAGE BINDINGS
3518loop argument"). The C<EV_A> form is used when this is the sole argument, 3609loop argument"). The C<EV_A> form is used when this is the sole argument,
3519C<EV_A_> is used when other arguments are following. Example: 3610C<EV_A_> is used when other arguments are following. Example:
3520 3611
3521 ev_unref (EV_A); 3612 ev_unref (EV_A);
3522 ev_timer_add (EV_A_ watcher); 3613 ev_timer_add (EV_A_ watcher);
3523 ev_loop (EV_A_ 0); 3614 ev_run (EV_A_ 0);
3524 3615
3525It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 3616It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3526which is often provided by the following macro. 3617which is often provided by the following macro.
3527 3618
3528=item C<EV_P>, C<EV_P_> 3619=item C<EV_P>, C<EV_P_>
3568 } 3659 }
3569 3660
3570 ev_check check; 3661 ev_check check;
3571 ev_check_init (&check, check_cb); 3662 ev_check_init (&check, check_cb);
3572 ev_check_start (EV_DEFAULT_ &check); 3663 ev_check_start (EV_DEFAULT_ &check);
3573 ev_loop (EV_DEFAULT_ 0); 3664 ev_run (EV_DEFAULT_ 0);
3574 3665
3575=head1 EMBEDDING 3666=head1 EMBEDDING
3576 3667
3577Libev can (and often is) directly embedded into host 3668Libev can (and often is) directly embedded into host
3578applications. Examples of applications that embed it include the Deliantra 3669applications. Examples of applications that embed it include the Deliantra
3669to a compiled library. All other symbols change the ABI, which means all 3760to a compiled library. All other symbols change the ABI, which means all
3670users of libev and the libev code itself must be compiled with compatible 3761users of libev and the libev code itself must be compiled with compatible
3671settings. 3762settings.
3672 3763
3673=over 4 3764=over 4
3765
3766=item EV_COMPAT3 (h)
3767
3768Backwards compatibility is a major concern for libev. This is why this
3769release of libev comes with wrappers for the functions and symbols that
3770have been renamed between libev version 3 and 4.
3771
3772You can disable these wrappers (to test compatibility with future
3773versions) by defining C<EV_COMPAT3> to C<0> when compiling your
3774sources. This has the additional advantage that you can drop the C<struct>
3775from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
3776typedef in that case.
3777
3778In some future version, the default for C<EV_COMPAT3> will become C<0>,
3779and in some even more future version the compatibility code will be
3780removed completely.
3674 3781
3675=item EV_STANDALONE (h) 3782=item EV_STANDALONE (h)
3676 3783
3677Must always be C<1> if you do not use autoconf configuration, which 3784Must always be C<1> if you do not use autoconf configuration, which
3678keeps libev from including F<config.h>, and it also defines dummy 3785keeps libev from including F<config.h>, and it also defines dummy
3885EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE, 3992EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3886EV_ASYNC_ENABLE, EV_CHILD_ENABLE. 3993EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3887 3994
3888If undefined or defined to be C<1> (and the platform supports it), then 3995If undefined or defined to be C<1> (and the platform supports it), then
3889the respective watcher type is supported. If defined to be C<0>, then it 3996the respective watcher type is supported. If defined to be C<0>, then it
3890is not. Disabling watcher types mainly saves codesize. 3997is not. Disabling watcher types mainly saves code size.
3891 3998
3892=item EV_FEATURES 3999=item EV_FEATURES
3893 4000
3894If you need to shave off some kilobytes of code at the expense of some 4001If you need to shave off some kilobytes of code at the expense of some
3895speed (but with the full API), you can define this symbol to request 4002speed (but with the full API), you can define this symbol to request
3915 4022
3916=item C<1> - faster/larger code 4023=item C<1> - faster/larger code
3917 4024
3918Use larger code to speed up some operations. 4025Use larger code to speed up some operations.
3919 4026
3920Currently this is used to override some inlining decisions (enlarging the roughly 4027Currently this is used to override some inlining decisions (enlarging the
392130% code size on amd64. 4028code size by roughly 30% on amd64).
3922 4029
3923When optimising for size, use of compiler flags such as C<-Os> with 4030When optimising for size, use of compiler flags such as C<-Os> with
3924gcc recommended, as well as C<-DNDEBUG>, as libev contains a number of 4031gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
3925assertions. 4032assertions.
3926 4033
3927=item C<2> - faster/larger data structures 4034=item C<2> - faster/larger data structures
3928 4035
3929Replaces the small 2-heap for timer management by a faster 4-heap, larger 4036Replaces the small 2-heap for timer management by a faster 4-heap, larger
3930hash table sizes and so on. This will usually further increase codesize 4037hash table sizes and so on. This will usually further increase code size
3931and can additionally have an effect on the size of data structures at 4038and can additionally have an effect on the size of data structures at
3932runtime. 4039runtime.
3933 4040
3934=item C<4> - full API configuration 4041=item C<4> - full API configuration
3935 4042
3972I/O watcher then might come out at only 5Kb. 4079I/O watcher then might come out at only 5Kb.
3973 4080
3974=item EV_AVOID_STDIO 4081=item EV_AVOID_STDIO
3975 4082
3976If this is set to C<1> at compiletime, then libev will avoid using stdio 4083If this is set to C<1> at compiletime, then libev will avoid using stdio
3977functions (printf, scanf, perror etc.). This will increase the codesize 4084functions (printf, scanf, perror etc.). This will increase the code size
3978somewhat, but if your program doesn't otherwise depend on stdio and your 4085somewhat, but if your program doesn't otherwise depend on stdio and your
3979libc allows it, this avoids linking in the stdio library which is quite 4086libc allows it, this avoids linking in the stdio library which is quite
3980big. 4087big.
3981 4088
3982Note that error messages might become less precise when this option is 4089Note that error messages might become less precise when this option is
3986 4093
3987The highest supported signal number, +1 (or, the number of 4094The highest supported signal number, +1 (or, the number of
3988signals): Normally, libev tries to deduce the maximum number of signals 4095signals): Normally, libev tries to deduce the maximum number of signals
3989automatically, but sometimes this fails, in which case it can be 4096automatically, but sometimes this fails, in which case it can be
3990specified. Also, using a lower number than detected (C<32> should be 4097specified. Also, using a lower number than detected (C<32> should be
3991good for about any system in existance) can save some memory, as libev 4098good for about any system in existence) can save some memory, as libev
3992statically allocates some 12-24 bytes per signal number. 4099statically allocates some 12-24 bytes per signal number.
3993 4100
3994=item EV_PID_HASHSIZE 4101=item EV_PID_HASHSIZE
3995 4102
3996C<ev_child> watchers use a small hash table to distribute workload by 4103C<ev_child> watchers use a small hash table to distribute workload by
4028The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it 4135The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
4029will be C<0>. 4136will be C<0>.
4030 4137
4031=item EV_VERIFY 4138=item EV_VERIFY
4032 4139
4033Controls how much internal verification (see C<ev_loop_verify ()>) will 4140Controls how much internal verification (see C<ev_verify ()>) will
4034be done: If set to C<0>, no internal verification code will be compiled 4141be done: If set to C<0>, no internal verification code will be compiled
4035in. If set to C<1>, then verification code will be compiled in, but not 4142in. If set to C<1>, then verification code will be compiled in, but not
4036called. If set to C<2>, then the internal verification code will be 4143called. If set to C<2>, then the internal verification code will be
4037called once per loop, which can slow down libev. If set to C<3>, then the 4144called once per loop, which can slow down libev. If set to C<3>, then the
4038verification code will be called very frequently, which will slow down 4145verification code will be called very frequently, which will slow down
4042will be C<0>. 4149will be C<0>.
4043 4150
4044=item EV_COMMON 4151=item EV_COMMON
4045 4152
4046By default, all watchers have a C<void *data> member. By redefining 4153By default, all watchers have a C<void *data> member. By redefining
4047this macro to a something else you can include more and other types of 4154this macro to something else you can include more and other types of
4048members. You have to define it each time you include one of the files, 4155members. You have to define it each time you include one of the files,
4049though, and it must be identical each time. 4156though, and it must be identical each time.
4050 4157
4051For example, the perl EV module uses something like this: 4158For example, the perl EV module uses something like this:
4052 4159
4253 userdata *u = ev_userdata (EV_A); 4360 userdata *u = ev_userdata (EV_A);
4254 pthread_mutex_lock (&u->lock); 4361 pthread_mutex_lock (&u->lock);
4255 } 4362 }
4256 4363
4257The event loop thread first acquires the mutex, and then jumps straight 4364The event loop thread first acquires the mutex, and then jumps straight
4258into C<ev_loop>: 4365into C<ev_run>:
4259 4366
4260 void * 4367 void *
4261 l_run (void *thr_arg) 4368 l_run (void *thr_arg)
4262 { 4369 {
4263 struct ev_loop *loop = (struct ev_loop *)thr_arg; 4370 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4264 4371
4265 l_acquire (EV_A); 4372 l_acquire (EV_A);
4266 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0); 4373 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4267 ev_loop (EV_A_ 0); 4374 ev_run (EV_A_ 0);
4268 l_release (EV_A); 4375 l_release (EV_A);
4269 4376
4270 return 0; 4377 return 0;
4271 } 4378 }
4272 4379
4324 4431
4325=head3 COROUTINES 4432=head3 COROUTINES
4326 4433
4327Libev is very accommodating to coroutines ("cooperative threads"): 4434Libev is very accommodating to coroutines ("cooperative threads"):
4328libev fully supports nesting calls to its functions from different 4435libev fully supports nesting calls to its functions from different
4329coroutines (e.g. you can call C<ev_loop> on the same loop from two 4436coroutines (e.g. you can call C<ev_run> on the same loop from two
4330different coroutines, and switch freely between both coroutines running 4437different coroutines, and switch freely between both coroutines running
4331the loop, as long as you don't confuse yourself). The only exception is 4438the loop, as long as you don't confuse yourself). The only exception is
4332that you must not do this from C<ev_periodic> reschedule callbacks. 4439that you must not do this from C<ev_periodic> reschedule callbacks.
4333 4440
4334Care has been taken to ensure that libev does not keep local state inside 4441Care has been taken to ensure that libev does not keep local state inside
4335C<ev_loop>, and other calls do not usually allow for coroutine switches as 4442C<ev_run>, and other calls do not usually allow for coroutine switches as
4336they do not call any callbacks. 4443they do not call any callbacks.
4337 4444
4338=head2 COMPILER WARNINGS 4445=head2 COMPILER WARNINGS
4339 4446
4340Depending on your compiler and compiler settings, you might get no or a 4447Depending on your compiler and compiler settings, you might get no or a
4351maintainable. 4458maintainable.
4352 4459
4353And of course, some compiler warnings are just plain stupid, or simply 4460And of course, some compiler warnings are just plain stupid, or simply
4354wrong (because they don't actually warn about the condition their message 4461wrong (because they don't actually warn about the condition their message
4355seems to warn about). For example, certain older gcc versions had some 4462seems to warn about). For example, certain older gcc versions had some
4356warnings that resulted an extreme number of false positives. These have 4463warnings that resulted in an extreme number of false positives. These have
4357been fixed, but some people still insist on making code warn-free with 4464been fixed, but some people still insist on making code warn-free with
4358such buggy versions. 4465such buggy versions.
4359 4466
4360While libev is written to generate as few warnings as possible, 4467While libev is written to generate as few warnings as possible,
4361"warn-free" code is not a goal, and it is recommended not to build libev 4468"warn-free" code is not a goal, and it is recommended not to build libev
4397I suggest using suppression lists. 4504I suggest using suppression lists.
4398 4505
4399 4506
4400=head1 PORTABILITY NOTES 4507=head1 PORTABILITY NOTES
4401 4508
4509=head2 GNU/LINUX 32 BIT LIMITATIONS
4510
4511GNU/Linux is the only common platform that supports 64 bit file/large file
4512interfaces but I<disables> them by default.
4513
4514That means that libev compiled in the default environment doesn't support
4515files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4516
4517Unfortunately, many programs try to work around this GNU/Linux issue
4518by enabling the large file API, which makes them incompatible with the
4519standard libev compiled for their system.
4520
4521Likewise, libev cannot enable the large file API itself as this would
4522suddenly make it incompatible to the default compile time environment,
4523i.e. all programs not using special compile switches.
4524
4525=head2 OS/X AND DARWIN BUGS
4526
4527The whole thing is a bug if you ask me - basically any system interface
4528you touch is broken, whether it is locales, poll, kqueue or even the
4529OpenGL drivers.
4530
4531=head3 C<kqueue> is buggy
4532
4533The kqueue syscall is broken in all known versions - most versions support
4534only sockets, many support pipes.
4535
4536Libev tries to work around this by not using C<kqueue> by default on this
4537rotten platform, but of course you can still ask for it when creating a
4538loop - embedding a socket-only kqueue loop into a select-based one is
4539probably going to work well.
4540
4541=head3 C<poll> is buggy
4542
4543Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4544implementation by something calling C<kqueue> internally around the 10.5.6
4545release, so now C<kqueue> I<and> C<poll> are broken.
4546
4547Libev tries to work around this by not using C<poll> by default on
4548this rotten platform, but of course you can still ask for it when creating
4549a loop.
4550
4551=head3 C<select> is buggy
4552
4553All that's left is C<select>, and of course Apple found a way to fuck this
4554one up as well: On OS/X, C<select> actively limits the number of file
4555descriptors you can pass in to 1024 - your program suddenly crashes when
4556you use more.
4557
4558There is an undocumented "workaround" for this - defining
4559C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4560work on OS/X.
4561
4562=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4563
4564=head3 C<errno> reentrancy
4565
4566The default compile environment on Solaris is unfortunately so
4567thread-unsafe that you can't even use components/libraries compiled
4568without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4569defined by default. A valid, if stupid, implementation choice.
4570
4571If you want to use libev in threaded environments you have to make sure
4572it's compiled with C<_REENTRANT> defined.
4573
4574=head3 Event port backend
4575
4576The scalable event interface for Solaris is called "event
4577ports". Unfortunately, this mechanism is very buggy in all major
4578releases. If you run into high CPU usage, your program freezes or you get
4579a large number of spurious wakeups, make sure you have all the relevant
4580and latest kernel patches applied. No, I don't know which ones, but there
4581are multiple ones to apply, and afterwards, event ports actually work
4582great.
4583
4584If you can't get it to work, you can try running the program by setting
4585the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4586C<select> backends.
4587
4588=head2 AIX POLL BUG
4589
4590AIX unfortunately has a broken C<poll.h> header. Libev works around
4591this by trying to avoid the poll backend altogether (i.e. it's not even
4592compiled in), which normally isn't a big problem as C<select> works fine
4593with large bitsets on AIX, and AIX is dead anyway.
4594
4402=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4595=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4596
4597=head3 General issues
4403 4598
4404Win32 doesn't support any of the standards (e.g. POSIX) that libev 4599Win32 doesn't support any of the standards (e.g. POSIX) that libev
4405requires, and its I/O model is fundamentally incompatible with the POSIX 4600requires, and its I/O model is fundamentally incompatible with the POSIX
4406model. Libev still offers limited functionality on this platform in 4601model. Libev still offers limited functionality on this platform in
4407the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4602the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4408descriptors. This only applies when using Win32 natively, not when using 4603descriptors. This only applies when using Win32 natively, not when using
4409e.g. cygwin. 4604e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4605as every compielr comes with a slightly differently broken/incompatible
4606environment.
4410 4607
4411Lifting these limitations would basically require the full 4608Lifting these limitations would basically require the full
4412re-implementation of the I/O system. If you are into these kinds of 4609re-implementation of the I/O system. If you are into this kind of thing,
4413things, then note that glib does exactly that for you in a very portable 4610then note that glib does exactly that for you in a very portable way (note
4414way (note also that glib is the slowest event library known to man). 4611also that glib is the slowest event library known to man).
4415 4612
4416There is no supported compilation method available on windows except 4613There is no supported compilation method available on windows except
4417embedding it into other applications. 4614embedding it into other applications.
4418 4615
4419Sensible signal handling is officially unsupported by Microsoft - libev 4616Sensible signal handling is officially unsupported by Microsoft - libev
4447you do I<not> compile the F<ev.c> or any other embedded source files!): 4644you do I<not> compile the F<ev.c> or any other embedded source files!):
4448 4645
4449 #include "evwrap.h" 4646 #include "evwrap.h"
4450 #include "ev.c" 4647 #include "ev.c"
4451 4648
4452=over 4
4453
4454=item The winsocket select function 4649=head3 The winsocket C<select> function
4455 4650
4456The winsocket C<select> function doesn't follow POSIX in that it 4651The winsocket C<select> function doesn't follow POSIX in that it
4457requires socket I<handles> and not socket I<file descriptors> (it is 4652requires socket I<handles> and not socket I<file descriptors> (it is
4458also extremely buggy). This makes select very inefficient, and also 4653also extremely buggy). This makes select very inefficient, and also
4459requires a mapping from file descriptors to socket handles (the Microsoft 4654requires a mapping from file descriptors to socket handles (the Microsoft
4468 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4663 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4469 4664
4470Note that winsockets handling of fd sets is O(n), so you can easily get a 4665Note that winsockets handling of fd sets is O(n), so you can easily get a
4471complexity in the O(n²) range when using win32. 4666complexity in the O(n²) range when using win32.
4472 4667
4473=item Limited number of file descriptors 4668=head3 Limited number of file descriptors
4474 4669
4475Windows has numerous arbitrary (and low) limits on things. 4670Windows has numerous arbitrary (and low) limits on things.
4476 4671
4477Early versions of winsocket's select only supported waiting for a maximum 4672Early versions of winsocket's select only supported waiting for a maximum
4478of C<64> handles (probably owning to the fact that all windows kernels 4673of C<64> handles (probably owning to the fact that all windows kernels
4493runtime libraries. This might get you to about C<512> or C<2048> sockets 4688runtime libraries. This might get you to about C<512> or C<2048> sockets
4494(depending on windows version and/or the phase of the moon). To get more, 4689(depending on windows version and/or the phase of the moon). To get more,
4495you need to wrap all I/O functions and provide your own fd management, but 4690you need to wrap all I/O functions and provide your own fd management, but
4496the cost of calling select (O(n²)) will likely make this unworkable. 4691the cost of calling select (O(n²)) will likely make this unworkable.
4497 4692
4498=back
4499
4500=head2 PORTABILITY REQUIREMENTS 4693=head2 PORTABILITY REQUIREMENTS
4501 4694
4502In addition to a working ISO-C implementation and of course the 4695In addition to a working ISO-C implementation and of course the
4503backend-specific APIs, libev relies on a few additional extensions: 4696backend-specific APIs, libev relies on a few additional extensions:
4504 4697
4542watchers. 4735watchers.
4543 4736
4544=item C<double> must hold a time value in seconds with enough accuracy 4737=item C<double> must hold a time value in seconds with enough accuracy
4545 4738
4546The type C<double> is used to represent timestamps. It is required to 4739The type C<double> is used to represent timestamps. It is required to
4547have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4740have at least 51 bits of mantissa (and 9 bits of exponent), which is
4548enough for at least into the year 4000. This requirement is fulfilled by 4741good enough for at least into the year 4000 with millisecond accuracy
4742(the design goal for libev). This requirement is overfulfilled by
4549implementations implementing IEEE 754, which is basically all existing 4743implementations using IEEE 754, which is basically all existing ones. With
4550ones. With IEEE 754 doubles, you get microsecond accuracy until at least 4744IEEE 754 doubles, you get microsecond accuracy until at least 2200.
45512200.
4552 4745
4553=back 4746=back
4554 4747
4555If you know of other additional requirements drop me a note. 4748If you know of other additional requirements drop me a note.
4556 4749
4634compatibility, so most programs should still compile. Those might be 4827compatibility, so most programs should still compile. Those might be
4635removed in later versions of libev, so better update early than late. 4828removed in later versions of libev, so better update early than late.
4636 4829
4637=over 4 4830=over 4
4638 4831
4639=item C<ev_loop_count> renamed to C<ev_iteration> 4832=item function/symbol renames
4640 4833
4641=item C<ev_loop_depth> renamed to C<ev_depth> 4834A number of functions and symbols have been renamed:
4642 4835
4643=item C<ev_loop_verify> renamed to C<ev_verify> 4836 ev_loop => ev_run
4837 EVLOOP_NONBLOCK => EVRUN_NOWAIT
4838 EVLOOP_ONESHOT => EVRUN_ONCE
4839
4840 ev_unloop => ev_break
4841 EVUNLOOP_CANCEL => EVBREAK_CANCEL
4842 EVUNLOOP_ONE => EVBREAK_ONE
4843 EVUNLOOP_ALL => EVBREAK_ALL
4844
4845 EV_TIMEOUT => EV_TIMER
4846
4847 ev_loop_count => ev_iteration
4848 ev_loop_depth => ev_depth
4849 ev_loop_verify => ev_verify
4644 4850
4645Most functions working on C<struct ev_loop> objects don't have an 4851Most functions working on C<struct ev_loop> objects don't have an
4646C<ev_loop_> prefix, so it was removed. Note that C<ev_loop_fork> is 4852C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
4853associated constants have been renamed to not collide with the C<struct
4854ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4855as all other watcher types. Note that C<ev_loop_fork> is still called
4647still called C<ev_loop_fork> because it would otherwise clash with the 4856C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4648C<ev_fork> typedef. 4857typedef.
4649 4858
4650=item C<EV_TIMEOUT> renamed to C<EV_TIMER> in C<revents> 4859=item C<EV_COMPAT3> backwards compatibility mechanism
4651 4860
4652This is a simple rename - all other watcher types use their name 4861The backward compatibility mechanism can be controlled by
4653as revents flag, and now C<ev_timer> does, too. 4862C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4654 4863section.
4655Both C<EV_TIMER> and C<EV_TIMEOUT> symbols were present in 3.x versions
4656and continue to be present for the forseeable future, so this is mostly a
4657documentation change.
4658 4864
4659=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 4865=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4660 4866
4661The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 4867The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4662mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 4868mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4669 4875
4670=over 4 4876=over 4
4671 4877
4672=item active 4878=item active
4673 4879
4674A watcher is active as long as it has been started (has been attached to 4880A watcher is active as long as it has been started and not yet stopped.
4675an event loop) but not yet stopped (disassociated from the event loop). 4881See L<WATCHER STATES> for details.
4676 4882
4677=item application 4883=item application
4678 4884
4679In this document, an application is whatever is using libev. 4885In this document, an application is whatever is using libev.
4886
4887=item backend
4888
4889The part of the code dealing with the operating system interfaces.
4680 4890
4681=item callback 4891=item callback
4682 4892
4683The address of a function that is called when some event has been 4893The address of a function that is called when some event has been
4684detected. Callbacks are being passed the event loop, the watcher that 4894detected. Callbacks are being passed the event loop, the watcher that
4685received the event, and the actual event bitset. 4895received the event, and the actual event bitset.
4686 4896
4687=item callback invocation 4897=item callback/watcher invocation
4688 4898
4689The act of calling the callback associated with a watcher. 4899The act of calling the callback associated with a watcher.
4690 4900
4691=item event 4901=item event
4692 4902
4711The model used to describe how an event loop handles and processes 4921The model used to describe how an event loop handles and processes
4712watchers and events. 4922watchers and events.
4713 4923
4714=item pending 4924=item pending
4715 4925
4716A watcher is pending as soon as the corresponding event has been detected, 4926A watcher is pending as soon as the corresponding event has been
4717and stops being pending as soon as the watcher will be invoked or its 4927detected. See L<WATCHER STATES> for details.
4718pending status is explicitly cleared by the application.
4719
4720A watcher can be pending, but not active. Stopping a watcher also clears
4721its pending status.
4722 4928
4723=item real time 4929=item real time
4724 4930
4725The physical time that is observed. It is apparently strictly monotonic :) 4931The physical time that is observed. It is apparently strictly monotonic :)
4726 4932
4733=item watcher 4939=item watcher
4734 4940
4735A data structure that describes interest in certain events. Watchers need 4941A data structure that describes interest in certain events. Watchers need
4736to be started (attached to an event loop) before they can receive events. 4942to be started (attached to an event loop) before they can receive events.
4737 4943
4738=item watcher invocation
4739
4740The act of calling the callback associated with a watcher.
4741
4742=back 4944=back
4743 4945
4744=head1 AUTHOR 4946=head1 AUTHOR
4745 4947
4746Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 4948Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines