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

Comparing libev/ev.pod (file contents):
Revision 1.16 by root, Mon Nov 12 08:47:14 2007 UTC vs.
Revision 1.32 by root, Fri Nov 23 08:36:35 2007 UTC

39F<README.embed> in the libev distribution. If libev was configured without 39F<README.embed> in the libev distribution. If libev was configured without
40support for multiple event loops, then all functions taking an initial 40support for multiple event loops, then all functions taking an initial
41argument of name C<loop> (which is always of type C<struct ev_loop *>) 41argument of name C<loop> (which is always of type C<struct ev_loop *>)
42will not have this argument. 42will not have this argument.
43 43
44=head1 TIME AND OTHER GLOBAL FUNCTIONS 44=head1 TIME REPRESENTATION
45 45
46Libev represents time as a single floating point number, representing the 46Libev represents time as a single floating point number, representing the
47(fractional) number of seconds since the (POSIX) epoch (somewhere near 47(fractional) number of seconds since the (POSIX) epoch (somewhere near
48the beginning of 1970, details are complicated, don't ask). This type is 48the beginning of 1970, details are complicated, don't ask). This type is
49called C<ev_tstamp>, which is what you should use too. It usually aliases 49called C<ev_tstamp>, which is what you should use too. It usually aliases
50to the double type in C. 50to the double type in C.
51 51
52=head1 GLOBAL FUNCTIONS
53
54These functions can be called anytime, even before initialising the
55library in any way.
56
52=over 4 57=over 4
53 58
54=item ev_tstamp ev_time () 59=item ev_tstamp ev_time ()
55 60
56Returns the current time as libev would use it. 61Returns the current time as libev would use it. Please note that the
62C<ev_now> function is usually faster and also often returns the timestamp
63you actually want to know.
57 64
58=item int ev_version_major () 65=item int ev_version_major ()
59 66
60=item int ev_version_minor () 67=item int ev_version_minor ()
61 68
67 74
68Usually, it's a good idea to terminate if the major versions mismatch, 75Usually, it's a good idea to terminate if the major versions mismatch,
69as this indicates an incompatible change. Minor versions are usually 76as this indicates an incompatible change. Minor versions are usually
70compatible to older versions, so a larger minor version alone is usually 77compatible to older versions, so a larger minor version alone is usually
71not a problem. 78not a problem.
79
80=item unsigned int ev_supported_backends ()
81
82Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
83value) compiled into this binary of libev (independent of their
84availability on the system you are running on). See C<ev_default_loop> for
85a description of the set values.
86
87=item unsigned int ev_recommended_backends ()
88
89Return the set of all backends compiled into this binary of libev and also
90recommended for this platform. This set is often smaller than the one
91returned by C<ev_supported_backends>, as for example kqueue is broken on
92most BSDs and will not be autodetected unless you explicitly request it
93(assuming you know what you are doing). This is the set of backends that
94C<EVFLAG_AUTO> will probe for.
72 95
73=item ev_set_allocator (void *(*cb)(void *ptr, long size)) 96=item ev_set_allocator (void *(*cb)(void *ptr, long size))
74 97
75Sets the allocation function to use (the prototype is similar to the 98Sets the allocation function to use (the prototype is similar to the
76realloc C function, the semantics are identical). It is used to allocate 99realloc C function, the semantics are identical). It is used to allocate
99An event loop is described by a C<struct ev_loop *>. The library knows two 122An event loop is described by a C<struct ev_loop *>. The library knows two
100types of such loops, the I<default> loop, which supports signals and child 123types of such loops, the I<default> loop, which supports signals and child
101events, and dynamically created loops which do not. 124events, and dynamically created loops which do not.
102 125
103If you use threads, a common model is to run the default event loop 126If you use threads, a common model is to run the default event loop
104in your main thread (or in a separate thrad) and for each thread you 127in your main thread (or in a separate thread) and for each thread you
105create, you also create another event loop. Libev itself does no locking 128create, you also create another event loop. Libev itself does no locking
106whatsoever, so if you mix calls to the same event loop in different 129whatsoever, so if you mix calls to the same event loop in different
107threads, make sure you lock (this is usually a bad idea, though, even if 130threads, make sure you lock (this is usually a bad idea, though, even if
108done correctly, because it's hideous and inefficient). 131done correctly, because it's hideous and inefficient).
109 132
112=item struct ev_loop *ev_default_loop (unsigned int flags) 135=item struct ev_loop *ev_default_loop (unsigned int flags)
113 136
114This will initialise the default event loop if it hasn't been initialised 137This will initialise the default event loop if it hasn't been initialised
115yet and return it. If the default loop could not be initialised, returns 138yet and return it. If the default loop could not be initialised, returns
116false. If it already was initialised it simply returns it (and ignores the 139false. If it already was initialised it simply returns it (and ignores the
117flags). 140flags. If that is troubling you, check C<ev_backend ()> afterwards).
118 141
119If you don't know what event loop to use, use the one returned from this 142If you don't know what event loop to use, use the one returned from this
120function. 143function.
121 144
122The flags argument can be used to specify special behaviour or specific 145The flags argument can be used to specify special behaviour or specific
123backends to use, and is usually specified as 0 (or EVFLAG_AUTO). 146backends to use, and is usually specified as C<0> (or EVFLAG_AUTO).
124 147
125It supports the following flags: 148It supports the following flags:
126 149
127=over 4 150=over 4
128 151
138C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 161C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
139override the flags completely if it is found in the environment. This is 162override the flags completely if it is found in the environment. This is
140useful to try out specific backends to test their performance, or to work 163useful to try out specific backends to test their performance, or to work
141around bugs. 164around bugs.
142 165
143=item C<EVMETHOD_SELECT> (portable select backend) 166=item C<EVBACKEND_SELECT> (value 1, portable select backend)
144 167
168This is your standard select(2) backend. Not I<completely> standard, as
169libev tries to roll its own fd_set with no limits on the number of fds,
170but if that fails, expect a fairly low limit on the number of fds when
171using this backend. It doesn't scale too well (O(highest_fd)), but its usually
172the fastest backend for a low number of fds.
173
145=item C<EVMETHOD_POLL> (poll backend, available everywhere except on windows) 174=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
146 175
147=item C<EVMETHOD_EPOLL> (linux only) 176And this is your standard poll(2) backend. It's more complicated than
177select, but handles sparse fds better and has no artificial limit on the
178number of fds you can use (except it will slow down considerably with a
179lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
148 180
149=item C<EVMETHOD_KQUEUE> (some bsds only) 181=item C<EVBACKEND_EPOLL> (value 4, Linux)
150 182
151=item C<EVMETHOD_DEVPOLL> (solaris 8 only) 183For few fds, this backend is a bit little slower than poll and select,
184but it scales phenomenally better. While poll and select usually scale like
185O(total_fds) where n is the total number of fds (or the highest fd), epoll scales
186either O(1) or O(active_fds).
152 187
153=item C<EVMETHOD_PORT> (solaris 10 only) 188While stopping and starting an I/O watcher in the same iteration will
189result in some caching, there is still a syscall per such incident
190(because the fd could point to a different file description now), so its
191best to avoid that. Also, dup()ed file descriptors might not work very
192well if you register events for both fds.
193
194Please note that epoll sometimes generates spurious notifications, so you
195need to use non-blocking I/O or other means to avoid blocking when no data
196(or space) is available.
197
198=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
199
200Kqueue deserves special mention, as at the time of this writing, it
201was broken on all BSDs except NetBSD (usually it doesn't work with
202anything but sockets and pipes, except on Darwin, where of course its
203completely useless). For this reason its not being "autodetected" unless
204you explicitly specify the flags (i.e. you don't use EVFLAG_AUTO).
205
206It scales in the same way as the epoll backend, but the interface to the
207kernel is more efficient (which says nothing about its actual speed, of
208course). While starting and stopping an I/O watcher does not cause an
209extra syscall as with epoll, it still adds up to four event changes per
210incident, so its best to avoid that.
211
212=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
213
214This is not implemented yet (and might never be).
215
216=item C<EVBACKEND_PORT> (value 32, Solaris 10)
217
218This uses the Solaris 10 port mechanism. As with everything on Solaris,
219it's really slow, but it still scales very well (O(active_fds)).
220
221Please note that solaris ports can result in a lot of spurious
222notifications, so you need to use non-blocking I/O or other means to avoid
223blocking when no data (or space) is available.
224
225=item C<EVBACKEND_ALL>
226
227Try all backends (even potentially broken ones that wouldn't be tried
228with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
229C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
230
231=back
154 232
155If one or more of these are ored into the flags value, then only these 233If one or more of these are ored into the flags value, then only these
156backends will be tried (in the reverse order as given here). If one are 234backends will be tried (in the reverse order as given here). If none are
157specified, any backend will do. 235specified, most compiled-in backend will be tried, usually in reverse
158 236order of their flag values :)
159=back
160 237
161=item struct ev_loop *ev_loop_new (unsigned int flags) 238=item struct ev_loop *ev_loop_new (unsigned int flags)
162 239
163Similar to C<ev_default_loop>, but always creates a new event loop that is 240Similar to C<ev_default_loop>, but always creates a new event loop that is
164always distinct from the default loop. Unlike the default loop, it cannot 241always distinct from the default loop. Unlike the default loop, it cannot
181This function reinitialises the kernel state for backends that have 258This function reinitialises the kernel state for backends that have
182one. Despite the name, you can call it anytime, but it makes most sense 259one. Despite the name, you can call it anytime, but it makes most sense
183after forking, in either the parent or child process (or both, but that 260after forking, in either the parent or child process (or both, but that
184again makes little sense). 261again makes little sense).
185 262
186You I<must> call this function after forking if and only if you want to 263You I<must> call this function in the child process after forking if and
187use the event library in both processes. If you just fork+exec, you don't 264only if you want to use the event library in both processes. If you just
188have to call it. 265fork+exec, you don't have to call it.
189 266
190The function itself is quite fast and it's usually not a problem to call 267The function itself is quite fast and it's usually not a problem to call
191it just in case after a fork. To make this easy, the function will fit in 268it just in case after a fork. To make this easy, the function will fit in
192quite nicely into a call to C<pthread_atfork>: 269quite nicely into a call to C<pthread_atfork>:
193 270
194 pthread_atfork (0, 0, ev_default_fork); 271 pthread_atfork (0, 0, ev_default_fork);
195 272
273At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
274without calling this function, so if you force one of those backends you
275do not need to care.
276
196=item ev_loop_fork (loop) 277=item ev_loop_fork (loop)
197 278
198Like C<ev_default_fork>, but acts on an event loop created by 279Like C<ev_default_fork>, but acts on an event loop created by
199C<ev_loop_new>. Yes, you have to call this on every allocated event loop 280C<ev_loop_new>. Yes, you have to call this on every allocated event loop
200after fork, and how you do this is entirely your own problem. 281after fork, and how you do this is entirely your own problem.
201 282
202=item unsigned int ev_method (loop) 283=item unsigned int ev_backend (loop)
203 284
204Returns one of the C<EVMETHOD_*> flags indicating the event backend in 285Returns one of the C<EVBACKEND_*> flags indicating the event backend in
205use. 286use.
206 287
207=item ev_tstamp ev_now (loop) 288=item ev_tstamp ev_now (loop)
208 289
209Returns the current "event loop time", which is the time the event loop 290Returns the current "event loop time", which is the time the event loop
232 313
233This flags value could be used to implement alternative looping 314This flags value could be used to implement alternative looping
234constructs, but the C<prepare> and C<check> watchers provide a better and 315constructs, but the C<prepare> and C<check> watchers provide a better and
235more generic mechanism. 316more generic mechanism.
236 317
318Here are the gory details of what ev_loop does:
319
320 1. If there are no active watchers (reference count is zero), return.
321 2. Queue and immediately call all prepare watchers.
322 3. If we have been forked, recreate the kernel state.
323 4. Update the kernel state with all outstanding changes.
324 5. Update the "event loop time".
325 6. Calculate for how long to block.
326 7. Block the process, waiting for events.
327 8. Update the "event loop time" and do time jump handling.
328 9. Queue all outstanding timers.
329 10. Queue all outstanding periodics.
330 11. If no events are pending now, queue all idle watchers.
331 12. Queue all check watchers.
332 13. Call all queued watchers in reverse order (i.e. check watchers first).
333 14. If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
334 was used, return, otherwise continue with step #1.
335
237=item ev_unloop (loop, how) 336=item ev_unloop (loop, how)
238 337
239Can be used to make a call to C<ev_loop> return early (but only after it 338Can be used to make a call to C<ev_loop> return early (but only after it
240has processed all outstanding events). The C<how> argument must be either 339has processed all outstanding events). The C<how> argument must be either
241C<EVUNLOOP_ONCE>, which will make the innermost C<ev_loop> call return, or 340C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
242C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 341C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
243 342
244=item ev_ref (loop) 343=item ev_ref (loop)
245 344
246=item ev_unref (loop) 345=item ev_unref (loop)
297*) >>), and you can stop watching for events at any time by calling the 396*) >>), and you can stop watching for events at any time by calling the
298corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>. 397corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
299 398
300As long as your watcher is active (has been started but not stopped) you 399As long as your watcher is active (has been started but not stopped) you
301must not touch the values stored in it. Most specifically you must never 400must not touch the values stored in it. Most specifically you must never
302reinitialise it or call its set method. 401reinitialise it or call its set macro.
303 402
304You can check whether an event is active by calling the C<ev_is_active 403You can check whether an event is active by calling the C<ev_is_active
305(watcher *)> macro. To see whether an event is outstanding (but the 404(watcher *)> macro. To see whether an event is outstanding (but the
306callback for it has not been called yet) you can use the C<ev_is_pending 405callback for it has not been called yet) you can use the C<ev_is_pending
307(watcher *)> macro. 406(watcher *)> macro.
412in each iteration of the event loop (This behaviour is called 511in each iteration of the event loop (This behaviour is called
413level-triggering because you keep receiving events as long as the 512level-triggering because you keep receiving events as long as the
414condition persists. Remember you can stop the watcher if you don't want to 513condition persists. Remember you can stop the watcher if you don't want to
415act on the event and neither want to receive future events). 514act on the event and neither want to receive future events).
416 515
417In general you can register as many read and/or write event watchers oer 516In general you can register as many read and/or write event watchers per
418fd as you want (as long as you don't confuse yourself). Setting all file 517fd as you want (as long as you don't confuse yourself). Setting all file
419descriptors to non-blocking mode is also usually a good idea (but not 518descriptors to non-blocking mode is also usually a good idea (but not
420required if you know what you are doing). 519required if you know what you are doing).
421 520
422You have to be careful with dup'ed file descriptors, though. Some backends 521You have to be careful with dup'ed file descriptors, though. Some backends
423(the linux epoll backend is a notable example) cannot handle dup'ed file 522(the linux epoll backend is a notable example) cannot handle dup'ed file
424descriptors correctly if you register interest in two or more fds pointing 523descriptors correctly if you register interest in two or more fds pointing
425to the same file/socket etc. description. 524to the same underlying file/socket etc. description (that is, they share
525the same underlying "file open").
426 526
427If you must do this, then force the use of a known-to-be-good backend 527If you must do this, then force the use of a known-to-be-good backend
428(at the time of this writing, this includes only EVMETHOD_SELECT and 528(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
429EVMETHOD_POLL). 529C<EVBACKEND_POLL>).
430 530
431=over 4 531=over 4
432 532
433=item ev_io_init (ev_io *, callback, int fd, int events) 533=item ev_io_init (ev_io *, callback, int fd, int events)
434 534
436 536
437Configures an C<ev_io> watcher. The fd is the file descriptor to rceeive 537Configures an C<ev_io> watcher. The fd is the file descriptor to rceeive
438events for and events is either C<EV_READ>, C<EV_WRITE> or C<EV_READ | 538events for and events is either C<EV_READ>, C<EV_WRITE> or C<EV_READ |
439EV_WRITE> to receive the given events. 539EV_WRITE> to receive the given events.
440 540
541Please note that most of the more scalable backend mechanisms (for example
542epoll and solaris ports) can result in spurious readyness notifications
543for file descriptors, so you practically need to use non-blocking I/O (and
544treat callback invocation as hint only), or retest separately with a safe
545interface before doing I/O (XLib can do this), or force the use of either
546C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>, which don't suffer from this
547problem. Also note that it is quite easy to have your callback invoked
548when the readyness condition is no longer valid even when employing
549typical ways of handling events, so its a good idea to use non-blocking
550I/O unconditionally.
551
441=back 552=back
442 553
443=head2 C<ev_timer> - relative and optionally recurring timeouts 554=head2 C<ev_timer> - relative and optionally recurring timeouts
444 555
445Timer watchers are simple relative timers that generate an event after a 556Timer watchers are simple relative timers that generate an event after a
446given time, and optionally repeating in regular intervals after that. 557given time, and optionally repeating in regular intervals after that.
447 558
448The timers are based on real time, that is, if you register an event that 559The timers are based on real time, that is, if you register an event that
449times out after an hour and youreset your system clock to last years 560times out after an hour and you reset your system clock to last years
450time, it will still time out after (roughly) and hour. "Roughly" because 561time, it will still time out after (roughly) and hour. "Roughly" because
451detecting time jumps is hard, and soem inaccuracies are unavoidable (the 562detecting time jumps is hard, and some inaccuracies are unavoidable (the
452monotonic clock option helps a lot here). 563monotonic clock option helps a lot here).
453 564
454The relative timeouts are calculated relative to the C<ev_now ()> 565The relative timeouts are calculated relative to the C<ev_now ()>
455time. This is usually the right thing as this timestamp refers to the time 566time. This is usually the right thing as this timestamp refers to the time
456of the event triggering whatever timeout you are modifying/starting. If 567of the event triggering whatever timeout you are modifying/starting. If
457you suspect event processing to be delayed and you *need* to base the timeout 568you suspect event processing to be delayed and you I<need> to base the timeout
458ion the current time, use something like this to adjust for this: 569on the current time, use something like this to adjust for this:
459 570
460 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 571 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
572
573The callback is guarenteed to be invoked only when its timeout has passed,
574but if multiple timers become ready during the same loop iteration then
575order of execution is undefined.
461 576
462=over 4 577=over 4
463 578
464=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 579=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
465 580
471later, again, and again, until stopped manually. 586later, again, and again, until stopped manually.
472 587
473The timer itself will do a best-effort at avoiding drift, that is, if you 588The timer itself will do a best-effort at avoiding drift, that is, if you
474configure a timer to trigger every 10 seconds, then it will trigger at 589configure a timer to trigger every 10 seconds, then it will trigger at
475exactly 10 second intervals. If, however, your program cannot keep up with 590exactly 10 second intervals. If, however, your program cannot keep up with
476the timer (ecause it takes longer than those 10 seconds to do stuff) the 591the timer (because it takes longer than those 10 seconds to do stuff) the
477timer will not fire more than once per event loop iteration. 592timer will not fire more than once per event loop iteration.
478 593
479=item ev_timer_again (loop) 594=item ev_timer_again (loop)
480 595
481This will act as if the timer timed out and restart it again if it is 596This will act as if the timer timed out and restart it again if it is
512again). 627again).
513 628
514They can also be used to implement vastly more complex timers, such as 629They can also be used to implement vastly more complex timers, such as
515triggering an event on eahc midnight, local time. 630triggering an event on eahc midnight, local time.
516 631
632As with timers, the callback is guarenteed to be invoked only when the
633time (C<at>) has been passed, but if multiple periodic timers become ready
634during the same loop iteration then order of execution is undefined.
635
517=over 4 636=over 4
518 637
519=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) 638=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
520 639
521=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) 640=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
522 641
523Lots of arguments, lets sort it out... There are basically three modes of 642Lots of arguments, lets sort it out... There are basically three modes of
524operation, and we will explain them from simplest to complex: 643operation, and we will explain them from simplest to complex:
525
526 644
527=over 4 645=over 4
528 646
529=item * absolute timer (interval = reschedule_cb = 0) 647=item * absolute timer (interval = reschedule_cb = 0)
530 648
558In this mode the values for C<interval> and C<at> are both being 676In this mode the values for C<interval> and C<at> are both being
559ignored. Instead, each time the periodic watcher gets scheduled, the 677ignored. Instead, each time the periodic watcher gets scheduled, the
560reschedule callback will be called with the watcher as first, and the 678reschedule callback will be called with the watcher as first, and the
561current time as second argument. 679current time as second argument.
562 680
563NOTE: I<This callback MUST NOT stop or destroy the periodic or any other 681NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
564periodic watcher, ever, or make any event loop modifications>. If you need 682ever, or make any event loop modifications>. If you need to stop it,
565to stop it, return C<now + 1e30> (or so, fudge fudge) and stop it afterwards. 683return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
566 684starting a prepare watcher).
567Also, I<< this callback must always return a time that is later than the
568passed C<now> value >>. Not even C<now> itself will be ok.
569 685
570Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 686Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
571ev_tstamp now)>, e.g.: 687ev_tstamp now)>, e.g.:
572 688
573 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 689 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
578It must return the next time to trigger, based on the passed time value 694It must return the next time to trigger, based on the passed time value
579(that is, the lowest time value larger than to the second argument). It 695(that is, the lowest time value larger than to the second argument). It
580will usually be called just before the callback will be triggered, but 696will usually be called just before the callback will be triggered, but
581might be called at other times, too. 697might be called at other times, too.
582 698
699NOTE: I<< This callback must always return a time that is later than the
700passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
701
583This can be used to create very complex timers, such as a timer that 702This can be used to create very complex timers, such as a timer that
584triggers on each midnight, local time. To do this, you would calculate the 703triggers on each midnight, local time. To do this, you would calculate the
585next midnight after C<now> and return the timestamp value for this. How you do this 704next midnight after C<now> and return the timestamp value for this. How
586is, again, up to you (but it is not trivial). 705you do this is, again, up to you (but it is not trivial, which is the main
706reason I omitted it as an example).
587 707
588=back 708=back
589 709
590=item ev_periodic_again (loop, ev_periodic *) 710=item ev_periodic_again (loop, ev_periodic *)
591 711
670=back 790=back
671 791
672=head2 C<ev_prepare> and C<ev_check> - customise your event loop 792=head2 C<ev_prepare> and C<ev_check> - customise your event loop
673 793
674Prepare and check watchers are usually (but not always) used in tandem: 794Prepare and check watchers are usually (but not always) used in tandem:
675Prepare watchers get invoked before the process blocks and check watchers 795prepare watchers get invoked before the process blocks and check watchers
676afterwards. 796afterwards.
677 797
678Their main purpose is to integrate other event mechanisms into libev. This 798Their main purpose is to integrate other event mechanisms into libev. This
679could be used, for example, to track variable changes, implement your own 799could be used, for example, to track variable changes, implement your own
680watchers, integrate net-snmp or a coroutine library and lots more. 800watchers, integrate net-snmp or a coroutine library and lots more.
683to be watched by the other library, registering C<ev_io> watchers for 803to be watched by the other library, registering C<ev_io> watchers for
684them and starting an C<ev_timer> watcher for any timeouts (many libraries 804them and starting an C<ev_timer> watcher for any timeouts (many libraries
685provide just this functionality). Then, in the check watcher you check for 805provide just this functionality). Then, in the check watcher you check for
686any events that occured (by checking the pending status of all watchers 806any events that occured (by checking the pending status of all watchers
687and stopping them) and call back into the library. The I/O and timer 807and stopping them) and call back into the library. The I/O and timer
688callbacks will never actually be called (but must be valid neverthelles, 808callbacks will never actually be called (but must be valid nevertheless,
689because you never know, you know?). 809because you never know, you know?).
690 810
691As another example, the Perl Coro module uses these hooks to integrate 811As another example, the Perl Coro module uses these hooks to integrate
692coroutines into libev programs, by yielding to other active coroutines 812coroutines into libev programs, by yielding to other active coroutines
693during each prepare and only letting the process block if no coroutines 813during each prepare and only letting the process block if no coroutines
694are ready to run (its actually more complicated, it only runs coroutines 814are ready to run (it's actually more complicated: it only runs coroutines
695with priority higher than the event loop and one lower priority once, 815with priority higher than or equal to the event loop and one coroutine
696using idle watchers to keep the event loop from blocking if lower-priority 816of lower priority, but only once, using idle watchers to keep the event
697coroutines exist, thus mapping low-priority coroutines to idle/background 817loop from blocking if lower-priority coroutines are active, thus mapping
698tasks). 818low-priority coroutines to idle/background tasks).
699 819
700=over 4 820=over 4
701 821
702=item ev_prepare_init (ev_prepare *, callback) 822=item ev_prepare_init (ev_prepare *, callback)
703 823
718=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback) 838=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
719 839
720This function combines a simple timer and an I/O watcher, calls your 840This function combines a simple timer and an I/O watcher, calls your
721callback on whichever event happens first and automatically stop both 841callback on whichever event happens first and automatically stop both
722watchers. This is useful if you want to wait for a single event on an fd 842watchers. This is useful if you want to wait for a single event on an fd
723or timeout without havign to allocate/configure/start/stop/free one or 843or timeout without having to allocate/configure/start/stop/free one or
724more watchers yourself. 844more watchers yourself.
725 845
726If C<fd> is less than 0, then no I/O watcher will be started and events 846If C<fd> is less than 0, then no I/O watcher will be started and events
727is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and 847is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
728C<events> set will be craeted and started. 848C<events> set will be craeted and started.
731started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 851started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
732repeat = 0) will be started. While C<0> is a valid timeout, it is of 852repeat = 0) will be started. While C<0> is a valid timeout, it is of
733dubious value. 853dubious value.
734 854
735The callback has the type C<void (*cb)(int revents, void *arg)> and gets 855The callback has the type C<void (*cb)(int revents, void *arg)> and gets
736passed an events set like normal event callbacks (with a combination of 856passed an C<revents> set like normal event callbacks (a combination of
737C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 857C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
738value passed to C<ev_once>: 858value passed to C<ev_once>:
739 859
740 static void stdin_ready (int revents, void *arg) 860 static void stdin_ready (int revents, void *arg)
741 { 861 {
762 882
763Feed an event as if the given signal occured (loop must be the default loop!). 883Feed an event as if the given signal occured (loop must be the default loop!).
764 884
765=back 885=back
766 886
887=head1 LIBEVENT EMULATION
888
889Libev offers a compatibility emulation layer for libevent. It cannot
890emulate the internals of libevent, so here are some usage hints:
891
892=over 4
893
894=item * Use it by including <event.h>, as usual.
895
896=item * The following members are fully supported: ev_base, ev_callback,
897ev_arg, ev_fd, ev_res, ev_events.
898
899=item * Avoid using ev_flags and the EVLIST_*-macros, while it is
900maintained by libev, it does not work exactly the same way as in libevent (consider
901it a private API).
902
903=item * Priorities are not currently supported. Initialising priorities
904will fail and all watchers will have the same priority, even though there
905is an ev_pri field.
906
907=item * Other members are not supported.
908
909=item * The libev emulation is I<not> ABI compatible to libevent, you need
910to use the libev header file and library.
911
912=back
913
914=head1 C++ SUPPORT
915
916TBD.
917
767=head1 AUTHOR 918=head1 AUTHOR
768 919
769Marc Lehmann <libev@schmorp.de>. 920Marc Lehmann <libev@schmorp.de>.
770 921

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines