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

Comparing libev/ev.pod (file contents):
Revision 1.319 by root, Fri Oct 22 10:09:12 2010 UTC vs.
Revision 1.358 by sf-exg, Tue Jan 11 08:43:48 2011 UTC

43 43
44 int 44 int
45 main (void) 45 main (void)
46 { 46 {
47 // use the default event loop unless you have special needs 47 // use the default event loop unless you have special needs
48 struct ev_loop *loop = ev_default_loop (0); 48 struct ev_loop *loop = EV_DEFAULT;
49 49
50 // initialise an io watcher, then start it 50 // initialise an io watcher, then start it
51 // this one will watch for stdin to become readable 51 // this one will watch for stdin to become readable
52 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); 52 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
53 ev_io_start (loop, &stdin_watcher); 53 ev_io_start (loop, &stdin_watcher);
77on event-based programming, nor will it introduce event-based programming 77on event-based programming, nor will it introduce event-based programming
78with libev. 78with libev.
79 79
80Familiarity with event based programming techniques in general is assumed 80Familiarity with event based programming techniques in general is assumed
81throughout this document. 81throughout this document.
82
83=head1 WHAT TO READ WHEN IN A HURRY
84
85This manual tries to be very detailed, but unfortunately, this also makes
86it very long. If you just want to know the basics of libev, I suggest
87reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and
88look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and
89C<ev_timer> sections in L<WATCHER TYPES>.
82 90
83=head1 ABOUT LIBEV 91=head1 ABOUT LIBEV
84 92
85Libev is an event loop: you register interest in certain events (such as a 93Libev is an event loop: you register interest in certain events (such as a
86file descriptor being readable or a timeout occurring), and it will manage 94file descriptor being readable or a timeout occurring), and it will manage
165 173
166=item ev_tstamp ev_time () 174=item ev_tstamp ev_time ()
167 175
168Returns the current time as libev would use it. Please note that the 176Returns the current time as libev would use it. Please note that the
169C<ev_now> function is usually faster and also often returns the timestamp 177C<ev_now> function is usually faster and also often returns the timestamp
170you actually want to know. Also interetsing is the combination of 178you actually want to know. Also interesting is the combination of
171C<ev_update_now> and C<ev_now>. 179C<ev_update_now> and C<ev_now>.
172 180
173=item ev_sleep (ev_tstamp interval) 181=item ev_sleep (ev_tstamp interval)
174 182
175Sleep for the given interval: The current thread will be blocked until 183Sleep for the given interval: The current thread will be blocked until
193as this indicates an incompatible change. Minor versions are usually 201as this indicates an incompatible change. Minor versions are usually
194compatible to older versions, so a larger minor version alone is usually 202compatible to older versions, so a larger minor version alone is usually
195not a problem. 203not a problem.
196 204
197Example: Make sure we haven't accidentally been linked against the wrong 205Example: Make sure we haven't accidentally been linked against the wrong
198version (note, however, that this will not detect ABI mismatches :). 206version (note, however, that this will not detect other ABI mismatches,
207such as LFS or reentrancy).
199 208
200 assert (("libev version mismatch", 209 assert (("libev version mismatch",
201 ev_version_major () == EV_VERSION_MAJOR 210 ev_version_major () == EV_VERSION_MAJOR
202 && ev_version_minor () >= EV_VERSION_MINOR)); 211 && ev_version_minor () >= EV_VERSION_MINOR));
203 212
232the current system, you would need to look at C<ev_embeddable_backends () 241the current system, you would need to look at C<ev_embeddable_backends ()
233& ev_supported_backends ()>, likewise for recommended ones. 242& ev_supported_backends ()>, likewise for recommended ones.
234 243
235See the description of C<ev_embed> watchers for more info. 244See the description of C<ev_embed> watchers for more info.
236 245
237=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT] 246=item ev_set_allocator (void *(*cb)(void *ptr, long size))
238 247
239Sets the allocation function to use (the prototype is similar - the 248Sets the allocation function to use (the prototype is similar - the
240semantics are identical to the C<realloc> C89/SuS/POSIX function). It is 249semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
241used to allocate and free memory (no surprises here). If it returns zero 250used to allocate and free memory (no surprises here). If it returns zero
242when memory needs to be allocated (C<size != 0>), the library might abort 251when memory needs to be allocated (C<size != 0>), the library might abort
268 } 277 }
269 278
270 ... 279 ...
271 ev_set_allocator (persistent_realloc); 280 ev_set_allocator (persistent_realloc);
272 281
273=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT] 282=item ev_set_syserr_cb (void (*cb)(const char *msg))
274 283
275Set the callback function to call on a retryable system call error (such 284Set the callback function to call on a retryable system call error (such
276as failed select, poll, epoll_wait). The message is a printable string 285as failed select, poll, epoll_wait). The message is a printable string
277indicating the system call or subsystem causing the problem. If this 286indicating the system call or subsystem causing the problem. If this
278callback is set, then libev will expect it to remedy the situation, no 287callback is set, then libev will expect it to remedy the situation, no
290 } 299 }
291 300
292 ... 301 ...
293 ev_set_syserr_cb (fatal_error); 302 ev_set_syserr_cb (fatal_error);
294 303
304=item ev_feed_signal (int signum)
305
306This function can be used to "simulate" a signal receive. It is completely
307safe to call this function at any time, from any context, including signal
308handlers or random threads.
309
310Its main use is to customise signal handling in your process, especially
311in the presence of threads. For example, you could block signals
312by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
313creating any loops), and in one thread, use C<sigwait> or any other
314mechanism to wait for signals, then "deliver" them to libev by calling
315C<ev_feed_signal>.
316
295=back 317=back
296 318
297=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 319=head1 FUNCTIONS CONTROLLING EVENT LOOPS
298 320
299An event loop is described by a C<struct ev_loop *> (the C<struct> is 321An event loop is described by a C<struct ev_loop *> (the C<struct> is
300I<not> optional in this case unless libev 3 compatibility is disabled, as 322I<not> optional in this case unless libev 3 compatibility is disabled, as
301libev 3 had an C<ev_loop> function colliding with the struct name). 323libev 3 had an C<ev_loop> function colliding with the struct name).
302 324
303The library knows two types of such loops, the I<default> loop, which 325The library knows two types of such loops, the I<default> loop, which
304supports signals and child events, and dynamically created event loops 326supports child process events, and dynamically created event loops which
305which do not. 327do not.
306 328
307=over 4 329=over 4
308 330
309=item struct ev_loop *ev_default_loop (unsigned int flags) 331=item struct ev_loop *ev_default_loop (unsigned int flags)
310 332
311This will initialise the default event loop if it hasn't been initialised 333This returns the "default" event loop object, which is what you should
312yet and return it. If the default loop could not be initialised, returns 334normally use when you just need "the event loop". Event loop objects and
313false. If it already was initialised it simply returns it (and ignores the 335the C<flags> parameter are described in more detail in the entry for
314flags. If that is troubling you, check C<ev_backend ()> afterwards). 336C<ev_loop_new>.
337
338If the default loop is already initialised then this function simply
339returns it (and ignores the flags. If that is troubling you, check
340C<ev_backend ()> afterwards). Otherwise it will create it with the given
341flags, which should almost always be C<0>, unless the caller is also the
342one calling C<ev_run> or otherwise qualifies as "the main program".
315 343
316If you don't know what event loop to use, use the one returned from this 344If you don't know what event loop to use, use the one returned from this
317function. 345function (or via the C<EV_DEFAULT> macro).
318 346
319Note that this function is I<not> thread-safe, so if you want to use it 347Note that this function is I<not> thread-safe, so if you want to use it
320from multiple threads, you have to lock (note also that this is unlikely, 348from multiple threads, you have to employ some kind of mutex (note also
321as loops cannot be shared easily between threads anyway). 349that this case is unlikely, as loops cannot be shared easily between
350threads anyway).
322 351
323The default loop is the only loop that can handle C<ev_signal> and 352The default loop is the only loop that can handle C<ev_child> watchers,
324C<ev_child> watchers, and to do this, it always registers a handler 353and to do this, it always registers a handler for C<SIGCHLD>. If this is
325for C<SIGCHLD>. If this is a problem for your application you can either 354a problem for your application you can either create a dynamic loop with
326create a dynamic loop with C<ev_loop_new> that doesn't do that, or you 355C<ev_loop_new> which doesn't do that, or you can simply overwrite the
327can simply overwrite the C<SIGCHLD> signal handler I<after> calling 356C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
328C<ev_default_init>. 357
358Example: This is the most typical usage.
359
360 if (!ev_default_loop (0))
361 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
362
363Example: Restrict libev to the select and poll backends, and do not allow
364environment settings to be taken into account:
365
366 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
367
368=item struct ev_loop *ev_loop_new (unsigned int flags)
369
370This will create and initialise a new event loop object. If the loop
371could not be initialised, returns false.
372
373This function is thread-safe, and one common way to use libev with
374threads is indeed to create one loop per thread, and using the default
375loop in the "main" or "initial" thread.
329 376
330The flags argument can be used to specify special behaviour or specific 377The flags argument can be used to specify special behaviour or specific
331backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). 378backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
332 379
333The following flags are supported: 380The following flags are supported:
368environment variable. 415environment variable.
369 416
370=item C<EVFLAG_NOINOTIFY> 417=item C<EVFLAG_NOINOTIFY>
371 418
372When this flag is specified, then libev will not attempt to use the 419When this flag is specified, then libev will not attempt to use the
373I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and 420I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
374testing, this flag can be useful to conserve inotify file descriptors, as 421testing, this flag can be useful to conserve inotify file descriptors, as
375otherwise each loop using C<ev_stat> watchers consumes one inotify handle. 422otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
376 423
377=item C<EVFLAG_SIGNALFD> 424=item C<EVFLAG_SIGNALFD>
378 425
379When this flag is specified, then libev will attempt to use the 426When this flag is specified, then libev will attempt to use the
380I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API 427I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API
381delivers signals synchronously, which makes it both faster and might make 428delivers signals synchronously, which makes it both faster and might make
382it possible to get the queued signal data. It can also simplify signal 429it possible to get the queued signal data. It can also simplify signal
383handling with threads, as long as you properly block signals in your 430handling with threads, as long as you properly block signals in your
384threads that are not interested in handling them. 431threads that are not interested in handling them.
385 432
386Signalfd will not be used by default as this changes your signal mask, and 433Signalfd will not be used by default as this changes your signal mask, and
387there are a lot of shoddy libraries and programs (glib's threadpool for 434there are a lot of shoddy libraries and programs (glib's threadpool for
388example) that can't properly initialise their signal masks. 435example) that can't properly initialise their signal masks.
436
437=item C<EVFLAG_NOSIGMASK>
438
439When this flag is specified, then libev will avoid to modify the signal
440mask. Specifically, this means you ahve to make sure signals are unblocked
441when you want to receive them.
442
443This behaviour is useful when you want to do your own signal handling, or
444want to handle signals only in specific threads and want to avoid libev
445unblocking the signals.
446
447This flag's behaviour will become the default in future versions of libev.
389 448
390=item C<EVBACKEND_SELECT> (value 1, portable select backend) 449=item C<EVBACKEND_SELECT> (value 1, portable select backend)
391 450
392This is your standard select(2) backend. Not I<completely> standard, as 451This is your standard select(2) backend. Not I<completely> standard, as
393libev tries to roll its own fd_set with no limits on the number of fds, 452libev tries to roll its own fd_set with no limits on the number of fds,
429epoll scales either O(1) or O(active_fds). 488epoll scales either O(1) or O(active_fds).
430 489
431The epoll mechanism deserves honorable mention as the most misdesigned 490The epoll mechanism deserves honorable mention as the most misdesigned
432of the more advanced event mechanisms: mere annoyances include silently 491of the more advanced event mechanisms: mere annoyances include silently
433dropping file descriptors, requiring a system call per change per file 492dropping file descriptors, requiring a system call per change per file
434descriptor (and unnecessary guessing of parameters), problems with dup and 493descriptor (and unnecessary guessing of parameters), problems with dup,
494returning before the timeout value, resulting in additional iterations
495(and only giving 5ms accuracy while select on the same platform gives
435so on. The biggest issue is fork races, however - if a program forks then 4960.1ms) and so on. The biggest issue is fork races, however - if a program
436I<both> parent and child process have to recreate the epoll set, which can 497forks then I<both> parent and child process have to recreate the epoll
437take considerable time (one syscall per file descriptor) and is of course 498set, which can take considerable time (one syscall per file descriptor)
438hard to detect. 499and is of course hard to detect.
439 500
440Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 501Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
441of course I<doesn't>, and epoll just loves to report events for totally 502of course I<doesn't>, and epoll just loves to report events for totally
442I<different> file descriptors (even already closed ones, so one cannot 503I<different> file descriptors (even already closed ones, so one cannot
443even remove them from the set) than registered in the set (especially 504even remove them from the set) than registered in the set (especially
445employing an additional generation counter and comparing that against the 506employing an additional generation counter and comparing that against the
446events to filter out spurious ones, recreating the set when required. Last 507events to filter out spurious ones, recreating the set when required. Last
447not least, it also refuses to work with some file descriptors which work 508not least, it also refuses to work with some file descriptors which work
448perfectly fine with C<select> (files, many character devices...). 509perfectly fine with C<select> (files, many character devices...).
449 510
511Epoll is truly the train wreck analog among event poll mechanisms,
512a frankenpoll, cobbled together in a hurry, no thought to design or
513interaction with others.
514
450While stopping, setting and starting an I/O watcher in the same iteration 515While stopping, setting and starting an I/O watcher in the same iteration
451will result in some caching, there is still a system call per such 516will result in some caching, there is still a system call per such
452incident (because the same I<file descriptor> could point to a different 517incident (because the same I<file descriptor> could point to a different
453I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 518I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
454file descriptors might not work very well if you register events for both 519file descriptors might not work very well if you register events for both
519=item C<EVBACKEND_PORT> (value 32, Solaris 10) 584=item C<EVBACKEND_PORT> (value 32, Solaris 10)
520 585
521This uses the Solaris 10 event port mechanism. As with everything on Solaris, 586This uses the Solaris 10 event port mechanism. As with everything on Solaris,
522it's really slow, but it still scales very well (O(active_fds)). 587it's really slow, but it still scales very well (O(active_fds)).
523 588
524Please note that Solaris event ports can deliver a lot of spurious
525notifications, so you need to use non-blocking I/O or other means to avoid
526blocking when no data (or space) is available.
527
528While this backend scales well, it requires one system call per active 589While this backend scales well, it requires one system call per active
529file descriptor per loop iteration. For small and medium numbers of file 590file descriptor per loop iteration. For small and medium numbers of file
530descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 591descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
531might perform better. 592might perform better.
532 593
533On the positive side, with the exception of the spurious readiness 594On the positive side, this backend actually performed fully to
534notifications, this backend actually performed fully to specification
535in all tests and is fully embeddable, which is a rare feat among the 595specification in all tests and is fully embeddable, which is a rare feat
536OS-specific backends (I vastly prefer correctness over speed hacks). 596among the OS-specific backends (I vastly prefer correctness over speed
597hacks).
598
599On the negative side, the interface is I<bizarre> - so bizarre that
600even sun itself gets it wrong in their code examples: The event polling
601function sometimes returning events to the caller even though an error
602occurred, but with no indication whether it has done so or not (yes, it's
603even documented that way) - deadly for edge-triggered interfaces where
604you absolutely have to know whether an event occurred or not because you
605have to re-arm the watcher.
606
607Fortunately libev seems to be able to work around these idiocies.
537 608
538This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 609This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
539C<EVBACKEND_POLL>. 610C<EVBACKEND_POLL>.
540 611
541=item C<EVBACKEND_ALL> 612=item C<EVBACKEND_ALL>
542 613
543Try all backends (even potentially broken ones that wouldn't be tried 614Try all backends (even potentially broken ones that wouldn't be tried
544with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 615with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
545C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 616C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
546 617
547It is definitely not recommended to use this flag. 618It is definitely not recommended to use this flag, use whatever
619C<ev_recommended_backends ()> returns, or simply do not specify a backend
620at all.
621
622=item C<EVBACKEND_MASK>
623
624Not a backend at all, but a mask to select all backend bits from a
625C<flags> value, in case you want to mask out any backends from a flags
626value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
548 627
549=back 628=back
550 629
551If one or more of the backend flags are or'ed into the flags value, 630If one or more of the backend flags are or'ed into the flags value,
552then only these backends will be tried (in the reverse order as listed 631then only these backends will be tried (in the reverse order as listed
553here). If none are specified, all backends in C<ev_recommended_backends 632here). If none are specified, all backends in C<ev_recommended_backends
554()> will be tried. 633()> will be tried.
555 634
556Example: This is the most typical usage.
557
558 if (!ev_default_loop (0))
559 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
560
561Example: Restrict libev to the select and poll backends, and do not allow
562environment settings to be taken into account:
563
564 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
565
566Example: Use whatever libev has to offer, but make sure that kqueue is
567used if available (warning, breaks stuff, best use only with your own
568private event loop and only if you know the OS supports your types of
569fds):
570
571 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
572
573=item struct ev_loop *ev_loop_new (unsigned int flags)
574
575Similar to C<ev_default_loop>, but always creates a new event loop that is
576always distinct from the default loop.
577
578Note that this function I<is> thread-safe, and one common way to use
579libev with threads is indeed to create one loop per thread, and using the
580default loop in the "main" or "initial" thread.
581
582Example: Try to create a event loop that uses epoll and nothing else. 635Example: Try to create a event loop that uses epoll and nothing else.
583 636
584 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 637 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
585 if (!epoller) 638 if (!epoller)
586 fatal ("no epoll found here, maybe it hides under your chair"); 639 fatal ("no epoll found here, maybe it hides under your chair");
587 640
641Example: Use whatever libev has to offer, but make sure that kqueue is
642used if available.
643
644 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
645
588=item ev_default_destroy () 646=item ev_loop_destroy (loop)
589 647
590Destroys the default loop (frees all memory and kernel state etc.). None 648Destroys an event loop object (frees all memory and kernel state
591of the active event watchers will be stopped in the normal sense, so 649etc.). None of the active event watchers will be stopped in the normal
592e.g. C<ev_is_active> might still return true. It is your responsibility to 650sense, so e.g. C<ev_is_active> might still return true. It is your
593either stop all watchers cleanly yourself I<before> calling this function, 651responsibility to either stop all watchers cleanly yourself I<before>
594or cope with the fact afterwards (which is usually the easiest thing, you 652calling this function, or cope with the fact afterwards (which is usually
595can just ignore the watchers and/or C<free ()> them for example). 653the easiest thing, you can just ignore the watchers and/or C<free ()> them
654for example).
596 655
597Note that certain global state, such as signal state (and installed signal 656Note that certain global state, such as signal state (and installed signal
598handlers), will not be freed by this function, and related watchers (such 657handlers), will not be freed by this function, and related watchers (such
599as signal and child watchers) would need to be stopped manually. 658as signal and child watchers) would need to be stopped manually.
600 659
601In general it is not advisable to call this function except in the 660This function is normally used on loop objects allocated by
602rare occasion where you really need to free e.g. the signal handling 661C<ev_loop_new>, but it can also be used on the default loop returned by
662C<ev_default_loop>, in which case it is not thread-safe.
663
664Note that it is not advisable to call this function on the default loop
665except in the rare occasion where you really need to free its resources.
603pipe fds. If you need dynamically allocated loops it is better to use 666If you need dynamically allocated loops it is better to use C<ev_loop_new>
604C<ev_loop_new> and C<ev_loop_destroy>. 667and C<ev_loop_destroy>.
605 668
606=item ev_loop_destroy (loop) 669=item ev_loop_fork (loop)
607 670
608Like C<ev_default_destroy>, but destroys an event loop created by an
609earlier call to C<ev_loop_new>.
610
611=item ev_default_fork ()
612
613This function sets a flag that causes subsequent C<ev_run> iterations 671This function sets a flag that causes subsequent C<ev_run> iterations to
614to reinitialise the kernel state for backends that have one. Despite the 672reinitialise the kernel state for backends that have one. Despite the
615name, you can call it anytime, but it makes most sense after forking, in 673name, you can call it anytime, but it makes most sense after forking, in
616the child process (or both child and parent, but that again makes little 674the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
617sense). You I<must> call it in the child before using any of the libev 675child before resuming or calling C<ev_run>.
618functions, and it will only take effect at the next C<ev_run> iteration.
619 676
620Again, you I<have> to call it on I<any> loop that you want to re-use after 677Again, you I<have> to call it on I<any> loop that you want to re-use after
621a fork, I<even if you do not plan to use the loop in the parent>. This is 678a fork, I<even if you do not plan to use the loop in the parent>. This is
622because some kernel interfaces *cough* I<kqueue> *cough* do funny things 679because some kernel interfaces *cough* I<kqueue> *cough* do funny things
623during fork. 680during fork.
628call it at all (in fact, C<epoll> is so badly broken that it makes a 685call it at all (in fact, C<epoll> is so badly broken that it makes a
629difference, but libev will usually detect this case on its own and do a 686difference, but libev will usually detect this case on its own and do a
630costly reset of the backend). 687costly reset of the backend).
631 688
632The function itself is quite fast and it's usually not a problem to call 689The function itself is quite fast and it's usually not a problem to call
633it just in case after a fork. To make this easy, the function will fit in 690it just in case after a fork.
634quite nicely into a call to C<pthread_atfork>:
635 691
692Example: Automate calling C<ev_loop_fork> on the default loop when
693using pthreads.
694
695 static void
696 post_fork_child (void)
697 {
698 ev_loop_fork (EV_DEFAULT);
699 }
700
701 ...
636 pthread_atfork (0, 0, ev_default_fork); 702 pthread_atfork (0, 0, post_fork_child);
637
638=item ev_loop_fork (loop)
639
640Like C<ev_default_fork>, but acts on an event loop created by
641C<ev_loop_new>. Yes, you have to call this on every allocated event loop
642after fork that you want to re-use in the child, and how you keep track of
643them is entirely your own problem.
644 703
645=item int ev_is_default_loop (loop) 704=item int ev_is_default_loop (loop)
646 705
647Returns true when the given loop is, in fact, the default loop, and false 706Returns true when the given loop is, in fact, the default loop, and false
648otherwise. 707otherwise.
659prepare and check phases. 718prepare and check phases.
660 719
661=item unsigned int ev_depth (loop) 720=item unsigned int ev_depth (loop)
662 721
663Returns the number of times C<ev_run> was entered minus the number of 722Returns the number of times C<ev_run> was entered minus the number of
664times C<ev_run> was exited, in other words, the recursion depth. 723times C<ev_run> was exited normally, in other words, the recursion depth.
665 724
666Outside C<ev_run>, this number is zero. In a callback, this number is 725Outside C<ev_run>, this number is zero. In a callback, this number is
667C<1>, unless C<ev_run> was invoked recursively (or from another thread), 726C<1>, unless C<ev_run> was invoked recursively (or from another thread),
668in which case it is higher. 727in which case it is higher.
669 728
670Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 729Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
671etc.), doesn't count as "exit" - consider this as a hint to avoid such 730throwing an exception etc.), doesn't count as "exit" - consider this
672ungentleman-like behaviour unless it's really convenient. 731as a hint to avoid such ungentleman-like behaviour unless it's really
732convenient, in which case it is fully supported.
673 733
674=item unsigned int ev_backend (loop) 734=item unsigned int ev_backend (loop)
675 735
676Returns one of the C<EVBACKEND_*> flags indicating the event backend in 736Returns one of the C<EVBACKEND_*> flags indicating the event backend in
677use. 737use.
738relying on all watchers to be stopped when deciding when a program has 798relying on all watchers to be stopped when deciding when a program has
739finished (especially in interactive programs), but having a program 799finished (especially in interactive programs), but having a program
740that automatically loops as long as it has to and no longer by virtue 800that automatically loops as long as it has to and no longer by virtue
741of relying on its watchers stopping correctly, that is truly a thing of 801of relying on its watchers stopping correctly, that is truly a thing of
742beauty. 802beauty.
803
804This function is also I<mostly> exception-safe - you can break out of
805a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
806exception and so on. This does not decrement the C<ev_depth> value, nor
807will it clear any outstanding C<EVBREAK_ONE> breaks.
743 808
744A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 809A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
745those events and any already outstanding ones, but will not wait and 810those events and any already outstanding ones, but will not wait and
746block your process in case there are no events and will return after one 811block your process in case there are no events and will return after one
747iteration of the loop. This is sometimes useful to poll and handle new 812iteration of the loop. This is sometimes useful to poll and handle new
809Can be used to make a call to C<ev_run> return early (but only after it 874Can be used to make a call to C<ev_run> return early (but only after it
810has processed all outstanding events). The C<how> argument must be either 875has processed all outstanding events). The C<how> argument must be either
811C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or 876C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
812C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return. 877C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
813 878
814This "unloop state" will be cleared when entering C<ev_run> again. 879This "break state" will be cleared on the next call to C<ev_run>.
815 880
816It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## 881It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
882which case it will have no effect.
817 883
818=item ev_ref (loop) 884=item ev_ref (loop)
819 885
820=item ev_unref (loop) 886=item ev_unref (loop)
821 887
842running when nothing else is active. 908running when nothing else is active.
843 909
844 ev_signal exitsig; 910 ev_signal exitsig;
845 ev_signal_init (&exitsig, sig_cb, SIGINT); 911 ev_signal_init (&exitsig, sig_cb, SIGINT);
846 ev_signal_start (loop, &exitsig); 912 ev_signal_start (loop, &exitsig);
847 evf_unref (loop); 913 ev_unref (loop);
848 914
849Example: For some weird reason, unregister the above signal handler again. 915Example: For some weird reason, unregister the above signal handler again.
850 916
851 ev_ref (loop); 917 ev_ref (loop);
852 ev_signal_stop (loop, &exitsig); 918 ev_signal_stop (loop, &exitsig);
964See also the locking example in the C<THREADS> section later in this 1030See also the locking example in the C<THREADS> section later in this
965document. 1031document.
966 1032
967=item ev_set_userdata (loop, void *data) 1033=item ev_set_userdata (loop, void *data)
968 1034
969=item ev_userdata (loop) 1035=item void *ev_userdata (loop)
970 1036
971Set and retrieve a single C<void *> associated with a loop. When 1037Set and retrieve a single C<void *> associated with a loop. When
972C<ev_set_userdata> has never been called, then C<ev_userdata> returns 1038C<ev_set_userdata> has never been called, then C<ev_userdata> returns
973C<0.> 1039C<0>.
974 1040
975These two functions can be used to associate arbitrary data with a loop, 1041These two functions can be used to associate arbitrary data with a loop,
976and are intended solely for the C<invoke_pending_cb>, C<release> and 1042and are intended solely for the C<invoke_pending_cb>, C<release> and
977C<acquire> callbacks described above, but of course can be (ab-)used for 1043C<acquire> callbacks described above, but of course can be (ab-)used for
978any other purpose as well. 1044any other purpose as well.
1106=item C<EV_FORK> 1172=item C<EV_FORK>
1107 1173
1108The event loop has been resumed in the child process after fork (see 1174The event loop has been resumed in the child process after fork (see
1109C<ev_fork>). 1175C<ev_fork>).
1110 1176
1177=item C<EV_CLEANUP>
1178
1179The event loop is about to be destroyed (see C<ev_cleanup>).
1180
1111=item C<EV_ASYNC> 1181=item C<EV_ASYNC>
1112 1182
1113The given async watcher has been asynchronously notified (see C<ev_async>). 1183The given async watcher has been asynchronously notified (see C<ev_async>).
1114 1184
1115=item C<EV_CUSTOM> 1185=item C<EV_CUSTOM>
1136programs, though, as the fd could already be closed and reused for another 1206programs, though, as the fd could already be closed and reused for another
1137thing, so beware. 1207thing, so beware.
1138 1208
1139=back 1209=back
1140 1210
1211=head2 GENERIC WATCHER FUNCTIONS
1212
1213=over 4
1214
1215=item C<ev_init> (ev_TYPE *watcher, callback)
1216
1217This macro initialises the generic portion of a watcher. The contents
1218of the watcher object can be arbitrary (so C<malloc> will do). Only
1219the generic parts of the watcher are initialised, you I<need> to call
1220the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1221type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1222which rolls both calls into one.
1223
1224You can reinitialise a watcher at any time as long as it has been stopped
1225(or never started) and there are no pending events outstanding.
1226
1227The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1228int revents)>.
1229
1230Example: Initialise an C<ev_io> watcher in two steps.
1231
1232 ev_io w;
1233 ev_init (&w, my_cb);
1234 ev_io_set (&w, STDIN_FILENO, EV_READ);
1235
1236=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1237
1238This macro initialises the type-specific parts of a watcher. You need to
1239call C<ev_init> at least once before you call this macro, but you can
1240call C<ev_TYPE_set> any number of times. You must not, however, call this
1241macro on a watcher that is active (it can be pending, however, which is a
1242difference to the C<ev_init> macro).
1243
1244Although some watcher types do not have type-specific arguments
1245(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1246
1247See C<ev_init>, above, for an example.
1248
1249=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1250
1251This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1252calls into a single call. This is the most convenient method to initialise
1253a watcher. The same limitations apply, of course.
1254
1255Example: Initialise and set an C<ev_io> watcher in one step.
1256
1257 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1258
1259=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1260
1261Starts (activates) the given watcher. Only active watchers will receive
1262events. If the watcher is already active nothing will happen.
1263
1264Example: Start the C<ev_io> watcher that is being abused as example in this
1265whole section.
1266
1267 ev_io_start (EV_DEFAULT_UC, &w);
1268
1269=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1270
1271Stops the given watcher if active, and clears the pending status (whether
1272the watcher was active or not).
1273
1274It is possible that stopped watchers are pending - for example,
1275non-repeating timers are being stopped when they become pending - but
1276calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1277pending. If you want to free or reuse the memory used by the watcher it is
1278therefore a good idea to always call its C<ev_TYPE_stop> function.
1279
1280=item bool ev_is_active (ev_TYPE *watcher)
1281
1282Returns a true value iff the watcher is active (i.e. it has been started
1283and not yet been stopped). As long as a watcher is active you must not modify
1284it.
1285
1286=item bool ev_is_pending (ev_TYPE *watcher)
1287
1288Returns a true value iff the watcher is pending, (i.e. it has outstanding
1289events but its callback has not yet been invoked). As long as a watcher
1290is pending (but not active) you must not call an init function on it (but
1291C<ev_TYPE_set> is safe), you must not change its priority, and you must
1292make sure the watcher is available to libev (e.g. you cannot C<free ()>
1293it).
1294
1295=item callback ev_cb (ev_TYPE *watcher)
1296
1297Returns the callback currently set on the watcher.
1298
1299=item ev_cb_set (ev_TYPE *watcher, callback)
1300
1301Change the callback. You can change the callback at virtually any time
1302(modulo threads).
1303
1304=item ev_set_priority (ev_TYPE *watcher, int priority)
1305
1306=item int ev_priority (ev_TYPE *watcher)
1307
1308Set and query the priority of the watcher. The priority is a small
1309integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1310(default: C<-2>). Pending watchers with higher priority will be invoked
1311before watchers with lower priority, but priority will not keep watchers
1312from being executed (except for C<ev_idle> watchers).
1313
1314If you need to suppress invocation when higher priority events are pending
1315you need to look at C<ev_idle> watchers, which provide this functionality.
1316
1317You I<must not> change the priority of a watcher as long as it is active or
1318pending.
1319
1320Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1321fine, as long as you do not mind that the priority value you query might
1322or might not have been clamped to the valid range.
1323
1324The default priority used by watchers when no priority has been set is
1325always C<0>, which is supposed to not be too high and not be too low :).
1326
1327See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1328priorities.
1329
1330=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1331
1332Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1333C<loop> nor C<revents> need to be valid as long as the watcher callback
1334can deal with that fact, as both are simply passed through to the
1335callback.
1336
1337=item int ev_clear_pending (loop, ev_TYPE *watcher)
1338
1339If the watcher is pending, this function clears its pending status and
1340returns its C<revents> bitset (as if its callback was invoked). If the
1341watcher isn't pending it does nothing and returns C<0>.
1342
1343Sometimes it can be useful to "poll" a watcher instead of waiting for its
1344callback to be invoked, which can be accomplished with this function.
1345
1346=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1347
1348Feeds the given event set into the event loop, as if the specified event
1349had happened for the specified watcher (which must be a pointer to an
1350initialised but not necessarily started event watcher). Obviously you must
1351not free the watcher as long as it has pending events.
1352
1353Stopping the watcher, letting libev invoke it, or calling
1354C<ev_clear_pending> will clear the pending event, even if the watcher was
1355not started in the first place.
1356
1357See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1358functions that do not need a watcher.
1359
1360=back
1361
1362See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1363OWN COMPOSITE WATCHERS> idioms.
1364
1141=head2 WATCHER STATES 1365=head2 WATCHER STATES
1142 1366
1143There are various watcher states mentioned throughout this manual - 1367There are various watcher states mentioned throughout this manual -
1144active, pending and so on. In this section these states and the rules to 1368active, pending and so on. In this section these states and the rules to
1145transition between them will be described in more detail - and while these 1369transition between them will be described in more detail - and while these
1194While stopped (and not pending) the watcher is essentially in the 1418While stopped (and not pending) the watcher is essentially in the
1195initialised state, that is it can be reused, moved, modified in any way 1419initialised state, that is it can be reused, moved, modified in any way
1196you wish. 1420you wish.
1197 1421
1198=back 1422=back
1199
1200=head2 GENERIC WATCHER FUNCTIONS
1201
1202=over 4
1203
1204=item C<ev_init> (ev_TYPE *watcher, callback)
1205
1206This macro initialises the generic portion of a watcher. The contents
1207of the watcher object can be arbitrary (so C<malloc> will do). Only
1208the generic parts of the watcher are initialised, you I<need> to call
1209the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1210type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1211which rolls both calls into one.
1212
1213You can reinitialise a watcher at any time as long as it has been stopped
1214(or never started) and there are no pending events outstanding.
1215
1216The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1217int revents)>.
1218
1219Example: Initialise an C<ev_io> watcher in two steps.
1220
1221 ev_io w;
1222 ev_init (&w, my_cb);
1223 ev_io_set (&w, STDIN_FILENO, EV_READ);
1224
1225=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1226
1227This macro initialises the type-specific parts of a watcher. You need to
1228call C<ev_init> at least once before you call this macro, but you can
1229call C<ev_TYPE_set> any number of times. You must not, however, call this
1230macro on a watcher that is active (it can be pending, however, which is a
1231difference to the C<ev_init> macro).
1232
1233Although some watcher types do not have type-specific arguments
1234(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1235
1236See C<ev_init>, above, for an example.
1237
1238=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1239
1240This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1241calls into a single call. This is the most convenient method to initialise
1242a watcher. The same limitations apply, of course.
1243
1244Example: Initialise and set an C<ev_io> watcher in one step.
1245
1246 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1247
1248=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1249
1250Starts (activates) the given watcher. Only active watchers will receive
1251events. If the watcher is already active nothing will happen.
1252
1253Example: Start the C<ev_io> watcher that is being abused as example in this
1254whole section.
1255
1256 ev_io_start (EV_DEFAULT_UC, &w);
1257
1258=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1259
1260Stops the given watcher if active, and clears the pending status (whether
1261the watcher was active or not).
1262
1263It is possible that stopped watchers are pending - for example,
1264non-repeating timers are being stopped when they become pending - but
1265calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1266pending. If you want to free or reuse the memory used by the watcher it is
1267therefore a good idea to always call its C<ev_TYPE_stop> function.
1268
1269=item bool ev_is_active (ev_TYPE *watcher)
1270
1271Returns a true value iff the watcher is active (i.e. it has been started
1272and not yet been stopped). As long as a watcher is active you must not modify
1273it.
1274
1275=item bool ev_is_pending (ev_TYPE *watcher)
1276
1277Returns a true value iff the watcher is pending, (i.e. it has outstanding
1278events but its callback has not yet been invoked). As long as a watcher
1279is pending (but not active) you must not call an init function on it (but
1280C<ev_TYPE_set> is safe), you must not change its priority, and you must
1281make sure the watcher is available to libev (e.g. you cannot C<free ()>
1282it).
1283
1284=item callback ev_cb (ev_TYPE *watcher)
1285
1286Returns the callback currently set on the watcher.
1287
1288=item ev_cb_set (ev_TYPE *watcher, callback)
1289
1290Change the callback. You can change the callback at virtually any time
1291(modulo threads).
1292
1293=item ev_set_priority (ev_TYPE *watcher, int priority)
1294
1295=item int ev_priority (ev_TYPE *watcher)
1296
1297Set and query the priority of the watcher. The priority is a small
1298integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1299(default: C<-2>). Pending watchers with higher priority will be invoked
1300before watchers with lower priority, but priority will not keep watchers
1301from being executed (except for C<ev_idle> watchers).
1302
1303If you need to suppress invocation when higher priority events are pending
1304you need to look at C<ev_idle> watchers, which provide this functionality.
1305
1306You I<must not> change the priority of a watcher as long as it is active or
1307pending.
1308
1309Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1310fine, as long as you do not mind that the priority value you query might
1311or might not have been clamped to the valid range.
1312
1313The default priority used by watchers when no priority has been set is
1314always C<0>, which is supposed to not be too high and not be too low :).
1315
1316See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1317priorities.
1318
1319=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1320
1321Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1322C<loop> nor C<revents> need to be valid as long as the watcher callback
1323can deal with that fact, as both are simply passed through to the
1324callback.
1325
1326=item int ev_clear_pending (loop, ev_TYPE *watcher)
1327
1328If the watcher is pending, this function clears its pending status and
1329returns its C<revents> bitset (as if its callback was invoked). If the
1330watcher isn't pending it does nothing and returns C<0>.
1331
1332Sometimes it can be useful to "poll" a watcher instead of waiting for its
1333callback to be invoked, which can be accomplished with this function.
1334
1335=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1336
1337Feeds the given event set into the event loop, as if the specified event
1338had happened for the specified watcher (which must be a pointer to an
1339initialised but not necessarily started event watcher). Obviously you must
1340not free the watcher as long as it has pending events.
1341
1342Stopping the watcher, letting libev invoke it, or calling
1343C<ev_clear_pending> will clear the pending event, even if the watcher was
1344not started in the first place.
1345
1346See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1347functions that do not need a watcher.
1348
1349=back
1350
1351
1352=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1353
1354Each watcher has, by default, a member C<void *data> that you can change
1355and read at any time: libev will completely ignore it. This can be used
1356to associate arbitrary data with your watcher. If you need more data and
1357don't want to allocate memory and store a pointer to it in that data
1358member, you can also "subclass" the watcher type and provide your own
1359data:
1360
1361 struct my_io
1362 {
1363 ev_io io;
1364 int otherfd;
1365 void *somedata;
1366 struct whatever *mostinteresting;
1367 };
1368
1369 ...
1370 struct my_io w;
1371 ev_io_init (&w.io, my_cb, fd, EV_READ);
1372
1373And since your callback will be called with a pointer to the watcher, you
1374can cast it back to your own type:
1375
1376 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1377 {
1378 struct my_io *w = (struct my_io *)w_;
1379 ...
1380 }
1381
1382More interesting and less C-conformant ways of casting your callback type
1383instead have been omitted.
1384
1385Another common scenario is to use some data structure with multiple
1386embedded watchers:
1387
1388 struct my_biggy
1389 {
1390 int some_data;
1391 ev_timer t1;
1392 ev_timer t2;
1393 }
1394
1395In this case getting the pointer to C<my_biggy> is a bit more
1396complicated: Either you store the address of your C<my_biggy> struct
1397in the C<data> member of the watcher (for woozies), or you need to use
1398some pointer arithmetic using C<offsetof> inside your watchers (for real
1399programmers):
1400
1401 #include <stddef.h>
1402
1403 static void
1404 t1_cb (EV_P_ ev_timer *w, int revents)
1405 {
1406 struct my_biggy big = (struct my_biggy *)
1407 (((char *)w) - offsetof (struct my_biggy, t1));
1408 }
1409
1410 static void
1411 t2_cb (EV_P_ ev_timer *w, int revents)
1412 {
1413 struct my_biggy big = (struct my_biggy *)
1414 (((char *)w) - offsetof (struct my_biggy, t2));
1415 }
1416 1423
1417=head2 WATCHER PRIORITY MODELS 1424=head2 WATCHER PRIORITY MODELS
1418 1425
1419Many event loops support I<watcher priorities>, which are usually small 1426Many event loops support I<watcher priorities>, which are usually small
1420integers that influence the ordering of event callback invocation 1427integers that influence the ordering of event callback invocation
1547In general you can register as many read and/or write event watchers per 1554In general you can register as many read and/or write event watchers per
1548fd as you want (as long as you don't confuse yourself). Setting all file 1555fd as you want (as long as you don't confuse yourself). Setting all file
1549descriptors to non-blocking mode is also usually a good idea (but not 1556descriptors to non-blocking mode is also usually a good idea (but not
1550required if you know what you are doing). 1557required if you know what you are doing).
1551 1558
1552If you cannot use non-blocking mode, then force the use of a
1553known-to-be-good backend (at the time of this writing, this includes only
1554C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1555descriptors for which non-blocking operation makes no sense (such as
1556files) - libev doesn't guarantee any specific behaviour in that case.
1557
1558Another thing you have to watch out for is that it is quite easy to 1559Another thing you have to watch out for is that it is quite easy to
1559receive "spurious" readiness notifications, that is your callback might 1560receive "spurious" readiness notifications, that is, your callback might
1560be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1561be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1561because there is no data. Not only are some backends known to create a 1562because there is no data. It is very easy to get into this situation even
1562lot of those (for example Solaris ports), it is very easy to get into 1563with a relatively standard program structure. Thus it is best to always
1563this situation even with a relatively standard program structure. Thus 1564use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1564it is best to always use non-blocking I/O: An extra C<read>(2) returning
1565C<EAGAIN> is far preferable to a program hanging until some data arrives. 1565preferable to a program hanging until some data arrives.
1566 1566
1567If you cannot run the fd in non-blocking mode (for example you should 1567If you cannot run the fd in non-blocking mode (for example you should
1568not play around with an Xlib connection), then you have to separately 1568not play around with an Xlib connection), then you have to separately
1569re-test whether a file descriptor is really ready with a known-to-be good 1569re-test whether a file descriptor is really ready with a known-to-be good
1570interface such as poll (fortunately in our Xlib example, Xlib already 1570interface such as poll (fortunately in the case of Xlib, it already does
1571does this on its own, so its quite safe to use). Some people additionally 1571this on its own, so its quite safe to use). Some people additionally
1572use C<SIGALRM> and an interval timer, just to be sure you won't block 1572use C<SIGALRM> and an interval timer, just to be sure you won't block
1573indefinitely. 1573indefinitely.
1574 1574
1575But really, best use non-blocking mode. 1575But really, best use non-blocking mode.
1576 1576
1604 1604
1605There is no workaround possible except not registering events 1605There is no workaround possible except not registering events
1606for potentially C<dup ()>'ed file descriptors, or to resort to 1606for potentially C<dup ()>'ed file descriptors, or to resort to
1607C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1607C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1608 1608
1609=head3 The special problem of files
1610
1611Many people try to use C<select> (or libev) on file descriptors
1612representing files, and expect it to become ready when their program
1613doesn't block on disk accesses (which can take a long time on their own).
1614
1615However, this cannot ever work in the "expected" way - you get a readiness
1616notification as soon as the kernel knows whether and how much data is
1617there, and in the case of open files, that's always the case, so you
1618always get a readiness notification instantly, and your read (or possibly
1619write) will still block on the disk I/O.
1620
1621Another way to view it is that in the case of sockets, pipes, character
1622devices and so on, there is another party (the sender) that delivers data
1623on its own, but in the case of files, there is no such thing: the disk
1624will not send data on its own, simply because it doesn't know what you
1625wish to read - you would first have to request some data.
1626
1627Since files are typically not-so-well supported by advanced notification
1628mechanism, libev tries hard to emulate POSIX behaviour with respect
1629to files, even though you should not use it. The reason for this is
1630convenience: sometimes you want to watch STDIN or STDOUT, which is
1631usually a tty, often a pipe, but also sometimes files or special devices
1632(for example, C<epoll> on Linux works with F</dev/random> but not with
1633F</dev/urandom>), and even though the file might better be served with
1634asynchronous I/O instead of with non-blocking I/O, it is still useful when
1635it "just works" instead of freezing.
1636
1637So avoid file descriptors pointing to files when you know it (e.g. use
1638libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
1639when you rarely read from a file instead of from a socket, and want to
1640reuse the same code path.
1641
1609=head3 The special problem of fork 1642=head3 The special problem of fork
1610 1643
1611Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1644Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1612useless behaviour. Libev fully supports fork, but needs to be told about 1645useless behaviour. Libev fully supports fork, but needs to be told about
1613it in the child. 1646it in the child if you want to continue to use it in the child.
1614 1647
1615To support fork in your programs, you either have to call 1648To support fork in your child processes, you have to call C<ev_loop_fork
1616C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1649()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1617enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1650C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1618C<EVBACKEND_POLL>.
1619 1651
1620=head3 The special problem of SIGPIPE 1652=head3 The special problem of SIGPIPE
1621 1653
1622While not really specific to libev, it is easy to forget about C<SIGPIPE>: 1654While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1623when writing to a pipe whose other end has been closed, your program gets 1655when writing to a pipe whose other end has been closed, your program gets
2239 2271
2240=head2 C<ev_signal> - signal me when a signal gets signalled! 2272=head2 C<ev_signal> - signal me when a signal gets signalled!
2241 2273
2242Signal watchers will trigger an event when the process receives a specific 2274Signal watchers will trigger an event when the process receives a specific
2243signal one or more times. Even though signals are very asynchronous, libev 2275signal one or more times. Even though signals are very asynchronous, libev
2244will try it's best to deliver signals synchronously, i.e. as part of the 2276will try its best to deliver signals synchronously, i.e. as part of the
2245normal event processing, like any other event. 2277normal event processing, like any other event.
2246 2278
2247If you want signals to be delivered truly asynchronously, just use 2279If you want signals to be delivered truly asynchronously, just use
2248C<sigaction> as you would do without libev and forget about sharing 2280C<sigaction> as you would do without libev and forget about sharing
2249the signal. You can even use C<ev_async> from a signal handler to 2281the signal. You can even use C<ev_async> from a signal handler to
2291I<has> to modify the signal mask, at least temporarily. 2323I<has> to modify the signal mask, at least temporarily.
2292 2324
2293So I can't stress this enough: I<If you do not reset your signal mask when 2325So I can't stress this enough: I<If you do not reset your signal mask when
2294you expect it to be empty, you have a race condition in your code>. This 2326you expect it to be empty, you have a race condition in your code>. This
2295is not a libev-specific thing, this is true for most event libraries. 2327is not a libev-specific thing, this is true for most event libraries.
2328
2329=head3 The special problem of threads signal handling
2330
2331POSIX threads has problematic signal handling semantics, specifically,
2332a lot of functionality (sigfd, sigwait etc.) only really works if all
2333threads in a process block signals, which is hard to achieve.
2334
2335When you want to use sigwait (or mix libev signal handling with your own
2336for the same signals), you can tackle this problem by globally blocking
2337all signals before creating any threads (or creating them with a fully set
2338sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
2339loops. Then designate one thread as "signal receiver thread" which handles
2340these signals. You can pass on any signals that libev might be interested
2341in by calling C<ev_feed_signal>.
2296 2342
2297=head3 Watcher-Specific Functions and Data Members 2343=head3 Watcher-Specific Functions and Data Members
2298 2344
2299=over 4 2345=over 4
2300 2346
3074disadvantage of having to use multiple event loops (which do not support 3120disadvantage of having to use multiple event loops (which do not support
3075signal watchers). 3121signal watchers).
3076 3122
3077When this is not possible, or you want to use the default loop for 3123When this is not possible, or you want to use the default loop for
3078other reasons, then in the process that wants to start "fresh", call 3124other reasons, then in the process that wants to start "fresh", call
3079C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying 3125C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
3080the default loop will "orphan" (not stop) all registered watchers, so you 3126Destroying the default loop will "orphan" (not stop) all registered
3081have to be careful not to execute code that modifies those watchers. Note 3127watchers, so you have to be careful not to execute code that modifies
3082also that in that case, you have to re-register any signal watchers. 3128those watchers. Note also that in that case, you have to re-register any
3129signal watchers.
3083 3130
3084=head3 Watcher-Specific Functions and Data Members 3131=head3 Watcher-Specific Functions and Data Members
3085 3132
3086=over 4 3133=over 4
3087 3134
3088=item ev_fork_init (ev_signal *, callback) 3135=item ev_fork_init (ev_fork *, callback)
3089 3136
3090Initialises and configures the fork watcher - it has no parameters of any 3137Initialises and configures the fork watcher - it has no parameters of any
3091kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 3138kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3092believe me. 3139really.
3093 3140
3094=back 3141=back
3142
3143
3144=head2 C<ev_cleanup> - even the best things end
3145
3146Cleanup watchers are called just before the event loop is being destroyed
3147by a call to C<ev_loop_destroy>.
3148
3149While there is no guarantee that the event loop gets destroyed, cleanup
3150watchers provide a convenient method to install cleanup hooks for your
3151program, worker threads and so on - you just to make sure to destroy the
3152loop when you want them to be invoked.
3153
3154Cleanup watchers are invoked in the same way as any other watcher. Unlike
3155all other watchers, they do not keep a reference to the event loop (which
3156makes a lot of sense if you think about it). Like all other watchers, you
3157can call libev functions in the callback, except C<ev_cleanup_start>.
3158
3159=head3 Watcher-Specific Functions and Data Members
3160
3161=over 4
3162
3163=item ev_cleanup_init (ev_cleanup *, callback)
3164
3165Initialises and configures the cleanup watcher - it has no parameters of
3166any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3167pointless, I assure you.
3168
3169=back
3170
3171Example: Register an atexit handler to destroy the default loop, so any
3172cleanup functions are called.
3173
3174 static void
3175 program_exits (void)
3176 {
3177 ev_loop_destroy (EV_DEFAULT_UC);
3178 }
3179
3180 ...
3181 atexit (program_exits);
3095 3182
3096 3183
3097=head2 C<ev_async> - how to wake up an event loop 3184=head2 C<ev_async> - how to wake up an event loop
3098 3185
3099In general, you cannot use an C<ev_run> from multiple threads or other 3186In general, you cannot use an C<ev_run> from multiple threads or other
3106it by calling C<ev_async_send>, which is thread- and signal safe. 3193it by calling C<ev_async_send>, which is thread- and signal safe.
3107 3194
3108This functionality is very similar to C<ev_signal> watchers, as signals, 3195This functionality is very similar to C<ev_signal> watchers, as signals,
3109too, are asynchronous in nature, and signals, too, will be compressed 3196too, are asynchronous in nature, and signals, too, will be compressed
3110(i.e. the number of callback invocations may be less than the number of 3197(i.e. the number of callback invocations may be less than the number of
3111C<ev_async_sent> calls). 3198C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3199of "global async watchers" by using a watcher on an otherwise unused
3200signal, and C<ev_feed_signal> to signal this watcher from another thread,
3201even without knowing which loop owns the signal.
3112 3202
3113Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not 3203Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3114just the default loop. 3204just the default loop.
3115 3205
3116=head3 Queueing 3206=head3 Queueing
3292Feed an event on the given fd, as if a file descriptor backend detected 3382Feed an event on the given fd, as if a file descriptor backend detected
3293the given events it. 3383the given events it.
3294 3384
3295=item ev_feed_signal_event (loop, int signum) 3385=item ev_feed_signal_event (loop, int signum)
3296 3386
3297Feed an event as if the given signal occurred (C<loop> must be the default 3387Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3298loop!). 3388which is async-safe.
3299 3389
3300=back 3390=back
3391
3392
3393=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3394
3395This section explains some common idioms that are not immediately
3396obvious. Note that examples are sprinkled over the whole manual, and this
3397section only contains stuff that wouldn't fit anywhere else.
3398
3399=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3400
3401Each watcher has, by default, a C<void *data> member that you can read
3402or modify at any time: libev will completely ignore it. This can be used
3403to associate arbitrary data with your watcher. If you need more data and
3404don't want to allocate memory separately and store a pointer to it in that
3405data member, you can also "subclass" the watcher type and provide your own
3406data:
3407
3408 struct my_io
3409 {
3410 ev_io io;
3411 int otherfd;
3412 void *somedata;
3413 struct whatever *mostinteresting;
3414 };
3415
3416 ...
3417 struct my_io w;
3418 ev_io_init (&w.io, my_cb, fd, EV_READ);
3419
3420And since your callback will be called with a pointer to the watcher, you
3421can cast it back to your own type:
3422
3423 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
3424 {
3425 struct my_io *w = (struct my_io *)w_;
3426 ...
3427 }
3428
3429More interesting and less C-conformant ways of casting your callback
3430function type instead have been omitted.
3431
3432=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
3433
3434Another common scenario is to use some data structure with multiple
3435embedded watchers, in effect creating your own watcher that combines
3436multiple libev event sources into one "super-watcher":
3437
3438 struct my_biggy
3439 {
3440 int some_data;
3441 ev_timer t1;
3442 ev_timer t2;
3443 }
3444
3445In this case getting the pointer to C<my_biggy> is a bit more
3446complicated: Either you store the address of your C<my_biggy> struct in
3447the C<data> member of the watcher (for woozies or C++ coders), or you need
3448to use some pointer arithmetic using C<offsetof> inside your watchers (for
3449real programmers):
3450
3451 #include <stddef.h>
3452
3453 static void
3454 t1_cb (EV_P_ ev_timer *w, int revents)
3455 {
3456 struct my_biggy big = (struct my_biggy *)
3457 (((char *)w) - offsetof (struct my_biggy, t1));
3458 }
3459
3460 static void
3461 t2_cb (EV_P_ ev_timer *w, int revents)
3462 {
3463 struct my_biggy big = (struct my_biggy *)
3464 (((char *)w) - offsetof (struct my_biggy, t2));
3465 }
3466
3467=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3468
3469Often (especially in GUI toolkits) there are places where you have
3470I<modal> interaction, which is most easily implemented by recursively
3471invoking C<ev_run>.
3472
3473This brings the problem of exiting - a callback might want to finish the
3474main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3475a modal "Are you sure?" dialog is still waiting), or just the nested one
3476and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3477other combination: In these cases, C<ev_break> will not work alone.
3478
3479The solution is to maintain "break this loop" variable for each C<ev_run>
3480invocation, and use a loop around C<ev_run> until the condition is
3481triggered, using C<EVRUN_ONCE>:
3482
3483 // main loop
3484 int exit_main_loop = 0;
3485
3486 while (!exit_main_loop)
3487 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3488
3489 // in a model watcher
3490 int exit_nested_loop = 0;
3491
3492 while (!exit_nested_loop)
3493 ev_run (EV_A_ EVRUN_ONCE);
3494
3495To exit from any of these loops, just set the corresponding exit variable:
3496
3497 // exit modal loop
3498 exit_nested_loop = 1;
3499
3500 // exit main program, after modal loop is finished
3501 exit_main_loop = 1;
3502
3503 // exit both
3504 exit_main_loop = exit_nested_loop = 1;
3505
3506=head2 THREAD LOCKING EXAMPLE
3507
3508Here is a fictitious example of how to run an event loop in a different
3509thread than where callbacks are being invoked and watchers are
3510created/added/removed.
3511
3512For a real-world example, see the C<EV::Loop::Async> perl module,
3513which uses exactly this technique (which is suited for many high-level
3514languages).
3515
3516The example uses a pthread mutex to protect the loop data, a condition
3517variable to wait for callback invocations, an async watcher to notify the
3518event loop thread and an unspecified mechanism to wake up the main thread.
3519
3520First, you need to associate some data with the event loop:
3521
3522 typedef struct {
3523 mutex_t lock; /* global loop lock */
3524 ev_async async_w;
3525 thread_t tid;
3526 cond_t invoke_cv;
3527 } userdata;
3528
3529 void prepare_loop (EV_P)
3530 {
3531 // for simplicity, we use a static userdata struct.
3532 static userdata u;
3533
3534 ev_async_init (&u->async_w, async_cb);
3535 ev_async_start (EV_A_ &u->async_w);
3536
3537 pthread_mutex_init (&u->lock, 0);
3538 pthread_cond_init (&u->invoke_cv, 0);
3539
3540 // now associate this with the loop
3541 ev_set_userdata (EV_A_ u);
3542 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3543 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3544
3545 // then create the thread running ev_loop
3546 pthread_create (&u->tid, 0, l_run, EV_A);
3547 }
3548
3549The callback for the C<ev_async> watcher does nothing: the watcher is used
3550solely to wake up the event loop so it takes notice of any new watchers
3551that might have been added:
3552
3553 static void
3554 async_cb (EV_P_ ev_async *w, int revents)
3555 {
3556 // just used for the side effects
3557 }
3558
3559The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
3560protecting the loop data, respectively.
3561
3562 static void
3563 l_release (EV_P)
3564 {
3565 userdata *u = ev_userdata (EV_A);
3566 pthread_mutex_unlock (&u->lock);
3567 }
3568
3569 static void
3570 l_acquire (EV_P)
3571 {
3572 userdata *u = ev_userdata (EV_A);
3573 pthread_mutex_lock (&u->lock);
3574 }
3575
3576The event loop thread first acquires the mutex, and then jumps straight
3577into C<ev_run>:
3578
3579 void *
3580 l_run (void *thr_arg)
3581 {
3582 struct ev_loop *loop = (struct ev_loop *)thr_arg;
3583
3584 l_acquire (EV_A);
3585 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
3586 ev_run (EV_A_ 0);
3587 l_release (EV_A);
3588
3589 return 0;
3590 }
3591
3592Instead of invoking all pending watchers, the C<l_invoke> callback will
3593signal the main thread via some unspecified mechanism (signals? pipe
3594writes? C<Async::Interrupt>?) and then waits until all pending watchers
3595have been called (in a while loop because a) spurious wakeups are possible
3596and b) skipping inter-thread-communication when there are no pending
3597watchers is very beneficial):
3598
3599 static void
3600 l_invoke (EV_P)
3601 {
3602 userdata *u = ev_userdata (EV_A);
3603
3604 while (ev_pending_count (EV_A))
3605 {
3606 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
3607 pthread_cond_wait (&u->invoke_cv, &u->lock);
3608 }
3609 }
3610
3611Now, whenever the main thread gets told to invoke pending watchers, it
3612will grab the lock, call C<ev_invoke_pending> and then signal the loop
3613thread to continue:
3614
3615 static void
3616 real_invoke_pending (EV_P)
3617 {
3618 userdata *u = ev_userdata (EV_A);
3619
3620 pthread_mutex_lock (&u->lock);
3621 ev_invoke_pending (EV_A);
3622 pthread_cond_signal (&u->invoke_cv);
3623 pthread_mutex_unlock (&u->lock);
3624 }
3625
3626Whenever you want to start/stop a watcher or do other modifications to an
3627event loop, you will now have to lock:
3628
3629 ev_timer timeout_watcher;
3630 userdata *u = ev_userdata (EV_A);
3631
3632 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
3633
3634 pthread_mutex_lock (&u->lock);
3635 ev_timer_start (EV_A_ &timeout_watcher);
3636 ev_async_send (EV_A_ &u->async_w);
3637 pthread_mutex_unlock (&u->lock);
3638
3639Note that sending the C<ev_async> watcher is required because otherwise
3640an event loop currently blocking in the kernel will have no knowledge
3641about the newly added timer. By waking up the loop it will pick up any new
3642watchers in the next event loop iteration.
3643
3644=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
3645
3646While the overhead of a callback that e.g. schedules a thread is small, it
3647is still an overhead. If you embed libev, and your main usage is with some
3648kind of threads or coroutines, you might want to customise libev so that
3649doesn't need callbacks anymore.
3650
3651Imagine you have coroutines that you can switch to using a function
3652C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
3653and that due to some magic, the currently active coroutine is stored in a
3654global called C<current_coro>. Then you can build your own "wait for libev
3655event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
3656the differing C<;> conventions):
3657
3658 #define EV_CB_DECLARE(type) struct my_coro *cb;
3659 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3660
3661That means instead of having a C callback function, you store the
3662coroutine to switch to in each watcher, and instead of having libev call
3663your callback, you instead have it switch to that coroutine.
3664
3665A coroutine might now wait for an event with a function called
3666C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
3667matter when, or whether the watcher is active or not when this function is
3668called):
3669
3670 void
3671 wait_for_event (ev_watcher *w)
3672 {
3673 ev_cb_set (w) = current_coro;
3674 switch_to (libev_coro);
3675 }
3676
3677That basically suspends the coroutine inside C<wait_for_event> and
3678continues the libev coroutine, which, when appropriate, switches back to
3679this or any other coroutine. I am sure if you sue this your own :)
3680
3681You can do similar tricks if you have, say, threads with an event queue -
3682instead of storing a coroutine, you store the queue object and instead of
3683switching to a coroutine, you push the watcher onto the queue and notify
3684any waiters.
3685
3686To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
3687files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3688
3689 // my_ev.h
3690 #define EV_CB_DECLARE(type) struct my_coro *cb;
3691 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3692 #include "../libev/ev.h"
3693
3694 // my_ev.c
3695 #define EV_H "my_ev.h"
3696 #include "../libev/ev.c"
3697
3698And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
3699F<my_ev.c> into your project. When properly specifying include paths, you
3700can even use F<ev.h> as header file name directly.
3301 3701
3302 3702
3303=head1 LIBEVENT EMULATION 3703=head1 LIBEVENT EMULATION
3304 3704
3305Libev offers a compatibility emulation layer for libevent. It cannot 3705Libev offers a compatibility emulation layer for libevent. It cannot
3306emulate the internals of libevent, so here are some usage hints: 3706emulate the internals of libevent, so here are some usage hints:
3307 3707
3308=over 4 3708=over 4
3709
3710=item * Only the libevent-1.4.1-beta API is being emulated.
3711
3712This was the newest libevent version available when libev was implemented,
3713and is still mostly unchanged in 2010.
3309 3714
3310=item * Use it by including <event.h>, as usual. 3715=item * Use it by including <event.h>, as usual.
3311 3716
3312=item * The following members are fully supported: ev_base, ev_callback, 3717=item * The following members are fully supported: ev_base, ev_callback,
3313ev_arg, ev_fd, ev_res, ev_events. 3718ev_arg, ev_fd, ev_res, ev_events.
3319=item * Priorities are not currently supported. Initialising priorities 3724=item * Priorities are not currently supported. Initialising priorities
3320will fail and all watchers will have the same priority, even though there 3725will fail and all watchers will have the same priority, even though there
3321is an ev_pri field. 3726is an ev_pri field.
3322 3727
3323=item * In libevent, the last base created gets the signals, in libev, the 3728=item * In libevent, the last base created gets the signals, in libev, the
3324first base created (== the default loop) gets the signals. 3729base that registered the signal gets the signals.
3325 3730
3326=item * Other members are not supported. 3731=item * Other members are not supported.
3327 3732
3328=item * The libev emulation is I<not> ABI compatible to libevent, you need 3733=item * The libev emulation is I<not> ABI compatible to libevent, you need
3329to use the libev header file and library. 3734to use the libev header file and library.
3348Care has been taken to keep the overhead low. The only data member the C++ 3753Care has been taken to keep the overhead low. The only data member the C++
3349classes add (compared to plain C-style watchers) is the event loop pointer 3754classes add (compared to plain C-style watchers) is the event loop pointer
3350that the watcher is associated with (or no additional members at all if 3755that the watcher is associated with (or no additional members at all if
3351you disable C<EV_MULTIPLICITY> when embedding libev). 3756you disable C<EV_MULTIPLICITY> when embedding libev).
3352 3757
3353Currently, functions, and static and non-static member functions can be 3758Currently, functions, static and non-static member functions and classes
3354used as callbacks. Other types should be easy to add as long as they only 3759with C<operator ()> can be used as callbacks. Other types should be easy
3355need one additional pointer for context. If you need support for other 3760to add as long as they only need one additional pointer for context. If
3356types of functors please contact the author (preferably after implementing 3761you need support for other types of functors please contact the author
3357it). 3762(preferably after implementing it).
3358 3763
3359Here is a list of things available in the C<ev> namespace: 3764Here is a list of things available in the C<ev> namespace:
3360 3765
3361=over 4 3766=over 4
3362 3767
4230And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4635And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4231 4636
4232 #include "ev_cpp.h" 4637 #include "ev_cpp.h"
4233 #include "ev.c" 4638 #include "ev.c"
4234 4639
4235=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4640=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4236 4641
4237=head2 THREADS AND COROUTINES 4642=head2 THREADS AND COROUTINES
4238 4643
4239=head3 THREADS 4644=head3 THREADS
4240 4645
4291default loop and triggering an C<ev_async> watcher from the default loop 4696default loop and triggering an C<ev_async> watcher from the default loop
4292watcher callback into the event loop interested in the signal. 4697watcher callback into the event loop interested in the signal.
4293 4698
4294=back 4699=back
4295 4700
4296=head4 THREAD LOCKING EXAMPLE 4701See also L<THREAD LOCKING EXAMPLE>.
4297
4298Here is a fictitious example of how to run an event loop in a different
4299thread than where callbacks are being invoked and watchers are
4300created/added/removed.
4301
4302For a real-world example, see the C<EV::Loop::Async> perl module,
4303which uses exactly this technique (which is suited for many high-level
4304languages).
4305
4306The example uses a pthread mutex to protect the loop data, a condition
4307variable to wait for callback invocations, an async watcher to notify the
4308event loop thread and an unspecified mechanism to wake up the main thread.
4309
4310First, you need to associate some data with the event loop:
4311
4312 typedef struct {
4313 mutex_t lock; /* global loop lock */
4314 ev_async async_w;
4315 thread_t tid;
4316 cond_t invoke_cv;
4317 } userdata;
4318
4319 void prepare_loop (EV_P)
4320 {
4321 // for simplicity, we use a static userdata struct.
4322 static userdata u;
4323
4324 ev_async_init (&u->async_w, async_cb);
4325 ev_async_start (EV_A_ &u->async_w);
4326
4327 pthread_mutex_init (&u->lock, 0);
4328 pthread_cond_init (&u->invoke_cv, 0);
4329
4330 // now associate this with the loop
4331 ev_set_userdata (EV_A_ u);
4332 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4333 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4334
4335 // then create the thread running ev_loop
4336 pthread_create (&u->tid, 0, l_run, EV_A);
4337 }
4338
4339The callback for the C<ev_async> watcher does nothing: the watcher is used
4340solely to wake up the event loop so it takes notice of any new watchers
4341that might have been added:
4342
4343 static void
4344 async_cb (EV_P_ ev_async *w, int revents)
4345 {
4346 // just used for the side effects
4347 }
4348
4349The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4350protecting the loop data, respectively.
4351
4352 static void
4353 l_release (EV_P)
4354 {
4355 userdata *u = ev_userdata (EV_A);
4356 pthread_mutex_unlock (&u->lock);
4357 }
4358
4359 static void
4360 l_acquire (EV_P)
4361 {
4362 userdata *u = ev_userdata (EV_A);
4363 pthread_mutex_lock (&u->lock);
4364 }
4365
4366The event loop thread first acquires the mutex, and then jumps straight
4367into C<ev_run>:
4368
4369 void *
4370 l_run (void *thr_arg)
4371 {
4372 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4373
4374 l_acquire (EV_A);
4375 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4376 ev_run (EV_A_ 0);
4377 l_release (EV_A);
4378
4379 return 0;
4380 }
4381
4382Instead of invoking all pending watchers, the C<l_invoke> callback will
4383signal the main thread via some unspecified mechanism (signals? pipe
4384writes? C<Async::Interrupt>?) and then waits until all pending watchers
4385have been called (in a while loop because a) spurious wakeups are possible
4386and b) skipping inter-thread-communication when there are no pending
4387watchers is very beneficial):
4388
4389 static void
4390 l_invoke (EV_P)
4391 {
4392 userdata *u = ev_userdata (EV_A);
4393
4394 while (ev_pending_count (EV_A))
4395 {
4396 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4397 pthread_cond_wait (&u->invoke_cv, &u->lock);
4398 }
4399 }
4400
4401Now, whenever the main thread gets told to invoke pending watchers, it
4402will grab the lock, call C<ev_invoke_pending> and then signal the loop
4403thread to continue:
4404
4405 static void
4406 real_invoke_pending (EV_P)
4407 {
4408 userdata *u = ev_userdata (EV_A);
4409
4410 pthread_mutex_lock (&u->lock);
4411 ev_invoke_pending (EV_A);
4412 pthread_cond_signal (&u->invoke_cv);
4413 pthread_mutex_unlock (&u->lock);
4414 }
4415
4416Whenever you want to start/stop a watcher or do other modifications to an
4417event loop, you will now have to lock:
4418
4419 ev_timer timeout_watcher;
4420 userdata *u = ev_userdata (EV_A);
4421
4422 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4423
4424 pthread_mutex_lock (&u->lock);
4425 ev_timer_start (EV_A_ &timeout_watcher);
4426 ev_async_send (EV_A_ &u->async_w);
4427 pthread_mutex_unlock (&u->lock);
4428
4429Note that sending the C<ev_async> watcher is required because otherwise
4430an event loop currently blocking in the kernel will have no knowledge
4431about the newly added timer. By waking up the loop it will pick up any new
4432watchers in the next event loop iteration.
4433 4702
4434=head3 COROUTINES 4703=head3 COROUTINES
4435 4704
4436Libev is very accommodating to coroutines ("cooperative threads"): 4705Libev is very accommodating to coroutines ("cooperative threads"):
4437libev fully supports nesting calls to its functions from different 4706libev fully supports nesting calls to its functions from different
4706structure (guaranteed by POSIX but not by ISO C for example), but it also 4975structure (guaranteed by POSIX but not by ISO C for example), but it also
4707assumes that the same (machine) code can be used to call any watcher 4976assumes that the same (machine) code can be used to call any watcher
4708callback: The watcher callbacks have different type signatures, but libev 4977callback: The watcher callbacks have different type signatures, but libev
4709calls them using an C<ev_watcher *> internally. 4978calls them using an C<ev_watcher *> internally.
4710 4979
4980=item pointer accesses must be thread-atomic
4981
4982Accessing a pointer value must be atomic, it must both be readable and
4983writable in one piece - this is the case on all current architectures.
4984
4711=item C<sig_atomic_t volatile> must be thread-atomic as well 4985=item C<sig_atomic_t volatile> must be thread-atomic as well
4712 4986
4713The type C<sig_atomic_t volatile> (or whatever is defined as 4987The type C<sig_atomic_t volatile> (or whatever is defined as
4714C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4988C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4715threads. This is not part of the specification for C<sig_atomic_t>, but is 4989threads. This is not part of the specification for C<sig_atomic_t>, but is
4821=back 5095=back
4822 5096
4823 5097
4824=head1 PORTING FROM LIBEV 3.X TO 4.X 5098=head1 PORTING FROM LIBEV 3.X TO 4.X
4825 5099
4826The major version 4 introduced some minor incompatible changes to the API. 5100The major version 4 introduced some incompatible changes to the API.
4827 5101
4828At the moment, the C<ev.h> header file tries to implement superficial 5102At the moment, the C<ev.h> header file provides compatibility definitions
4829compatibility, so most programs should still compile. Those might be 5103for all changes, so most programs should still compile. The compatibility
4830removed in later versions of libev, so better update early than late. 5104layer might be removed in later versions of libev, so better update to the
5105new API early than late.
4831 5106
4832=over 4 5107=over 4
5108
5109=item C<EV_COMPAT3> backwards compatibility mechanism
5110
5111The backward compatibility mechanism can be controlled by
5112C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
5113section.
5114
5115=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5116
5117These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5118
5119 ev_loop_destroy (EV_DEFAULT_UC);
5120 ev_loop_fork (EV_DEFAULT);
4833 5121
4834=item function/symbol renames 5122=item function/symbol renames
4835 5123
4836A number of functions and symbols have been renamed: 5124A number of functions and symbols have been renamed:
4837 5125
4856ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 5144ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4857as all other watcher types. Note that C<ev_loop_fork> is still called 5145as all other watcher types. Note that C<ev_loop_fork> is still called
4858C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> 5146C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4859typedef. 5147typedef.
4860 5148
4861=item C<EV_COMPAT3> backwards compatibility mechanism
4862
4863The backward compatibility mechanism can be controlled by
4864C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4865section.
4866
4867=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 5149=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4868 5150
4869The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 5151The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4870mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 5152mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4871and work, but the library code will of course be larger. 5153and work, but the library code will of course be larger.
4945 5227
4946=back 5228=back
4947 5229
4948=head1 AUTHOR 5230=head1 AUTHOR
4949 5231
4950Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5232Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5233Magnusson and Emanuele Giaquinta.
4951 5234

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines