ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
Revision: 1.31
Committed: Fri Nov 23 05:00:45 2007 UTC (16 years, 5 months ago) by root
Branch: MAIN
Changes since 1.30: +35 -15 lines
Log Message:
renamed METHODs to BACKENDs
add ev_supported_backends and ev_recommended_backends functions.

File Contents

# Content
1 =head1 NAME
2
3 libev - a high performance full-featured event loop written in C
4
5 =head1 SYNOPSIS
6
7 #include <ev.h>
8
9 =head1 DESCRIPTION
10
11 Libev is an event loop: you register interest in certain events (such as a
12 file descriptor being readable or a timeout occuring), and it will manage
13 these event sources and provide your program with events.
14
15 To do this, it must take more or less complete control over your process
16 (or thread) by executing the I<event loop> handler, and will then
17 communicate events via a callback mechanism.
18
19 You register interest in certain events by registering so-called I<event
20 watchers>, which are relatively small C structures you initialise with the
21 details of the event, and then hand it over to libev by I<starting> the
22 watcher.
23
24 =head1 FEATURES
25
26 Libev supports select, poll, the linux-specific epoll and the bsd-specific
27 kqueue mechanisms for file descriptor events, relative timers, absolute
28 timers with customised rescheduling, signal events, process status change
29 events (related to SIGCHLD), and event watchers dealing with the event
30 loop mechanism itself (idle, prepare and check watchers). It also is quite
31 fast (see this L<benchmark|http://libev.schmorp.de/bench.html> comparing
32 it to libevent for example).
33
34 =head1 CONVENTIONS
35
36 Libev is very configurable. In this manual the default configuration
37 will be described, which supports multiple event loops. For more info
38 about various configuration options please have a look at the file
39 F<README.embed> in the libev distribution. If libev was configured without
40 support for multiple event loops, then all functions taking an initial
41 argument of name C<loop> (which is always of type C<struct ev_loop *>)
42 will not have this argument.
43
44 =head1 TIME REPRESENTATION
45
46 Libev represents time as a single floating point number, representing the
47 (fractional) number of seconds since the (POSIX) epoch (somewhere near
48 the beginning of 1970, details are complicated, don't ask). This type is
49 called C<ev_tstamp>, which is what you should use too. It usually aliases
50 to the double type in C.
51
52 =head1 GLOBAL FUNCTIONS
53
54 These functions can be called anytime, even before initialising the
55 library in any way.
56
57 =over 4
58
59 =item ev_tstamp ev_time ()
60
61 Returns the current time as libev would use it. Please note that the
62 C<ev_now> function is usually faster and also often returns the timestamp
63 you actually want to know.
64
65 =item int ev_version_major ()
66
67 =item int ev_version_minor ()
68
69 You can find out the major and minor version numbers of the library
70 you linked against by calling the functions C<ev_version_major> and
71 C<ev_version_minor>. If you want, you can compare against the global
72 symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
73 version of the library your program was compiled against.
74
75 Usually, it's a good idea to terminate if the major versions mismatch,
76 as this indicates an incompatible change. Minor versions are usually
77 compatible to older versions, so a larger minor version alone is usually
78 not a problem.
79
80 =item unsigned int ev_supported_backends ()
81
82 Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
83 value) compiled into this binary of libev (independent of their
84 availability on the system you are running on). See C<ev_default_loop> for
85 a description of the set values.
86
87 =item unsigned int ev_recommended_backends ()
88
89 Return the set of all backends compiled into this binary of libev and also
90 recommended for this platform. This set is often smaller than the one
91 returned by C<ev_supported_backends>, as for example kqueue is broken on
92 most 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
94 C<EVFLAG_AUTO> will probe for.
95
96 =item ev_set_allocator (void *(*cb)(void *ptr, long size))
97
98 Sets the allocation function to use (the prototype is similar to the
99 realloc C function, the semantics are identical). It is used to allocate
100 and free memory (no surprises here). If it returns zero when memory
101 needs to be allocated, the library might abort or take some potentially
102 destructive action. The default is your system realloc function.
103
104 You could override this function in high-availability programs to, say,
105 free some memory if it cannot allocate memory, to use a special allocator,
106 or even to sleep a while and retry until some memory is available.
107
108 =item ev_set_syserr_cb (void (*cb)(const char *msg));
109
110 Set the callback function to call on a retryable syscall error (such
111 as failed select, poll, epoll_wait). The message is a printable string
112 indicating the system call or subsystem causing the problem. If this
113 callback is set, then libev will expect it to remedy the sitution, no
114 matter what, when it returns. That is, libev will generally retry the
115 requested operation, or, if the condition doesn't go away, do bad stuff
116 (such as abort).
117
118 =back
119
120 =head1 FUNCTIONS CONTROLLING THE EVENT LOOP
121
122 An event loop is described by a C<struct ev_loop *>. The library knows two
123 types of such loops, the I<default> loop, which supports signals and child
124 events, and dynamically created loops which do not.
125
126 If you use threads, a common model is to run the default event loop
127 in your main thread (or in a separate thread) and for each thread you
128 create, you also create another event loop. Libev itself does no locking
129 whatsoever, so if you mix calls to the same event loop in different
130 threads, make sure you lock (this is usually a bad idea, though, even if
131 done correctly, because it's hideous and inefficient).
132
133 =over 4
134
135 =item struct ev_loop *ev_default_loop (unsigned int flags)
136
137 This will initialise the default event loop if it hasn't been initialised
138 yet and return it. If the default loop could not be initialised, returns
139 false. If it already was initialised it simply returns it (and ignores the
140 flags. If that is troubling you, check C<ev_backend ()> afterwards).
141
142 If you don't know what event loop to use, use the one returned from this
143 function.
144
145 The flags argument can be used to specify special behaviour or specific
146 backends to use, and is usually specified as C<0> (or EVFLAG_AUTO).
147
148 It supports the following flags:
149
150 =over 4
151
152 =item C<EVFLAG_AUTO>
153
154 The default flags value. Use this if you have no clue (it's the right
155 thing, believe me).
156
157 =item C<EVFLAG_NOENV>
158
159 If this flag bit is ored into the flag value (or the program runs setuid
160 or setgid) then libev will I<not> look at the environment variable
161 C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
162 override the flags completely if it is found in the environment. This is
163 useful to try out specific backends to test their performance, or to work
164 around bugs.
165
166 =item C<EVBACKEND_SELECT> (value 1, portable select backend)
167
168 This is your standard select(2) backend. Not I<completely> standard, as
169 libev tries to roll its own fd_set with no limits on the number of fds,
170 but if that fails, expect a fairly low limit on the number of fds when
171 using this backend. It doesn't scale too well (O(highest_fd)), but its usually
172 the fastest backend for a low number of fds.
173
174 =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
175
176 And this is your standard poll(2) backend. It's more complicated than
177 select, but handles sparse fds better and has no artificial limit on the
178 number of fds you can use (except it will slow down considerably with a
179 lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
180
181 =item C<EVBACKEND_EPOLL> (value 4, Linux)
182
183 For few fds, this backend is a bit little slower than poll and select,
184 but it scales phenomenally better. While poll and select usually scale like
185 O(total_fds) where n is the total number of fds (or the highest fd), epoll scales
186 either O(1) or O(active_fds).
187
188 While stopping and starting an I/O watcher in the same iteration will
189 result 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
191 best to avoid that. Also, dup()ed file descriptors might not work very
192 well if you register events for both fds.
193
194 =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
195
196 Kqueue deserves special mention, as at the time of this writing, it
197 was broken on all BSDs except NetBSD (usually it doesn't work with
198 anything but sockets and pipes, except on Darwin, where of course its
199 completely useless). For this reason its not being "autodetected" unless
200 you explicitly specify the flags (i.e. you don't use EVFLAG_AUTO).
201
202 It scales in the same way as the epoll backend, but the interface to the
203 kernel is more efficient (which says nothing about its actual speed, of
204 course). While starting and stopping an I/O watcher does not cause an
205 extra syscall as with epoll, it still adds up to four event changes per
206 incident, so its best to avoid that.
207
208 =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
209
210 This is not implemented yet (and might never be).
211
212 =item C<EVBACKEND_PORT> (value 32, Solaris 10)
213
214 This uses the Solaris 10 port mechanism. As with everything on Solaris,
215 it's really slow, but it still scales very well (O(active_fds)).
216
217 =item C<EVBACKEND_ALL>
218
219 Try all backends (even potentially broken ones that wouldn't be tried
220 with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
221 C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
222
223 =back
224
225 If one or more of these are ored into the flags value, then only these
226 backends will be tried (in the reverse order as given here). If none are
227 specified, most compiled-in backend will be tried, usually in reverse
228 order of their flag values :)
229
230 =item struct ev_loop *ev_loop_new (unsigned int flags)
231
232 Similar to C<ev_default_loop>, but always creates a new event loop that is
233 always distinct from the default loop. Unlike the default loop, it cannot
234 handle signal and child watchers, and attempts to do so will be greeted by
235 undefined behaviour (or a failed assertion if assertions are enabled).
236
237 =item ev_default_destroy ()
238
239 Destroys the default loop again (frees all memory and kernel state
240 etc.). This stops all registered event watchers (by not touching them in
241 any way whatsoever, although you cannot rely on this :).
242
243 =item ev_loop_destroy (loop)
244
245 Like C<ev_default_destroy>, but destroys an event loop created by an
246 earlier call to C<ev_loop_new>.
247
248 =item ev_default_fork ()
249
250 This function reinitialises the kernel state for backends that have
251 one. Despite the name, you can call it anytime, but it makes most sense
252 after forking, in either the parent or child process (or both, but that
253 again makes little sense).
254
255 You I<must> call this function in the child process after forking if and
256 only if you want to use the event library in both processes. If you just
257 fork+exec, you don't have to call it.
258
259 The function itself is quite fast and it's usually not a problem to call
260 it just in case after a fork. To make this easy, the function will fit in
261 quite nicely into a call to C<pthread_atfork>:
262
263 pthread_atfork (0, 0, ev_default_fork);
264
265 At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
266 without calling this function, so if you force one of those backends you
267 do not need to care.
268
269 =item ev_loop_fork (loop)
270
271 Like C<ev_default_fork>, but acts on an event loop created by
272 C<ev_loop_new>. Yes, you have to call this on every allocated event loop
273 after fork, and how you do this is entirely your own problem.
274
275 =item unsigned int ev_backend (loop)
276
277 Returns one of the C<EVBACKEND_*> flags indicating the event backend in
278 use.
279
280 =item ev_tstamp ev_now (loop)
281
282 Returns the current "event loop time", which is the time the event loop
283 got events and started processing them. This timestamp does not change
284 as long as callbacks are being processed, and this is also the base time
285 used for relative timers. You can treat it as the timestamp of the event
286 occuring (or more correctly, the mainloop finding out about it).
287
288 =item ev_loop (loop, int flags)
289
290 Finally, this is it, the event handler. This function usually is called
291 after you initialised all your watchers and you want to start handling
292 events.
293
294 If the flags argument is specified as 0, it will not return until either
295 no event watchers are active anymore or C<ev_unloop> was called.
296
297 A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
298 those events and any outstanding ones, but will not block your process in
299 case there are no events and will return after one iteration of the loop.
300
301 A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
302 neccessary) and will handle those and any outstanding ones. It will block
303 your process until at least one new event arrives, and will return after
304 one iteration of the loop.
305
306 This flags value could be used to implement alternative looping
307 constructs, but the C<prepare> and C<check> watchers provide a better and
308 more generic mechanism.
309
310 Here are the gory details of what ev_loop does:
311
312 1. If there are no active watchers (reference count is zero), return.
313 2. Queue and immediately call all prepare watchers.
314 3. If we have been forked, recreate the kernel state.
315 4. Update the kernel state with all outstanding changes.
316 5. Update the "event loop time".
317 6. Calculate for how long to block.
318 7. Block the process, waiting for events.
319 8. Update the "event loop time" and do time jump handling.
320 9. Queue all outstanding timers.
321 10. Queue all outstanding periodics.
322 11. If no events are pending now, queue all idle watchers.
323 12. Queue all check watchers.
324 13. Call all queued watchers in reverse order (i.e. check watchers first).
325 14. If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
326 was used, return, otherwise continue with step #1.
327
328 =item ev_unloop (loop, how)
329
330 Can be used to make a call to C<ev_loop> return early (but only after it
331 has processed all outstanding events). The C<how> argument must be either
332 C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
333 C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
334
335 =item ev_ref (loop)
336
337 =item ev_unref (loop)
338
339 Ref/unref can be used to add or remove a reference count on the event
340 loop: Every watcher keeps one reference, and as long as the reference
341 count is nonzero, C<ev_loop> will not return on its own. If you have
342 a watcher you never unregister that should not keep C<ev_loop> from
343 returning, ev_unref() after starting, and ev_ref() before stopping it. For
344 example, libev itself uses this for its internal signal pipe: It is not
345 visible to the libev user and should not keep C<ev_loop> from exiting if
346 no event watchers registered by it are active. It is also an excellent
347 way to do this for generic recurring timers or from within third-party
348 libraries. Just remember to I<unref after start> and I<ref before stop>.
349
350 =back
351
352 =head1 ANATOMY OF A WATCHER
353
354 A watcher is a structure that you create and register to record your
355 interest in some event. For instance, if you want to wait for STDIN to
356 become readable, you would create an C<ev_io> watcher for that:
357
358 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
359 {
360 ev_io_stop (w);
361 ev_unloop (loop, EVUNLOOP_ALL);
362 }
363
364 struct ev_loop *loop = ev_default_loop (0);
365 struct ev_io stdin_watcher;
366 ev_init (&stdin_watcher, my_cb);
367 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
368 ev_io_start (loop, &stdin_watcher);
369 ev_loop (loop, 0);
370
371 As you can see, you are responsible for allocating the memory for your
372 watcher structures (and it is usually a bad idea to do this on the stack,
373 although this can sometimes be quite valid).
374
375 Each watcher structure must be initialised by a call to C<ev_init
376 (watcher *, callback)>, which expects a callback to be provided. This
377 callback gets invoked each time the event occurs (or, in the case of io
378 watchers, each time the event loop detects that the file descriptor given
379 is readable and/or writable).
380
381 Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
382 with arguments specific to this watcher type. There is also a macro
383 to combine initialisation and setting in one call: C<< ev_<type>_init
384 (watcher *, callback, ...) >>.
385
386 To make the watcher actually watch out for events, you have to start it
387 with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
388 *) >>), and you can stop watching for events at any time by calling the
389 corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
390
391 As long as your watcher is active (has been started but not stopped) you
392 must not touch the values stored in it. Most specifically you must never
393 reinitialise it or call its set macro.
394
395 You can check whether an event is active by calling the C<ev_is_active
396 (watcher *)> macro. To see whether an event is outstanding (but the
397 callback for it has not been called yet) you can use the C<ev_is_pending
398 (watcher *)> macro.
399
400 Each and every callback receives the event loop pointer as first, the
401 registered watcher structure as second, and a bitset of received events as
402 third argument.
403
404 The received events usually include a single bit per event type received
405 (you can receive multiple events at the same time). The possible bit masks
406 are:
407
408 =over 4
409
410 =item C<EV_READ>
411
412 =item C<EV_WRITE>
413
414 The file descriptor in the C<ev_io> watcher has become readable and/or
415 writable.
416
417 =item C<EV_TIMEOUT>
418
419 The C<ev_timer> watcher has timed out.
420
421 =item C<EV_PERIODIC>
422
423 The C<ev_periodic> watcher has timed out.
424
425 =item C<EV_SIGNAL>
426
427 The signal specified in the C<ev_signal> watcher has been received by a thread.
428
429 =item C<EV_CHILD>
430
431 The pid specified in the C<ev_child> watcher has received a status change.
432
433 =item C<EV_IDLE>
434
435 The C<ev_idle> watcher has determined that you have nothing better to do.
436
437 =item C<EV_PREPARE>
438
439 =item C<EV_CHECK>
440
441 All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
442 to gather new events, and all C<ev_check> watchers are invoked just after
443 C<ev_loop> has gathered them, but before it invokes any callbacks for any
444 received events. Callbacks of both watcher types can start and stop as
445 many watchers as they want, and all of them will be taken into account
446 (for example, a C<ev_prepare> watcher might start an idle watcher to keep
447 C<ev_loop> from blocking).
448
449 =item C<EV_ERROR>
450
451 An unspecified error has occured, the watcher has been stopped. This might
452 happen because the watcher could not be properly started because libev
453 ran out of memory, a file descriptor was found to be closed or any other
454 problem. You best act on it by reporting the problem and somehow coping
455 with the watcher being stopped.
456
457 Libev will usually signal a few "dummy" events together with an error,
458 for example it might indicate that a fd is readable or writable, and if
459 your callbacks is well-written it can just attempt the operation and cope
460 with the error from read() or write(). This will not work in multithreaded
461 programs, though, so beware.
462
463 =back
464
465 =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
466
467 Each watcher has, by default, a member C<void *data> that you can change
468 and read at any time, libev will completely ignore it. This can be used
469 to associate arbitrary data with your watcher. If you need more data and
470 don't want to allocate memory and store a pointer to it in that data
471 member, you can also "subclass" the watcher type and provide your own
472 data:
473
474 struct my_io
475 {
476 struct ev_io io;
477 int otherfd;
478 void *somedata;
479 struct whatever *mostinteresting;
480 }
481
482 And since your callback will be called with a pointer to the watcher, you
483 can cast it back to your own type:
484
485 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
486 {
487 struct my_io *w = (struct my_io *)w_;
488 ...
489 }
490
491 More interesting and less C-conformant ways of catsing your callback type
492 have been omitted....
493
494
495 =head1 WATCHER TYPES
496
497 This section describes each watcher in detail, but will not repeat
498 information given in the last section.
499
500 =head2 C<ev_io> - is this file descriptor readable or writable
501
502 I/O watchers check whether a file descriptor is readable or writable
503 in each iteration of the event loop (This behaviour is called
504 level-triggering because you keep receiving events as long as the
505 condition persists. Remember you can stop the watcher if you don't want to
506 act on the event and neither want to receive future events).
507
508 In general you can register as many read and/or write event watchers per
509 fd as you want (as long as you don't confuse yourself). Setting all file
510 descriptors to non-blocking mode is also usually a good idea (but not
511 required if you know what you are doing).
512
513 You have to be careful with dup'ed file descriptors, though. Some backends
514 (the linux epoll backend is a notable example) cannot handle dup'ed file
515 descriptors correctly if you register interest in two or more fds pointing
516 to the same underlying file/socket etc. description (that is, they share
517 the same underlying "file open").
518
519 If you must do this, then force the use of a known-to-be-good backend
520 (at the time of this writing, this includes only C<EVBACKEND_SELECT> and
521 C<EVBACKEND_POLL>).
522
523 =over 4
524
525 =item ev_io_init (ev_io *, callback, int fd, int events)
526
527 =item ev_io_set (ev_io *, int fd, int events)
528
529 Configures an C<ev_io> watcher. The fd is the file descriptor to rceeive
530 events for and events is either C<EV_READ>, C<EV_WRITE> or C<EV_READ |
531 EV_WRITE> to receive the given events.
532
533 =back
534
535 =head2 C<ev_timer> - relative and optionally recurring timeouts
536
537 Timer watchers are simple relative timers that generate an event after a
538 given time, and optionally repeating in regular intervals after that.
539
540 The timers are based on real time, that is, if you register an event that
541 times out after an hour and you reset your system clock to last years
542 time, it will still time out after (roughly) and hour. "Roughly" because
543 detecting time jumps is hard, and some inaccuracies are unavoidable (the
544 monotonic clock option helps a lot here).
545
546 The relative timeouts are calculated relative to the C<ev_now ()>
547 time. This is usually the right thing as this timestamp refers to the time
548 of the event triggering whatever timeout you are modifying/starting. If
549 you suspect event processing to be delayed and you I<need> to base the timeout
550 on the current time, use something like this to adjust for this:
551
552 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
553
554 The callback is guarenteed to be invoked only when its timeout has passed,
555 but if multiple timers become ready during the same loop iteration then
556 order of execution is undefined.
557
558 =over 4
559
560 =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
561
562 =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
563
564 Configure the timer to trigger after C<after> seconds. If C<repeat> is
565 C<0.>, then it will automatically be stopped. If it is positive, then the
566 timer will automatically be configured to trigger again C<repeat> seconds
567 later, again, and again, until stopped manually.
568
569 The timer itself will do a best-effort at avoiding drift, that is, if you
570 configure a timer to trigger every 10 seconds, then it will trigger at
571 exactly 10 second intervals. If, however, your program cannot keep up with
572 the timer (because it takes longer than those 10 seconds to do stuff) the
573 timer will not fire more than once per event loop iteration.
574
575 =item ev_timer_again (loop)
576
577 This will act as if the timer timed out and restart it again if it is
578 repeating. The exact semantics are:
579
580 If the timer is started but nonrepeating, stop it.
581
582 If the timer is repeating, either start it if necessary (with the repeat
583 value), or reset the running timer to the repeat value.
584
585 This sounds a bit complicated, but here is a useful and typical
586 example: Imagine you have a tcp connection and you want a so-called idle
587 timeout, that is, you want to be called when there have been, say, 60
588 seconds of inactivity on the socket. The easiest way to do this is to
589 configure an C<ev_timer> with after=repeat=60 and calling ev_timer_again each
590 time you successfully read or write some data. If you go into an idle
591 state where you do not expect data to travel on the socket, you can stop
592 the timer, and again will automatically restart it if need be.
593
594 =back
595
596 =head2 C<ev_periodic> - to cron or not to cron
597
598 Periodic watchers are also timers of a kind, but they are very versatile
599 (and unfortunately a bit complex).
600
601 Unlike C<ev_timer>'s, they are not based on real time (or relative time)
602 but on wallclock time (absolute time). You can tell a periodic watcher
603 to trigger "at" some specific point in time. For example, if you tell a
604 periodic watcher to trigger in 10 seconds (by specifiying e.g. c<ev_now ()
605 + 10.>) and then reset your system clock to the last year, then it will
606 take a year to trigger the event (unlike an C<ev_timer>, which would trigger
607 roughly 10 seconds later and of course not if you reset your system time
608 again).
609
610 They can also be used to implement vastly more complex timers, such as
611 triggering an event on eahc midnight, local time.
612
613 As with timers, the callback is guarenteed to be invoked only when the
614 time (C<at>) has been passed, but if multiple periodic timers become ready
615 during the same loop iteration then order of execution is undefined.
616
617 =over 4
618
619 =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
620
621 =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
622
623 Lots of arguments, lets sort it out... There are basically three modes of
624 operation, and we will explain them from simplest to complex:
625
626 =over 4
627
628 =item * absolute timer (interval = reschedule_cb = 0)
629
630 In this configuration the watcher triggers an event at the wallclock time
631 C<at> and doesn't repeat. It will not adjust when a time jump occurs,
632 that is, if it is to be run at January 1st 2011 then it will run when the
633 system time reaches or surpasses this time.
634
635 =item * non-repeating interval timer (interval > 0, reschedule_cb = 0)
636
637 In this mode the watcher will always be scheduled to time out at the next
638 C<at + N * interval> time (for some integer N) and then repeat, regardless
639 of any time jumps.
640
641 This can be used to create timers that do not drift with respect to system
642 time:
643
644 ev_periodic_set (&periodic, 0., 3600., 0);
645
646 This doesn't mean there will always be 3600 seconds in between triggers,
647 but only that the the callback will be called when the system time shows a
648 full hour (UTC), or more correctly, when the system time is evenly divisible
649 by 3600.
650
651 Another way to think about it (for the mathematically inclined) is that
652 C<ev_periodic> will try to run the callback in this mode at the next possible
653 time where C<time = at (mod interval)>, regardless of any time jumps.
654
655 =item * manual reschedule mode (reschedule_cb = callback)
656
657 In this mode the values for C<interval> and C<at> are both being
658 ignored. Instead, each time the periodic watcher gets scheduled, the
659 reschedule callback will be called with the watcher as first, and the
660 current time as second argument.
661
662 NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
663 ever, or make any event loop modifications>. If you need to stop it,
664 return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
665 starting a prepare watcher).
666
667 Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
668 ev_tstamp now)>, e.g.:
669
670 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
671 {
672 return now + 60.;
673 }
674
675 It must return the next time to trigger, based on the passed time value
676 (that is, the lowest time value larger than to the second argument). It
677 will usually be called just before the callback will be triggered, but
678 might be called at other times, too.
679
680 NOTE: I<< This callback must always return a time that is later than the
681 passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
682
683 This can be used to create very complex timers, such as a timer that
684 triggers on each midnight, local time. To do this, you would calculate the
685 next midnight after C<now> and return the timestamp value for this. How
686 you do this is, again, up to you (but it is not trivial, which is the main
687 reason I omitted it as an example).
688
689 =back
690
691 =item ev_periodic_again (loop, ev_periodic *)
692
693 Simply stops and restarts the periodic watcher again. This is only useful
694 when you changed some parameters or the reschedule callback would return
695 a different time than the last time it was called (e.g. in a crond like
696 program when the crontabs have changed).
697
698 =back
699
700 =head2 C<ev_signal> - signal me when a signal gets signalled
701
702 Signal watchers will trigger an event when the process receives a specific
703 signal one or more times. Even though signals are very asynchronous, libev
704 will try it's best to deliver signals synchronously, i.e. as part of the
705 normal event processing, like any other event.
706
707 You can configure as many watchers as you like per signal. Only when the
708 first watcher gets started will libev actually register a signal watcher
709 with the kernel (thus it coexists with your own signal handlers as long
710 as you don't register any with libev). Similarly, when the last signal
711 watcher for a signal is stopped libev will reset the signal handler to
712 SIG_DFL (regardless of what it was set to before).
713
714 =over 4
715
716 =item ev_signal_init (ev_signal *, callback, int signum)
717
718 =item ev_signal_set (ev_signal *, int signum)
719
720 Configures the watcher to trigger on the given signal number (usually one
721 of the C<SIGxxx> constants).
722
723 =back
724
725 =head2 C<ev_child> - wait for pid status changes
726
727 Child watchers trigger when your process receives a SIGCHLD in response to
728 some child status changes (most typically when a child of yours dies).
729
730 =over 4
731
732 =item ev_child_init (ev_child *, callback, int pid)
733
734 =item ev_child_set (ev_child *, int pid)
735
736 Configures the watcher to wait for status changes of process C<pid> (or
737 I<any> process if C<pid> is specified as C<0>). The callback can look
738 at the C<rstatus> member of the C<ev_child> watcher structure to see
739 the status word (use the macros from C<sys/wait.h> and see your systems
740 C<waitpid> documentation). The C<rpid> member contains the pid of the
741 process causing the status change.
742
743 =back
744
745 =head2 C<ev_idle> - when you've got nothing better to do
746
747 Idle watchers trigger events when there are no other events are pending
748 (prepare, check and other idle watchers do not count). That is, as long
749 as your process is busy handling sockets or timeouts (or even signals,
750 imagine) it will not be triggered. But when your process is idle all idle
751 watchers are being called again and again, once per event loop iteration -
752 until stopped, that is, or your process receives more events and becomes
753 busy.
754
755 The most noteworthy effect is that as long as any idle watchers are
756 active, the process will not block when waiting for new events.
757
758 Apart from keeping your process non-blocking (which is a useful
759 effect on its own sometimes), idle watchers are a good place to do
760 "pseudo-background processing", or delay processing stuff to after the
761 event loop has handled all outstanding events.
762
763 =over 4
764
765 =item ev_idle_init (ev_signal *, callback)
766
767 Initialises and configures the idle watcher - it has no parameters of any
768 kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
769 believe me.
770
771 =back
772
773 =head2 C<ev_prepare> and C<ev_check> - customise your event loop
774
775 Prepare and check watchers are usually (but not always) used in tandem:
776 prepare watchers get invoked before the process blocks and check watchers
777 afterwards.
778
779 Their main purpose is to integrate other event mechanisms into libev. This
780 could be used, for example, to track variable changes, implement your own
781 watchers, integrate net-snmp or a coroutine library and lots more.
782
783 This is done by examining in each prepare call which file descriptors need
784 to be watched by the other library, registering C<ev_io> watchers for
785 them and starting an C<ev_timer> watcher for any timeouts (many libraries
786 provide just this functionality). Then, in the check watcher you check for
787 any events that occured (by checking the pending status of all watchers
788 and stopping them) and call back into the library. The I/O and timer
789 callbacks will never actually be called (but must be valid nevertheless,
790 because you never know, you know?).
791
792 As another example, the Perl Coro module uses these hooks to integrate
793 coroutines into libev programs, by yielding to other active coroutines
794 during each prepare and only letting the process block if no coroutines
795 are ready to run (it's actually more complicated: it only runs coroutines
796 with priority higher than or equal to the event loop and one coroutine
797 of lower priority, but only once, using idle watchers to keep the event
798 loop from blocking if lower-priority coroutines are active, thus mapping
799 low-priority coroutines to idle/background tasks).
800
801 =over 4
802
803 =item ev_prepare_init (ev_prepare *, callback)
804
805 =item ev_check_init (ev_check *, callback)
806
807 Initialises and configures the prepare or check watcher - they have no
808 parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
809 macros, but using them is utterly, utterly and completely pointless.
810
811 =back
812
813 =head1 OTHER FUNCTIONS
814
815 There are some other functions of possible interest. Described. Here. Now.
816
817 =over 4
818
819 =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
820
821 This function combines a simple timer and an I/O watcher, calls your
822 callback on whichever event happens first and automatically stop both
823 watchers. This is useful if you want to wait for a single event on an fd
824 or timeout without having to allocate/configure/start/stop/free one or
825 more watchers yourself.
826
827 If C<fd> is less than 0, then no I/O watcher will be started and events
828 is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
829 C<events> set will be craeted and started.
830
831 If C<timeout> is less than 0, then no timeout watcher will be
832 started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
833 repeat = 0) will be started. While C<0> is a valid timeout, it is of
834 dubious value.
835
836 The callback has the type C<void (*cb)(int revents, void *arg)> and gets
837 passed an C<revents> set like normal event callbacks (a combination of
838 C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
839 value passed to C<ev_once>:
840
841 static void stdin_ready (int revents, void *arg)
842 {
843 if (revents & EV_TIMEOUT)
844 /* doh, nothing entered */;
845 else if (revents & EV_READ)
846 /* stdin might have data for us, joy! */;
847 }
848
849 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
850
851 =item ev_feed_event (loop, watcher, int events)
852
853 Feeds the given event set into the event loop, as if the specified event
854 had happened for the specified watcher (which must be a pointer to an
855 initialised but not necessarily started event watcher).
856
857 =item ev_feed_fd_event (loop, int fd, int revents)
858
859 Feed an event on the given fd, as if a file descriptor backend detected
860 the given events it.
861
862 =item ev_feed_signal_event (loop, int signum)
863
864 Feed an event as if the given signal occured (loop must be the default loop!).
865
866 =back
867
868 =head1 LIBEVENT EMULATION
869
870 Libev offers a compatibility emulation layer for libevent. It cannot
871 emulate the internals of libevent, so here are some usage hints:
872
873 =over 4
874
875 =item * Use it by including <event.h>, as usual.
876
877 =item * The following members are fully supported: ev_base, ev_callback,
878 ev_arg, ev_fd, ev_res, ev_events.
879
880 =item * Avoid using ev_flags and the EVLIST_*-macros, while it is
881 maintained by libev, it does not work exactly the same way as in libevent (consider
882 it a private API).
883
884 =item * Priorities are not currently supported. Initialising priorities
885 will fail and all watchers will have the same priority, even though there
886 is an ev_pri field.
887
888 =item * Other members are not supported.
889
890 =item * The libev emulation is I<not> ABI compatible to libevent, you need
891 to use the libev header file and library.
892
893 =back
894
895 =head1 C++ SUPPORT
896
897 TBD.
898
899 =head1 AUTHOR
900
901 Marc Lehmann <libev@schmorp.de>.
902