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

Comparing libev/ev.pod (file contents):
Revision 1.231 by root, Wed Apr 15 19:35:53 2009 UTC vs.
Revision 1.285 by root, Tue Mar 16 00:20:17 2010 UTC

62 62
63 // unloop was called, so exit 63 // unloop was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
67=head1 DESCRIPTION 67=head1 ABOUT THIS DOCUMENT
68
69This document documents the libev software package.
68 70
69The newest version of this document is also available as an html-formatted 71The newest version of this document is also available as an html-formatted
70web page you might find easier to navigate when reading it for the first 72web page you might find easier to navigate when reading it for the first
71time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>. 73time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
74
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
77on event-based programming, nor will it introduce event-based programming
78with libev.
79
80Familarity with event based programming techniques in general is assumed
81throughout this document.
82
83=head1 ABOUT LIBEV
72 84
73Libev 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
74file descriptor being readable or a timeout occurring), and it will manage 86file descriptor being readable or a timeout occurring), and it will manage
75these event sources and provide your program with events. 87these event sources and provide your program with events.
76 88
86=head2 FEATURES 98=head2 FEATURES
87 99
88Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
89BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
90for file descriptor events (C<ev_io>), the Linux C<inotify> interface 102for file descriptor events (C<ev_io>), the Linux C<inotify> interface
91(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 103(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
92with customised rescheduling (C<ev_periodic>), synchronous signals 104inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
93(C<ev_signal>), process status change events (C<ev_child>), and event 105timers (C<ev_timer>), absolute timers with customised rescheduling
94watchers dealing with the event loop mechanism itself (C<ev_idle>, 106(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
95C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as 107change events (C<ev_child>), and event watchers dealing with the event
96file watchers (C<ev_stat>) and even limited support for fork events 108loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
97(C<ev_fork>). 109C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
110limited support for fork events (C<ev_fork>).
98 111
99It also is quite fast (see this 112It also is quite fast (see this
100L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 113L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
101for example). 114for example).
102 115
105Libev is very configurable. In this manual the default (and most common) 118Libev is very configurable. In this manual the default (and most common)
106configuration will be described, which supports multiple event loops. For 119configuration will be described, which supports multiple event loops. For
107more info about various configuration options please have a look at 120more info about various configuration options please have a look at
108B<EMBED> section in this manual. If libev was configured without support 121B<EMBED> section in this manual. If libev was configured without support
109for multiple event loops, then all functions taking an initial argument of 122for multiple event loops, then all functions taking an initial argument of
110name C<loop> (which is always of type C<ev_loop *>) will not have 123name C<loop> (which is always of type C<struct ev_loop *>) will not have
111this argument. 124this argument.
112 125
113=head2 TIME REPRESENTATION 126=head2 TIME REPRESENTATION
114 127
115Libev represents time as a single floating point number, representing the 128Libev represents time as a single floating point number, representing
116(fractional) number of seconds since the (POSIX) epoch (somewhere near 129the (fractional) number of seconds since the (POSIX) epoch (somewhere
117the beginning of 1970, details are complicated, don't ask). This type is 130near the beginning of 1970, details are complicated, don't ask). This
118called C<ev_tstamp>, which is what you should use too. It usually aliases 131type is called C<ev_tstamp>, which is what you should use too. It usually
119to the C<double> type in C, and when you need to do any calculations on 132aliases to the C<double> type in C. When you need to do any calculations
120it, you should treat it as some floating point value. Unlike the name 133on it, you should treat it as some floating point value. Unlike the name
121component C<stamp> might indicate, it is also used for time differences 134component C<stamp> might indicate, it is also used for time differences
122throughout libev. 135throughout libev.
123 136
124=head1 ERROR HANDLING 137=head1 ERROR HANDLING
125 138
350flag. 363flag.
351 364
352This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 365This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
353environment variable. 366environment variable.
354 367
368=item C<EVFLAG_NOINOTIFY>
369
370When this flag is specified, then libev will not attempt to use the
371I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
372testing, this flag can be useful to conserve inotify file descriptors, as
373otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374
375=item C<EVFLAG_SIGNALFD>
376
377When this flag is specified, then libev will attempt to use the
378I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API
379delivers signals synchronously, which makes it both faster and might make
380it possible to get the queued signal data. It can also simplify signal
381handling with threads, as long as you properly block signals in your
382threads that are not interested in handling them.
383
384Signalfd will not be used by default as this changes your signal mask, and
385there are a lot of shoddy libraries and programs (glib's threadpool for
386example) that can't properly initialise their signal masks.
387
355=item C<EVBACKEND_SELECT> (value 1, portable select backend) 388=item C<EVBACKEND_SELECT> (value 1, portable select backend)
356 389
357This is your standard select(2) backend. Not I<completely> standard, as 390This is your standard select(2) backend. Not I<completely> standard, as
358libev tries to roll its own fd_set with no limits on the number of fds, 391libev tries to roll its own fd_set with no limits on the number of fds,
359but if that fails, expect a fairly low limit on the number of fds when 392but if that fails, expect a fairly low limit on the number of fds when
382 415
383This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 416This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
384C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 417C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
385 418
386=item C<EVBACKEND_EPOLL> (value 4, Linux) 419=item C<EVBACKEND_EPOLL> (value 4, Linux)
420
421Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
422kernels).
387 423
388For few fds, this backend is a bit little slower than poll and select, 424For few fds, this backend is a bit little slower than poll and select,
389but it scales phenomenally better. While poll and select usually scale 425but it scales phenomenally better. While poll and select usually scale
390like O(total_fds) where n is the total number of fds (or the highest fd), 426like O(total_fds) where n is the total number of fds (or the highest fd),
391epoll scales either O(1) or O(active_fds). 427epoll scales either O(1) or O(active_fds).
506 542
507It is definitely not recommended to use this flag. 543It is definitely not recommended to use this flag.
508 544
509=back 545=back
510 546
511If one or more of these are or'ed into the flags value, then only these 547If one or more of the backend flags are or'ed into the flags value,
512backends will be tried (in the reverse order as listed here). If none are 548then only these backends will be tried (in the reverse order as listed
513specified, all backends in C<ev_recommended_backends ()> will be tried. 549here). If none are specified, all backends in C<ev_recommended_backends
550()> will be tried.
514 551
515Example: This is the most typical usage. 552Example: This is the most typical usage.
516 553
517 if (!ev_default_loop (0)) 554 if (!ev_default_loop (0))
518 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 555 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
561as signal and child watchers) would need to be stopped manually. 598as signal and child watchers) would need to be stopped manually.
562 599
563In general it is not advisable to call this function except in the 600In general it is not advisable to call this function except in the
564rare occasion where you really need to free e.g. the signal handling 601rare occasion where you really need to free e.g. the signal handling
565pipe fds. If you need dynamically allocated loops it is better to use 602pipe fds. If you need dynamically allocated loops it is better to use
566C<ev_loop_new> and C<ev_loop_destroy>). 603C<ev_loop_new> and C<ev_loop_destroy>.
567 604
568=item ev_loop_destroy (loop) 605=item ev_loop_destroy (loop)
569 606
570Like C<ev_default_destroy>, but destroys an event loop created by an 607Like C<ev_default_destroy>, but destroys an event loop created by an
571earlier call to C<ev_loop_new>. 608earlier call to C<ev_loop_new>.
609 646
610This value can sometimes be useful as a generation counter of sorts (it 647This value can sometimes be useful as a generation counter of sorts (it
611"ticks" the number of loop iterations), as it roughly corresponds with 648"ticks" the number of loop iterations), as it roughly corresponds with
612C<ev_prepare> and C<ev_check> calls. 649C<ev_prepare> and C<ev_check> calls.
613 650
651=item unsigned int ev_loop_depth (loop)
652
653Returns the number of times C<ev_loop> was entered minus the number of
654times C<ev_loop> was exited, in other words, the recursion depth.
655
656Outside C<ev_loop>, this number is zero. In a callback, this number is
657C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
658in which case it is higher.
659
660Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
661etc.), doesn't count as exit.
662
614=item unsigned int ev_backend (loop) 663=item unsigned int ev_backend (loop)
615 664
616Returns one of the C<EVBACKEND_*> flags indicating the event backend in 665Returns one of the C<EVBACKEND_*> flags indicating the event backend in
617use. 666use.
618 667
632 681
633This function is rarely useful, but when some event callback runs for a 682This function is rarely useful, but when some event callback runs for a
634very long time without entering the event loop, updating libev's idea of 683very long time without entering the event loop, updating libev's idea of
635the current time is a good idea. 684the current time is a good idea.
636 685
637See also "The special problem of time updates" in the C<ev_timer> section. 686See also L<The special problem of time updates> in the C<ev_timer> section.
638 687
639=item ev_suspend (loop) 688=item ev_suspend (loop)
640 689
641=item ev_resume (loop) 690=item ev_resume (loop)
642 691
663event loop time (see C<ev_now_update>). 712event loop time (see C<ev_now_update>).
664 713
665=item ev_loop (loop, int flags) 714=item ev_loop (loop, int flags)
666 715
667Finally, this is it, the event handler. This function usually is called 716Finally, this is it, the event handler. This function usually is called
668after you initialised all your watchers and you want to start handling 717after you have initialised all your watchers and you want to start
669events. 718handling events.
670 719
671If the flags argument is specified as C<0>, it will not return until 720If the flags argument is specified as C<0>, it will not return until
672either no event watchers are active anymore or C<ev_unloop> was called. 721either no event watchers are active anymore or C<ev_unloop> was called.
673 722
674Please note that an explicit C<ev_unloop> is usually better than 723Please note that an explicit C<ev_unloop> is usually better than
748 797
749Ref/unref can be used to add or remove a reference count on the event 798Ref/unref can be used to add or remove a reference count on the event
750loop: Every watcher keeps one reference, and as long as the reference 799loop: Every watcher keeps one reference, and as long as the reference
751count is nonzero, C<ev_loop> will not return on its own. 800count is nonzero, C<ev_loop> will not return on its own.
752 801
753If you have a watcher you never unregister that should not keep C<ev_loop> 802This is useful when you have a watcher that you never intend to
754from returning, call ev_unref() after starting, and ev_ref() before 803unregister, but that nevertheless should not keep C<ev_loop> from
804returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
755stopping it. 805before stopping it.
756 806
757As an example, libev itself uses this for its internal signal pipe: It 807As an example, libev itself uses this for its internal signal pipe: It
758is not visible to the libev user and should not keep C<ev_loop> from 808is not visible to the libev user and should not keep C<ev_loop> from
759exiting if no event watchers registered by it are active. It is also an 809exiting if no event watchers registered by it are active. It is also an
760excellent way to do this for generic recurring timers or from within 810excellent way to do this for generic recurring timers or from within
799 849
800By setting a higher I<io collect interval> you allow libev to spend more 850By setting a higher I<io collect interval> you allow libev to spend more
801time collecting I/O events, so you can handle more events per iteration, 851time collecting I/O events, so you can handle more events per iteration,
802at the cost of increasing latency. Timeouts (both C<ev_periodic> and 852at the cost of increasing latency. Timeouts (both C<ev_periodic> and
803C<ev_timer>) will be not affected. Setting this to a non-null value will 853C<ev_timer>) will be not affected. Setting this to a non-null value will
804introduce an additional C<ev_sleep ()> call into most loop iterations. 854introduce an additional C<ev_sleep ()> call into most loop iterations. The
855sleep time ensures that libev will not poll for I/O events more often then
856once per this interval, on average.
805 857
806Likewise, by setting a higher I<timeout collect interval> you allow libev 858Likewise, by setting a higher I<timeout collect interval> you allow libev
807to spend more time collecting timeouts, at the expense of increased 859to spend more time collecting timeouts, at the expense of increased
808latency/jitter/inexactness (the watcher callback will be called 860latency/jitter/inexactness (the watcher callback will be called
809later). C<ev_io> watchers will not be affected. Setting this to a non-null 861later). C<ev_io> watchers will not be affected. Setting this to a non-null
811 863
812Many (busy) programs can usually benefit by setting the I/O collect 864Many (busy) programs can usually benefit by setting the I/O collect
813interval to a value near C<0.1> or so, which is often enough for 865interval to a value near C<0.1> or so, which is often enough for
814interactive servers (of course not for games), likewise for timeouts. It 866interactive servers (of course not for games), likewise for timeouts. It
815usually doesn't make much sense to set it to a lower value than C<0.01>, 867usually doesn't make much sense to set it to a lower value than C<0.01>,
816as this approaches the timing granularity of most systems. 868as this approaches the timing granularity of most systems. Note that if
869you do transactions with the outside world and you can't increase the
870parallelity, then this setting will limit your transaction rate (if you
871need to poll once per transaction and the I/O collect interval is 0.01,
872then you can't do more than 100 transations per second).
817 873
818Setting the I<timeout collect interval> can improve the opportunity for 874Setting the I<timeout collect interval> can improve the opportunity for
819saving power, as the program will "bundle" timer callback invocations that 875saving power, as the program will "bundle" timer callback invocations that
820are "near" in time together, by delaying some, thus reducing the number of 876are "near" in time together, by delaying some, thus reducing the number of
821times the process sleeps and wakes up again. Another useful technique to 877times the process sleeps and wakes up again. Another useful technique to
822reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure 878reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
823they fire on, say, one-second boundaries only. 879they fire on, say, one-second boundaries only.
880
881Example: we only need 0.1s timeout granularity, and we wish not to poll
882more often than 100 times per second:
883
884 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
885 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
886
887=item ev_invoke_pending (loop)
888
889This call will simply invoke all pending watchers while resetting their
890pending state. Normally, C<ev_loop> does this automatically when required,
891but when overriding the invoke callback this call comes handy.
892
893=item int ev_pending_count (loop)
894
895Returns the number of pending watchers - zero indicates that no watchers
896are pending.
897
898=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
899
900This overrides the invoke pending functionality of the loop: Instead of
901invoking all pending watchers when there are any, C<ev_loop> will call
902this callback instead. This is useful, for example, when you want to
903invoke the actual watchers inside another context (another thread etc.).
904
905If you want to reset the callback, use C<ev_invoke_pending> as new
906callback.
907
908=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
909
910Sometimes you want to share the same loop between multiple threads. This
911can be done relatively simply by putting mutex_lock/unlock calls around
912each call to a libev function.
913
914However, C<ev_loop> can run an indefinite time, so it is not feasible to
915wait for it to return. One way around this is to wake up the loop via
916C<ev_unloop> and C<av_async_send>, another way is to set these I<release>
917and I<acquire> callbacks on the loop.
918
919When set, then C<release> will be called just before the thread is
920suspended waiting for new events, and C<acquire> is called just
921afterwards.
922
923Ideally, C<release> will just call your mutex_unlock function, and
924C<acquire> will just call the mutex_lock function again.
925
926While event loop modifications are allowed between invocations of
927C<release> and C<acquire> (that's their only purpose after all), no
928modifications done will affect the event loop, i.e. adding watchers will
929have no effect on the set of file descriptors being watched, or the time
930waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it
931to take note of any changes you made.
932
933In theory, threads executing C<ev_loop> will be async-cancel safe between
934invocations of C<release> and C<acquire>.
935
936See also the locking example in the C<THREADS> section later in this
937document.
938
939=item ev_set_userdata (loop, void *data)
940
941=item ev_userdata (loop)
942
943Set and retrieve a single C<void *> associated with a loop. When
944C<ev_set_userdata> has never been called, then C<ev_userdata> returns
945C<0.>
946
947These two functions can be used to associate arbitrary data with a loop,
948and are intended solely for the C<invoke_pending_cb>, C<release> and
949C<acquire> callbacks described above, but of course can be (ab-)used for
950any other purpose as well.
824 951
825=item ev_loop_verify (loop) 952=item ev_loop_verify (loop)
826 953
827This function only does something when C<EV_VERIFY> support has been 954This function only does something when C<EV_VERIFY> support has been
828compiled in, which is the default for non-minimal builds. It tries to go 955compiled in, which is the default for non-minimal builds. It tries to go
1005 1132
1006 ev_io w; 1133 ev_io w;
1007 ev_init (&w, my_cb); 1134 ev_init (&w, my_cb);
1008 ev_io_set (&w, STDIN_FILENO, EV_READ); 1135 ev_io_set (&w, STDIN_FILENO, EV_READ);
1009 1136
1010=item C<ev_TYPE_set> (ev_TYPE *, [args]) 1137=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1011 1138
1012This macro initialises the type-specific parts of a watcher. You need to 1139This macro initialises the type-specific parts of a watcher. You need to
1013call C<ev_init> at least once before you call this macro, but you can 1140call C<ev_init> at least once before you call this macro, but you can
1014call C<ev_TYPE_set> any number of times. You must not, however, call this 1141call C<ev_TYPE_set> any number of times. You must not, however, call this
1015macro on a watcher that is active (it can be pending, however, which is a 1142macro on a watcher that is active (it can be pending, however, which is a
1028 1155
1029Example: Initialise and set an C<ev_io> watcher in one step. 1156Example: Initialise and set an C<ev_io> watcher in one step.
1030 1157
1031 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); 1158 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1032 1159
1033=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 1160=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1034 1161
1035Starts (activates) the given watcher. Only active watchers will receive 1162Starts (activates) the given watcher. Only active watchers will receive
1036events. If the watcher is already active nothing will happen. 1163events. If the watcher is already active nothing will happen.
1037 1164
1038Example: Start the C<ev_io> watcher that is being abused as example in this 1165Example: Start the C<ev_io> watcher that is being abused as example in this
1039whole section. 1166whole section.
1040 1167
1041 ev_io_start (EV_DEFAULT_UC, &w); 1168 ev_io_start (EV_DEFAULT_UC, &w);
1042 1169
1043=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 1170=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1044 1171
1045Stops the given watcher if active, and clears the pending status (whether 1172Stops the given watcher if active, and clears the pending status (whether
1046the watcher was active or not). 1173the watcher was active or not).
1047 1174
1048It is possible that stopped watchers are pending - for example, 1175It is possible that stopped watchers are pending - for example,
1073=item ev_cb_set (ev_TYPE *watcher, callback) 1200=item ev_cb_set (ev_TYPE *watcher, callback)
1074 1201
1075Change the callback. You can change the callback at virtually any time 1202Change the callback. You can change the callback at virtually any time
1076(modulo threads). 1203(modulo threads).
1077 1204
1078=item ev_set_priority (ev_TYPE *watcher, priority) 1205=item ev_set_priority (ev_TYPE *watcher, int priority)
1079 1206
1080=item int ev_priority (ev_TYPE *watcher) 1207=item int ev_priority (ev_TYPE *watcher)
1081 1208
1082Set and query the priority of the watcher. The priority is a small 1209Set and query the priority of the watcher. The priority is a small
1083integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> 1210integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1084(default: C<-2>). Pending watchers with higher priority will be invoked 1211(default: C<-2>). Pending watchers with higher priority will be invoked
1085before watchers with lower priority, but priority will not keep watchers 1212before watchers with lower priority, but priority will not keep watchers
1086from being executed (except for C<ev_idle> watchers). 1213from being executed (except for C<ev_idle> watchers).
1087 1214
1088This means that priorities are I<only> used for ordering callback
1089invocation after new events have been received. This is useful, for
1090example, to reduce latency after idling, or more often, to bind two
1091watchers on the same event and make sure one is called first.
1092
1093If you need to suppress invocation when higher priority events are pending 1215If you need to suppress invocation when higher priority events are pending
1094you need to look at C<ev_idle> watchers, which provide this functionality. 1216you need to look at C<ev_idle> watchers, which provide this functionality.
1095 1217
1096You I<must not> change the priority of a watcher as long as it is active or 1218You I<must not> change the priority of a watcher as long as it is active or
1097pending. 1219pending.
1098
1099The default priority used by watchers when no priority has been set is
1100always C<0>, which is supposed to not be too high and not be too low :).
1101 1220
1102Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is 1221Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1103fine, as long as you do not mind that the priority value you query might 1222fine, as long as you do not mind that the priority value you query might
1104or might not have been clamped to the valid range. 1223or might not have been clamped to the valid range.
1224
1225The default priority used by watchers when no priority has been set is
1226always C<0>, which is supposed to not be too high and not be too low :).
1227
1228See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1229priorities.
1105 1230
1106=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1231=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1107 1232
1108Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1233Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1109C<loop> nor C<revents> need to be valid as long as the watcher callback 1234C<loop> nor C<revents> need to be valid as long as the watcher callback
1116returns its C<revents> bitset (as if its callback was invoked). If the 1241returns its C<revents> bitset (as if its callback was invoked). If the
1117watcher isn't pending it does nothing and returns C<0>. 1242watcher isn't pending it does nothing and returns C<0>.
1118 1243
1119Sometimes it can be useful to "poll" a watcher instead of waiting for its 1244Sometimes it can be useful to "poll" a watcher instead of waiting for its
1120callback to be invoked, which can be accomplished with this function. 1245callback to be invoked, which can be accomplished with this function.
1246
1247=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1248
1249Feeds the given event set into the event loop, as if the specified event
1250had happened for the specified watcher (which must be a pointer to an
1251initialised but not necessarily started event watcher). Obviously you must
1252not free the watcher as long as it has pending events.
1253
1254Stopping the watcher, letting libev invoke it, or calling
1255C<ev_clear_pending> will clear the pending event, even if the watcher was
1256not started in the first place.
1257
1258See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1259functions that do not need a watcher.
1121 1260
1122=back 1261=back
1123 1262
1124 1263
1125=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1264=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1174 #include <stddef.h> 1313 #include <stddef.h>
1175 1314
1176 static void 1315 static void
1177 t1_cb (EV_P_ ev_timer *w, int revents) 1316 t1_cb (EV_P_ ev_timer *w, int revents)
1178 { 1317 {
1179 struct my_biggy big = (struct my_biggy * 1318 struct my_biggy big = (struct my_biggy *)
1180 (((char *)w) - offsetof (struct my_biggy, t1)); 1319 (((char *)w) - offsetof (struct my_biggy, t1));
1181 } 1320 }
1182 1321
1183 static void 1322 static void
1184 t2_cb (EV_P_ ev_timer *w, int revents) 1323 t2_cb (EV_P_ ev_timer *w, int revents)
1185 { 1324 {
1186 struct my_biggy big = (struct my_biggy * 1325 struct my_biggy big = (struct my_biggy *)
1187 (((char *)w) - offsetof (struct my_biggy, t2)); 1326 (((char *)w) - offsetof (struct my_biggy, t2));
1188 } 1327 }
1328
1329=head2 WATCHER PRIORITY MODELS
1330
1331Many event loops support I<watcher priorities>, which are usually small
1332integers that influence the ordering of event callback invocation
1333between watchers in some way, all else being equal.
1334
1335In libev, Watcher priorities can be set using C<ev_set_priority>. See its
1336description for the more technical details such as the actual priority
1337range.
1338
1339There are two common ways how these these priorities are being interpreted
1340by event loops:
1341
1342In the more common lock-out model, higher priorities "lock out" invocation
1343of lower priority watchers, which means as long as higher priority
1344watchers receive events, lower priority watchers are not being invoked.
1345
1346The less common only-for-ordering model uses priorities solely to order
1347callback invocation within a single event loop iteration: Higher priority
1348watchers are invoked before lower priority ones, but they all get invoked
1349before polling for new events.
1350
1351Libev uses the second (only-for-ordering) model for all its watchers
1352except for idle watchers (which use the lock-out model).
1353
1354The rationale behind this is that implementing the lock-out model for
1355watchers is not well supported by most kernel interfaces, and most event
1356libraries will just poll for the same events again and again as long as
1357their callbacks have not been executed, which is very inefficient in the
1358common case of one high-priority watcher locking out a mass of lower
1359priority ones.
1360
1361Static (ordering) priorities are most useful when you have two or more
1362watchers handling the same resource: a typical usage example is having an
1363C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle
1364timeouts. Under load, data might be received while the program handles
1365other jobs, but since timers normally get invoked first, the timeout
1366handler will be executed before checking for data. In that case, giving
1367the timer a lower priority than the I/O watcher ensures that I/O will be
1368handled first even under adverse conditions (which is usually, but not
1369always, what you want).
1370
1371Since idle watchers use the "lock-out" model, meaning that idle watchers
1372will only be executed when no same or higher priority watchers have
1373received events, they can be used to implement the "lock-out" model when
1374required.
1375
1376For example, to emulate how many other event libraries handle priorities,
1377you can associate an C<ev_idle> watcher to each such watcher, and in
1378the normal watcher callback, you just start the idle watcher. The real
1379processing is done in the idle watcher callback. This causes libev to
1380continously poll and process kernel event data for the watcher, but when
1381the lock-out case is known to be rare (which in turn is rare :), this is
1382workable.
1383
1384Usually, however, the lock-out model implemented that way will perform
1385miserably under the type of load it was designed to handle. In that case,
1386it might be preferable to stop the real watcher before starting the
1387idle watcher, so the kernel will not have to process the event in case
1388the actual processing will be delayed for considerable time.
1389
1390Here is an example of an I/O watcher that should run at a strictly lower
1391priority than the default, and which should only process data when no
1392other events are pending:
1393
1394 ev_idle idle; // actual processing watcher
1395 ev_io io; // actual event watcher
1396
1397 static void
1398 io_cb (EV_P_ ev_io *w, int revents)
1399 {
1400 // stop the I/O watcher, we received the event, but
1401 // are not yet ready to handle it.
1402 ev_io_stop (EV_A_ w);
1403
1404 // start the idle watcher to ahndle the actual event.
1405 // it will not be executed as long as other watchers
1406 // with the default priority are receiving events.
1407 ev_idle_start (EV_A_ &idle);
1408 }
1409
1410 static void
1411 idle_cb (EV_P_ ev_idle *w, int revents)
1412 {
1413 // actual processing
1414 read (STDIN_FILENO, ...);
1415
1416 // have to start the I/O watcher again, as
1417 // we have handled the event
1418 ev_io_start (EV_P_ &io);
1419 }
1420
1421 // initialisation
1422 ev_idle_init (&idle, idle_cb);
1423 ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ);
1424 ev_io_start (EV_DEFAULT_ &io);
1425
1426In the "real" world, it might also be beneficial to start a timer, so that
1427low-priority connections can not be locked out forever under load. This
1428enables your program to keep a lower latency for important connections
1429during short periods of high load, while not completely locking out less
1430important ones.
1189 1431
1190 1432
1191=head1 WATCHER TYPES 1433=head1 WATCHER TYPES
1192 1434
1193This section describes each watcher in detail, but will not repeat 1435This section describes each watcher in detail, but will not repeat
1219descriptors to non-blocking mode is also usually a good idea (but not 1461descriptors to non-blocking mode is also usually a good idea (but not
1220required if you know what you are doing). 1462required if you know what you are doing).
1221 1463
1222If you cannot use non-blocking mode, then force the use of a 1464If you cannot use non-blocking mode, then force the use of a
1223known-to-be-good backend (at the time of this writing, this includes only 1465known-to-be-good backend (at the time of this writing, this includes only
1224C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1466C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1467descriptors for which non-blocking operation makes no sense (such as
1468files) - libev doesn't guarentee any specific behaviour in that case.
1225 1469
1226Another thing you have to watch out for is that it is quite easy to 1470Another thing you have to watch out for is that it is quite easy to
1227receive "spurious" readiness notifications, that is your callback might 1471receive "spurious" readiness notifications, that is your callback might
1228be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1472be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1229because there is no data. Not only are some backends known to create a 1473because there is no data. Not only are some backends known to create a
1294 1538
1295So when you encounter spurious, unexplained daemon exits, make sure you 1539So when you encounter spurious, unexplained daemon exits, make sure you
1296ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1540ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1297somewhere, as that would have given you a big clue). 1541somewhere, as that would have given you a big clue).
1298 1542
1543=head3 The special problem of accept()ing when you can't
1544
1545Many implementations of the POSIX C<accept> function (for example,
1546found in port-2004 Linux) have the peculiar behaviour of not removing a
1547connection from the pending queue in all error cases.
1548
1549For example, larger servers often run out of file descriptors (because
1550of resource limits), causing C<accept> to fail with C<ENFILE> but not
1551rejecting the connection, leading to libev signalling readiness on
1552the next iteration again (the connection still exists after all), and
1553typically causing the program to loop at 100% CPU usage.
1554
1555Unfortunately, the set of errors that cause this issue differs between
1556operating systems, there is usually little the app can do to remedy the
1557situation, and no known thread-safe method of removing the connection to
1558cope with overload is known (to me).
1559
1560One of the easiest ways to handle this situation is to just ignore it
1561- when the program encounters an overload, it will just loop until the
1562situation is over. While this is a form of busy waiting, no OS offers an
1563event-based way to handle this situation, so it's the best one can do.
1564
1565A better way to handle the situation is to log any errors other than
1566C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
1567messages, and continue as usual, which at least gives the user an idea of
1568what could be wrong ("raise the ulimit!"). For extra points one could stop
1569the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
1570usage.
1571
1572If your program is single-threaded, then you could also keep a dummy file
1573descriptor for overload situations (e.g. by opening F</dev/null>), and
1574when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
1575close that fd, and create a new dummy fd. This will gracefully refuse
1576clients under typical overload conditions.
1577
1578The last way to handle it is to simply log the error and C<exit>, as
1579is often done with C<malloc> failures, but this results in an easy
1580opportunity for a DoS attack.
1299 1581
1300=head3 Watcher-Specific Functions 1582=head3 Watcher-Specific Functions
1301 1583
1302=over 4 1584=over 4
1303 1585
1350year, it will still time out after (roughly) one hour. "Roughly" because 1632year, it will still time out after (roughly) one hour. "Roughly" because
1351detecting time jumps is hard, and some inaccuracies are unavoidable (the 1633detecting time jumps is hard, and some inaccuracies are unavoidable (the
1352monotonic clock option helps a lot here). 1634monotonic clock option helps a lot here).
1353 1635
1354The callback is guaranteed to be invoked only I<after> its timeout has 1636The callback is guaranteed to be invoked only I<after> its timeout has
1355passed. If multiple timers become ready during the same loop iteration 1637passed (not I<at>, so on systems with very low-resolution clocks this
1356then the ones with earlier time-out values are invoked before ones with 1638might introduce a small delay). If multiple timers become ready during the
1357later time-out values (but this is no longer true when a callback calls 1639same loop iteration then the ones with earlier time-out values are invoked
1358C<ev_loop> recursively). 1640before ones of the same priority with later time-out values (but this is
1641no longer true when a callback calls C<ev_loop> recursively).
1359 1642
1360=head3 Be smart about timeouts 1643=head3 Be smart about timeouts
1361 1644
1362Many real-world problems involve some kind of timeout, usually for error 1645Many real-world problems involve some kind of timeout, usually for error
1363recovery. A typical example is an HTTP request - if the other side hangs, 1646recovery. A typical example is an HTTP request - if the other side hangs,
1407C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> 1690C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1408member and C<ev_timer_again>. 1691member and C<ev_timer_again>.
1409 1692
1410At start: 1693At start:
1411 1694
1412 ev_timer_init (timer, callback); 1695 ev_init (timer, callback);
1413 timer->repeat = 60.; 1696 timer->repeat = 60.;
1414 ev_timer_again (loop, timer); 1697 ev_timer_again (loop, timer);
1415 1698
1416Each time there is some activity: 1699Each time there is some activity:
1417 1700
1479 1762
1480To start the timer, simply initialise the watcher and set C<last_activity> 1763To start the timer, simply initialise the watcher and set C<last_activity>
1481to the current time (meaning we just have some activity :), then call the 1764to the current time (meaning we just have some activity :), then call the
1482callback, which will "do the right thing" and start the timer: 1765callback, which will "do the right thing" and start the timer:
1483 1766
1484 ev_timer_init (timer, callback); 1767 ev_init (timer, callback);
1485 last_activity = ev_now (loop); 1768 last_activity = ev_now (loop);
1486 callback (loop, timer, EV_TIMEOUT); 1769 callback (loop, timer, EV_TIMEOUT);
1487 1770
1488And when there is some activity, simply store the current time in 1771And when there is some activity, simply store the current time in
1489C<last_activity>, no libev calls at all: 1772C<last_activity>, no libev calls at all:
1550 1833
1551If the event loop is suspended for a long time, you can also force an 1834If the event loop is suspended for a long time, you can also force an
1552update of the time returned by C<ev_now ()> by calling C<ev_now_update 1835update of the time returned by C<ev_now ()> by calling C<ev_now_update
1553()>. 1836()>.
1554 1837
1838=head3 The special problems of suspended animation
1839
1840When you leave the server world it is quite customary to hit machines that
1841can suspend/hibernate - what happens to the clocks during such a suspend?
1842
1843Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1844all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1845to run until the system is suspended, but they will not advance while the
1846system is suspended. That means, on resume, it will be as if the program
1847was frozen for a few seconds, but the suspend time will not be counted
1848towards C<ev_timer> when a monotonic clock source is used. The real time
1849clock advanced as expected, but if it is used as sole clocksource, then a
1850long suspend would be detected as a time jump by libev, and timers would
1851be adjusted accordingly.
1852
1853I would not be surprised to see different behaviour in different between
1854operating systems, OS versions or even different hardware.
1855
1856The other form of suspend (job control, or sending a SIGSTOP) will see a
1857time jump in the monotonic clocks and the realtime clock. If the program
1858is suspended for a very long time, and monotonic clock sources are in use,
1859then you can expect C<ev_timer>s to expire as the full suspension time
1860will be counted towards the timers. When no monotonic clock source is in
1861use, then libev will again assume a timejump and adjust accordingly.
1862
1863It might be beneficial for this latter case to call C<ev_suspend>
1864and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1865deterministic behaviour in this case (you can do nothing against
1866C<SIGSTOP>).
1867
1555=head3 Watcher-Specific Functions and Data Members 1868=head3 Watcher-Specific Functions and Data Members
1556 1869
1557=over 4 1870=over 4
1558 1871
1559=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1872=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1582If the timer is started but non-repeating, stop it (as if it timed out). 1895If the timer is started but non-repeating, stop it (as if it timed out).
1583 1896
1584If the timer is repeating, either start it if necessary (with the 1897If the timer is repeating, either start it if necessary (with the
1585C<repeat> value), or reset the running timer to the C<repeat> value. 1898C<repeat> value), or reset the running timer to the C<repeat> value.
1586 1899
1587This sounds a bit complicated, see "Be smart about timeouts", above, for a 1900This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1588usage example. 1901usage example.
1902
1903=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1904
1905Returns the remaining time until a timer fires. If the timer is active,
1906then this time is relative to the current event loop time, otherwise it's
1907the timeout value currently configured.
1908
1909That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1910C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
1911will return C<4>. When the timer expires and is restarted, it will return
1912roughly C<7> (likely slightly less as callback invocation takes some time,
1913too), and so on.
1589 1914
1590=item ev_tstamp repeat [read-write] 1915=item ev_tstamp repeat [read-write]
1591 1916
1592The current C<repeat> value. Will be used each time the watcher times out 1917The current C<repeat> value. Will be used each time the watcher times out
1593or C<ev_timer_again> is called, and determines the next timeout (if any), 1918or C<ev_timer_again> is called, and determines the next timeout (if any),
1829Signal watchers will trigger an event when the process receives a specific 2154Signal watchers will trigger an event when the process receives a specific
1830signal one or more times. Even though signals are very asynchronous, libev 2155signal one or more times. Even though signals are very asynchronous, libev
1831will try it's best to deliver signals synchronously, i.e. as part of the 2156will try it's best to deliver signals synchronously, i.e. as part of the
1832normal event processing, like any other event. 2157normal event processing, like any other event.
1833 2158
1834If you want signals asynchronously, just use C<sigaction> as you would 2159If you want signals to be delivered truly asynchronously, just use
1835do without libev and forget about sharing the signal. You can even use 2160C<sigaction> as you would do without libev and forget about sharing
1836C<ev_async> from a signal handler to synchronously wake up an event loop. 2161the signal. You can even use C<ev_async> from a signal handler to
2162synchronously wake up an event loop.
1837 2163
1838You can configure as many watchers as you like per signal. Only when the 2164You can configure as many watchers as you like for the same signal, but
2165only within the same loop, i.e. you can watch for C<SIGINT> in your
2166default loop and for C<SIGIO> in another loop, but you cannot watch for
2167C<SIGINT> in both the default loop and another loop at the same time. At
2168the moment, C<SIGCHLD> is permanently tied to the default loop.
2169
1839first watcher gets started will libev actually register a signal handler 2170When the first watcher gets started will libev actually register something
1840with the kernel (thus it coexists with your own signal handlers as long as 2171with the kernel (thus it coexists with your own signal handlers as long as
1841you don't register any with libev for the same signal). Similarly, when 2172you don't register any with libev for the same signal).
1842the last signal watcher for a signal is stopped, libev will reset the
1843signal handler to SIG_DFL (regardless of what it was set to before).
1844 2173
1845If possible and supported, libev will install its handlers with 2174If possible and supported, libev will install its handlers with
1846C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2175C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1847interrupted. If you have a problem with system calls getting interrupted by 2176not be unduly interrupted. If you have a problem with system calls getting
1848signals you can block all signals in an C<ev_check> watcher and unblock 2177interrupted by signals you can block all signals in an C<ev_check> watcher
1849them in an C<ev_prepare> watcher. 2178and unblock them in an C<ev_prepare> watcher.
2179
2180=head3 The special problem of inheritance over fork/execve/pthread_create
2181
2182Both the signal mask (C<sigprocmask>) and the signal disposition
2183(C<sigaction>) are unspecified after starting a signal watcher (and after
2184stopping it again), that is, libev might or might not block the signal,
2185and might or might not set or restore the installed signal handler.
2186
2187While this does not matter for the signal disposition (libev never
2188sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2189C<execve>), this matters for the signal mask: many programs do not expect
2190certain signals to be blocked.
2191
2192This means that before calling C<exec> (from the child) you should reset
2193the signal mask to whatever "default" you expect (all clear is a good
2194choice usually).
2195
2196The simplest way to ensure that the signal mask is reset in the child is
2197to install a fork handler with C<pthread_atfork> that resets it. That will
2198catch fork calls done by libraries (such as the libc) as well.
2199
2200In current versions of libev, the signal will not be blocked indefinitely
2201unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
2202the window of opportunity for problems, it will not go away, as libev
2203I<has> to modify the signal mask, at least temporarily.
2204
2205So I can't stress this enough: I<If you do not reset your signal mask when
2206you expect it to be empty, you have a race condition in your code>. This
2207is not a libev-specific thing, this is true for most event libraries.
1850 2208
1851=head3 Watcher-Specific Functions and Data Members 2209=head3 Watcher-Specific Functions and Data Members
1852 2210
1853=over 4 2211=over 4
1854 2212
1886some child status changes (most typically when a child of yours dies or 2244some child status changes (most typically when a child of yours dies or
1887exits). It is permissible to install a child watcher I<after> the child 2245exits). It is permissible to install a child watcher I<after> the child
1888has been forked (which implies it might have already exited), as long 2246has been forked (which implies it might have already exited), as long
1889as the event loop isn't entered (or is continued from a watcher), i.e., 2247as the event loop isn't entered (or is continued from a watcher), i.e.,
1890forking and then immediately registering a watcher for the child is fine, 2248forking and then immediately registering a watcher for the child is fine,
1891but forking and registering a watcher a few event loop iterations later is 2249but forking and registering a watcher a few event loop iterations later or
1892not. 2250in the next callback invocation is not.
1893 2251
1894Only the default event loop is capable of handling signals, and therefore 2252Only the default event loop is capable of handling signals, and therefore
1895you can only register child watchers in the default event loop. 2253you can only register child watchers in the default event loop.
1896 2254
2255Due to some design glitches inside libev, child watchers will always be
2256handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2257libev)
2258
1897=head3 Process Interaction 2259=head3 Process Interaction
1898 2260
1899Libev grabs C<SIGCHLD> as soon as the default event loop is 2261Libev grabs C<SIGCHLD> as soon as the default event loop is
1900initialised. This is necessary to guarantee proper behaviour even if 2262initialised. This is necessary to guarantee proper behaviour even if the
1901the first child watcher is started after the child exits. The occurrence 2263first child watcher is started after the child exits. The occurrence
1902of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2264of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1903synchronously as part of the event loop processing. Libev always reaps all 2265synchronously as part of the event loop processing. Libev always reaps all
1904children, even ones not watched. 2266children, even ones not watched.
1905 2267
1906=head3 Overriding the Built-In Processing 2268=head3 Overriding the Built-In Processing
1916=head3 Stopping the Child Watcher 2278=head3 Stopping the Child Watcher
1917 2279
1918Currently, the child watcher never gets stopped, even when the 2280Currently, the child watcher never gets stopped, even when the
1919child terminates, so normally one needs to stop the watcher in the 2281child terminates, so normally one needs to stop the watcher in the
1920callback. Future versions of libev might stop the watcher automatically 2282callback. Future versions of libev might stop the watcher automatically
1921when a child exit is detected. 2283when a child exit is detected (calling C<ev_child_stop> twice is not a
2284problem).
1922 2285
1923=head3 Watcher-Specific Functions and Data Members 2286=head3 Watcher-Specific Functions and Data Members
1924 2287
1925=over 4 2288=over 4
1926 2289
2252 // no longer anything immediate to do. 2615 // no longer anything immediate to do.
2253 } 2616 }
2254 2617
2255 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2618 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2256 ev_idle_init (idle_watcher, idle_cb); 2619 ev_idle_init (idle_watcher, idle_cb);
2257 ev_idle_start (loop, idle_cb); 2620 ev_idle_start (loop, idle_watcher);
2258 2621
2259 2622
2260=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2623=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2261 2624
2262Prepare and check watchers are usually (but not always) used in pairs: 2625Prepare and check watchers are usually (but not always) used in pairs:
2355 struct pollfd fds [nfd]; 2718 struct pollfd fds [nfd];
2356 // actual code will need to loop here and realloc etc. 2719 // actual code will need to loop here and realloc etc.
2357 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2720 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2358 2721
2359 /* the callback is illegal, but won't be called as we stop during check */ 2722 /* the callback is illegal, but won't be called as we stop during check */
2360 ev_timer_init (&tw, 0, timeout * 1e-3); 2723 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2361 ev_timer_start (loop, &tw); 2724 ev_timer_start (loop, &tw);
2362 2725
2363 // create one ev_io per pollfd 2726 // create one ev_io per pollfd
2364 for (int i = 0; i < nfd; ++i) 2727 for (int i = 0; i < nfd; ++i)
2365 { 2728 {
2595event loop blocks next and before C<ev_check> watchers are being called, 2958event loop blocks next and before C<ev_check> watchers are being called,
2596and only in the child after the fork. If whoever good citizen calling 2959and only in the child after the fork. If whoever good citizen calling
2597C<ev_default_fork> cheats and calls it in the wrong process, the fork 2960C<ev_default_fork> cheats and calls it in the wrong process, the fork
2598handlers will be invoked, too, of course. 2961handlers will be invoked, too, of course.
2599 2962
2963=head3 The special problem of life after fork - how is it possible?
2964
2965Most uses of C<fork()> consist of forking, then some simple calls to ste
2966up/change the process environment, followed by a call to C<exec()>. This
2967sequence should be handled by libev without any problems.
2968
2969This changes when the application actually wants to do event handling
2970in the child, or both parent in child, in effect "continuing" after the
2971fork.
2972
2973The default mode of operation (for libev, with application help to detect
2974forks) is to duplicate all the state in the child, as would be expected
2975when I<either> the parent I<or> the child process continues.
2976
2977When both processes want to continue using libev, then this is usually the
2978wrong result. In that case, usually one process (typically the parent) is
2979supposed to continue with all watchers in place as before, while the other
2980process typically wants to start fresh, i.e. without any active watchers.
2981
2982The cleanest and most efficient way to achieve that with libev is to
2983simply create a new event loop, which of course will be "empty", and
2984use that for new watchers. This has the advantage of not touching more
2985memory than necessary, and thus avoiding the copy-on-write, and the
2986disadvantage of having to use multiple event loops (which do not support
2987signal watchers).
2988
2989When this is not possible, or you want to use the default loop for
2990other reasons, then in the process that wants to start "fresh", call
2991C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying
2992the default loop will "orphan" (not stop) all registered watchers, so you
2993have to be careful not to execute code that modifies those watchers. Note
2994also that in that case, you have to re-register any signal watchers.
2995
2600=head3 Watcher-Specific Functions and Data Members 2996=head3 Watcher-Specific Functions and Data Members
2601 2997
2602=over 4 2998=over 4
2603 2999
2604=item ev_fork_init (ev_signal *, callback) 3000=item ev_fork_init (ev_signal *, callback)
2633=head3 Queueing 3029=head3 Queueing
2634 3030
2635C<ev_async> does not support queueing of data in any way. The reason 3031C<ev_async> does not support queueing of data in any way. The reason
2636is that the author does not know of a simple (or any) algorithm for a 3032is that the author does not know of a simple (or any) algorithm for a
2637multiple-writer-single-reader queue that works in all cases and doesn't 3033multiple-writer-single-reader queue that works in all cases and doesn't
2638need elaborate support such as pthreads. 3034need elaborate support such as pthreads or unportable memory access
3035semantics.
2639 3036
2640That means that if you want to queue data, you have to provide your own 3037That means that if you want to queue data, you have to provide your own
2641queue. But at least I can tell you how to implement locking around your 3038queue. But at least I can tell you how to implement locking around your
2642queue: 3039queue:
2643 3040
2801 /* doh, nothing entered */; 3198 /* doh, nothing entered */;
2802 } 3199 }
2803 3200
2804 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3201 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2805 3202
2806=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2807
2808Feeds the given event set into the event loop, as if the specified event
2809had happened for the specified watcher (which must be a pointer to an
2810initialised but not necessarily started event watcher).
2811
2812=item ev_feed_fd_event (struct ev_loop *, int fd, int revents) 3203=item ev_feed_fd_event (loop, int fd, int revents)
2813 3204
2814Feed an event on the given fd, as if a file descriptor backend detected 3205Feed an event on the given fd, as if a file descriptor backend detected
2815the given events it. 3206the given events it.
2816 3207
2817=item ev_feed_signal_event (struct ev_loop *loop, int signum) 3208=item ev_feed_signal_event (loop, int signum)
2818 3209
2819Feed an event as if the given signal occurred (C<loop> must be the default 3210Feed an event as if the given signal occurred (C<loop> must be the default
2820loop!). 3211loop!).
2821 3212
2822=back 3213=back
2902 3293
2903=over 4 3294=over 4
2904 3295
2905=item ev::TYPE::TYPE () 3296=item ev::TYPE::TYPE ()
2906 3297
2907=item ev::TYPE::TYPE (struct ev_loop *) 3298=item ev::TYPE::TYPE (loop)
2908 3299
2909=item ev::TYPE::~TYPE 3300=item ev::TYPE::~TYPE
2910 3301
2911The constructor (optionally) takes an event loop to associate the watcher 3302The constructor (optionally) takes an event loop to associate the watcher
2912with. If it is omitted, it will use C<EV_DEFAULT>. 3303with. If it is omitted, it will use C<EV_DEFAULT>.
2989Example: Use a plain function as callback. 3380Example: Use a plain function as callback.
2990 3381
2991 static void io_cb (ev::io &w, int revents) { } 3382 static void io_cb (ev::io &w, int revents) { }
2992 iow.set <io_cb> (); 3383 iow.set <io_cb> ();
2993 3384
2994=item w->set (struct ev_loop *) 3385=item w->set (loop)
2995 3386
2996Associates a different C<struct ev_loop> with this watcher. You can only 3387Associates a different C<struct ev_loop> with this watcher. You can only
2997do this when the watcher is inactive (and not pending either). 3388do this when the watcher is inactive (and not pending either).
2998 3389
2999=item w->set ([arguments]) 3390=item w->set ([arguments])
3096=item Ocaml 3487=item Ocaml
3097 3488
3098Erkki Seppala has written Ocaml bindings for libev, to be found at 3489Erkki Seppala has written Ocaml bindings for libev, to be found at
3099L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3490L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3100 3491
3492=item Lua
3493
3494Brian Maher has written a partial interface to libev for lua (at the
3495time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3496L<http://github.com/brimworks/lua-ev>.
3497
3101=back 3498=back
3102 3499
3103 3500
3104=head1 MACRO MAGIC 3501=head1 MACRO MAGIC
3105 3502
3258 libev.m4 3655 libev.m4
3259 3656
3260=head2 PREPROCESSOR SYMBOLS/MACROS 3657=head2 PREPROCESSOR SYMBOLS/MACROS
3261 3658
3262Libev can be configured via a variety of preprocessor symbols you have to 3659Libev can be configured via a variety of preprocessor symbols you have to
3263define before including any of its files. The default in the absence of 3660define before including (or compiling) any of its files. The default in
3264autoconf is documented for every option. 3661the absence of autoconf is documented for every option.
3662
3663Symbols marked with "(h)" do not change the ABI, and can have different
3664values when compiling libev vs. including F<ev.h>, so it is permissible
3665to redefine them before including F<ev.h> without breakign compatibility
3666to a compiled library. All other symbols change the ABI, which means all
3667users of libev and the libev code itself must be compiled with compatible
3668settings.
3265 3669
3266=over 4 3670=over 4
3267 3671
3268=item EV_STANDALONE 3672=item EV_STANDALONE (h)
3269 3673
3270Must always be C<1> if you do not use autoconf configuration, which 3674Must always be C<1> if you do not use autoconf configuration, which
3271keeps libev from including F<config.h>, and it also defines dummy 3675keeps libev from including F<config.h>, and it also defines dummy
3272implementations for some libevent functions (such as logging, which is not 3676implementations for some libevent functions (such as logging, which is not
3273supported). It will also not define any of the structs usually found in 3677supported). It will also not define any of the structs usually found in
3274F<event.h> that are not directly supported by the libev core alone. 3678F<event.h> that are not directly supported by the libev core alone.
3275 3679
3276In stanbdalone mode, libev will still try to automatically deduce the 3680In standalone mode, libev will still try to automatically deduce the
3277configuration, but has to be more conservative. 3681configuration, but has to be more conservative.
3278 3682
3279=item EV_USE_MONOTONIC 3683=item EV_USE_MONOTONIC
3280 3684
3281If defined to be C<1>, libev will try to detect the availability of the 3685If defined to be C<1>, libev will try to detect the availability of the
3346be used is the winsock select). This means that it will call 3750be used is the winsock select). This means that it will call
3347C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3751C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3348it is assumed that all these functions actually work on fds, even 3752it is assumed that all these functions actually work on fds, even
3349on win32. Should not be defined on non-win32 platforms. 3753on win32. Should not be defined on non-win32 platforms.
3350 3754
3351=item EV_FD_TO_WIN32_HANDLE 3755=item EV_FD_TO_WIN32_HANDLE(fd)
3352 3756
3353If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3757If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3354file descriptors to socket handles. When not defining this symbol (the 3758file descriptors to socket handles. When not defining this symbol (the
3355default), then libev will call C<_get_osfhandle>, which is usually 3759default), then libev will call C<_get_osfhandle>, which is usually
3356correct. In some cases, programs use their own file descriptor management, 3760correct. In some cases, programs use their own file descriptor management,
3357in which case they can provide this function to map fds to socket handles. 3761in which case they can provide this function to map fds to socket handles.
3762
3763=item EV_WIN32_HANDLE_TO_FD(handle)
3764
3765If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3766using the standard C<_open_osfhandle> function. For programs implementing
3767their own fd to handle mapping, overwriting this function makes it easier
3768to do so. This can be done by defining this macro to an appropriate value.
3769
3770=item EV_WIN32_CLOSE_FD(fd)
3771
3772If programs implement their own fd to handle mapping on win32, then this
3773macro can be used to override the C<close> function, useful to unregister
3774file descriptors again. Note that the replacement function has to close
3775the underlying OS handle.
3358 3776
3359=item EV_USE_POLL 3777=item EV_USE_POLL
3360 3778
3361If defined to be C<1>, libev will compile in support for the C<poll>(2) 3779If defined to be C<1>, libev will compile in support for the C<poll>(2)
3362backend. Otherwise it will be enabled on non-win32 platforms. It 3780backend. Otherwise it will be enabled on non-win32 platforms. It
3409as well as for signal and thread safety in C<ev_async> watchers. 3827as well as for signal and thread safety in C<ev_async> watchers.
3410 3828
3411In the absence of this define, libev will use C<sig_atomic_t volatile> 3829In the absence of this define, libev will use C<sig_atomic_t volatile>
3412(from F<signal.h>), which is usually good enough on most platforms. 3830(from F<signal.h>), which is usually good enough on most platforms.
3413 3831
3414=item EV_H 3832=item EV_H (h)
3415 3833
3416The name of the F<ev.h> header file used to include it. The default if 3834The name of the F<ev.h> header file used to include it. The default if
3417undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 3835undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3418used to virtually rename the F<ev.h> header file in case of conflicts. 3836used to virtually rename the F<ev.h> header file in case of conflicts.
3419 3837
3420=item EV_CONFIG_H 3838=item EV_CONFIG_H (h)
3421 3839
3422If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 3840If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3423F<ev.c>'s idea of where to find the F<config.h> file, similarly to 3841F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3424C<EV_H>, above. 3842C<EV_H>, above.
3425 3843
3426=item EV_EVENT_H 3844=item EV_EVENT_H (h)
3427 3845
3428Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 3846Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3429of how the F<event.h> header can be found, the default is C<"event.h">. 3847of how the F<event.h> header can be found, the default is C<"event.h">.
3430 3848
3431=item EV_PROTOTYPES 3849=item EV_PROTOTYPES (h)
3432 3850
3433If defined to be C<0>, then F<ev.h> will not define any function 3851If defined to be C<0>, then F<ev.h> will not define any function
3434prototypes, but still define all the structs and other symbols. This is 3852prototypes, but still define all the structs and other symbols. This is
3435occasionally useful if you want to provide your own wrapper functions 3853occasionally useful if you want to provide your own wrapper functions
3436around libev functions. 3854around libev functions.
3458fine. 3876fine.
3459 3877
3460If your embedding application does not need any priorities, defining these 3878If your embedding application does not need any priorities, defining these
3461both to C<0> will save some memory and CPU. 3879both to C<0> will save some memory and CPU.
3462 3880
3463=item EV_PERIODIC_ENABLE 3881=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
3882EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3883EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3464 3884
3465If undefined or defined to be C<1>, then periodic timers are supported. If 3885If undefined or defined to be C<1> (and the platform supports it), then
3466defined to be C<0>, then they are not. Disabling them saves a few kB of 3886the respective watcher type is supported. If defined to be C<0>, then it
3467code. 3887is not. Disabling watcher types mainly saves codesize.
3468 3888
3469=item EV_IDLE_ENABLE 3889=item EV_FEATURES
3470
3471If undefined or defined to be C<1>, then idle watchers are supported. If
3472defined to be C<0>, then they are not. Disabling them saves a few kB of
3473code.
3474
3475=item EV_EMBED_ENABLE
3476
3477If undefined or defined to be C<1>, then embed watchers are supported. If
3478defined to be C<0>, then they are not. Embed watchers rely on most other
3479watcher types, which therefore must not be disabled.
3480
3481=item EV_STAT_ENABLE
3482
3483If undefined or defined to be C<1>, then stat watchers are supported. If
3484defined to be C<0>, then they are not.
3485
3486=item EV_FORK_ENABLE
3487
3488If undefined or defined to be C<1>, then fork watchers are supported. If
3489defined to be C<0>, then they are not.
3490
3491=item EV_ASYNC_ENABLE
3492
3493If undefined or defined to be C<1>, then async watchers are supported. If
3494defined to be C<0>, then they are not.
3495
3496=item EV_MINIMAL
3497 3890
3498If you need to shave off some kilobytes of code at the expense of some 3891If you need to shave off some kilobytes of code at the expense of some
3499speed, define this symbol to C<1>. Currently this is used to override some 3892speed (but with the full API), you can define this symbol to request
3500inlining decisions, saves roughly 30% code size on amd64. It also selects a 3893certain subsets of functionality. The default is to enable all features
3501much smaller 2-heap for timer management over the default 4-heap. 3894that can be enabled on the platform.
3895
3896Note that using autoconf will usually override most of the features, so
3897using this symbol makes sense mostly when embedding libev.
3898
3899A typical way to use this symbol is to define it to C<0> (or to a bitset
3900with some broad features you want) and then selectively re-enable
3901additional parts you want, for example if you want everything minimal,
3902but multiple event loop support, async and child watchers and the poll
3903backend, use this:
3904
3905 #define EV_FEATURES 0
3906 #define EV_MULTIPLICITY 1
3907 #define EV_USE_POLL 1
3908 #define EV_CHILD_ENABLE 1
3909 #define EV_ASYNC_ENABLE 1
3910
3911The actual value is a bitset, it can be a combination of the following
3912values:
3913
3914=over 4
3915
3916=item C<1> - faster/larger code
3917
3918Use larger code to speed up some operations.
3919
3920Currently this is used to override some inlining decisions (enlarging the roughly
392130% code size on amd64.
3922
3923Also disables C<assert>'s in the code, unless you define C<NDEBUG>
3924explicitly to C<0>.
3925
3926Use of compiler flags such as C<-Os> with gcc that optimise for size are
3927recommended when disabling this feature.
3928
3929=item C<2> - faster/larger data structures
3930
3931Replaces the small 2-heap for timer management by a faster 4-heap, larger
3932hash table sizes and so on. This will usually further increase codesize
3933and can additionally have an effect on the size of data structures at
3934runtime.
3935
3936=item C<4> - full API configuration
3937
3938This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
3939enables multiplicity (C<EV_MULTIPLICITY>=1).
3940
3941It also enables a lot of the "lesser used" core API functions. See C<ev.h>
3942for details on which parts of the API are still available without this
3943feature, and do not complain if this subset changes over time.
3944
3945=item C<8> - enable all optional watcher types
3946
3947Enables all optional watcher types. If you want to selectively enable
3948only some watcher types other than I/O and timers (e.g. prepare,
3949embed, async, child...) you can enable them manually by defining
3950C<EV_watchertype_ENABLE> to C<1> instead.
3951
3952=item C<16> - enable all backends
3953
3954This enables all backends - without this feature, you need to enable at
3955least one backend manually (C<EV_USE_SELECT> is a good choice).
3956
3957=item C<32> - enable OS-specific "helper" APIs
3958
3959Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
3960default.
3961
3962=back
3963
3964Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
3965reduces the compiled size of libev from 24.7Kb to 6.5Kb on my GNU/Linux
3966amd64 system, while still giving you I/O watchers, timers and monotonic
3967clock support.
3968
3969With an intelligent-enough linker (gcc+binutils are intelligent enough
3970when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
3971your program might be left out as well - a binary starting a timer and an
3972I/O watcher then might come out at only 5Kb.
3973
3974=item EV_AVOID_STDIO
3975
3976If this is set to C<1> at compiletime, then libev will avoid using stdio
3977functions (printf, scanf, perror etc.). This will increase the codesize
3978somewhat, but if your program doesn't otherwise depend on stdio and your
3979libc allows it, this avoids linking in the stdio library which is quite
3980big.
3981
3982Note that error messages might become less precise when this option is
3983enabled.
3984
3985=item EV_NSIG
3986
3987The highest supported signal number, +1 (or, the number of
3988signals): Normally, libev tries to deduce the maximum number of signals
3989automatically, but sometimes this fails, in which case it can be
3990specified. Also, using a lower number than detected (C<32> should be
3991good for about any system in existance) can save some memory, as libev
3992statically allocates some 12-24 bytes per signal number.
3502 3993
3503=item EV_PID_HASHSIZE 3994=item EV_PID_HASHSIZE
3504 3995
3505C<ev_child> watchers use a small hash table to distribute workload by 3996C<ev_child> watchers use a small hash table to distribute workload by
3506pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 3997pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3507than enough. If you need to manage thousands of children you might want to 3998usually more than enough. If you need to manage thousands of children you
3508increase this value (I<must> be a power of two). 3999might want to increase this value (I<must> be a power of two).
3509 4000
3510=item EV_INOTIFY_HASHSIZE 4001=item EV_INOTIFY_HASHSIZE
3511 4002
3512C<ev_stat> watchers use a small hash table to distribute workload by 4003C<ev_stat> watchers use a small hash table to distribute workload by
3513inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 4004inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3514usually more than enough. If you need to manage thousands of C<ev_stat> 4005disabled), usually more than enough. If you need to manage thousands of
3515watchers you might want to increase this value (I<must> be a power of 4006C<ev_stat> watchers you might want to increase this value (I<must> be a
3516two). 4007power of two).
3517 4008
3518=item EV_USE_4HEAP 4009=item EV_USE_4HEAP
3519 4010
3520Heaps are not very cache-efficient. To improve the cache-efficiency of the 4011Heaps are not very cache-efficient. To improve the cache-efficiency of the
3521timer and periodics heaps, libev uses a 4-heap when this symbol is defined 4012timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3522to C<1>. The 4-heap uses more complicated (longer) code but has noticeably 4013to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3523faster performance with many (thousands) of watchers. 4014faster performance with many (thousands) of watchers.
3524 4015
3525The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4016The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3526(disabled). 4017will be C<0>.
3527 4018
3528=item EV_HEAP_CACHE_AT 4019=item EV_HEAP_CACHE_AT
3529 4020
3530Heaps are not very cache-efficient. To improve the cache-efficiency of the 4021Heaps are not very cache-efficient. To improve the cache-efficiency of the
3531timer and periodics heaps, libev can cache the timestamp (I<at>) within 4022timer and periodics heaps, libev can cache the timestamp (I<at>) within
3532the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 4023the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3533which uses 8-12 bytes more per watcher and a few hundred bytes more code, 4024which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3534but avoids random read accesses on heap changes. This improves performance 4025but avoids random read accesses on heap changes. This improves performance
3535noticeably with many (hundreds) of watchers. 4026noticeably with many (hundreds) of watchers.
3536 4027
3537The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4028The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3538(disabled). 4029will be C<0>.
3539 4030
3540=item EV_VERIFY 4031=item EV_VERIFY
3541 4032
3542Controls how much internal verification (see C<ev_loop_verify ()>) will 4033Controls how much internal verification (see C<ev_loop_verify ()>) will
3543be done: If set to C<0>, no internal verification code will be compiled 4034be done: If set to C<0>, no internal verification code will be compiled
3545called. If set to C<2>, then the internal verification code will be 4036called. If set to C<2>, then the internal verification code will be
3546called once per loop, which can slow down libev. If set to C<3>, then the 4037called once per loop, which can slow down libev. If set to C<3>, then the
3547verification code will be called very frequently, which will slow down 4038verification code will be called very frequently, which will slow down
3548libev considerably. 4039libev considerably.
3549 4040
3550The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 4041The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3551C<0>. 4042will be C<0>.
3552 4043
3553=item EV_COMMON 4044=item EV_COMMON
3554 4045
3555By default, all watchers have a C<void *data> member. By redefining 4046By default, all watchers have a C<void *data> member. By redefining
3556this macro to a something else you can include more and other types of 4047this macro to a something else you can include more and other types of
3614file. 4105file.
3615 4106
3616The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4107The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3617that everybody includes and which overrides some configure choices: 4108that everybody includes and which overrides some configure choices:
3618 4109
3619 #define EV_MINIMAL 1 4110 #define EV_FEATURES 0
3620 #define EV_USE_POLL 0 4111 #define EV_USE_SELECT 1
3621 #define EV_MULTIPLICITY 0
3622 #define EV_PERIODIC_ENABLE 0
3623 #define EV_STAT_ENABLE 0
3624 #define EV_FORK_ENABLE 0
3625 #define EV_CONFIG_H <config.h> 4112 #define EV_CONFIG_H <config.h>
3626 #define EV_MINPRI 0
3627 #define EV_MAXPRI 0
3628 4113
3629 #include "ev++.h" 4114 #include "ev++.h"
3630 4115
3631And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4116And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3632 4117
3692default loop and triggering an C<ev_async> watcher from the default loop 4177default loop and triggering an C<ev_async> watcher from the default loop
3693watcher callback into the event loop interested in the signal. 4178watcher callback into the event loop interested in the signal.
3694 4179
3695=back 4180=back
3696 4181
4182=head4 THREAD LOCKING EXAMPLE
4183
4184Here is a fictitious example of how to run an event loop in a different
4185thread than where callbacks are being invoked and watchers are
4186created/added/removed.
4187
4188For a real-world example, see the C<EV::Loop::Async> perl module,
4189which uses exactly this technique (which is suited for many high-level
4190languages).
4191
4192The example uses a pthread mutex to protect the loop data, a condition
4193variable to wait for callback invocations, an async watcher to notify the
4194event loop thread and an unspecified mechanism to wake up the main thread.
4195
4196First, you need to associate some data with the event loop:
4197
4198 typedef struct {
4199 mutex_t lock; /* global loop lock */
4200 ev_async async_w;
4201 thread_t tid;
4202 cond_t invoke_cv;
4203 } userdata;
4204
4205 void prepare_loop (EV_P)
4206 {
4207 // for simplicity, we use a static userdata struct.
4208 static userdata u;
4209
4210 ev_async_init (&u->async_w, async_cb);
4211 ev_async_start (EV_A_ &u->async_w);
4212
4213 pthread_mutex_init (&u->lock, 0);
4214 pthread_cond_init (&u->invoke_cv, 0);
4215
4216 // now associate this with the loop
4217 ev_set_userdata (EV_A_ u);
4218 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4219 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4220
4221 // then create the thread running ev_loop
4222 pthread_create (&u->tid, 0, l_run, EV_A);
4223 }
4224
4225The callback for the C<ev_async> watcher does nothing: the watcher is used
4226solely to wake up the event loop so it takes notice of any new watchers
4227that might have been added:
4228
4229 static void
4230 async_cb (EV_P_ ev_async *w, int revents)
4231 {
4232 // just used for the side effects
4233 }
4234
4235The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4236protecting the loop data, respectively.
4237
4238 static void
4239 l_release (EV_P)
4240 {
4241 userdata *u = ev_userdata (EV_A);
4242 pthread_mutex_unlock (&u->lock);
4243 }
4244
4245 static void
4246 l_acquire (EV_P)
4247 {
4248 userdata *u = ev_userdata (EV_A);
4249 pthread_mutex_lock (&u->lock);
4250 }
4251
4252The event loop thread first acquires the mutex, and then jumps straight
4253into C<ev_loop>:
4254
4255 void *
4256 l_run (void *thr_arg)
4257 {
4258 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4259
4260 l_acquire (EV_A);
4261 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4262 ev_loop (EV_A_ 0);
4263 l_release (EV_A);
4264
4265 return 0;
4266 }
4267
4268Instead of invoking all pending watchers, the C<l_invoke> callback will
4269signal the main thread via some unspecified mechanism (signals? pipe
4270writes? C<Async::Interrupt>?) and then waits until all pending watchers
4271have been called (in a while loop because a) spurious wakeups are possible
4272and b) skipping inter-thread-communication when there are no pending
4273watchers is very beneficial):
4274
4275 static void
4276 l_invoke (EV_P)
4277 {
4278 userdata *u = ev_userdata (EV_A);
4279
4280 while (ev_pending_count (EV_A))
4281 {
4282 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4283 pthread_cond_wait (&u->invoke_cv, &u->lock);
4284 }
4285 }
4286
4287Now, whenever the main thread gets told to invoke pending watchers, it
4288will grab the lock, call C<ev_invoke_pending> and then signal the loop
4289thread to continue:
4290
4291 static void
4292 real_invoke_pending (EV_P)
4293 {
4294 userdata *u = ev_userdata (EV_A);
4295
4296 pthread_mutex_lock (&u->lock);
4297 ev_invoke_pending (EV_A);
4298 pthread_cond_signal (&u->invoke_cv);
4299 pthread_mutex_unlock (&u->lock);
4300 }
4301
4302Whenever you want to start/stop a watcher or do other modifications to an
4303event loop, you will now have to lock:
4304
4305 ev_timer timeout_watcher;
4306 userdata *u = ev_userdata (EV_A);
4307
4308 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4309
4310 pthread_mutex_lock (&u->lock);
4311 ev_timer_start (EV_A_ &timeout_watcher);
4312 ev_async_send (EV_A_ &u->async_w);
4313 pthread_mutex_unlock (&u->lock);
4314
4315Note that sending the C<ev_async> watcher is required because otherwise
4316an event loop currently blocking in the kernel will have no knowledge
4317about the newly added timer. By waking up the loop it will pick up any new
4318watchers in the next event loop iteration.
4319
3697=head3 COROUTINES 4320=head3 COROUTINES
3698 4321
3699Libev is very accommodating to coroutines ("cooperative threads"): 4322Libev is very accommodating to coroutines ("cooperative threads"):
3700libev fully supports nesting calls to its functions from different 4323libev fully supports nesting calls to its functions from different
3701coroutines (e.g. you can call C<ev_loop> on the same loop from two 4324coroutines (e.g. you can call C<ev_loop> on the same loop from two
3702different coroutines, and switch freely between both coroutines running the 4325different coroutines, and switch freely between both coroutines running
3703loop, as long as you don't confuse yourself). The only exception is that 4326the loop, as long as you don't confuse yourself). The only exception is
3704you must not do this from C<ev_periodic> reschedule callbacks. 4327that you must not do this from C<ev_periodic> reschedule callbacks.
3705 4328
3706Care has been taken to ensure that libev does not keep local state inside 4329Care has been taken to ensure that libev does not keep local state inside
3707C<ev_loop>, and other calls do not usually allow for coroutine switches as 4330C<ev_loop>, and other calls do not usually allow for coroutine switches as
3708they do not call any callbacks. 4331they do not call any callbacks.
3709 4332
3786way (note also that glib is the slowest event library known to man). 4409way (note also that glib is the slowest event library known to man).
3787 4410
3788There is no supported compilation method available on windows except 4411There is no supported compilation method available on windows except
3789embedding it into other applications. 4412embedding it into other applications.
3790 4413
4414Sensible signal handling is officially unsupported by Microsoft - libev
4415tries its best, but under most conditions, signals will simply not work.
4416
3791Not a libev limitation but worth mentioning: windows apparently doesn't 4417Not a libev limitation but worth mentioning: windows apparently doesn't
3792accept large writes: instead of resulting in a partial write, windows will 4418accept large writes: instead of resulting in a partial write, windows will
3793either accept everything or return C<ENOBUFS> if the buffer is too large, 4419either accept everything or return C<ENOBUFS> if the buffer is too large,
3794so make sure you only write small amounts into your sockets (less than a 4420so make sure you only write small amounts into your sockets (less than a
3795megabyte seems safe, but this apparently depends on the amount of memory 4421megabyte seems safe, but this apparently depends on the amount of memory
3799the abysmal performance of winsockets, using a large number of sockets 4425the abysmal performance of winsockets, using a large number of sockets
3800is not recommended (and not reasonable). If your program needs to use 4426is not recommended (and not reasonable). If your program needs to use
3801more than a hundred or so sockets, then likely it needs to use a totally 4427more than a hundred or so sockets, then likely it needs to use a totally
3802different implementation for windows, as libev offers the POSIX readiness 4428different implementation for windows, as libev offers the POSIX readiness
3803notification model, which cannot be implemented efficiently on windows 4429notification model, which cannot be implemented efficiently on windows
3804(Microsoft monopoly games). 4430(due to Microsoft monopoly games).
3805 4431
3806A typical way to use libev under windows is to embed it (see the embedding 4432A typical way to use libev under windows is to embed it (see the embedding
3807section for details) and use the following F<evwrap.h> header file instead 4433section for details) and use the following F<evwrap.h> header file instead
3808of F<ev.h>: 4434of F<ev.h>:
3809 4435
3845 4471
3846Early versions of winsocket's select only supported waiting for a maximum 4472Early versions of winsocket's select only supported waiting for a maximum
3847of C<64> handles (probably owning to the fact that all windows kernels 4473of C<64> handles (probably owning to the fact that all windows kernels
3848can only wait for C<64> things at the same time internally; Microsoft 4474can only wait for C<64> things at the same time internally; Microsoft
3849recommends spawning a chain of threads and wait for 63 handles and the 4475recommends spawning a chain of threads and wait for 63 handles and the
3850previous thread in each. Great). 4476previous thread in each. Sounds great!).
3851 4477
3852Newer versions support more handles, but you need to define C<FD_SETSIZE> 4478Newer versions support more handles, but you need to define C<FD_SETSIZE>
3853to some high number (e.g. C<2048>) before compiling the winsocket select 4479to some high number (e.g. C<2048>) before compiling the winsocket select
3854call (which might be in libev or elsewhere, for example, perl does its own 4480call (which might be in libev or elsewhere, for example, perl and many
3855select emulation on windows). 4481other interpreters do their own select emulation on windows).
3856 4482
3857Another limit is the number of file descriptors in the Microsoft runtime 4483Another limit is the number of file descriptors in the Microsoft runtime
3858libraries, which by default is C<64> (there must be a hidden I<64> fetish 4484libraries, which by default is C<64> (there must be a hidden I<64>
3859or something like this inside Microsoft). You can increase this by calling 4485fetish or something like this inside Microsoft). You can increase this
3860C<_setmaxstdio>, which can increase this limit to C<2048> (another 4486by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3861arbitrary limit), but is broken in many versions of the Microsoft runtime 4487(another arbitrary limit), but is broken in many versions of the Microsoft
3862libraries.
3863
3864This might get you to about C<512> or C<2048> sockets (depending on 4488runtime libraries. This might get you to about C<512> or C<2048> sockets
3865windows version and/or the phase of the moon). To get more, you need to 4489(depending on windows version and/or the phase of the moon). To get more,
3866wrap all I/O functions and provide your own fd management, but the cost of 4490you need to wrap all I/O functions and provide your own fd management, but
3867calling select (O(n²)) will likely make this unworkable. 4491the cost of calling select (O(n²)) will likely make this unworkable.
3868 4492
3869=back 4493=back
3870 4494
3871=head2 PORTABILITY REQUIREMENTS 4495=head2 PORTABILITY REQUIREMENTS
3872 4496
3915=item C<double> must hold a time value in seconds with enough accuracy 4539=item C<double> must hold a time value in seconds with enough accuracy
3916 4540
3917The type C<double> is used to represent timestamps. It is required to 4541The type C<double> is used to represent timestamps. It is required to
3918have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4542have at least 51 bits of mantissa (and 9 bits of exponent), which is good
3919enough for at least into the year 4000. This requirement is fulfilled by 4543enough for at least into the year 4000. This requirement is fulfilled by
3920implementations implementing IEEE 754 (basically all existing ones). 4544implementations implementing IEEE 754, which is basically all existing
4545ones. With IEEE 754 doubles, you get microsecond accuracy until at least
45462200.
3921 4547
3922=back 4548=back
3923 4549
3924If you know of other additional requirements drop me a note. 4550If you know of other additional requirements drop me a note.
3925 4551
3993involves iterating over all running async watchers or all signal numbers. 4619involves iterating over all running async watchers or all signal numbers.
3994 4620
3995=back 4621=back
3996 4622
3997 4623
4624=head1 GLOSSARY
4625
4626=over 4
4627
4628=item active
4629
4630A watcher is active as long as it has been started (has been attached to
4631an event loop) but not yet stopped (disassociated from the event loop).
4632
4633=item application
4634
4635In this document, an application is whatever is using libev.
4636
4637=item callback
4638
4639The address of a function that is called when some event has been
4640detected. Callbacks are being passed the event loop, the watcher that
4641received the event, and the actual event bitset.
4642
4643=item callback invocation
4644
4645The act of calling the callback associated with a watcher.
4646
4647=item event
4648
4649A change of state of some external event, such as data now being available
4650for reading on a file descriptor, time having passed or simply not having
4651any other events happening anymore.
4652
4653In libev, events are represented as single bits (such as C<EV_READ> or
4654C<EV_TIMEOUT>).
4655
4656=item event library
4657
4658A software package implementing an event model and loop.
4659
4660=item event loop
4661
4662An entity that handles and processes external events and converts them
4663into callback invocations.
4664
4665=item event model
4666
4667The model used to describe how an event loop handles and processes
4668watchers and events.
4669
4670=item pending
4671
4672A watcher is pending as soon as the corresponding event has been detected,
4673and stops being pending as soon as the watcher will be invoked or its
4674pending status is explicitly cleared by the application.
4675
4676A watcher can be pending, but not active. Stopping a watcher also clears
4677its pending status.
4678
4679=item real time
4680
4681The physical time that is observed. It is apparently strictly monotonic :)
4682
4683=item wall-clock time
4684
4685The time and date as shown on clocks. Unlike real time, it can actually
4686be wrong and jump forwards and backwards, e.g. when the you adjust your
4687clock.
4688
4689=item watcher
4690
4691A data structure that describes interest in certain events. Watchers need
4692to be started (attached to an event loop) before they can receive events.
4693
4694=item watcher invocation
4695
4696The act of calling the callback associated with a watcher.
4697
4698=back
4699
3998=head1 AUTHOR 4700=head1 AUTHOR
3999 4701
4000Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 4702Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
4001 4703

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines