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

Comparing libev/ev.pod (file contents):
Revision 1.277 by root, Thu Dec 31 06:50:17 2009 UTC vs.
Revision 1.318 by root, Fri Oct 22 09:40:22 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
124this argument. 124this argument.
125 125
126=head2 TIME REPRESENTATION 126=head2 TIME REPRESENTATION
127 127
128Libev represents time as a single floating point number, representing 128Libev represents time as a single floating point number, representing
129the (fractional) number of seconds since the (POSIX) epoch (somewhere 129the (fractional) number of seconds since the (POSIX) epoch (in practice
130near the beginning of 1970, details are complicated, don't ask). This 130somewhere near the beginning of 1970, details are complicated, don't
131type 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
132aliases 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
133on 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
134component C<stamp> might indicate, it is also used for time differences 135Unlike the name component C<stamp> might indicate, it is also used for
135throughout libev. 136time differences (e.g. delays) throughout libev.
136 137
137=head1 ERROR HANDLING 138=head1 ERROR HANDLING
138 139
139Libev knows three classes of errors: operating system errors, usage errors 140Libev knows three classes of errors: operating system errors, usage errors
140and internal errors (bugs). 141and internal errors (bugs).
164 165
165=item ev_tstamp ev_time () 166=item ev_tstamp ev_time ()
166 167
167Returns the current time as libev would use it. Please note that the 168Returns the current time as libev would use it. Please note that the
168C<ev_now> function is usually faster and also often returns the timestamp 169C<ev_now> function is usually faster and also often returns the timestamp
169you actually want to know. 170you actually want to know. Also interetsing is the combination of
171C<ev_update_now> and C<ev_now>.
170 172
171=item ev_sleep (ev_tstamp interval) 173=item ev_sleep (ev_tstamp interval)
172 174
173Sleep for the given interval: The current thread will be blocked until 175Sleep for the given interval: The current thread will be blocked until
174either it is interrupted or the given time interval has passed. Basically 176either it is interrupted or the given time interval has passed. Basically
191as this indicates an incompatible change. Minor versions are usually 193as this indicates an incompatible change. Minor versions are usually
192compatible to older versions, so a larger minor version alone is usually 194compatible to older versions, so a larger minor version alone is usually
193not a problem. 195not a problem.
194 196
195Example: Make sure we haven't accidentally been linked against the wrong 197Example: Make sure we haven't accidentally been linked against the wrong
196version. 198version (note, however, that this will not detect ABI mismatches :).
197 199
198 assert (("libev version mismatch", 200 assert (("libev version mismatch",
199 ev_version_major () == EV_VERSION_MAJOR 201 ev_version_major () == EV_VERSION_MAJOR
200 && ev_version_minor () >= EV_VERSION_MINOR)); 202 && ev_version_minor () >= EV_VERSION_MINOR));
201 203
212 assert (("sorry, no epoll, no sex", 214 assert (("sorry, no epoll, no sex",
213 ev_supported_backends () & EVBACKEND_EPOLL)); 215 ev_supported_backends () & EVBACKEND_EPOLL));
214 216
215=item unsigned int ev_recommended_backends () 217=item unsigned int ev_recommended_backends ()
216 218
217Return the set of all backends compiled into this binary of libev and also 219Return the set of all backends compiled into this binary of libev and
218recommended for this platform. This set is often smaller than the one 220also recommended for this platform, meaning it will work for most file
221descriptor types. This set is often smaller than the one returned by
219returned by C<ev_supported_backends>, as for example kqueue is broken on 222C<ev_supported_backends>, as for example kqueue is broken on most BSDs
220most BSDs and will not be auto-detected unless you explicitly request it 223and will not be auto-detected unless you explicitly request it (assuming
221(assuming you know what you are doing). This is the set of backends that 224you know what you are doing). This is the set of backends that libev will
222libev will probe for if you specify no backends explicitly. 225probe for if you specify no backends explicitly.
223 226
224=item unsigned int ev_embeddable_backends () 227=item unsigned int ev_embeddable_backends ()
225 228
226Returns the set of backends that are embeddable in other event loops. This 229Returns the set of backends that are embeddable in other event loops. This
227is the theoretical, all-platform, value. To find which backends 230is the theoretical, all-platform, value. To find which backends
291 294
292=back 295=back
293 296
294=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 297=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
295 298
296An event loop is described by a C<struct ev_loop *> (the C<struct> 299An event loop is described by a C<struct ev_loop *> (the C<struct> is
297is I<not> optional in this case, as there is also an C<ev_loop> 300I<not> optional in this case unless libev 3 compatibility is disabled, as
298I<function>). 301libev 3 had an C<ev_loop> function colliding with the struct name).
299 302
300The library knows two types of such loops, the I<default> loop, which 303The library knows two types of such loops, the I<default> loop, which
301supports signals and child events, and dynamically created loops which do 304supports signals and child events, and dynamically created event loops
302not. 305which do not.
303 306
304=over 4 307=over 4
305 308
306=item struct ev_loop *ev_default_loop (unsigned int flags) 309=item struct ev_loop *ev_default_loop (unsigned int flags)
307 310
345useful to try out specific backends to test their performance, or to work 348useful to try out specific backends to test their performance, or to work
346around bugs. 349around bugs.
347 350
348=item C<EVFLAG_FORKCHECK> 351=item C<EVFLAG_FORKCHECK>
349 352
350Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after 353Instead of calling C<ev_loop_fork> manually after a fork, you can also
351a fork, you can also make libev check for a fork in each iteration by 354make libev check for a fork in each iteration by enabling this flag.
352enabling this flag.
353 355
354This works by calling C<getpid ()> on every iteration of the loop, 356This works by calling C<getpid ()> on every iteration of the loop,
355and thus this might slow down your event loop if you do a lot of loop 357and thus this might slow down your event loop if you do a lot of loop
356iterations and little real work, but is usually not noticeable (on my 358iterations and little real work, but is usually not noticeable (on my
357GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 359GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
374 376
375=item C<EVFLAG_SIGNALFD> 377=item C<EVFLAG_SIGNALFD>
376 378
377When this flag is specified, then libev will attempt to use the 379When 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 380I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API
379delivers signals synchronously, which makes is both faster and might make 381delivers signals synchronously, which makes it both faster and might make
380it possible to get the queued signal data. 382it possible to get the queued signal data. It can also simplify signal
383handling with threads, as long as you properly block signals in your
384threads that are not interested in handling them.
381 385
382Signalfd will not be used by default as this changes your signal mask, and 386Signalfd will not be used by default as this changes your signal mask, and
383there are a lot of shoddy libraries and programs (glib's threadpool for 387there are a lot of shoddy libraries and programs (glib's threadpool for
384example) that can't properly initialise their signal masks. 388example) that can't properly initialise their signal masks.
385 389
437of course I<doesn't>, and epoll just loves to report events for totally 441of course I<doesn't>, and epoll just loves to report events for totally
438I<different> file descriptors (even already closed ones, so one cannot 442I<different> file descriptors (even already closed ones, so one cannot
439even remove them from the set) than registered in the set (especially 443even remove them from the set) than registered in the set (especially
440on SMP systems). Libev tries to counter these spurious notifications by 444on SMP systems). Libev tries to counter these spurious notifications by
441employing an additional generation counter and comparing that against the 445employing an additional generation counter and comparing that against the
442events to filter out spurious ones, recreating the set when required. 446events to filter out spurious ones, recreating the set when required. Last
447not least, it also refuses to work with some file descriptors which work
448perfectly fine with C<select> (files, many character devices...).
443 449
444While stopping, setting and starting an I/O watcher in the same iteration 450While stopping, setting and starting an I/O watcher in the same iteration
445will result in some caching, there is still a system call per such 451will result in some caching, there is still a system call per such
446incident (because the same I<file descriptor> could point to a different 452incident (because the same I<file descriptor> could point to a different
447I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 453I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
565 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); 571 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
566 572
567=item struct ev_loop *ev_loop_new (unsigned int flags) 573=item struct ev_loop *ev_loop_new (unsigned int flags)
568 574
569Similar to C<ev_default_loop>, but always creates a new event loop that is 575Similar to C<ev_default_loop>, but always creates a new event loop that is
570always distinct from the default loop. Unlike the default loop, it cannot 576always distinct from the default loop.
571handle signal and child watchers, and attempts to do so will be greeted by
572undefined behaviour (or a failed assertion if assertions are enabled).
573 577
574Note that this function I<is> thread-safe, and the recommended way to use 578Note that this function I<is> thread-safe, and one common way to use
575libev with threads is indeed to create one loop per thread, and using the 579libev with threads is indeed to create one loop per thread, and using the
576default loop in the "main" or "initial" thread. 580default loop in the "main" or "initial" thread.
577 581
578Example: Try to create a event loop that uses epoll and nothing else. 582Example: Try to create a event loop that uses epoll and nothing else.
579 583
581 if (!epoller) 585 if (!epoller)
582 fatal ("no epoll found here, maybe it hides under your chair"); 586 fatal ("no epoll found here, maybe it hides under your chair");
583 587
584=item ev_default_destroy () 588=item ev_default_destroy ()
585 589
586Destroys the default loop again (frees all memory and kernel state 590Destroys the default loop (frees all memory and kernel state etc.). None
587etc.). None of the active event watchers will be stopped in the normal 591of the active event watchers will be stopped in the normal sense, so
588sense, so e.g. C<ev_is_active> might still return true. It is your 592e.g. C<ev_is_active> might still return true. It is your responsibility to
589responsibility to either stop all watchers cleanly yourself I<before> 593either stop all watchers cleanly yourself I<before> calling this function,
590calling this function, or cope with the fact afterwards (which is usually 594or cope with the fact afterwards (which is usually the easiest thing, you
591the easiest thing, you can just ignore the watchers and/or C<free ()> them 595can just ignore the watchers and/or C<free ()> them for example).
592for example).
593 596
594Note that certain global state, such as signal state (and installed signal 597Note that certain global state, such as signal state (and installed signal
595handlers), will not be freed by this function, and related watchers (such 598handlers), will not be freed by this function, and related watchers (such
596as signal and child watchers) would need to be stopped manually. 599as signal and child watchers) would need to be stopped manually.
597 600
605Like C<ev_default_destroy>, but destroys an event loop created by an 608Like C<ev_default_destroy>, but destroys an event loop created by an
606earlier call to C<ev_loop_new>. 609earlier call to C<ev_loop_new>.
607 610
608=item ev_default_fork () 611=item ev_default_fork ()
609 612
610This function sets a flag that causes subsequent C<ev_loop> iterations 613This function sets a flag that causes subsequent C<ev_run> iterations
611to reinitialise the kernel state for backends that have one. Despite the 614to reinitialise the kernel state for backends that have one. Despite the
612name, you can call it anytime, but it makes most sense after forking, in 615name, you can call it anytime, but it makes most sense after forking, in
613the child process (or both child and parent, but that again makes little 616the child process (or both child and parent, but that again makes little
614sense). You I<must> call it in the child before using any of the libev 617sense). You I<must> call it in the child before using any of the libev
615functions, and it will only take effect at the next C<ev_loop> iteration. 618functions, and it will only take effect at the next C<ev_run> iteration.
619
620Again, you I<have> to call it on I<any> loop that you want to re-use after
621a fork, I<even if you do not plan to use the loop in the parent>. This is
622because some kernel interfaces *cough* I<kqueue> *cough* do funny things
623during fork.
616 624
617On the other hand, you only need to call this function in the child 625On the other hand, you only need to call this function in the child
618process if and only if you want to use the event library in the child. If 626process if and only if you want to use the event loop in the child. If
619you just fork+exec, you don't have to call it at all. 627you just fork+exec or create a new loop in the child, you don't have to
628call it at all (in fact, C<epoll> is so badly broken that it makes a
629difference, but libev will usually detect this case on its own and do a
630costly reset of the backend).
620 631
621The function itself is quite fast and it's usually not a problem to call 632The function itself is quite fast and it's usually not a problem to call
622it just in case after a fork. To make this easy, the function will fit in 633it just in case after a fork. To make this easy, the function will fit in
623quite nicely into a call to C<pthread_atfork>: 634quite nicely into a call to C<pthread_atfork>:
624 635
626 637
627=item ev_loop_fork (loop) 638=item ev_loop_fork (loop)
628 639
629Like C<ev_default_fork>, but acts on an event loop created by 640Like C<ev_default_fork>, but acts on an event loop created by
630C<ev_loop_new>. Yes, you have to call this on every allocated event loop 641C<ev_loop_new>. Yes, you have to call this on every allocated event loop
631after fork that you want to re-use in the child, and how you do this is 642after fork that you want to re-use in the child, and how you keep track of
632entirely your own problem. 643them is entirely your own problem.
633 644
634=item int ev_is_default_loop (loop) 645=item int ev_is_default_loop (loop)
635 646
636Returns true when the given loop is, in fact, the default loop, and false 647Returns true when the given loop is, in fact, the default loop, and false
637otherwise. 648otherwise.
638 649
639=item unsigned int ev_loop_count (loop) 650=item unsigned int ev_iteration (loop)
640 651
641Returns the count of loop iterations for the loop, which is identical to 652Returns the current iteration count for the event loop, which is identical
642the number of times libev did poll for new events. It starts at C<0> and 653to the number of times libev did poll for new events. It starts at C<0>
643happily wraps around with enough iterations. 654and happily wraps around with enough iterations.
644 655
645This value can sometimes be useful as a generation counter of sorts (it 656This value can sometimes be useful as a generation counter of sorts (it
646"ticks" the number of loop iterations), as it roughly corresponds with 657"ticks" the number of loop iterations), as it roughly corresponds with
647C<ev_prepare> and C<ev_check> calls. 658C<ev_prepare> and C<ev_check> calls - and is incremented between the
659prepare and check phases.
648 660
649=item unsigned int ev_loop_depth (loop) 661=item unsigned int ev_depth (loop)
650 662
651Returns the number of times C<ev_loop> was entered minus the number of 663Returns the number of times C<ev_run> was entered minus the number of
652times C<ev_loop> was exited, in other words, the recursion depth. 664times C<ev_run> was exited, in other words, the recursion depth.
653 665
654Outside C<ev_loop>, this number is zero. In a callback, this number is 666Outside C<ev_run>, this number is zero. In a callback, this number is
655C<1>, unless C<ev_loop> was invoked recursively (or from another thread), 667C<1>, unless C<ev_run> was invoked recursively (or from another thread),
656in which case it is higher. 668in which case it is higher.
657 669
658Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread 670Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread
659etc.), doesn't count as exit. 671etc.), doesn't count as "exit" - consider this as a hint to avoid such
672ungentleman-like behaviour unless it's really convenient.
660 673
661=item unsigned int ev_backend (loop) 674=item unsigned int ev_backend (loop)
662 675
663Returns one of the C<EVBACKEND_*> flags indicating the event backend in 676Returns one of the C<EVBACKEND_*> flags indicating the event backend in
664use. 677use.
673 686
674=item ev_now_update (loop) 687=item ev_now_update (loop)
675 688
676Establishes the current time by querying the kernel, updating the time 689Establishes the current time by querying the kernel, updating the time
677returned by C<ev_now ()> in the progress. This is a costly operation and 690returned by C<ev_now ()> in the progress. This is a costly operation and
678is usually done automatically within C<ev_loop ()>. 691is usually done automatically within C<ev_run ()>.
679 692
680This function is rarely useful, but when some event callback runs for a 693This function is rarely useful, but when some event callback runs for a
681very long time without entering the event loop, updating libev's idea of 694very long time without entering the event loop, updating libev's idea of
682the current time is a good idea. 695the current time is a good idea.
683 696
685 698
686=item ev_suspend (loop) 699=item ev_suspend (loop)
687 700
688=item ev_resume (loop) 701=item ev_resume (loop)
689 702
690These two functions suspend and resume a loop, for use when the loop is 703These two functions suspend and resume an event loop, for use when the
691not used for a while and timeouts should not be processed. 704loop is not used for a while and timeouts should not be processed.
692 705
693A typical use case would be an interactive program such as a game: When 706A typical use case would be an interactive program such as a game: When
694the user presses C<^Z> to suspend the game and resumes it an hour later it 707the user presses C<^Z> to suspend the game and resumes it an hour later it
695would be best to handle timeouts as if no time had actually passed while 708would be best to handle timeouts as if no time had actually passed while
696the program was suspended. This can be achieved by calling C<ev_suspend> 709the program was suspended. This can be achieved by calling C<ev_suspend>
698C<ev_resume> directly afterwards to resume timer processing. 711C<ev_resume> directly afterwards to resume timer processing.
699 712
700Effectively, all C<ev_timer> watchers will be delayed by the time spend 713Effectively, all C<ev_timer> watchers will be delayed by the time spend
701between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers 714between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
702will be rescheduled (that is, they will lose any events that would have 715will be rescheduled (that is, they will lose any events that would have
703occured while suspended). 716occurred while suspended).
704 717
705After calling C<ev_suspend> you B<must not> call I<any> function on the 718After calling C<ev_suspend> you B<must not> call I<any> function on the
706given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> 719given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
707without a previous call to C<ev_suspend>. 720without a previous call to C<ev_suspend>.
708 721
709Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 722Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
710event loop time (see C<ev_now_update>). 723event loop time (see C<ev_now_update>).
711 724
712=item ev_loop (loop, int flags) 725=item ev_run (loop, int flags)
713 726
714Finally, this is it, the event handler. This function usually is called 727Finally, this is it, the event handler. This function usually is called
715after you have initialised all your watchers and you want to start 728after you have initialised all your watchers and you want to start
716handling events. 729handling events. It will ask the operating system for any new events, call
730the watcher callbacks, an then repeat the whole process indefinitely: This
731is why event loops are called I<loops>.
717 732
718If the flags argument is specified as C<0>, it will not return until 733If the flags argument is specified as C<0>, it will keep handling events
719either no event watchers are active anymore or C<ev_unloop> was called. 734until either no event watchers are active anymore or C<ev_break> was
735called.
720 736
721Please note that an explicit C<ev_unloop> is usually better than 737Please note that an explicit C<ev_break> is usually better than
722relying on all watchers to be stopped when deciding when a program has 738relying on all watchers to be stopped when deciding when a program has
723finished (especially in interactive programs), but having a program 739finished (especially in interactive programs), but having a program
724that automatically loops as long as it has to and no longer by virtue 740that automatically loops as long as it has to and no longer by virtue
725of relying on its watchers stopping correctly, that is truly a thing of 741of relying on its watchers stopping correctly, that is truly a thing of
726beauty. 742beauty.
727 743
728A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 744A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
729those events and any already outstanding ones, but will not block your 745those events and any already outstanding ones, but will not wait and
730process in case there are no events and will return after one iteration of 746block your process in case there are no events and will return after one
731the loop. 747iteration of the loop. This is sometimes useful to poll and handle new
748events while doing lengthy calculations, to keep the program responsive.
732 749
733A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 750A flags value of C<EVRUN_ONCE> will look for new events (waiting if
734necessary) and will handle those and any already outstanding ones. It 751necessary) and will handle those and any already outstanding ones. It
735will block your process until at least one new event arrives (which could 752will block your process until at least one new event arrives (which could
736be an event internal to libev itself, so there is no guarantee that a 753be an event internal to libev itself, so there is no guarantee that a
737user-registered callback will be called), and will return after one 754user-registered callback will be called), and will return after one
738iteration of the loop. 755iteration of the loop.
739 756
740This is useful if you are waiting for some external event in conjunction 757This is useful if you are waiting for some external event in conjunction
741with something not expressible using other libev watchers (i.e. "roll your 758with something not expressible using other libev watchers (i.e. "roll your
742own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 759own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
743usually a better approach for this kind of thing. 760usually a better approach for this kind of thing.
744 761
745Here are the gory details of what C<ev_loop> does: 762Here are the gory details of what C<ev_run> does:
746 763
764 - Increment loop depth.
765 - Reset the ev_break status.
747 - Before the first iteration, call any pending watchers. 766 - Before the first iteration, call any pending watchers.
767 LOOP:
748 * If EVFLAG_FORKCHECK was used, check for a fork. 768 - If EVFLAG_FORKCHECK was used, check for a fork.
749 - If a fork was detected (by any means), queue and call all fork watchers. 769 - If a fork was detected (by any means), queue and call all fork watchers.
750 - Queue and call all prepare watchers. 770 - Queue and call all prepare watchers.
771 - If ev_break was called, goto FINISH.
751 - If we have been forked, detach and recreate the kernel state 772 - If we have been forked, detach and recreate the kernel state
752 as to not disturb the other process. 773 as to not disturb the other process.
753 - Update the kernel state with all outstanding changes. 774 - Update the kernel state with all outstanding changes.
754 - Update the "event loop time" (ev_now ()). 775 - Update the "event loop time" (ev_now ()).
755 - Calculate for how long to sleep or block, if at all 776 - Calculate for how long to sleep or block, if at all
756 (active idle watchers, EVLOOP_NONBLOCK or not having 777 (active idle watchers, EVRUN_NOWAIT or not having
757 any active watchers at all will result in not sleeping). 778 any active watchers at all will result in not sleeping).
758 - Sleep if the I/O and timer collect interval say so. 779 - Sleep if the I/O and timer collect interval say so.
780 - Increment loop iteration counter.
759 - Block the process, waiting for any events. 781 - Block the process, waiting for any events.
760 - Queue all outstanding I/O (fd) events. 782 - Queue all outstanding I/O (fd) events.
761 - Update the "event loop time" (ev_now ()), and do time jump adjustments. 783 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
762 - Queue all expired timers. 784 - Queue all expired timers.
763 - Queue all expired periodics. 785 - Queue all expired periodics.
764 - Unless any events are pending now, queue all idle watchers. 786 - Queue all idle watchers with priority higher than that of pending events.
765 - Queue all check watchers. 787 - Queue all check watchers.
766 - Call all queued watchers in reverse order (i.e. check watchers first). 788 - Call all queued watchers in reverse order (i.e. check watchers first).
767 Signals and child watchers are implemented as I/O watchers, and will 789 Signals and child watchers are implemented as I/O watchers, and will
768 be handled here by queueing them when their watcher gets executed. 790 be handled here by queueing them when their watcher gets executed.
769 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 791 - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
770 were used, or there are no active watchers, return, otherwise 792 were used, or there are no active watchers, goto FINISH, otherwise
771 continue with step *. 793 continue with step LOOP.
794 FINISH:
795 - Reset the ev_break status iff it was EVBREAK_ONE.
796 - Decrement the loop depth.
797 - Return.
772 798
773Example: Queue some jobs and then loop until no events are outstanding 799Example: Queue some jobs and then loop until no events are outstanding
774anymore. 800anymore.
775 801
776 ... queue jobs here, make sure they register event watchers as long 802 ... queue jobs here, make sure they register event watchers as long
777 ... as they still have work to do (even an idle watcher will do..) 803 ... as they still have work to do (even an idle watcher will do..)
778 ev_loop (my_loop, 0); 804 ev_run (my_loop, 0);
779 ... jobs done or somebody called unloop. yeah! 805 ... jobs done or somebody called unloop. yeah!
780 806
781=item ev_unloop (loop, how) 807=item ev_break (loop, how)
782 808
783Can be used to make a call to C<ev_loop> return early (but only after it 809Can be used to make a call to C<ev_run> return early (but only after it
784has processed all outstanding events). The C<how> argument must be either 810has processed all outstanding events). The C<how> argument must be either
785C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 811C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
786C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 812C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
787 813
788This "unloop state" will be cleared when entering C<ev_loop> again. 814This "unloop state" will be cleared when entering C<ev_run> again.
789 815
790It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. 816It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO##
791 817
792=item ev_ref (loop) 818=item ev_ref (loop)
793 819
794=item ev_unref (loop) 820=item ev_unref (loop)
795 821
796Ref/unref can be used to add or remove a reference count on the event 822Ref/unref can be used to add or remove a reference count on the event
797loop: Every watcher keeps one reference, and as long as the reference 823loop: Every watcher keeps one reference, and as long as the reference
798count is nonzero, C<ev_loop> will not return on its own. 824count is nonzero, C<ev_run> will not return on its own.
799 825
800This is useful when you have a watcher that you never intend to 826This is useful when you have a watcher that you never intend to
801unregister, but that nevertheless should not keep C<ev_loop> from 827unregister, but that nevertheless should not keep C<ev_run> from
802returning. In such a case, call C<ev_unref> after starting, and C<ev_ref> 828returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
803before stopping it. 829before stopping it.
804 830
805As an example, libev itself uses this for its internal signal pipe: It 831As an example, libev itself uses this for its internal signal pipe: It
806is not visible to the libev user and should not keep C<ev_loop> from 832is not visible to the libev user and should not keep C<ev_run> from
807exiting if no event watchers registered by it are active. It is also an 833exiting if no event watchers registered by it are active. It is also an
808excellent way to do this for generic recurring timers or from within 834excellent way to do this for generic recurring timers or from within
809third-party libraries. Just remember to I<unref after start> and I<ref 835third-party libraries. Just remember to I<unref after start> and I<ref
810before stop> (but only if the watcher wasn't active before, or was active 836before stop> (but only if the watcher wasn't active before, or was active
811before, respectively. Note also that libev might stop watchers itself 837before, respectively. Note also that libev might stop watchers itself
812(e.g. non-repeating timers) in which case you have to C<ev_ref> 838(e.g. non-repeating timers) in which case you have to C<ev_ref>
813in the callback). 839in the callback).
814 840
815Example: Create a signal watcher, but keep it from keeping C<ev_loop> 841Example: Create a signal watcher, but keep it from keeping C<ev_run>
816running when nothing else is active. 842running when nothing else is active.
817 843
818 ev_signal exitsig; 844 ev_signal exitsig;
819 ev_signal_init (&exitsig, sig_cb, SIGINT); 845 ev_signal_init (&exitsig, sig_cb, SIGINT);
820 ev_signal_start (loop, &exitsig); 846 ev_signal_start (loop, &exitsig);
865usually doesn't make much sense to set it to a lower value than C<0.01>, 891usually doesn't make much sense to set it to a lower value than C<0.01>,
866as this approaches the timing granularity of most systems. Note that if 892as this approaches the timing granularity of most systems. Note that if
867you do transactions with the outside world and you can't increase the 893you do transactions with the outside world and you can't increase the
868parallelity, then this setting will limit your transaction rate (if you 894parallelity, then this setting will limit your transaction rate (if you
869need to poll once per transaction and the I/O collect interval is 0.01, 895need to poll once per transaction and the I/O collect interval is 0.01,
870then you can't do more than 100 transations per second). 896then you can't do more than 100 transactions per second).
871 897
872Setting the I<timeout collect interval> can improve the opportunity for 898Setting the I<timeout collect interval> can improve the opportunity for
873saving power, as the program will "bundle" timer callback invocations that 899saving power, as the program will "bundle" timer callback invocations that
874are "near" in time together, by delaying some, thus reducing the number of 900are "near" in time together, by delaying some, thus reducing the number of
875times the process sleeps and wakes up again. Another useful technique to 901times the process sleeps and wakes up again. Another useful technique to
883 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); 909 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
884 910
885=item ev_invoke_pending (loop) 911=item ev_invoke_pending (loop)
886 912
887This call will simply invoke all pending watchers while resetting their 913This call will simply invoke all pending watchers while resetting their
888pending state. Normally, C<ev_loop> does this automatically when required, 914pending state. Normally, C<ev_run> does this automatically when required,
889but when overriding the invoke callback this call comes handy. 915but when overriding the invoke callback this call comes handy. This
916function can be invoked from a watcher - this can be useful for example
917when you want to do some lengthy calculation and want to pass further
918event handling to another thread (you still have to make sure only one
919thread executes within C<ev_invoke_pending> or C<ev_run> of course).
890 920
891=item int ev_pending_count (loop) 921=item int ev_pending_count (loop)
892 922
893Returns the number of pending watchers - zero indicates that no watchers 923Returns the number of pending watchers - zero indicates that no watchers
894are pending. 924are pending.
895 925
896=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P)) 926=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
897 927
898This overrides the invoke pending functionality of the loop: Instead of 928This overrides the invoke pending functionality of the loop: Instead of
899invoking all pending watchers when there are any, C<ev_loop> will call 929invoking all pending watchers when there are any, C<ev_run> will call
900this callback instead. This is useful, for example, when you want to 930this callback instead. This is useful, for example, when you want to
901invoke the actual watchers inside another context (another thread etc.). 931invoke the actual watchers inside another context (another thread etc.).
902 932
903If you want to reset the callback, use C<ev_invoke_pending> as new 933If you want to reset the callback, use C<ev_invoke_pending> as new
904callback. 934callback.
907 937
908Sometimes you want to share the same loop between multiple threads. This 938Sometimes you want to share the same loop between multiple threads. This
909can be done relatively simply by putting mutex_lock/unlock calls around 939can be done relatively simply by putting mutex_lock/unlock calls around
910each call to a libev function. 940each call to a libev function.
911 941
912However, C<ev_loop> can run an indefinite time, so it is not feasible to 942However, C<ev_run> can run an indefinite time, so it is not feasible
913wait for it to return. One way around this is to wake up the loop via 943to wait for it to return. One way around this is to wake up the event
914C<ev_unloop> and C<av_async_send>, another way is to set these I<release> 944loop via C<ev_break> and C<av_async_send>, another way is to set these
915and I<acquire> callbacks on the loop. 945I<release> and I<acquire> callbacks on the loop.
916 946
917When set, then C<release> will be called just before the thread is 947When set, then C<release> will be called just before the thread is
918suspended waiting for new events, and C<acquire> is called just 948suspended waiting for new events, and C<acquire> is called just
919afterwards. 949afterwards.
920 950
923 953
924While event loop modifications are allowed between invocations of 954While event loop modifications are allowed between invocations of
925C<release> and C<acquire> (that's their only purpose after all), no 955C<release> and C<acquire> (that's their only purpose after all), no
926modifications done will affect the event loop, i.e. adding watchers will 956modifications done will affect the event loop, i.e. adding watchers will
927have no effect on the set of file descriptors being watched, or the time 957have no effect on the set of file descriptors being watched, or the time
928waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it 958waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
929to take note of any changes you made. 959to take note of any changes you made.
930 960
931In theory, threads executing C<ev_loop> will be async-cancel safe between 961In theory, threads executing C<ev_run> will be async-cancel safe between
932invocations of C<release> and C<acquire>. 962invocations of C<release> and C<acquire>.
933 963
934See also the locking example in the C<THREADS> section later in this 964See also the locking example in the C<THREADS> section later in this
935document. 965document.
936 966
945These two functions can be used to associate arbitrary data with a loop, 975These two functions can be used to associate arbitrary data with a loop,
946and are intended solely for the C<invoke_pending_cb>, C<release> and 976and are intended solely for the C<invoke_pending_cb>, C<release> and
947C<acquire> callbacks described above, but of course can be (ab-)used for 977C<acquire> callbacks described above, but of course can be (ab-)used for
948any other purpose as well. 978any other purpose as well.
949 979
950=item ev_loop_verify (loop) 980=item ev_verify (loop)
951 981
952This function only does something when C<EV_VERIFY> support has been 982This function only does something when C<EV_VERIFY> support has been
953compiled in, which is the default for non-minimal builds. It tries to go 983compiled in, which is the default for non-minimal builds. It tries to go
954through all internal structures and checks them for validity. If anything 984through all internal structures and checks them for validity. If anything
955is found to be inconsistent, it will print an error message to standard 985is found to be inconsistent, it will print an error message to standard
966 996
967In the following description, uppercase C<TYPE> in names stands for the 997In the following description, uppercase C<TYPE> in names stands for the
968watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer 998watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
969watchers and C<ev_io_start> for I/O watchers. 999watchers and C<ev_io_start> for I/O watchers.
970 1000
971A watcher is a structure that you create and register to record your 1001A watcher is an opaque structure that you allocate and register to record
972interest in some event. For instance, if you want to wait for STDIN to 1002your interest in some event. To make a concrete example, imagine you want
973become readable, you would create an C<ev_io> watcher for that: 1003to wait for STDIN to become readable, you would create an C<ev_io> watcher
1004for that:
974 1005
975 static void my_cb (struct ev_loop *loop, ev_io *w, int revents) 1006 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
976 { 1007 {
977 ev_io_stop (w); 1008 ev_io_stop (w);
978 ev_unloop (loop, EVUNLOOP_ALL); 1009 ev_break (loop, EVBREAK_ALL);
979 } 1010 }
980 1011
981 struct ev_loop *loop = ev_default_loop (0); 1012 struct ev_loop *loop = ev_default_loop (0);
982 1013
983 ev_io stdin_watcher; 1014 ev_io stdin_watcher;
984 1015
985 ev_init (&stdin_watcher, my_cb); 1016 ev_init (&stdin_watcher, my_cb);
986 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 1017 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
987 ev_io_start (loop, &stdin_watcher); 1018 ev_io_start (loop, &stdin_watcher);
988 1019
989 ev_loop (loop, 0); 1020 ev_run (loop, 0);
990 1021
991As you can see, you are responsible for allocating the memory for your 1022As you can see, you are responsible for allocating the memory for your
992watcher structures (and it is I<usually> a bad idea to do this on the 1023watcher structures (and it is I<usually> a bad idea to do this on the
993stack). 1024stack).
994 1025
995Each watcher has an associated watcher structure (called C<struct ev_TYPE> 1026Each watcher has an associated watcher structure (called C<struct ev_TYPE>
996or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). 1027or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
997 1028
998Each watcher structure must be initialised by a call to C<ev_init 1029Each watcher structure must be initialised by a call to C<ev_init (watcher
999(watcher *, callback)>, which expects a callback to be provided. This 1030*, callback)>, which expects a callback to be provided. This callback is
1000callback gets invoked each time the event occurs (or, in the case of I/O 1031invoked each time the event occurs (or, in the case of I/O watchers, each
1001watchers, each time the event loop detects that the file descriptor given 1032time the event loop detects that the file descriptor given is readable
1002is readable and/or writable). 1033and/or writable).
1003 1034
1004Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> 1035Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
1005macro to configure it, with arguments specific to the watcher type. There 1036macro to configure it, with arguments specific to the watcher type. There
1006is also a macro to combine initialisation and setting in one call: C<< 1037is also a macro to combine initialisation and setting in one call: C<<
1007ev_TYPE_init (watcher *, callback, ...) >>. 1038ev_TYPE_init (watcher *, callback, ...) >>.
1030=item C<EV_WRITE> 1061=item C<EV_WRITE>
1031 1062
1032The file descriptor in the C<ev_io> watcher has become readable and/or 1063The file descriptor in the C<ev_io> watcher has become readable and/or
1033writable. 1064writable.
1034 1065
1035=item C<EV_TIMEOUT> 1066=item C<EV_TIMER>
1036 1067
1037The C<ev_timer> watcher has timed out. 1068The C<ev_timer> watcher has timed out.
1038 1069
1039=item C<EV_PERIODIC> 1070=item C<EV_PERIODIC>
1040 1071
1058 1089
1059=item C<EV_PREPARE> 1090=item C<EV_PREPARE>
1060 1091
1061=item C<EV_CHECK> 1092=item C<EV_CHECK>
1062 1093
1063All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts 1094All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
1064to gather new events, and all C<ev_check> watchers are invoked just after 1095to gather new events, and all C<ev_check> watchers are invoked just after
1065C<ev_loop> has gathered them, but before it invokes any callbacks for any 1096C<ev_run> has gathered them, but before it invokes any callbacks for any
1066received events. Callbacks of both watcher types can start and stop as 1097received events. Callbacks of both watcher types can start and stop as
1067many watchers as they want, and all of them will be taken into account 1098many watchers as they want, and all of them will be taken into account
1068(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1099(for example, a C<ev_prepare> watcher might start an idle watcher to keep
1069C<ev_loop> from blocking). 1100C<ev_run> from blocking).
1070 1101
1071=item C<EV_EMBED> 1102=item C<EV_EMBED>
1072 1103
1073The embedded event loop specified in the C<ev_embed> watcher needs attention. 1104The embedded event loop specified in the C<ev_embed> watcher needs attention.
1074 1105
1102example it might indicate that a fd is readable or writable, and if your 1133example it might indicate that a fd is readable or writable, and if your
1103callbacks is well-written it can just attempt the operation and cope with 1134callbacks is well-written it can just attempt the operation and cope with
1104the error from read() or write(). This will not work in multi-threaded 1135the error from read() or write(). This will not work in multi-threaded
1105programs, though, as the fd could already be closed and reused for another 1136programs, though, as the fd could already be closed and reused for another
1106thing, so beware. 1137thing, so beware.
1138
1139=back
1140
1141=head2 WATCHER STATES
1142
1143There are various watcher states mentioned throughout this manual -
1144active, pending and so on. In this section these states and the rules to
1145transition between them will be described in more detail - and while these
1146rules might look complicated, they usually do "the right thing".
1147
1148=over 4
1149
1150=item initialiased
1151
1152Before a watcher can be registered with the event looop it has to be
1153initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1154C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1155
1156In this state it is simply some block of memory that is suitable for use
1157in an event loop. It can be moved around, freed, reused etc. at will.
1158
1159=item started/running/active
1160
1161Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1162property of the event loop, and is actively waiting for events. While in
1163this state it cannot be accessed (except in a few documented ways), moved,
1164freed or anything else - the only legal thing is to keep a pointer to it,
1165and call libev functions on it that are documented to work on active watchers.
1166
1167=item pending
1168
1169If a watcher is active and libev determines that an event it is interested
1170in has occurred (such as a timer expiring), it will become pending. It will
1171stay in this pending state until either it is stopped or its callback is
1172about to be invoked, so it is not normally pending inside the watcher
1173callback.
1174
1175The watcher might or might not be active while it is pending (for example,
1176an expired non-repeating timer can be pending but no longer active). If it
1177is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1178but it is still property of the event loop at this time, so cannot be
1179moved, freed or reused. And if it is active the rules described in the
1180previous item still apply.
1181
1182It is also possible to feed an event on a watcher that is not active (e.g.
1183via C<ev_feed_event>), in which case it becomes pending without being
1184active.
1185
1186=item stopped
1187
1188A watcher can be stopped implicitly by libev (in which case it might still
1189be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1190latter will clear any pending state the watcher might be in, regardless
1191of whether it was active or not, so stopping a watcher explicitly before
1192freeing it is often a good idea.
1193
1194While stopped (and not pending) the watcher is essentially in the
1195initialised state, that is it can be reused, moved, modified in any way
1196you wish.
1107 1197
1108=back 1198=back
1109 1199
1110=head2 GENERIC WATCHER FUNCTIONS 1200=head2 GENERIC WATCHER FUNCTIONS
1111 1201
1373 1463
1374For example, to emulate how many other event libraries handle priorities, 1464For example, to emulate how many other event libraries handle priorities,
1375you can associate an C<ev_idle> watcher to each such watcher, and in 1465you can associate an C<ev_idle> watcher to each such watcher, and in
1376the normal watcher callback, you just start the idle watcher. The real 1466the normal watcher callback, you just start the idle watcher. The real
1377processing is done in the idle watcher callback. This causes libev to 1467processing is done in the idle watcher callback. This causes libev to
1378continously poll and process kernel event data for the watcher, but when 1468continuously poll and process kernel event data for the watcher, but when
1379the lock-out case is known to be rare (which in turn is rare :), this is 1469the lock-out case is known to be rare (which in turn is rare :), this is
1380workable. 1470workable.
1381 1471
1382Usually, however, the lock-out model implemented that way will perform 1472Usually, however, the lock-out model implemented that way will perform
1383miserably under the type of load it was designed to handle. In that case, 1473miserably under the type of load it was designed to handle. In that case,
1397 { 1487 {
1398 // stop the I/O watcher, we received the event, but 1488 // stop the I/O watcher, we received the event, but
1399 // are not yet ready to handle it. 1489 // are not yet ready to handle it.
1400 ev_io_stop (EV_A_ w); 1490 ev_io_stop (EV_A_ w);
1401 1491
1402 // start the idle watcher to ahndle the actual event. 1492 // start the idle watcher to handle the actual event.
1403 // it will not be executed as long as other watchers 1493 // it will not be executed as long as other watchers
1404 // with the default priority are receiving events. 1494 // with the default priority are receiving events.
1405 ev_idle_start (EV_A_ &idle); 1495 ev_idle_start (EV_A_ &idle);
1406 } 1496 }
1407 1497
1461 1551
1462If you cannot use non-blocking mode, then force the use of a 1552If you cannot use non-blocking mode, then force the use of a
1463known-to-be-good backend (at the time of this writing, this includes only 1553known-to-be-good backend (at the time of this writing, this includes only
1464C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file 1554C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1465descriptors for which non-blocking operation makes no sense (such as 1555descriptors for which non-blocking operation makes no sense (such as
1466files) - libev doesn't guarentee any specific behaviour in that case. 1556files) - libev doesn't guarantee any specific behaviour in that case.
1467 1557
1468Another thing you have to watch out for is that it is quite easy to 1558Another thing you have to watch out for is that it is quite easy to
1469receive "spurious" readiness notifications, that is your callback might 1559receive "spurious" readiness notifications, that is your callback might
1470be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1560be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1471because there is no data. Not only are some backends known to create a 1561because there is no data. Not only are some backends known to create a
1536 1626
1537So when you encounter spurious, unexplained daemon exits, make sure you 1627So when you encounter spurious, unexplained daemon exits, make sure you
1538ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1628ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1539somewhere, as that would have given you a big clue). 1629somewhere, as that would have given you a big clue).
1540 1630
1631=head3 The special problem of accept()ing when you can't
1632
1633Many implementations of the POSIX C<accept> function (for example,
1634found in post-2004 Linux) have the peculiar behaviour of not removing a
1635connection from the pending queue in all error cases.
1636
1637For example, larger servers often run out of file descriptors (because
1638of resource limits), causing C<accept> to fail with C<ENFILE> but not
1639rejecting the connection, leading to libev signalling readiness on
1640the next iteration again (the connection still exists after all), and
1641typically causing the program to loop at 100% CPU usage.
1642
1643Unfortunately, the set of errors that cause this issue differs between
1644operating systems, there is usually little the app can do to remedy the
1645situation, and no known thread-safe method of removing the connection to
1646cope with overload is known (to me).
1647
1648One of the easiest ways to handle this situation is to just ignore it
1649- when the program encounters an overload, it will just loop until the
1650situation is over. While this is a form of busy waiting, no OS offers an
1651event-based way to handle this situation, so it's the best one can do.
1652
1653A better way to handle the situation is to log any errors other than
1654C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
1655messages, and continue as usual, which at least gives the user an idea of
1656what could be wrong ("raise the ulimit!"). For extra points one could stop
1657the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
1658usage.
1659
1660If your program is single-threaded, then you could also keep a dummy file
1661descriptor for overload situations (e.g. by opening F</dev/null>), and
1662when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
1663close that fd, and create a new dummy fd. This will gracefully refuse
1664clients under typical overload conditions.
1665
1666The last way to handle it is to simply log the error and C<exit>, as
1667is often done with C<malloc> failures, but this results in an easy
1668opportunity for a DoS attack.
1541 1669
1542=head3 Watcher-Specific Functions 1670=head3 Watcher-Specific Functions
1543 1671
1544=over 4 1672=over 4
1545 1673
1577 ... 1705 ...
1578 struct ev_loop *loop = ev_default_init (0); 1706 struct ev_loop *loop = ev_default_init (0);
1579 ev_io stdin_readable; 1707 ev_io stdin_readable;
1580 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1708 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1581 ev_io_start (loop, &stdin_readable); 1709 ev_io_start (loop, &stdin_readable);
1582 ev_loop (loop, 0); 1710 ev_run (loop, 0);
1583 1711
1584 1712
1585=head2 C<ev_timer> - relative and optionally repeating timeouts 1713=head2 C<ev_timer> - relative and optionally repeating timeouts
1586 1714
1587Timer watchers are simple relative timers that generate an event after a 1715Timer watchers are simple relative timers that generate an event after a
1596The callback is guaranteed to be invoked only I<after> its timeout has 1724The callback is guaranteed to be invoked only I<after> its timeout has
1597passed (not I<at>, so on systems with very low-resolution clocks this 1725passed (not I<at>, so on systems with very low-resolution clocks this
1598might introduce a small delay). If multiple timers become ready during the 1726might introduce a small delay). If multiple timers become ready during the
1599same loop iteration then the ones with earlier time-out values are invoked 1727same loop iteration then the ones with earlier time-out values are invoked
1600before ones of the same priority with later time-out values (but this is 1728before ones of the same priority with later time-out values (but this is
1601no longer true when a callback calls C<ev_loop> recursively). 1729no longer true when a callback calls C<ev_run> recursively).
1602 1730
1603=head3 Be smart about timeouts 1731=head3 Be smart about timeouts
1604 1732
1605Many real-world problems involve some kind of timeout, usually for error 1733Many real-world problems involve some kind of timeout, usually for error
1606recovery. A typical example is an HTTP request - if the other side hangs, 1734recovery. A typical example is an HTTP request - if the other side hangs,
1692 ev_tstamp timeout = last_activity + 60.; 1820 ev_tstamp timeout = last_activity + 60.;
1693 1821
1694 // if last_activity + 60. is older than now, we did time out 1822 // if last_activity + 60. is older than now, we did time out
1695 if (timeout < now) 1823 if (timeout < now)
1696 { 1824 {
1697 // timeout occured, take action 1825 // timeout occurred, take action
1698 } 1826 }
1699 else 1827 else
1700 { 1828 {
1701 // callback was invoked, but there was some activity, re-arm 1829 // callback was invoked, but there was some activity, re-arm
1702 // the watcher to fire in last_activity + 60, which is 1830 // the watcher to fire in last_activity + 60, which is
1724to the current time (meaning we just have some activity :), then call the 1852to the current time (meaning we just have some activity :), then call the
1725callback, which will "do the right thing" and start the timer: 1853callback, which will "do the right thing" and start the timer:
1726 1854
1727 ev_init (timer, callback); 1855 ev_init (timer, callback);
1728 last_activity = ev_now (loop); 1856 last_activity = ev_now (loop);
1729 callback (loop, timer, EV_TIMEOUT); 1857 callback (loop, timer, EV_TIMER);
1730 1858
1731And when there is some activity, simply store the current time in 1859And when there is some activity, simply store the current time in
1732C<last_activity>, no libev calls at all: 1860C<last_activity>, no libev calls at all:
1733 1861
1734 last_actiivty = ev_now (loop); 1862 last_activity = ev_now (loop);
1735 1863
1736This technique is slightly more complex, but in most cases where the 1864This technique is slightly more complex, but in most cases where the
1737time-out is unlikely to be triggered, much more efficient. 1865time-out is unlikely to be triggered, much more efficient.
1738 1866
1739Changing the timeout is trivial as well (if it isn't hard-coded in the 1867Changing the timeout is trivial as well (if it isn't hard-coded in the
1777 1905
1778=head3 The special problem of time updates 1906=head3 The special problem of time updates
1779 1907
1780Establishing the current time is a costly operation (it usually takes at 1908Establishing the current time is a costly operation (it usually takes at
1781least two system calls): EV therefore updates its idea of the current 1909least two system calls): EV therefore updates its idea of the current
1782time only before and after C<ev_loop> collects new events, which causes a 1910time only before and after C<ev_run> collects new events, which causes a
1783growing difference between C<ev_now ()> and C<ev_time ()> when handling 1911growing difference between C<ev_now ()> and C<ev_time ()> when handling
1784lots of events in one iteration. 1912lots of events in one iteration.
1785 1913
1786The relative timeouts are calculated relative to the C<ev_now ()> 1914The relative timeouts are calculated relative to the C<ev_now ()>
1787time. This is usually the right thing as this timestamp refers to the time 1915time. This is usually the right thing as this timestamp refers to the time
1865Returns the remaining time until a timer fires. If the timer is active, 1993Returns the remaining time until a timer fires. If the timer is active,
1866then this time is relative to the current event loop time, otherwise it's 1994then this time is relative to the current event loop time, otherwise it's
1867the timeout value currently configured. 1995the timeout value currently configured.
1868 1996
1869That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns 1997That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1870C<5>. When the timer is started and one second passes, C<ev_timer_remain> 1998C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
1871will return C<4>. When the timer expires and is restarted, it will return 1999will return C<4>. When the timer expires and is restarted, it will return
1872roughly C<7> (likely slightly less as callback invocation takes some time, 2000roughly C<7> (likely slightly less as callback invocation takes some time,
1873too), and so on. 2001too), and so on.
1874 2002
1875=item ev_tstamp repeat [read-write] 2003=item ev_tstamp repeat [read-write]
1904 } 2032 }
1905 2033
1906 ev_timer mytimer; 2034 ev_timer mytimer;
1907 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2035 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1908 ev_timer_again (&mytimer); /* start timer */ 2036 ev_timer_again (&mytimer); /* start timer */
1909 ev_loop (loop, 0); 2037 ev_run (loop, 0);
1910 2038
1911 // and in some piece of code that gets executed on any "activity": 2039 // and in some piece of code that gets executed on any "activity":
1912 // reset the timeout to start ticking again at 10 seconds 2040 // reset the timeout to start ticking again at 10 seconds
1913 ev_timer_again (&mytimer); 2041 ev_timer_again (&mytimer);
1914 2042
1940 2068
1941As with timers, the callback is guaranteed to be invoked only when the 2069As with timers, the callback is guaranteed to be invoked only when the
1942point in time where it is supposed to trigger has passed. If multiple 2070point in time where it is supposed to trigger has passed. If multiple
1943timers become ready during the same loop iteration then the ones with 2071timers become ready during the same loop iteration then the ones with
1944earlier time-out values are invoked before ones with later time-out values 2072earlier time-out values are invoked before ones with later time-out values
1945(but this is no longer true when a callback calls C<ev_loop> recursively). 2073(but this is no longer true when a callback calls C<ev_run> recursively).
1946 2074
1947=head3 Watcher-Specific Functions and Data Members 2075=head3 Watcher-Specific Functions and Data Members
1948 2076
1949=over 4 2077=over 4
1950 2078
2078Example: Call a callback every hour, or, more precisely, whenever the 2206Example: Call a callback every hour, or, more precisely, whenever the
2079system time is divisible by 3600. The callback invocation times have 2207system time is divisible by 3600. The callback invocation times have
2080potentially a lot of jitter, but good long-term stability. 2208potentially a lot of jitter, but good long-term stability.
2081 2209
2082 static void 2210 static void
2083 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2211 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
2084 { 2212 {
2085 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2213 ... its now a full hour (UTC, or TAI or whatever your clock follows)
2086 } 2214 }
2087 2215
2088 ev_periodic hourly_tick; 2216 ev_periodic hourly_tick;
2160In current versions of libev, the signal will not be blocked indefinitely 2288In current versions of libev, the signal will not be blocked indefinitely
2161unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces 2289unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
2162the window of opportunity for problems, it will not go away, as libev 2290the window of opportunity for problems, it will not go away, as libev
2163I<has> to modify the signal mask, at least temporarily. 2291I<has> to modify the signal mask, at least temporarily.
2164 2292
2165So I can't stress this enough I<if you do not reset your signal mask 2293So I can't stress this enough: I<If you do not reset your signal mask when
2166when you expect it to be empty, you have a race condition in your 2294you expect it to be empty, you have a race condition in your code>. This
2167program>. This is not a libev-specific thing, this is true for most event 2295is not a libev-specific thing, this is true for most event libraries.
2168libraries.
2169 2296
2170=head3 Watcher-Specific Functions and Data Members 2297=head3 Watcher-Specific Functions and Data Members
2171 2298
2172=over 4 2299=over 4
2173 2300
2189Example: Try to exit cleanly on SIGINT. 2316Example: Try to exit cleanly on SIGINT.
2190 2317
2191 static void 2318 static void
2192 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2319 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2193 { 2320 {
2194 ev_unloop (loop, EVUNLOOP_ALL); 2321 ev_break (loop, EVBREAK_ALL);
2195 } 2322 }
2196 2323
2197 ev_signal signal_watcher; 2324 ev_signal signal_watcher;
2198 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2325 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2199 ev_signal_start (loop, &signal_watcher); 2326 ev_signal_start (loop, &signal_watcher);
2585 2712
2586Prepare and check watchers are usually (but not always) used in pairs: 2713Prepare and check watchers are usually (but not always) used in pairs:
2587prepare watchers get invoked before the process blocks and check watchers 2714prepare watchers get invoked before the process blocks and check watchers
2588afterwards. 2715afterwards.
2589 2716
2590You I<must not> call C<ev_loop> or similar functions that enter 2717You I<must not> call C<ev_run> or similar functions that enter
2591the current event loop from either C<ev_prepare> or C<ev_check> 2718the current event loop from either C<ev_prepare> or C<ev_check>
2592watchers. Other loops than the current one are fine, however. The 2719watchers. Other loops than the current one are fine, however. The
2593rationale behind this is that you do not need to check for recursion in 2720rationale behind this is that you do not need to check for recursion in
2594those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2721those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2595C<ev_check> so if you have one watcher of each kind they will always be 2722C<ev_check> so if you have one watcher of each kind they will always be
2763 2890
2764 if (timeout >= 0) 2891 if (timeout >= 0)
2765 // create/start timer 2892 // create/start timer
2766 2893
2767 // poll 2894 // poll
2768 ev_loop (EV_A_ 0); 2895 ev_run (EV_A_ 0);
2769 2896
2770 // stop timer again 2897 // stop timer again
2771 if (timeout >= 0) 2898 if (timeout >= 0)
2772 ev_timer_stop (EV_A_ &to); 2899 ev_timer_stop (EV_A_ &to);
2773 2900
2851if you do not want that, you need to temporarily stop the embed watcher). 2978if you do not want that, you need to temporarily stop the embed watcher).
2852 2979
2853=item ev_embed_sweep (loop, ev_embed *) 2980=item ev_embed_sweep (loop, ev_embed *)
2854 2981
2855Make a single, non-blocking sweep over the embedded loop. This works 2982Make a single, non-blocking sweep over the embedded loop. This works
2856similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2983similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2857appropriate way for embedded loops. 2984appropriate way for embedded loops.
2858 2985
2859=item struct ev_loop *other [read-only] 2986=item struct ev_loop *other [read-only]
2860 2987
2861The embedded event loop. 2988The embedded event loop.
2921C<ev_default_fork> cheats and calls it in the wrong process, the fork 3048C<ev_default_fork> cheats and calls it in the wrong process, the fork
2922handlers will be invoked, too, of course. 3049handlers will be invoked, too, of course.
2923 3050
2924=head3 The special problem of life after fork - how is it possible? 3051=head3 The special problem of life after fork - how is it possible?
2925 3052
2926Most uses of C<fork()> consist of forking, then some simple calls to ste 3053Most uses of C<fork()> consist of forking, then some simple calls to set
2927up/change the process environment, followed by a call to C<exec()>. This 3054up/change the process environment, followed by a call to C<exec()>. This
2928sequence should be handled by libev without any problems. 3055sequence should be handled by libev without any problems.
2929 3056
2930This changes when the application actually wants to do event handling 3057This changes when the application actually wants to do event handling
2931in the child, or both parent in child, in effect "continuing" after the 3058in the child, or both parent in child, in effect "continuing" after the
2965believe me. 3092believe me.
2966 3093
2967=back 3094=back
2968 3095
2969 3096
2970=head2 C<ev_async> - how to wake up another event loop 3097=head2 C<ev_async> - how to wake up an event loop
2971 3098
2972In general, you cannot use an C<ev_loop> from multiple threads or other 3099In general, you cannot use an C<ev_run> from multiple threads or other
2973asynchronous sources such as signal handlers (as opposed to multiple event 3100asynchronous sources such as signal handlers (as opposed to multiple event
2974loops - those are of course safe to use in different threads). 3101loops - those are of course safe to use in different threads).
2975 3102
2976Sometimes, however, you need to wake up another event loop you do not 3103Sometimes, however, you need to wake up an event loop you do not control,
2977control, for example because it belongs to another thread. This is what 3104for example because it belongs to another thread. This is what C<ev_async>
2978C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3105watchers do: as long as the C<ev_async> watcher is active, you can signal
2979can signal it by calling C<ev_async_send>, which is thread- and signal 3106it by calling C<ev_async_send>, which is thread- and signal safe.
2980safe.
2981 3107
2982This functionality is very similar to C<ev_signal> watchers, as signals, 3108This functionality is very similar to C<ev_signal> watchers, as signals,
2983too, are asynchronous in nature, and signals, too, will be compressed 3109too, are asynchronous in nature, and signals, too, will be compressed
2984(i.e. the number of callback invocations may be less than the number of 3110(i.e. the number of callback invocations may be less than the number of
2985C<ev_async_sent> calls). 3111C<ev_async_sent> calls).
3140 3266
3141If C<timeout> is less than 0, then no timeout watcher will be 3267If C<timeout> is less than 0, then no timeout watcher will be
3142started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 3268started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
3143repeat = 0) will be started. C<0> is a valid timeout. 3269repeat = 0) will be started. C<0> is a valid timeout.
3144 3270
3145The callback has the type C<void (*cb)(int revents, void *arg)> and gets 3271The callback has the type C<void (*cb)(int revents, void *arg)> and is
3146passed an C<revents> set like normal event callbacks (a combination of 3272passed an C<revents> set like normal event callbacks (a combination of
3147C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 3273C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
3148value passed to C<ev_once>. Note that it is possible to receive I<both> 3274value passed to C<ev_once>. Note that it is possible to receive I<both>
3149a timeout and an io event at the same time - you probably should give io 3275a timeout and an io event at the same time - you probably should give io
3150events precedence. 3276events precedence.
3151 3277
3152Example: wait up to ten seconds for data to appear on STDIN_FILENO. 3278Example: wait up to ten seconds for data to appear on STDIN_FILENO.
3153 3279
3154 static void stdin_ready (int revents, void *arg) 3280 static void stdin_ready (int revents, void *arg)
3155 { 3281 {
3156 if (revents & EV_READ) 3282 if (revents & EV_READ)
3157 /* stdin might have data for us, joy! */; 3283 /* stdin might have data for us, joy! */;
3158 else if (revents & EV_TIMEOUT) 3284 else if (revents & EV_TIMER)
3159 /* doh, nothing entered */; 3285 /* doh, nothing entered */;
3160 } 3286 }
3161 3287
3162 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3288 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3163 3289
3297 myclass obj; 3423 myclass obj;
3298 ev::io iow; 3424 ev::io iow;
3299 iow.set <myclass, &myclass::io_cb> (&obj); 3425 iow.set <myclass, &myclass::io_cb> (&obj);
3300 3426
3301=item w->set (object *) 3427=item w->set (object *)
3302
3303This is an B<experimental> feature that might go away in a future version.
3304 3428
3305This is a variation of a method callback - leaving out the method to call 3429This is a variation of a method callback - leaving out the method to call
3306will default the method to C<operator ()>, which makes it possible to use 3430will default the method to C<operator ()>, which makes it possible to use
3307functor objects without having to manually specify the C<operator ()> all 3431functor objects without having to manually specify the C<operator ()> all
3308the time. Incidentally, you can then also leave out the template argument 3432the time. Incidentally, you can then also leave out the template argument
3348Associates a different C<struct ev_loop> with this watcher. You can only 3472Associates a different C<struct ev_loop> with this watcher. You can only
3349do this when the watcher is inactive (and not pending either). 3473do this when the watcher is inactive (and not pending either).
3350 3474
3351=item w->set ([arguments]) 3475=item w->set ([arguments])
3352 3476
3353Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3477Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3354called at least once. Unlike the C counterpart, an active watcher gets 3478method or a suitable start method must be called at least once. Unlike the
3355automatically stopped and restarted when reconfiguring it with this 3479C counterpart, an active watcher gets automatically stopped and restarted
3356method. 3480when reconfiguring it with this method.
3357 3481
3358=item w->start () 3482=item w->start ()
3359 3483
3360Starts the watcher. Note that there is no C<loop> argument, as the 3484Starts the watcher. Note that there is no C<loop> argument, as the
3361constructor already stores the event loop. 3485constructor already stores the event loop.
3362 3486
3487=item w->start ([arguments])
3488
3489Instead of calling C<set> and C<start> methods separately, it is often
3490convenient to wrap them in one call. Uses the same type of arguments as
3491the configure C<set> method of the watcher.
3492
3363=item w->stop () 3493=item w->stop ()
3364 3494
3365Stops the watcher if it is active. Again, no C<loop> argument. 3495Stops the watcher if it is active. Again, no C<loop> argument.
3366 3496
3367=item w->again () (C<ev::timer>, C<ev::periodic> only) 3497=item w->again () (C<ev::timer>, C<ev::periodic> only)
3379 3509
3380=back 3510=back
3381 3511
3382=back 3512=back
3383 3513
3384Example: Define a class with an IO and idle watcher, start one of them in 3514Example: Define a class with two I/O and idle watchers, start the I/O
3385the constructor. 3515watchers in the constructor.
3386 3516
3387 class myclass 3517 class myclass
3388 { 3518 {
3389 ev::io io ; void io_cb (ev::io &w, int revents); 3519 ev::io io ; void io_cb (ev::io &w, int revents);
3520 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3390 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3521 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3391 3522
3392 myclass (int fd) 3523 myclass (int fd)
3393 { 3524 {
3394 io .set <myclass, &myclass::io_cb > (this); 3525 io .set <myclass, &myclass::io_cb > (this);
3526 io2 .set <myclass, &myclass::io2_cb > (this);
3395 idle.set <myclass, &myclass::idle_cb> (this); 3527 idle.set <myclass, &myclass::idle_cb> (this);
3396 3528
3397 io.start (fd, ev::READ); 3529 io.set (fd, ev::WRITE); // configure the watcher
3530 io.start (); // start it whenever convenient
3531
3532 io2.start (fd, ev::READ); // set + start in one call
3398 } 3533 }
3399 }; 3534 };
3400 3535
3401 3536
3402=head1 OTHER LANGUAGE BINDINGS 3537=head1 OTHER LANGUAGE BINDINGS
3450Erkki Seppala has written Ocaml bindings for libev, to be found at 3585Erkki Seppala has written Ocaml bindings for libev, to be found at
3451L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3586L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3452 3587
3453=item Lua 3588=item Lua
3454 3589
3455Brian Maher has written a partial interface to libev 3590Brian Maher has written a partial interface to libev for lua (at the
3456for lua (only C<ev_io> and C<ev_timer>), to be found at 3591time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3457L<http://github.com/brimworks/lua-ev>. 3592L<http://github.com/brimworks/lua-ev>.
3458 3593
3459=back 3594=back
3460 3595
3461 3596
3476loop argument"). The C<EV_A> form is used when this is the sole argument, 3611loop argument"). The C<EV_A> form is used when this is the sole argument,
3477C<EV_A_> is used when other arguments are following. Example: 3612C<EV_A_> is used when other arguments are following. Example:
3478 3613
3479 ev_unref (EV_A); 3614 ev_unref (EV_A);
3480 ev_timer_add (EV_A_ watcher); 3615 ev_timer_add (EV_A_ watcher);
3481 ev_loop (EV_A_ 0); 3616 ev_run (EV_A_ 0);
3482 3617
3483It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 3618It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3484which is often provided by the following macro. 3619which is often provided by the following macro.
3485 3620
3486=item C<EV_P>, C<EV_P_> 3621=item C<EV_P>, C<EV_P_>
3526 } 3661 }
3527 3662
3528 ev_check check; 3663 ev_check check;
3529 ev_check_init (&check, check_cb); 3664 ev_check_init (&check, check_cb);
3530 ev_check_start (EV_DEFAULT_ &check); 3665 ev_check_start (EV_DEFAULT_ &check);
3531 ev_loop (EV_DEFAULT_ 0); 3666 ev_run (EV_DEFAULT_ 0);
3532 3667
3533=head1 EMBEDDING 3668=head1 EMBEDDING
3534 3669
3535Libev can (and often is) directly embedded into host 3670Libev can (and often is) directly embedded into host
3536applications. Examples of applications that embed it include the Deliantra 3671applications. Examples of applications that embed it include the Deliantra
3616 libev.m4 3751 libev.m4
3617 3752
3618=head2 PREPROCESSOR SYMBOLS/MACROS 3753=head2 PREPROCESSOR SYMBOLS/MACROS
3619 3754
3620Libev can be configured via a variety of preprocessor symbols you have to 3755Libev can be configured via a variety of preprocessor symbols you have to
3621define before including any of its files. The default in the absence of 3756define before including (or compiling) any of its files. The default in
3622autoconf is documented for every option. 3757the absence of autoconf is documented for every option.
3758
3759Symbols marked with "(h)" do not change the ABI, and can have different
3760values when compiling libev vs. including F<ev.h>, so it is permissible
3761to redefine them before including F<ev.h> without breaking compatibility
3762to a compiled library. All other symbols change the ABI, which means all
3763users of libev and the libev code itself must be compiled with compatible
3764settings.
3623 3765
3624=over 4 3766=over 4
3625 3767
3768=item EV_COMPAT3 (h)
3769
3770Backwards compatibility is a major concern for libev. This is why this
3771release of libev comes with wrappers for the functions and symbols that
3772have been renamed between libev version 3 and 4.
3773
3774You can disable these wrappers (to test compatibility with future
3775versions) by defining C<EV_COMPAT3> to C<0> when compiling your
3776sources. This has the additional advantage that you can drop the C<struct>
3777from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
3778typedef in that case.
3779
3780In some future version, the default for C<EV_COMPAT3> will become C<0>,
3781and in some even more future version the compatibility code will be
3782removed completely.
3783
3626=item EV_STANDALONE 3784=item EV_STANDALONE (h)
3627 3785
3628Must always be C<1> if you do not use autoconf configuration, which 3786Must always be C<1> if you do not use autoconf configuration, which
3629keeps libev from including F<config.h>, and it also defines dummy 3787keeps libev from including F<config.h>, and it also defines dummy
3630implementations for some libevent functions (such as logging, which is not 3788implementations for some libevent functions (such as logging, which is not
3631supported). It will also not define any of the structs usually found in 3789supported). It will also not define any of the structs usually found in
3781as well as for signal and thread safety in C<ev_async> watchers. 3939as well as for signal and thread safety in C<ev_async> watchers.
3782 3940
3783In the absence of this define, libev will use C<sig_atomic_t volatile> 3941In the absence of this define, libev will use C<sig_atomic_t volatile>
3784(from F<signal.h>), which is usually good enough on most platforms. 3942(from F<signal.h>), which is usually good enough on most platforms.
3785 3943
3786=item EV_H 3944=item EV_H (h)
3787 3945
3788The name of the F<ev.h> header file used to include it. The default if 3946The name of the F<ev.h> header file used to include it. The default if
3789undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 3947undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3790used to virtually rename the F<ev.h> header file in case of conflicts. 3948used to virtually rename the F<ev.h> header file in case of conflicts.
3791 3949
3792=item EV_CONFIG_H 3950=item EV_CONFIG_H (h)
3793 3951
3794If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 3952If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3795F<ev.c>'s idea of where to find the F<config.h> file, similarly to 3953F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3796C<EV_H>, above. 3954C<EV_H>, above.
3797 3955
3798=item EV_EVENT_H 3956=item EV_EVENT_H (h)
3799 3957
3800Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 3958Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3801of how the F<event.h> header can be found, the default is C<"event.h">. 3959of how the F<event.h> header can be found, the default is C<"event.h">.
3802 3960
3803=item EV_PROTOTYPES 3961=item EV_PROTOTYPES (h)
3804 3962
3805If defined to be C<0>, then F<ev.h> will not define any function 3963If defined to be C<0>, then F<ev.h> will not define any function
3806prototypes, but still define all the structs and other symbols. This is 3964prototypes, but still define all the structs and other symbols. This is
3807occasionally useful if you want to provide your own wrapper functions 3965occasionally useful if you want to provide your own wrapper functions
3808around libev functions. 3966around libev functions.
3830fine. 3988fine.
3831 3989
3832If your embedding application does not need any priorities, defining these 3990If your embedding application does not need any priorities, defining these
3833both to C<0> will save some memory and CPU. 3991both to C<0> will save some memory and CPU.
3834 3992
3835=item EV_PERIODIC_ENABLE 3993=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
3994EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3995EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3836 3996
3837If undefined or defined to be C<1>, then periodic timers are supported. If 3997If undefined or defined to be C<1> (and the platform supports it), then
3838defined to be C<0>, then they are not. Disabling them saves a few kB of 3998the respective watcher type is supported. If defined to be C<0>, then it
3839code. 3999is not. Disabling watcher types mainly saves code size.
3840 4000
3841=item EV_IDLE_ENABLE 4001=item EV_FEATURES
3842
3843If undefined or defined to be C<1>, then idle watchers are supported. If
3844defined to be C<0>, then they are not. Disabling them saves a few kB of
3845code.
3846
3847=item EV_EMBED_ENABLE
3848
3849If undefined or defined to be C<1>, then embed watchers are supported. If
3850defined to be C<0>, then they are not. Embed watchers rely on most other
3851watcher types, which therefore must not be disabled.
3852
3853=item EV_STAT_ENABLE
3854
3855If undefined or defined to be C<1>, then stat watchers are supported. If
3856defined to be C<0>, then they are not.
3857
3858=item EV_FORK_ENABLE
3859
3860If undefined or defined to be C<1>, then fork watchers are supported. If
3861defined to be C<0>, then they are not.
3862
3863=item EV_ASYNC_ENABLE
3864
3865If undefined or defined to be C<1>, then async watchers are supported. If
3866defined to be C<0>, then they are not.
3867
3868=item EV_MINIMAL
3869 4002
3870If you need to shave off some kilobytes of code at the expense of some 4003If you need to shave off some kilobytes of code at the expense of some
3871speed (but with the full API), define this symbol to C<1>. Currently this 4004speed (but with the full API), you can define this symbol to request
3872is used to override some inlining decisions, saves roughly 30% code size 4005certain subsets of functionality. The default is to enable all features
3873on amd64. It also selects a much smaller 2-heap for timer management over 4006that can be enabled on the platform.
3874the default 4-heap.
3875 4007
3876You can save even more by disabling watcher types you do not need 4008A typical way to use this symbol is to define it to C<0> (or to a bitset
3877and setting C<EV_MAXPRI> == C<EV_MINPRI>. Also, disabling C<assert> 4009with some broad features you want) and then selectively re-enable
3878(C<-DNDEBUG>) will usually reduce code size a lot. 4010additional parts you want, for example if you want everything minimal,
4011but multiple event loop support, async and child watchers and the poll
4012backend, use this:
3879 4013
3880Defining C<EV_MINIMAL> to C<2> will additionally reduce the core API to 4014 #define EV_FEATURES 0
3881provide a bare-bones event library. See C<ev.h> for details on what parts 4015 #define EV_MULTIPLICITY 1
3882of the API are still available, and do not complain if this subset changes 4016 #define EV_USE_POLL 1
3883over time. 4017 #define EV_CHILD_ENABLE 1
4018 #define EV_ASYNC_ENABLE 1
4019
4020The actual value is a bitset, it can be a combination of the following
4021values:
4022
4023=over 4
4024
4025=item C<1> - faster/larger code
4026
4027Use larger code to speed up some operations.
4028
4029Currently this is used to override some inlining decisions (enlarging the
4030code size by roughly 30% on amd64).
4031
4032When optimising for size, use of compiler flags such as C<-Os> with
4033gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4034assertions.
4035
4036=item C<2> - faster/larger data structures
4037
4038Replaces the small 2-heap for timer management by a faster 4-heap, larger
4039hash table sizes and so on. This will usually further increase code size
4040and can additionally have an effect on the size of data structures at
4041runtime.
4042
4043=item C<4> - full API configuration
4044
4045This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4046enables multiplicity (C<EV_MULTIPLICITY>=1).
4047
4048=item C<8> - full API
4049
4050This enables a lot of the "lesser used" API functions. See C<ev.h> for
4051details on which parts of the API are still available without this
4052feature, and do not complain if this subset changes over time.
4053
4054=item C<16> - enable all optional watcher types
4055
4056Enables all optional watcher types. If you want to selectively enable
4057only some watcher types other than I/O and timers (e.g. prepare,
4058embed, async, child...) you can enable them manually by defining
4059C<EV_watchertype_ENABLE> to C<1> instead.
4060
4061=item C<32> - enable all backends
4062
4063This enables all backends - without this feature, you need to enable at
4064least one backend manually (C<EV_USE_SELECT> is a good choice).
4065
4066=item C<64> - enable OS-specific "helper" APIs
4067
4068Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
4069default.
4070
4071=back
4072
4073Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
4074reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
4075code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
4076watchers, timers and monotonic clock support.
4077
4078With an intelligent-enough linker (gcc+binutils are intelligent enough
4079when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4080your program might be left out as well - a binary starting a timer and an
4081I/O watcher then might come out at only 5Kb.
4082
4083=item EV_AVOID_STDIO
4084
4085If this is set to C<1> at compiletime, then libev will avoid using stdio
4086functions (printf, scanf, perror etc.). This will increase the code size
4087somewhat, but if your program doesn't otherwise depend on stdio and your
4088libc allows it, this avoids linking in the stdio library which is quite
4089big.
4090
4091Note that error messages might become less precise when this option is
4092enabled.
3884 4093
3885=item EV_NSIG 4094=item EV_NSIG
3886 4095
3887The highest supported signal number, +1 (or, the number of 4096The highest supported signal number, +1 (or, the number of
3888signals): Normally, libev tries to deduce the maximum number of signals 4097signals): Normally, libev tries to deduce the maximum number of signals
3889automatically, but sometimes this fails, in which case it can be 4098automatically, but sometimes this fails, in which case it can be
3890specified. Also, using a lower number than detected (C<32> should be 4099specified. Also, using a lower number than detected (C<32> should be
3891good for about any system in existance) can save some memory, as libev 4100good for about any system in existence) can save some memory, as libev
3892statically allocates some 12-24 bytes per signal number. 4101statically allocates some 12-24 bytes per signal number.
3893 4102
3894=item EV_PID_HASHSIZE 4103=item EV_PID_HASHSIZE
3895 4104
3896C<ev_child> watchers use a small hash table to distribute workload by 4105C<ev_child> watchers use a small hash table to distribute workload by
3897pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 4106pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3898than enough. If you need to manage thousands of children you might want to 4107usually more than enough. If you need to manage thousands of children you
3899increase this value (I<must> be a power of two). 4108might want to increase this value (I<must> be a power of two).
3900 4109
3901=item EV_INOTIFY_HASHSIZE 4110=item EV_INOTIFY_HASHSIZE
3902 4111
3903C<ev_stat> watchers use a small hash table to distribute workload by 4112C<ev_stat> watchers use a small hash table to distribute workload by
3904inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 4113inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3905usually more than enough. If you need to manage thousands of C<ev_stat> 4114disabled), usually more than enough. If you need to manage thousands of
3906watchers you might want to increase this value (I<must> be a power of 4115C<ev_stat> watchers you might want to increase this value (I<must> be a
3907two). 4116power of two).
3908 4117
3909=item EV_USE_4HEAP 4118=item EV_USE_4HEAP
3910 4119
3911Heaps are not very cache-efficient. To improve the cache-efficiency of the 4120Heaps are not very cache-efficient. To improve the cache-efficiency of the
3912timer and periodics heaps, libev uses a 4-heap when this symbol is defined 4121timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3913to C<1>. The 4-heap uses more complicated (longer) code but has noticeably 4122to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3914faster performance with many (thousands) of watchers. 4123faster performance with many (thousands) of watchers.
3915 4124
3916The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4125The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3917(disabled). 4126will be C<0>.
3918 4127
3919=item EV_HEAP_CACHE_AT 4128=item EV_HEAP_CACHE_AT
3920 4129
3921Heaps are not very cache-efficient. To improve the cache-efficiency of the 4130Heaps are not very cache-efficient. To improve the cache-efficiency of the
3922timer and periodics heaps, libev can cache the timestamp (I<at>) within 4131timer and periodics heaps, libev can cache the timestamp (I<at>) within
3923the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 4132the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3924which uses 8-12 bytes more per watcher and a few hundred bytes more code, 4133which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3925but avoids random read accesses on heap changes. This improves performance 4134but avoids random read accesses on heap changes. This improves performance
3926noticeably with many (hundreds) of watchers. 4135noticeably with many (hundreds) of watchers.
3927 4136
3928The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4137The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3929(disabled). 4138will be C<0>.
3930 4139
3931=item EV_VERIFY 4140=item EV_VERIFY
3932 4141
3933Controls how much internal verification (see C<ev_loop_verify ()>) will 4142Controls how much internal verification (see C<ev_verify ()>) will
3934be done: If set to C<0>, no internal verification code will be compiled 4143be done: If set to C<0>, no internal verification code will be compiled
3935in. If set to C<1>, then verification code will be compiled in, but not 4144in. If set to C<1>, then verification code will be compiled in, but not
3936called. If set to C<2>, then the internal verification code will be 4145called. If set to C<2>, then the internal verification code will be
3937called once per loop, which can slow down libev. If set to C<3>, then the 4146called once per loop, which can slow down libev. If set to C<3>, then the
3938verification code will be called very frequently, which will slow down 4147verification code will be called very frequently, which will slow down
3939libev considerably. 4148libev considerably.
3940 4149
3941The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 4150The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3942C<0>. 4151will be C<0>.
3943 4152
3944=item EV_COMMON 4153=item EV_COMMON
3945 4154
3946By default, all watchers have a C<void *data> member. By redefining 4155By default, all watchers have a C<void *data> member. By redefining
3947this macro to a something else you can include more and other types of 4156this macro to something else you can include more and other types of
3948members. You have to define it each time you include one of the files, 4157members. You have to define it each time you include one of the files,
3949though, and it must be identical each time. 4158though, and it must be identical each time.
3950 4159
3951For example, the perl EV module uses something like this: 4160For example, the perl EV module uses something like this:
3952 4161
4005file. 4214file.
4006 4215
4007The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4216The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
4008that everybody includes and which overrides some configure choices: 4217that everybody includes and which overrides some configure choices:
4009 4218
4010 #define EV_MINIMAL 1 4219 #define EV_FEATURES 8
4011 #define EV_USE_POLL 0 4220 #define EV_USE_SELECT 1
4012 #define EV_MULTIPLICITY 0
4013 #define EV_PERIODIC_ENABLE 0 4221 #define EV_PREPARE_ENABLE 1
4222 #define EV_IDLE_ENABLE 1
4014 #define EV_STAT_ENABLE 0 4223 #define EV_SIGNAL_ENABLE 1
4015 #define EV_FORK_ENABLE 0 4224 #define EV_CHILD_ENABLE 1
4225 #define EV_USE_STDEXCEPT 0
4016 #define EV_CONFIG_H <config.h> 4226 #define EV_CONFIG_H <config.h>
4017 #define EV_MINPRI 0
4018 #define EV_MAXPRI 0
4019 4227
4020 #include "ev++.h" 4228 #include "ev++.h"
4021 4229
4022And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4230And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4023 4231
4154 userdata *u = ev_userdata (EV_A); 4362 userdata *u = ev_userdata (EV_A);
4155 pthread_mutex_lock (&u->lock); 4363 pthread_mutex_lock (&u->lock);
4156 } 4364 }
4157 4365
4158The event loop thread first acquires the mutex, and then jumps straight 4366The event loop thread first acquires the mutex, and then jumps straight
4159into C<ev_loop>: 4367into C<ev_run>:
4160 4368
4161 void * 4369 void *
4162 l_run (void *thr_arg) 4370 l_run (void *thr_arg)
4163 { 4371 {
4164 struct ev_loop *loop = (struct ev_loop *)thr_arg; 4372 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4165 4373
4166 l_acquire (EV_A); 4374 l_acquire (EV_A);
4167 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0); 4375 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4168 ev_loop (EV_A_ 0); 4376 ev_run (EV_A_ 0);
4169 l_release (EV_A); 4377 l_release (EV_A);
4170 4378
4171 return 0; 4379 return 0;
4172 } 4380 }
4173 4381
4225 4433
4226=head3 COROUTINES 4434=head3 COROUTINES
4227 4435
4228Libev is very accommodating to coroutines ("cooperative threads"): 4436Libev is very accommodating to coroutines ("cooperative threads"):
4229libev fully supports nesting calls to its functions from different 4437libev fully supports nesting calls to its functions from different
4230coroutines (e.g. you can call C<ev_loop> on the same loop from two 4438coroutines (e.g. you can call C<ev_run> on the same loop from two
4231different coroutines, and switch freely between both coroutines running 4439different coroutines, and switch freely between both coroutines running
4232the loop, as long as you don't confuse yourself). The only exception is 4440the loop, as long as you don't confuse yourself). The only exception is
4233that you must not do this from C<ev_periodic> reschedule callbacks. 4441that you must not do this from C<ev_periodic> reschedule callbacks.
4234 4442
4235Care has been taken to ensure that libev does not keep local state inside 4443Care has been taken to ensure that libev does not keep local state inside
4236C<ev_loop>, and other calls do not usually allow for coroutine switches as 4444C<ev_run>, and other calls do not usually allow for coroutine switches as
4237they do not call any callbacks. 4445they do not call any callbacks.
4238 4446
4239=head2 COMPILER WARNINGS 4447=head2 COMPILER WARNINGS
4240 4448
4241Depending on your compiler and compiler settings, you might get no or a 4449Depending on your compiler and compiler settings, you might get no or a
4252maintainable. 4460maintainable.
4253 4461
4254And of course, some compiler warnings are just plain stupid, or simply 4462And of course, some compiler warnings are just plain stupid, or simply
4255wrong (because they don't actually warn about the condition their message 4463wrong (because they don't actually warn about the condition their message
4256seems to warn about). For example, certain older gcc versions had some 4464seems to warn about). For example, certain older gcc versions had some
4257warnings that resulted an extreme number of false positives. These have 4465warnings that resulted in an extreme number of false positives. These have
4258been fixed, but some people still insist on making code warn-free with 4466been fixed, but some people still insist on making code warn-free with
4259such buggy versions. 4467such buggy versions.
4260 4468
4261While libev is written to generate as few warnings as possible, 4469While libev is written to generate as few warnings as possible,
4262"warn-free" code is not a goal, and it is recommended not to build libev 4470"warn-free" code is not a goal, and it is recommended not to build libev
4298I suggest using suppression lists. 4506I suggest using suppression lists.
4299 4507
4300 4508
4301=head1 PORTABILITY NOTES 4509=head1 PORTABILITY NOTES
4302 4510
4511=head2 GNU/LINUX 32 BIT LIMITATIONS
4512
4513GNU/Linux is the only common platform that supports 64 bit file/large file
4514interfaces but I<disables> them by default.
4515
4516That means that libev compiled in the default environment doesn't support
4517files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4518
4519Unfortunately, many programs try to work around this GNU/Linux issue
4520by enabling the large file API, which makes them incompatible with the
4521standard libev compiled for their system.
4522
4523Likewise, libev cannot enable the large file API itself as this would
4524suddenly make it incompatible to the default compile time environment,
4525i.e. all programs not using special compile switches.
4526
4527=head2 OS/X AND DARWIN BUGS
4528
4529The whole thing is a bug if you ask me - basically any system interface
4530you touch is broken, whether it is locales, poll, kqueue or even the
4531OpenGL drivers.
4532
4533=head3 C<kqueue> is buggy
4534
4535The kqueue syscall is broken in all known versions - most versions support
4536only sockets, many support pipes.
4537
4538Libev tries to work around this by not using C<kqueue> by default on this
4539rotten platform, but of course you can still ask for it when creating a
4540loop - embedding a socket-only kqueue loop into a select-based one is
4541probably going to work well.
4542
4543=head3 C<poll> is buggy
4544
4545Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4546implementation by something calling C<kqueue> internally around the 10.5.6
4547release, so now C<kqueue> I<and> C<poll> are broken.
4548
4549Libev tries to work around this by not using C<poll> by default on
4550this rotten platform, but of course you can still ask for it when creating
4551a loop.
4552
4553=head3 C<select> is buggy
4554
4555All that's left is C<select>, and of course Apple found a way to fuck this
4556one up as well: On OS/X, C<select> actively limits the number of file
4557descriptors you can pass in to 1024 - your program suddenly crashes when
4558you use more.
4559
4560There is an undocumented "workaround" for this - defining
4561C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4562work on OS/X.
4563
4564=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4565
4566=head3 C<errno> reentrancy
4567
4568The default compile environment on Solaris is unfortunately so
4569thread-unsafe that you can't even use components/libraries compiled
4570without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4571defined by default. A valid, if stupid, implementation choice.
4572
4573If you want to use libev in threaded environments you have to make sure
4574it's compiled with C<_REENTRANT> defined.
4575
4576=head3 Event port backend
4577
4578The scalable event interface for Solaris is called "event
4579ports". Unfortunately, this mechanism is very buggy in all major
4580releases. If you run into high CPU usage, your program freezes or you get
4581a large number of spurious wakeups, make sure you have all the relevant
4582and latest kernel patches applied. No, I don't know which ones, but there
4583are multiple ones to apply, and afterwards, event ports actually work
4584great.
4585
4586If you can't get it to work, you can try running the program by setting
4587the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4588C<select> backends.
4589
4590=head2 AIX POLL BUG
4591
4592AIX unfortunately has a broken C<poll.h> header. Libev works around
4593this by trying to avoid the poll backend altogether (i.e. it's not even
4594compiled in), which normally isn't a big problem as C<select> works fine
4595with large bitsets on AIX, and AIX is dead anyway.
4596
4303=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4597=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4598
4599=head3 General issues
4304 4600
4305Win32 doesn't support any of the standards (e.g. POSIX) that libev 4601Win32 doesn't support any of the standards (e.g. POSIX) that libev
4306requires, and its I/O model is fundamentally incompatible with the POSIX 4602requires, and its I/O model is fundamentally incompatible with the POSIX
4307model. Libev still offers limited functionality on this platform in 4603model. Libev still offers limited functionality on this platform in
4308the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4604the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4309descriptors. This only applies when using Win32 natively, not when using 4605descriptors. This only applies when using Win32 natively, not when using
4310e.g. cygwin. 4606e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4607as every compielr comes with a slightly differently broken/incompatible
4608environment.
4311 4609
4312Lifting these limitations would basically require the full 4610Lifting these limitations would basically require the full
4313re-implementation of the I/O system. If you are into these kinds of 4611re-implementation of the I/O system. If you are into this kind of thing,
4314things, then note that glib does exactly that for you in a very portable 4612then note that glib does exactly that for you in a very portable way (note
4315way (note also that glib is the slowest event library known to man). 4613also that glib is the slowest event library known to man).
4316 4614
4317There is no supported compilation method available on windows except 4615There is no supported compilation method available on windows except
4318embedding it into other applications. 4616embedding it into other applications.
4319 4617
4320Sensible signal handling is officially unsupported by Microsoft - libev 4618Sensible signal handling is officially unsupported by Microsoft - libev
4348you do I<not> compile the F<ev.c> or any other embedded source files!): 4646you do I<not> compile the F<ev.c> or any other embedded source files!):
4349 4647
4350 #include "evwrap.h" 4648 #include "evwrap.h"
4351 #include "ev.c" 4649 #include "ev.c"
4352 4650
4353=over 4
4354
4355=item The winsocket select function 4651=head3 The winsocket C<select> function
4356 4652
4357The winsocket C<select> function doesn't follow POSIX in that it 4653The winsocket C<select> function doesn't follow POSIX in that it
4358requires socket I<handles> and not socket I<file descriptors> (it is 4654requires socket I<handles> and not socket I<file descriptors> (it is
4359also extremely buggy). This makes select very inefficient, and also 4655also extremely buggy). This makes select very inefficient, and also
4360requires a mapping from file descriptors to socket handles (the Microsoft 4656requires a mapping from file descriptors to socket handles (the Microsoft
4369 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4665 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4370 4666
4371Note that winsockets handling of fd sets is O(n), so you can easily get a 4667Note that winsockets handling of fd sets is O(n), so you can easily get a
4372complexity in the O(n²) range when using win32. 4668complexity in the O(n²) range when using win32.
4373 4669
4374=item Limited number of file descriptors 4670=head3 Limited number of file descriptors
4375 4671
4376Windows has numerous arbitrary (and low) limits on things. 4672Windows has numerous arbitrary (and low) limits on things.
4377 4673
4378Early versions of winsocket's select only supported waiting for a maximum 4674Early versions of winsocket's select only supported waiting for a maximum
4379of C<64> handles (probably owning to the fact that all windows kernels 4675of C<64> handles (probably owning to the fact that all windows kernels
4394runtime libraries. This might get you to about C<512> or C<2048> sockets 4690runtime libraries. This might get you to about C<512> or C<2048> sockets
4395(depending on windows version and/or the phase of the moon). To get more, 4691(depending on windows version and/or the phase of the moon). To get more,
4396you need to wrap all I/O functions and provide your own fd management, but 4692you need to wrap all I/O functions and provide your own fd management, but
4397the cost of calling select (O(n²)) will likely make this unworkable. 4693the cost of calling select (O(n²)) will likely make this unworkable.
4398 4694
4399=back
4400
4401=head2 PORTABILITY REQUIREMENTS 4695=head2 PORTABILITY REQUIREMENTS
4402 4696
4403In addition to a working ISO-C implementation and of course the 4697In addition to a working ISO-C implementation and of course the
4404backend-specific APIs, libev relies on a few additional extensions: 4698backend-specific APIs, libev relies on a few additional extensions:
4405 4699
4443watchers. 4737watchers.
4444 4738
4445=item C<double> must hold a time value in seconds with enough accuracy 4739=item C<double> must hold a time value in seconds with enough accuracy
4446 4740
4447The type C<double> is used to represent timestamps. It is required to 4741The type C<double> is used to represent timestamps. It is required to
4448have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4742have at least 51 bits of mantissa (and 9 bits of exponent), which is
4449enough for at least into the year 4000. This requirement is fulfilled by 4743good enough for at least into the year 4000 with millisecond accuracy
4744(the design goal for libev). This requirement is overfulfilled by
4450implementations implementing IEEE 754, which is basically all existing 4745implementations using IEEE 754, which is basically all existing ones. With
4451ones. With IEEE 754 doubles, you get microsecond accuracy until at least 4746IEEE 754 doubles, you get microsecond accuracy until at least 2200.
44522200.
4453 4747
4454=back 4748=back
4455 4749
4456If you know of other additional requirements drop me a note. 4750If you know of other additional requirements drop me a note.
4457 4751
4525involves iterating over all running async watchers or all signal numbers. 4819involves iterating over all running async watchers or all signal numbers.
4526 4820
4527=back 4821=back
4528 4822
4529 4823
4824=head1 PORTING FROM LIBEV 3.X TO 4.X
4825
4826The major version 4 introduced some minor incompatible changes to the API.
4827
4828At the moment, the C<ev.h> header file tries to implement superficial
4829compatibility, so most programs should still compile. Those might be
4830removed in later versions of libev, so better update early than late.
4831
4832=over 4
4833
4834=item function/symbol renames
4835
4836A number of functions and symbols have been renamed:
4837
4838 ev_loop => ev_run
4839 EVLOOP_NONBLOCK => EVRUN_NOWAIT
4840 EVLOOP_ONESHOT => EVRUN_ONCE
4841
4842 ev_unloop => ev_break
4843 EVUNLOOP_CANCEL => EVBREAK_CANCEL
4844 EVUNLOOP_ONE => EVBREAK_ONE
4845 EVUNLOOP_ALL => EVBREAK_ALL
4846
4847 EV_TIMEOUT => EV_TIMER
4848
4849 ev_loop_count => ev_iteration
4850 ev_loop_depth => ev_depth
4851 ev_loop_verify => ev_verify
4852
4853Most functions working on C<struct ev_loop> objects don't have an
4854C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
4855associated constants have been renamed to not collide with the C<struct
4856ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4857as all other watcher types. Note that C<ev_loop_fork> is still called
4858C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4859typedef.
4860
4861=item C<EV_COMPAT3> backwards compatibility mechanism
4862
4863The backward compatibility mechanism can be controlled by
4864C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4865section.
4866
4867=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4868
4869The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4870mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4871and work, but the library code will of course be larger.
4872
4873=back
4874
4875
4530=head1 GLOSSARY 4876=head1 GLOSSARY
4531 4877
4532=over 4 4878=over 4
4533 4879
4534=item active 4880=item active
4535 4881
4536A watcher is active as long as it has been started (has been attached to 4882A watcher is active as long as it has been started and not yet stopped.
4537an event loop) but not yet stopped (disassociated from the event loop). 4883See L<WATCHER STATES> for details.
4538 4884
4539=item application 4885=item application
4540 4886
4541In this document, an application is whatever is using libev. 4887In this document, an application is whatever is using libev.
4888
4889=item backend
4890
4891The part of the code dealing with the operating system interfaces.
4542 4892
4543=item callback 4893=item callback
4544 4894
4545The address of a function that is called when some event has been 4895The address of a function that is called when some event has been
4546detected. Callbacks are being passed the event loop, the watcher that 4896detected. Callbacks are being passed the event loop, the watcher that
4547received the event, and the actual event bitset. 4897received the event, and the actual event bitset.
4548 4898
4549=item callback invocation 4899=item callback/watcher invocation
4550 4900
4551The act of calling the callback associated with a watcher. 4901The act of calling the callback associated with a watcher.
4552 4902
4553=item event 4903=item event
4554 4904
4555A change of state of some external event, such as data now being available 4905A change of state of some external event, such as data now being available
4556for reading on a file descriptor, time having passed or simply not having 4906for reading on a file descriptor, time having passed or simply not having
4557any other events happening anymore. 4907any other events happening anymore.
4558 4908
4559In libev, events are represented as single bits (such as C<EV_READ> or 4909In libev, events are represented as single bits (such as C<EV_READ> or
4560C<EV_TIMEOUT>). 4910C<EV_TIMER>).
4561 4911
4562=item event library 4912=item event library
4563 4913
4564A software package implementing an event model and loop. 4914A software package implementing an event model and loop.
4565 4915
4573The model used to describe how an event loop handles and processes 4923The model used to describe how an event loop handles and processes
4574watchers and events. 4924watchers and events.
4575 4925
4576=item pending 4926=item pending
4577 4927
4578A watcher is pending as soon as the corresponding event has been detected, 4928A watcher is pending as soon as the corresponding event has been
4579and stops being pending as soon as the watcher will be invoked or its 4929detected. See L<WATCHER STATES> for details.
4580pending status is explicitly cleared by the application.
4581
4582A watcher can be pending, but not active. Stopping a watcher also clears
4583its pending status.
4584 4930
4585=item real time 4931=item real time
4586 4932
4587The physical time that is observed. It is apparently strictly monotonic :) 4933The physical time that is observed. It is apparently strictly monotonic :)
4588 4934
4595=item watcher 4941=item watcher
4596 4942
4597A data structure that describes interest in certain events. Watchers need 4943A data structure that describes interest in certain events. Watchers need
4598to be started (attached to an event loop) before they can receive events. 4944to be started (attached to an event loop) before they can receive events.
4599 4945
4600=item watcher invocation
4601
4602The act of calling the callback associated with a watcher.
4603
4604=back 4946=back
4605 4947
4606=head1 AUTHOR 4948=head1 AUTHOR
4607 4949
4608Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 4950Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines