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

Comparing libev/ev.pod (file contents):
Revision 1.325 by root, Sun Oct 24 19:44:08 2010 UTC vs.
Revision 1.360 by root, Mon Jan 17 12:11:12 2011 UTC

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
233the 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 ()
234& ev_supported_backends ()>, likewise for recommended ones. 242& ev_supported_backends ()>, likewise for recommended ones.
235 243
236See the description of C<ev_embed> watchers for more info. 244See the description of C<ev_embed> watchers for more info.
237 245
238=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT] 246=item ev_set_allocator (void *(*cb)(void *ptr, long size))
239 247
240Sets the allocation function to use (the prototype is similar - the 248Sets the allocation function to use (the prototype is similar - the
241semantics 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
242used 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
243when 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
269 } 277 }
270 278
271 ... 279 ...
272 ev_set_allocator (persistent_realloc); 280 ev_set_allocator (persistent_realloc);
273 281
274=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT] 282=item ev_set_syserr_cb (void (*cb)(const char *msg))
275 283
276Set 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
277as failed select, poll, epoll_wait). The message is a printable string 285as failed select, poll, epoll_wait). The message is a printable string
278indicating the system call or subsystem causing the problem. If this 286indicating the system call or subsystem causing the problem. If this
279callback 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
291 } 299 }
292 300
293 ... 301 ...
294 ev_set_syserr_cb (fatal_error); 302 ev_set_syserr_cb (fatal_error);
295 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
296=back 317=back
297 318
298=head1 FUNCTIONS CONTROLLING EVENT LOOPS 319=head1 FUNCTIONS CONTROLLING EVENT LOOPS
299 320
300An 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
301I<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
302libev 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).
303 324
304The 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
305supports signals and child events, and dynamically created event loops 326supports child process events, and dynamically created event loops which
306which do not. 327do not.
307 328
308=over 4 329=over 4
309 330
310=item struct ev_loop *ev_default_loop (unsigned int flags) 331=item struct ev_loop *ev_default_loop (unsigned int flags)
311 332
347=item struct ev_loop *ev_loop_new (unsigned int flags) 368=item struct ev_loop *ev_loop_new (unsigned int flags)
348 369
349This will create and initialise a new event loop object. If the loop 370This will create and initialise a new event loop object. If the loop
350could not be initialised, returns false. 371could not be initialised, returns false.
351 372
352Note that this function I<is> thread-safe, and one common way to use 373This function is thread-safe, and one common way to use libev with
353libev with threads is indeed to create one loop per thread, and using the 374threads is indeed to create one loop per thread, and using the default
354default loop in the "main" or "initial" thread. 375loop in the "main" or "initial" thread.
355 376
356The flags argument can be used to specify special behaviour or specific 377The flags argument can be used to specify special behaviour or specific
357backends 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>).
358 379
359The following flags are supported: 380The following flags are supported:
394environment variable. 415environment variable.
395 416
396=item C<EVFLAG_NOINOTIFY> 417=item C<EVFLAG_NOINOTIFY>
397 418
398When 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
399I<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
400testing, this flag can be useful to conserve inotify file descriptors, as 421testing, this flag can be useful to conserve inotify file descriptors, as
401otherwise each loop using C<ev_stat> watchers consumes one inotify handle. 422otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
402 423
403=item C<EVFLAG_SIGNALFD> 424=item C<EVFLAG_SIGNALFD>
404 425
405When this flag is specified, then libev will attempt to use the 426When this flag is specified, then libev will attempt to use the
406I<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
407delivers signals synchronously, which makes it both faster and might make 428delivers signals synchronously, which makes it both faster and might make
408it 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
409handling with threads, as long as you properly block signals in your 430handling with threads, as long as you properly block signals in your
410threads that are not interested in handling them. 431threads that are not interested in handling them.
411 432
412Signalfd 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
413there 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
414example) 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
447It's also required by POSIX in a threaded program, as libev calls
448C<sigprocmask>, whose behaviour is officially unspecified.
449
450This flag's behaviour will become the default in future versions of libev.
415 451
416=item C<EVBACKEND_SELECT> (value 1, portable select backend) 452=item C<EVBACKEND_SELECT> (value 1, portable select backend)
417 453
418This is your standard select(2) backend. Not I<completely> standard, as 454This is your standard select(2) backend. Not I<completely> standard, as
419libev tries to roll its own fd_set with no limits on the number of fds, 455libev tries to roll its own fd_set with no limits on the number of fds,
455epoll scales either O(1) or O(active_fds). 491epoll scales either O(1) or O(active_fds).
456 492
457The epoll mechanism deserves honorable mention as the most misdesigned 493The epoll mechanism deserves honorable mention as the most misdesigned
458of the more advanced event mechanisms: mere annoyances include silently 494of the more advanced event mechanisms: mere annoyances include silently
459dropping file descriptors, requiring a system call per change per file 495dropping file descriptors, requiring a system call per change per file
460descriptor (and unnecessary guessing of parameters), problems with dup and 496descriptor (and unnecessary guessing of parameters), problems with dup,
497returning before the timeout value, resulting in additional iterations
498(and only giving 5ms accuracy while select on the same platform gives
461so on. The biggest issue is fork races, however - if a program forks then 4990.1ms) and so on. The biggest issue is fork races, however - if a program
462I<both> parent and child process have to recreate the epoll set, which can 500forks then I<both> parent and child process have to recreate the epoll
463take considerable time (one syscall per file descriptor) and is of course 501set, which can take considerable time (one syscall per file descriptor)
464hard to detect. 502and is of course hard to detect.
465 503
466Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 504Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
467of course I<doesn't>, and epoll just loves to report events for totally 505of course I<doesn't>, and epoll just loves to report events for totally
468I<different> file descriptors (even already closed ones, so one cannot 506I<different> file descriptors (even already closed ones, so one cannot
469even remove them from the set) than registered in the set (especially 507even remove them from the set) than registered in the set (especially
471employing an additional generation counter and comparing that against the 509employing an additional generation counter and comparing that against the
472events to filter out spurious ones, recreating the set when required. Last 510events to filter out spurious ones, recreating the set when required. Last
473not least, it also refuses to work with some file descriptors which work 511not least, it also refuses to work with some file descriptors which work
474perfectly fine with C<select> (files, many character devices...). 512perfectly fine with C<select> (files, many character devices...).
475 513
514Epoll is truly the train wreck analog among event poll mechanisms,
515a frankenpoll, cobbled together in a hurry, no thought to design or
516interaction with others.
517
476While stopping, setting and starting an I/O watcher in the same iteration 518While stopping, setting and starting an I/O watcher in the same iteration
477will result in some caching, there is still a system call per such 519will result in some caching, there is still a system call per such
478incident (because the same I<file descriptor> could point to a different 520incident (because the same I<file descriptor> could point to a different
479I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 521I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
480file descriptors might not work very well if you register events for both 522file descriptors might not work very well if you register events for both
545=item C<EVBACKEND_PORT> (value 32, Solaris 10) 587=item C<EVBACKEND_PORT> (value 32, Solaris 10)
546 588
547This uses the Solaris 10 event port mechanism. As with everything on Solaris, 589This uses the Solaris 10 event port mechanism. As with everything on Solaris,
548it's really slow, but it still scales very well (O(active_fds)). 590it's really slow, but it still scales very well (O(active_fds)).
549 591
550Please note that Solaris event ports can deliver a lot of spurious
551notifications, so you need to use non-blocking I/O or other means to avoid
552blocking when no data (or space) is available.
553
554While this backend scales well, it requires one system call per active 592While this backend scales well, it requires one system call per active
555file descriptor per loop iteration. For small and medium numbers of file 593file descriptor per loop iteration. For small and medium numbers of file
556descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 594descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
557might perform better. 595might perform better.
558 596
559On the positive side, with the exception of the spurious readiness 597On the positive side, this backend actually performed fully to
560notifications, this backend actually performed fully to specification
561in all tests and is fully embeddable, which is a rare feat among the 598specification in all tests and is fully embeddable, which is a rare feat
562OS-specific backends (I vastly prefer correctness over speed hacks). 599among the OS-specific backends (I vastly prefer correctness over speed
600hacks).
601
602On the negative side, the interface is I<bizarre> - so bizarre that
603even sun itself gets it wrong in their code examples: The event polling
604function sometimes returning events to the caller even though an error
605occurred, but with no indication whether it has done so or not (yes, it's
606even documented that way) - deadly for edge-triggered interfaces where
607you absolutely have to know whether an event occurred or not because you
608have to re-arm the watcher.
609
610Fortunately libev seems to be able to work around these idiocies.
563 611
564This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 612This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
565C<EVBACKEND_POLL>. 613C<EVBACKEND_POLL>.
566 614
567=item C<EVBACKEND_ALL> 615=item C<EVBACKEND_ALL>
568 616
569Try all backends (even potentially broken ones that wouldn't be tried 617Try all backends (even potentially broken ones that wouldn't be tried
570with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 618with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
571C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 619C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
572 620
573It is definitely not recommended to use this flag. 621It is definitely not recommended to use this flag, use whatever
622C<ev_recommended_backends ()> returns, or simply do not specify a backend
623at all.
624
625=item C<EVBACKEND_MASK>
626
627Not a backend at all, but a mask to select all backend bits from a
628C<flags> value, in case you want to mask out any backends from a flags
629value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
574 630
575=back 631=back
576 632
577If one or more of the backend flags are or'ed into the flags value, 633If one or more of the backend flags are or'ed into the flags value,
578then only these backends will be tried (in the reverse order as listed 634then only these backends will be tried (in the reverse order as listed
607This function is normally used on loop objects allocated by 663This function is normally used on loop objects allocated by
608C<ev_loop_new>, but it can also be used on the default loop returned by 664C<ev_loop_new>, but it can also be used on the default loop returned by
609C<ev_default_loop>, in which case it is not thread-safe. 665C<ev_default_loop>, in which case it is not thread-safe.
610 666
611Note that it is not advisable to call this function on the default loop 667Note that it is not advisable to call this function on the default loop
612except in the rare occasion where you really need to free it's resources. 668except in the rare occasion where you really need to free its resources.
613If you need dynamically allocated loops it is better to use C<ev_loop_new> 669If you need dynamically allocated loops it is better to use C<ev_loop_new>
614and C<ev_loop_destroy>. 670and C<ev_loop_destroy>.
615 671
616=item ev_loop_fork (loop) 672=item ev_loop_fork (loop)
617 673
665prepare and check phases. 721prepare and check phases.
666 722
667=item unsigned int ev_depth (loop) 723=item unsigned int ev_depth (loop)
668 724
669Returns the number of times C<ev_run> was entered minus the number of 725Returns the number of times C<ev_run> was entered minus the number of
670times C<ev_run> was exited, in other words, the recursion depth. 726times C<ev_run> was exited normally, in other words, the recursion depth.
671 727
672Outside C<ev_run>, this number is zero. In a callback, this number is 728Outside C<ev_run>, this number is zero. In a callback, this number is
673C<1>, unless C<ev_run> was invoked recursively (or from another thread), 729C<1>, unless C<ev_run> was invoked recursively (or from another thread),
674in which case it is higher. 730in which case it is higher.
675 731
676Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 732Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
677etc.), doesn't count as "exit" - consider this as a hint to avoid such 733throwing an exception etc.), doesn't count as "exit" - consider this
678ungentleman-like behaviour unless it's really convenient. 734as a hint to avoid such ungentleman-like behaviour unless it's really
735convenient, in which case it is fully supported.
679 736
680=item unsigned int ev_backend (loop) 737=item unsigned int ev_backend (loop)
681 738
682Returns one of the C<EVBACKEND_*> flags indicating the event backend in 739Returns one of the C<EVBACKEND_*> flags indicating the event backend in
683use. 740use.
744relying on all watchers to be stopped when deciding when a program has 801relying on all watchers to be stopped when deciding when a program has
745finished (especially in interactive programs), but having a program 802finished (especially in interactive programs), but having a program
746that automatically loops as long as it has to and no longer by virtue 803that automatically loops as long as it has to and no longer by virtue
747of relying on its watchers stopping correctly, that is truly a thing of 804of relying on its watchers stopping correctly, that is truly a thing of
748beauty. 805beauty.
806
807This function is also I<mostly> exception-safe - you can break out of
808a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
809exception and so on. This does not decrement the C<ev_depth> value, nor
810will it clear any outstanding C<EVBREAK_ONE> breaks.
749 811
750A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 812A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
751those events and any already outstanding ones, but will not wait and 813those events and any already outstanding ones, but will not wait and
752block your process in case there are no events and will return after one 814block your process in case there are no events and will return after one
753iteration of the loop. This is sometimes useful to poll and handle new 815iteration of the loop. This is sometimes useful to poll and handle new
815Can be used to make a call to C<ev_run> return early (but only after it 877Can be used to make a call to C<ev_run> return early (but only after it
816has processed all outstanding events). The C<how> argument must be either 878has processed all outstanding events). The C<how> argument must be either
817C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or 879C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
818C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return. 880C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
819 881
820This "unloop state" will be cleared when entering C<ev_run> again. 882This "break state" will be cleared on the next call to C<ev_run>.
821 883
822It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## 884It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
885which case it will have no effect.
823 886
824=item ev_ref (loop) 887=item ev_ref (loop)
825 888
826=item ev_unref (loop) 889=item ev_unref (loop)
827 890
848running when nothing else is active. 911running when nothing else is active.
849 912
850 ev_signal exitsig; 913 ev_signal exitsig;
851 ev_signal_init (&exitsig, sig_cb, SIGINT); 914 ev_signal_init (&exitsig, sig_cb, SIGINT);
852 ev_signal_start (loop, &exitsig); 915 ev_signal_start (loop, &exitsig);
853 evf_unref (loop); 916 ev_unref (loop);
854 917
855Example: For some weird reason, unregister the above signal handler again. 918Example: For some weird reason, unregister the above signal handler again.
856 919
857 ev_ref (loop); 920 ev_ref (loop);
858 ev_signal_stop (loop, &exitsig); 921 ev_signal_stop (loop, &exitsig);
970See also the locking example in the C<THREADS> section later in this 1033See also the locking example in the C<THREADS> section later in this
971document. 1034document.
972 1035
973=item ev_set_userdata (loop, void *data) 1036=item ev_set_userdata (loop, void *data)
974 1037
975=item ev_userdata (loop) 1038=item void *ev_userdata (loop)
976 1039
977Set and retrieve a single C<void *> associated with a loop. When 1040Set and retrieve a single C<void *> associated with a loop. When
978C<ev_set_userdata> has never been called, then C<ev_userdata> returns 1041C<ev_set_userdata> has never been called, then C<ev_userdata> returns
979C<0.> 1042C<0>.
980 1043
981These two functions can be used to associate arbitrary data with a loop, 1044These two functions can be used to associate arbitrary data with a loop,
982and are intended solely for the C<invoke_pending_cb>, C<release> and 1045and are intended solely for the C<invoke_pending_cb>, C<release> and
983C<acquire> callbacks described above, but of course can be (ab-)used for 1046C<acquire> callbacks described above, but of course can be (ab-)used for
984any other purpose as well. 1047any other purpose as well.
1114The event loop has been resumed in the child process after fork (see 1177The event loop has been resumed in the child process after fork (see
1115C<ev_fork>). 1178C<ev_fork>).
1116 1179
1117=item C<EV_CLEANUP> 1180=item C<EV_CLEANUP>
1118 1181
1119The event loop is abotu to be destroyed (see C<ev_cleanup>). 1182The event loop is about to be destroyed (see C<ev_cleanup>).
1120 1183
1121=item C<EV_ASYNC> 1184=item C<EV_ASYNC>
1122 1185
1123The given async watcher has been asynchronously notified (see C<ev_async>). 1186The given async watcher has been asynchronously notified (see C<ev_async>).
1124 1187
1146programs, though, as the fd could already be closed and reused for another 1209programs, though, as the fd could already be closed and reused for another
1147thing, so beware. 1210thing, so beware.
1148 1211
1149=back 1212=back
1150 1213
1214=head2 GENERIC WATCHER FUNCTIONS
1215
1216=over 4
1217
1218=item C<ev_init> (ev_TYPE *watcher, callback)
1219
1220This macro initialises the generic portion of a watcher. The contents
1221of the watcher object can be arbitrary (so C<malloc> will do). Only
1222the generic parts of the watcher are initialised, you I<need> to call
1223the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1224type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1225which rolls both calls into one.
1226
1227You can reinitialise a watcher at any time as long as it has been stopped
1228(or never started) and there are no pending events outstanding.
1229
1230The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1231int revents)>.
1232
1233Example: Initialise an C<ev_io> watcher in two steps.
1234
1235 ev_io w;
1236 ev_init (&w, my_cb);
1237 ev_io_set (&w, STDIN_FILENO, EV_READ);
1238
1239=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1240
1241This macro initialises the type-specific parts of a watcher. You need to
1242call C<ev_init> at least once before you call this macro, but you can
1243call C<ev_TYPE_set> any number of times. You must not, however, call this
1244macro on a watcher that is active (it can be pending, however, which is a
1245difference to the C<ev_init> macro).
1246
1247Although some watcher types do not have type-specific arguments
1248(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1249
1250See C<ev_init>, above, for an example.
1251
1252=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1253
1254This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1255calls into a single call. This is the most convenient method to initialise
1256a watcher. The same limitations apply, of course.
1257
1258Example: Initialise and set an C<ev_io> watcher in one step.
1259
1260 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1261
1262=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1263
1264Starts (activates) the given watcher. Only active watchers will receive
1265events. If the watcher is already active nothing will happen.
1266
1267Example: Start the C<ev_io> watcher that is being abused as example in this
1268whole section.
1269
1270 ev_io_start (EV_DEFAULT_UC, &w);
1271
1272=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1273
1274Stops the given watcher if active, and clears the pending status (whether
1275the watcher was active or not).
1276
1277It is possible that stopped watchers are pending - for example,
1278non-repeating timers are being stopped when they become pending - but
1279calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1280pending. If you want to free or reuse the memory used by the watcher it is
1281therefore a good idea to always call its C<ev_TYPE_stop> function.
1282
1283=item bool ev_is_active (ev_TYPE *watcher)
1284
1285Returns a true value iff the watcher is active (i.e. it has been started
1286and not yet been stopped). As long as a watcher is active you must not modify
1287it.
1288
1289=item bool ev_is_pending (ev_TYPE *watcher)
1290
1291Returns a true value iff the watcher is pending, (i.e. it has outstanding
1292events but its callback has not yet been invoked). As long as a watcher
1293is pending (but not active) you must not call an init function on it (but
1294C<ev_TYPE_set> is safe), you must not change its priority, and you must
1295make sure the watcher is available to libev (e.g. you cannot C<free ()>
1296it).
1297
1298=item callback ev_cb (ev_TYPE *watcher)
1299
1300Returns the callback currently set on the watcher.
1301
1302=item ev_cb_set (ev_TYPE *watcher, callback)
1303
1304Change the callback. You can change the callback at virtually any time
1305(modulo threads).
1306
1307=item ev_set_priority (ev_TYPE *watcher, int priority)
1308
1309=item int ev_priority (ev_TYPE *watcher)
1310
1311Set and query the priority of the watcher. The priority is a small
1312integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1313(default: C<-2>). Pending watchers with higher priority will be invoked
1314before watchers with lower priority, but priority will not keep watchers
1315from being executed (except for C<ev_idle> watchers).
1316
1317If you need to suppress invocation when higher priority events are pending
1318you need to look at C<ev_idle> watchers, which provide this functionality.
1319
1320You I<must not> change the priority of a watcher as long as it is active or
1321pending.
1322
1323Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1324fine, as long as you do not mind that the priority value you query might
1325or might not have been clamped to the valid range.
1326
1327The default priority used by watchers when no priority has been set is
1328always C<0>, which is supposed to not be too high and not be too low :).
1329
1330See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1331priorities.
1332
1333=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1334
1335Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1336C<loop> nor C<revents> need to be valid as long as the watcher callback
1337can deal with that fact, as both are simply passed through to the
1338callback.
1339
1340=item int ev_clear_pending (loop, ev_TYPE *watcher)
1341
1342If the watcher is pending, this function clears its pending status and
1343returns its C<revents> bitset (as if its callback was invoked). If the
1344watcher isn't pending it does nothing and returns C<0>.
1345
1346Sometimes it can be useful to "poll" a watcher instead of waiting for its
1347callback to be invoked, which can be accomplished with this function.
1348
1349=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1350
1351Feeds the given event set into the event loop, as if the specified event
1352had happened for the specified watcher (which must be a pointer to an
1353initialised but not necessarily started event watcher). Obviously you must
1354not free the watcher as long as it has pending events.
1355
1356Stopping the watcher, letting libev invoke it, or calling
1357C<ev_clear_pending> will clear the pending event, even if the watcher was
1358not started in the first place.
1359
1360See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1361functions that do not need a watcher.
1362
1363=back
1364
1365See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1366OWN COMPOSITE WATCHERS> idioms.
1367
1151=head2 WATCHER STATES 1368=head2 WATCHER STATES
1152 1369
1153There are various watcher states mentioned throughout this manual - 1370There are various watcher states mentioned throughout this manual -
1154active, pending and so on. In this section these states and the rules to 1371active, pending and so on. In this section these states and the rules to
1155transition between them will be described in more detail - and while these 1372transition between them will be described in more detail - and while these
1204While stopped (and not pending) the watcher is essentially in the 1421While stopped (and not pending) the watcher is essentially in the
1205initialised state, that is it can be reused, moved, modified in any way 1422initialised state, that is it can be reused, moved, modified in any way
1206you wish. 1423you wish.
1207 1424
1208=back 1425=back
1209
1210=head2 GENERIC WATCHER FUNCTIONS
1211
1212=over 4
1213
1214=item C<ev_init> (ev_TYPE *watcher, callback)
1215
1216This macro initialises the generic portion of a watcher. The contents
1217of the watcher object can be arbitrary (so C<malloc> will do). Only
1218the generic parts of the watcher are initialised, you I<need> to call
1219the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1220type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1221which rolls both calls into one.
1222
1223You can reinitialise a watcher at any time as long as it has been stopped
1224(or never started) and there are no pending events outstanding.
1225
1226The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1227int revents)>.
1228
1229Example: Initialise an C<ev_io> watcher in two steps.
1230
1231 ev_io w;
1232 ev_init (&w, my_cb);
1233 ev_io_set (&w, STDIN_FILENO, EV_READ);
1234
1235=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1236
1237This macro initialises the type-specific parts of a watcher. You need to
1238call C<ev_init> at least once before you call this macro, but you can
1239call C<ev_TYPE_set> any number of times. You must not, however, call this
1240macro on a watcher that is active (it can be pending, however, which is a
1241difference to the C<ev_init> macro).
1242
1243Although some watcher types do not have type-specific arguments
1244(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1245
1246See C<ev_init>, above, for an example.
1247
1248=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1249
1250This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1251calls into a single call. This is the most convenient method to initialise
1252a watcher. The same limitations apply, of course.
1253
1254Example: Initialise and set an C<ev_io> watcher in one step.
1255
1256 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1257
1258=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1259
1260Starts (activates) the given watcher. Only active watchers will receive
1261events. If the watcher is already active nothing will happen.
1262
1263Example: Start the C<ev_io> watcher that is being abused as example in this
1264whole section.
1265
1266 ev_io_start (EV_DEFAULT_UC, &w);
1267
1268=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1269
1270Stops the given watcher if active, and clears the pending status (whether
1271the watcher was active or not).
1272
1273It is possible that stopped watchers are pending - for example,
1274non-repeating timers are being stopped when they become pending - but
1275calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1276pending. If you want to free or reuse the memory used by the watcher it is
1277therefore a good idea to always call its C<ev_TYPE_stop> function.
1278
1279=item bool ev_is_active (ev_TYPE *watcher)
1280
1281Returns a true value iff the watcher is active (i.e. it has been started
1282and not yet been stopped). As long as a watcher is active you must not modify
1283it.
1284
1285=item bool ev_is_pending (ev_TYPE *watcher)
1286
1287Returns a true value iff the watcher is pending, (i.e. it has outstanding
1288events but its callback has not yet been invoked). As long as a watcher
1289is pending (but not active) you must not call an init function on it (but
1290C<ev_TYPE_set> is safe), you must not change its priority, and you must
1291make sure the watcher is available to libev (e.g. you cannot C<free ()>
1292it).
1293
1294=item callback ev_cb (ev_TYPE *watcher)
1295
1296Returns the callback currently set on the watcher.
1297
1298=item ev_cb_set (ev_TYPE *watcher, callback)
1299
1300Change the callback. You can change the callback at virtually any time
1301(modulo threads).
1302
1303=item ev_set_priority (ev_TYPE *watcher, int priority)
1304
1305=item int ev_priority (ev_TYPE *watcher)
1306
1307Set and query the priority of the watcher. The priority is a small
1308integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1309(default: C<-2>). Pending watchers with higher priority will be invoked
1310before watchers with lower priority, but priority will not keep watchers
1311from being executed (except for C<ev_idle> watchers).
1312
1313If you need to suppress invocation when higher priority events are pending
1314you need to look at C<ev_idle> watchers, which provide this functionality.
1315
1316You I<must not> change the priority of a watcher as long as it is active or
1317pending.
1318
1319Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1320fine, as long as you do not mind that the priority value you query might
1321or might not have been clamped to the valid range.
1322
1323The default priority used by watchers when no priority has been set is
1324always C<0>, which is supposed to not be too high and not be too low :).
1325
1326See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1327priorities.
1328
1329=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1330
1331Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1332C<loop> nor C<revents> need to be valid as long as the watcher callback
1333can deal with that fact, as both are simply passed through to the
1334callback.
1335
1336=item int ev_clear_pending (loop, ev_TYPE *watcher)
1337
1338If the watcher is pending, this function clears its pending status and
1339returns its C<revents> bitset (as if its callback was invoked). If the
1340watcher isn't pending it does nothing and returns C<0>.
1341
1342Sometimes it can be useful to "poll" a watcher instead of waiting for its
1343callback to be invoked, which can be accomplished with this function.
1344
1345=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1346
1347Feeds the given event set into the event loop, as if the specified event
1348had happened for the specified watcher (which must be a pointer to an
1349initialised but not necessarily started event watcher). Obviously you must
1350not free the watcher as long as it has pending events.
1351
1352Stopping the watcher, letting libev invoke it, or calling
1353C<ev_clear_pending> will clear the pending event, even if the watcher was
1354not started in the first place.
1355
1356See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1357functions that do not need a watcher.
1358
1359=back
1360
1361
1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1363
1364Each watcher has, by default, a member C<void *data> that you can change
1365and read at any time: libev will completely ignore it. This can be used
1366to associate arbitrary data with your watcher. If you need more data and
1367don't want to allocate memory and store a pointer to it in that data
1368member, you can also "subclass" the watcher type and provide your own
1369data:
1370
1371 struct my_io
1372 {
1373 ev_io io;
1374 int otherfd;
1375 void *somedata;
1376 struct whatever *mostinteresting;
1377 };
1378
1379 ...
1380 struct my_io w;
1381 ev_io_init (&w.io, my_cb, fd, EV_READ);
1382
1383And since your callback will be called with a pointer to the watcher, you
1384can cast it back to your own type:
1385
1386 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1387 {
1388 struct my_io *w = (struct my_io *)w_;
1389 ...
1390 }
1391
1392More interesting and less C-conformant ways of casting your callback type
1393instead have been omitted.
1394
1395Another common scenario is to use some data structure with multiple
1396embedded watchers:
1397
1398 struct my_biggy
1399 {
1400 int some_data;
1401 ev_timer t1;
1402 ev_timer t2;
1403 }
1404
1405In this case getting the pointer to C<my_biggy> is a bit more
1406complicated: Either you store the address of your C<my_biggy> struct
1407in the C<data> member of the watcher (for woozies), or you need to use
1408some pointer arithmetic using C<offsetof> inside your watchers (for real
1409programmers):
1410
1411 #include <stddef.h>
1412
1413 static void
1414 t1_cb (EV_P_ ev_timer *w, int revents)
1415 {
1416 struct my_biggy big = (struct my_biggy *)
1417 (((char *)w) - offsetof (struct my_biggy, t1));
1418 }
1419
1420 static void
1421 t2_cb (EV_P_ ev_timer *w, int revents)
1422 {
1423 struct my_biggy big = (struct my_biggy *)
1424 (((char *)w) - offsetof (struct my_biggy, t2));
1425 }
1426 1426
1427=head2 WATCHER PRIORITY MODELS 1427=head2 WATCHER PRIORITY MODELS
1428 1428
1429Many event loops support I<watcher priorities>, which are usually small 1429Many event loops support I<watcher priorities>, which are usually small
1430integers that influence the ordering of event callback invocation 1430integers that influence the ordering of event callback invocation
1557In general you can register as many read and/or write event watchers per 1557In general you can register as many read and/or write event watchers per
1558fd as you want (as long as you don't confuse yourself). Setting all file 1558fd as you want (as long as you don't confuse yourself). Setting all file
1559descriptors to non-blocking mode is also usually a good idea (but not 1559descriptors to non-blocking mode is also usually a good idea (but not
1560required if you know what you are doing). 1560required if you know what you are doing).
1561 1561
1562If you cannot use non-blocking mode, then force the use of a
1563known-to-be-good backend (at the time of this writing, this includes only
1564C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1565descriptors for which non-blocking operation makes no sense (such as
1566files) - libev doesn't guarantee any specific behaviour in that case.
1567
1568Another thing you have to watch out for is that it is quite easy to 1562Another thing you have to watch out for is that it is quite easy to
1569receive "spurious" readiness notifications, that is your callback might 1563receive "spurious" readiness notifications, that is, your callback might
1570be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1564be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1571because there is no data. Not only are some backends known to create a 1565because there is no data. It is very easy to get into this situation even
1572lot of those (for example Solaris ports), it is very easy to get into 1566with a relatively standard program structure. Thus it is best to always
1573this situation even with a relatively standard program structure. Thus 1567use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1574it is best to always use non-blocking I/O: An extra C<read>(2) returning
1575C<EAGAIN> is far preferable to a program hanging until some data arrives. 1568preferable to a program hanging until some data arrives.
1576 1569
1577If you cannot run the fd in non-blocking mode (for example you should 1570If you cannot run the fd in non-blocking mode (for example you should
1578not play around with an Xlib connection), then you have to separately 1571not play around with an Xlib connection), then you have to separately
1579re-test whether a file descriptor is really ready with a known-to-be good 1572re-test whether a file descriptor is really ready with a known-to-be good
1580interface such as poll (fortunately in our Xlib example, Xlib already 1573interface such as poll (fortunately in the case of Xlib, it already does
1581does this on its own, so its quite safe to use). Some people additionally 1574this on its own, so its quite safe to use). Some people additionally
1582use C<SIGALRM> and an interval timer, just to be sure you won't block 1575use C<SIGALRM> and an interval timer, just to be sure you won't block
1583indefinitely. 1576indefinitely.
1584 1577
1585But really, best use non-blocking mode. 1578But really, best use non-blocking mode.
1586 1579
1614 1607
1615There is no workaround possible except not registering events 1608There is no workaround possible except not registering events
1616for potentially C<dup ()>'ed file descriptors, or to resort to 1609for potentially C<dup ()>'ed file descriptors, or to resort to
1617C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1610C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1618 1611
1612=head3 The special problem of files
1613
1614Many people try to use C<select> (or libev) on file descriptors
1615representing files, and expect it to become ready when their program
1616doesn't block on disk accesses (which can take a long time on their own).
1617
1618However, this cannot ever work in the "expected" way - you get a readiness
1619notification as soon as the kernel knows whether and how much data is
1620there, and in the case of open files, that's always the case, so you
1621always get a readiness notification instantly, and your read (or possibly
1622write) will still block on the disk I/O.
1623
1624Another way to view it is that in the case of sockets, pipes, character
1625devices and so on, there is another party (the sender) that delivers data
1626on its own, but in the case of files, there is no such thing: the disk
1627will not send data on its own, simply because it doesn't know what you
1628wish to read - you would first have to request some data.
1629
1630Since files are typically not-so-well supported by advanced notification
1631mechanism, libev tries hard to emulate POSIX behaviour with respect
1632to files, even though you should not use it. The reason for this is
1633convenience: sometimes you want to watch STDIN or STDOUT, which is
1634usually a tty, often a pipe, but also sometimes files or special devices
1635(for example, C<epoll> on Linux works with F</dev/random> but not with
1636F</dev/urandom>), and even though the file might better be served with
1637asynchronous I/O instead of with non-blocking I/O, it is still useful when
1638it "just works" instead of freezing.
1639
1640So avoid file descriptors pointing to files when you know it (e.g. use
1641libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
1642when you rarely read from a file instead of from a socket, and want to
1643reuse the same code path.
1644
1619=head3 The special problem of fork 1645=head3 The special problem of fork
1620 1646
1621Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1647Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1622useless behaviour. Libev fully supports fork, but needs to be told about 1648useless behaviour. Libev fully supports fork, but needs to be told about
1623it in the child. 1649it in the child if you want to continue to use it in the child.
1624 1650
1625To support fork in your programs, you either have to call 1651To support fork in your child processes, you have to call C<ev_loop_fork
1626C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1652()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1627enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1653C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1628C<EVBACKEND_POLL>.
1629 1654
1630=head3 The special problem of SIGPIPE 1655=head3 The special problem of SIGPIPE
1631 1656
1632While not really specific to libev, it is easy to forget about C<SIGPIPE>: 1657While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1633when writing to a pipe whose other end has been closed, your program gets 1658when writing to a pipe whose other end has been closed, your program gets
2249 2274
2250=head2 C<ev_signal> - signal me when a signal gets signalled! 2275=head2 C<ev_signal> - signal me when a signal gets signalled!
2251 2276
2252Signal watchers will trigger an event when the process receives a specific 2277Signal watchers will trigger an event when the process receives a specific
2253signal one or more times. Even though signals are very asynchronous, libev 2278signal one or more times. Even though signals are very asynchronous, libev
2254will try it's best to deliver signals synchronously, i.e. as part of the 2279will try its best to deliver signals synchronously, i.e. as part of the
2255normal event processing, like any other event. 2280normal event processing, like any other event.
2256 2281
2257If you want signals to be delivered truly asynchronously, just use 2282If you want signals to be delivered truly asynchronously, just use
2258C<sigaction> as you would do without libev and forget about sharing 2283C<sigaction> as you would do without libev and forget about sharing
2259the signal. You can even use C<ev_async> from a signal handler to 2284the signal. You can even use C<ev_async> from a signal handler to
2278=head3 The special problem of inheritance over fork/execve/pthread_create 2303=head3 The special problem of inheritance over fork/execve/pthread_create
2279 2304
2280Both the signal mask (C<sigprocmask>) and the signal disposition 2305Both the signal mask (C<sigprocmask>) and the signal disposition
2281(C<sigaction>) are unspecified after starting a signal watcher (and after 2306(C<sigaction>) are unspecified after starting a signal watcher (and after
2282stopping it again), that is, libev might or might not block the signal, 2307stopping it again), that is, libev might or might not block the signal,
2283and might or might not set or restore the installed signal handler. 2308and might or might not set or restore the installed signal handler (but
2309see C<EVFLAG_NOSIGMASK>).
2284 2310
2285While this does not matter for the signal disposition (libev never 2311While this does not matter for the signal disposition (libev never
2286sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on 2312sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2287C<execve>), this matters for the signal mask: many programs do not expect 2313C<execve>), this matters for the signal mask: many programs do not expect
2288certain signals to be blocked. 2314certain signals to be blocked.
2301I<has> to modify the signal mask, at least temporarily. 2327I<has> to modify the signal mask, at least temporarily.
2302 2328
2303So I can't stress this enough: I<If you do not reset your signal mask when 2329So I can't stress this enough: I<If you do not reset your signal mask when
2304you expect it to be empty, you have a race condition in your code>. This 2330you expect it to be empty, you have a race condition in your code>. This
2305is not a libev-specific thing, this is true for most event libraries. 2331is not a libev-specific thing, this is true for most event libraries.
2332
2333=head3 The special problem of threads signal handling
2334
2335POSIX threads has problematic signal handling semantics, specifically,
2336a lot of functionality (sigfd, sigwait etc.) only really works if all
2337threads in a process block signals, which is hard to achieve.
2338
2339When you want to use sigwait (or mix libev signal handling with your own
2340for the same signals), you can tackle this problem by globally blocking
2341all signals before creating any threads (or creating them with a fully set
2342sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
2343loops. Then designate one thread as "signal receiver thread" which handles
2344these signals. You can pass on any signals that libev might be interested
2345in by calling C<ev_feed_signal>.
2306 2346
2307=head3 Watcher-Specific Functions and Data Members 2347=head3 Watcher-Specific Functions and Data Members
2308 2348
2309=over 4 2349=over 4
2310 2350
3098 3138
3099=item ev_fork_init (ev_fork *, callback) 3139=item ev_fork_init (ev_fork *, callback)
3100 3140
3101Initialises and configures the fork watcher - it has no parameters of any 3141Initialises and configures the fork watcher - it has no parameters of any
3102kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 3142kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3103believe me. 3143really.
3104 3144
3105=back 3145=back
3106 3146
3107 3147
3108=head2 C<ev_cleanup> - even the best things end 3148=head2 C<ev_cleanup> - even the best things end
3109 3149
3110Cleanup watchers are called just before the event loop they are registered 3150Cleanup watchers are called just before the event loop is being destroyed
3111with is being destroyed. 3151by a call to C<ev_loop_destroy>.
3112 3152
3113While there is no guarantee that the event loop gets destroyed, cleanup 3153While there is no guarantee that the event loop gets destroyed, cleanup
3114watchers provide a convenient method to install cleanup watchers for your 3154watchers provide a convenient method to install cleanup hooks for your
3115program, worker threads and so on - you just to make sure to destroy the 3155program, worker threads and so on - you just to make sure to destroy the
3116loop when you want them to be invoked. 3156loop when you want them to be invoked.
3117 3157
3158Cleanup watchers are invoked in the same way as any other watcher. Unlike
3159all other watchers, they do not keep a reference to the event loop (which
3160makes a lot of sense if you think about it). Like all other watchers, you
3161can call libev functions in the callback, except C<ev_cleanup_start>.
3162
3118=head3 Watcher-Specific Functions and Data Members 3163=head3 Watcher-Specific Functions and Data Members
3119 3164
3120=over 4 3165=over 4
3121 3166
3122=item ev_cleanup_init (ev_cleanup *, callback) 3167=item ev_cleanup_init (ev_cleanup *, callback)
3123 3168
3124Initialises and configures the cleanup watcher - it has no parameters of 3169Initialises and configures the cleanup watcher - it has no parameters of
3125any kind. There is a C<ev_cleanup_set> macro, but using it is utterly 3170any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3126pointless, believe me. 3171pointless, I assure you.
3127 3172
3128=back 3173=back
3129 3174
3130Example: Register an atexit handler to destroy the default loop, so any 3175Example: Register an atexit handler to destroy the default loop, so any
3131cleanup functions are called. 3176cleanup functions are called.
3152it by calling C<ev_async_send>, which is thread- and signal safe. 3197it by calling C<ev_async_send>, which is thread- and signal safe.
3153 3198
3154This functionality is very similar to C<ev_signal> watchers, as signals, 3199This functionality is very similar to C<ev_signal> watchers, as signals,
3155too, are asynchronous in nature, and signals, too, will be compressed 3200too, are asynchronous in nature, and signals, too, will be compressed
3156(i.e. the number of callback invocations may be less than the number of 3201(i.e. the number of callback invocations may be less than the number of
3157C<ev_async_sent> calls). 3202C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3203of "global async watchers" by using a watcher on an otherwise unused
3204signal, and C<ev_feed_signal> to signal this watcher from another thread,
3205even without knowing which loop owns the signal.
3158 3206
3159Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not 3207Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3160just the default loop. 3208just the default loop.
3161 3209
3162=head3 Queueing 3210=head3 Queueing
3338Feed an event on the given fd, as if a file descriptor backend detected 3386Feed an event on the given fd, as if a file descriptor backend detected
3339the given events it. 3387the given events it.
3340 3388
3341=item ev_feed_signal_event (loop, int signum) 3389=item ev_feed_signal_event (loop, int signum)
3342 3390
3343Feed an event as if the given signal occurred (C<loop> must be the default 3391Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3344loop!). 3392which is async-safe.
3345 3393
3346=back 3394=back
3395
3396
3397=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3398
3399This section explains some common idioms that are not immediately
3400obvious. Note that examples are sprinkled over the whole manual, and this
3401section only contains stuff that wouldn't fit anywhere else.
3402
3403=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3404
3405Each watcher has, by default, a C<void *data> member that you can read
3406or modify at any time: libev will completely ignore it. This can be used
3407to associate arbitrary data with your watcher. If you need more data and
3408don't want to allocate memory separately and store a pointer to it in that
3409data member, you can also "subclass" the watcher type and provide your own
3410data:
3411
3412 struct my_io
3413 {
3414 ev_io io;
3415 int otherfd;
3416 void *somedata;
3417 struct whatever *mostinteresting;
3418 };
3419
3420 ...
3421 struct my_io w;
3422 ev_io_init (&w.io, my_cb, fd, EV_READ);
3423
3424And since your callback will be called with a pointer to the watcher, you
3425can cast it back to your own type:
3426
3427 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
3428 {
3429 struct my_io *w = (struct my_io *)w_;
3430 ...
3431 }
3432
3433More interesting and less C-conformant ways of casting your callback
3434function type instead have been omitted.
3435
3436=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
3437
3438Another common scenario is to use some data structure with multiple
3439embedded watchers, in effect creating your own watcher that combines
3440multiple libev event sources into one "super-watcher":
3441
3442 struct my_biggy
3443 {
3444 int some_data;
3445 ev_timer t1;
3446 ev_timer t2;
3447 }
3448
3449In this case getting the pointer to C<my_biggy> is a bit more
3450complicated: Either you store the address of your C<my_biggy> struct in
3451the C<data> member of the watcher (for woozies or C++ coders), or you need
3452to use some pointer arithmetic using C<offsetof> inside your watchers (for
3453real programmers):
3454
3455 #include <stddef.h>
3456
3457 static void
3458 t1_cb (EV_P_ ev_timer *w, int revents)
3459 {
3460 struct my_biggy big = (struct my_biggy *)
3461 (((char *)w) - offsetof (struct my_biggy, t1));
3462 }
3463
3464 static void
3465 t2_cb (EV_P_ ev_timer *w, int revents)
3466 {
3467 struct my_biggy big = (struct my_biggy *)
3468 (((char *)w) - offsetof (struct my_biggy, t2));
3469 }
3470
3471=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3472
3473Often (especially in GUI toolkits) there are places where you have
3474I<modal> interaction, which is most easily implemented by recursively
3475invoking C<ev_run>.
3476
3477This brings the problem of exiting - a callback might want to finish the
3478main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3479a modal "Are you sure?" dialog is still waiting), or just the nested one
3480and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3481other combination: In these cases, C<ev_break> will not work alone.
3482
3483The solution is to maintain "break this loop" variable for each C<ev_run>
3484invocation, and use a loop around C<ev_run> until the condition is
3485triggered, using C<EVRUN_ONCE>:
3486
3487 // main loop
3488 int exit_main_loop = 0;
3489
3490 while (!exit_main_loop)
3491 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3492
3493 // in a model watcher
3494 int exit_nested_loop = 0;
3495
3496 while (!exit_nested_loop)
3497 ev_run (EV_A_ EVRUN_ONCE);
3498
3499To exit from any of these loops, just set the corresponding exit variable:
3500
3501 // exit modal loop
3502 exit_nested_loop = 1;
3503
3504 // exit main program, after modal loop is finished
3505 exit_main_loop = 1;
3506
3507 // exit both
3508 exit_main_loop = exit_nested_loop = 1;
3509
3510=head2 THREAD LOCKING EXAMPLE
3511
3512Here is a fictitious example of how to run an event loop in a different
3513thread from where callbacks are being invoked and watchers are
3514created/added/removed.
3515
3516For a real-world example, see the C<EV::Loop::Async> perl module,
3517which uses exactly this technique (which is suited for many high-level
3518languages).
3519
3520The example uses a pthread mutex to protect the loop data, a condition
3521variable to wait for callback invocations, an async watcher to notify the
3522event loop thread and an unspecified mechanism to wake up the main thread.
3523
3524First, you need to associate some data with the event loop:
3525
3526 typedef struct {
3527 mutex_t lock; /* global loop lock */
3528 ev_async async_w;
3529 thread_t tid;
3530 cond_t invoke_cv;
3531 } userdata;
3532
3533 void prepare_loop (EV_P)
3534 {
3535 // for simplicity, we use a static userdata struct.
3536 static userdata u;
3537
3538 ev_async_init (&u->async_w, async_cb);
3539 ev_async_start (EV_A_ &u->async_w);
3540
3541 pthread_mutex_init (&u->lock, 0);
3542 pthread_cond_init (&u->invoke_cv, 0);
3543
3544 // now associate this with the loop
3545 ev_set_userdata (EV_A_ u);
3546 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3547 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3548
3549 // then create the thread running ev_loop
3550 pthread_create (&u->tid, 0, l_run, EV_A);
3551 }
3552
3553The callback for the C<ev_async> watcher does nothing: the watcher is used
3554solely to wake up the event loop so it takes notice of any new watchers
3555that might have been added:
3556
3557 static void
3558 async_cb (EV_P_ ev_async *w, int revents)
3559 {
3560 // just used for the side effects
3561 }
3562
3563The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
3564protecting the loop data, respectively.
3565
3566 static void
3567 l_release (EV_P)
3568 {
3569 userdata *u = ev_userdata (EV_A);
3570 pthread_mutex_unlock (&u->lock);
3571 }
3572
3573 static void
3574 l_acquire (EV_P)
3575 {
3576 userdata *u = ev_userdata (EV_A);
3577 pthread_mutex_lock (&u->lock);
3578 }
3579
3580The event loop thread first acquires the mutex, and then jumps straight
3581into C<ev_run>:
3582
3583 void *
3584 l_run (void *thr_arg)
3585 {
3586 struct ev_loop *loop = (struct ev_loop *)thr_arg;
3587
3588 l_acquire (EV_A);
3589 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
3590 ev_run (EV_A_ 0);
3591 l_release (EV_A);
3592
3593 return 0;
3594 }
3595
3596Instead of invoking all pending watchers, the C<l_invoke> callback will
3597signal the main thread via some unspecified mechanism (signals? pipe
3598writes? C<Async::Interrupt>?) and then waits until all pending watchers
3599have been called (in a while loop because a) spurious wakeups are possible
3600and b) skipping inter-thread-communication when there are no pending
3601watchers is very beneficial):
3602
3603 static void
3604 l_invoke (EV_P)
3605 {
3606 userdata *u = ev_userdata (EV_A);
3607
3608 while (ev_pending_count (EV_A))
3609 {
3610 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
3611 pthread_cond_wait (&u->invoke_cv, &u->lock);
3612 }
3613 }
3614
3615Now, whenever the main thread gets told to invoke pending watchers, it
3616will grab the lock, call C<ev_invoke_pending> and then signal the loop
3617thread to continue:
3618
3619 static void
3620 real_invoke_pending (EV_P)
3621 {
3622 userdata *u = ev_userdata (EV_A);
3623
3624 pthread_mutex_lock (&u->lock);
3625 ev_invoke_pending (EV_A);
3626 pthread_cond_signal (&u->invoke_cv);
3627 pthread_mutex_unlock (&u->lock);
3628 }
3629
3630Whenever you want to start/stop a watcher or do other modifications to an
3631event loop, you will now have to lock:
3632
3633 ev_timer timeout_watcher;
3634 userdata *u = ev_userdata (EV_A);
3635
3636 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
3637
3638 pthread_mutex_lock (&u->lock);
3639 ev_timer_start (EV_A_ &timeout_watcher);
3640 ev_async_send (EV_A_ &u->async_w);
3641 pthread_mutex_unlock (&u->lock);
3642
3643Note that sending the C<ev_async> watcher is required because otherwise
3644an event loop currently blocking in the kernel will have no knowledge
3645about the newly added timer. By waking up the loop it will pick up any new
3646watchers in the next event loop iteration.
3647
3648=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
3649
3650While the overhead of a callback that e.g. schedules a thread is small, it
3651is still an overhead. If you embed libev, and your main usage is with some
3652kind of threads or coroutines, you might want to customise libev so that
3653doesn't need callbacks anymore.
3654
3655Imagine you have coroutines that you can switch to using a function
3656C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
3657and that due to some magic, the currently active coroutine is stored in a
3658global called C<current_coro>. Then you can build your own "wait for libev
3659event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
3660the differing C<;> conventions):
3661
3662 #define EV_CB_DECLARE(type) struct my_coro *cb;
3663 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3664
3665That means instead of having a C callback function, you store the
3666coroutine to switch to in each watcher, and instead of having libev call
3667your callback, you instead have it switch to that coroutine.
3668
3669A coroutine might now wait for an event with a function called
3670C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
3671matter when, or whether the watcher is active or not when this function is
3672called):
3673
3674 void
3675 wait_for_event (ev_watcher *w)
3676 {
3677 ev_cb_set (w) = current_coro;
3678 switch_to (libev_coro);
3679 }
3680
3681That basically suspends the coroutine inside C<wait_for_event> and
3682continues the libev coroutine, which, when appropriate, switches back to
3683this or any other coroutine. I am sure if you sue this your own :)
3684
3685You can do similar tricks if you have, say, threads with an event queue -
3686instead of storing a coroutine, you store the queue object and instead of
3687switching to a coroutine, you push the watcher onto the queue and notify
3688any waiters.
3689
3690To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
3691files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3692
3693 // my_ev.h
3694 #define EV_CB_DECLARE(type) struct my_coro *cb;
3695 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3696 #include "../libev/ev.h"
3697
3698 // my_ev.c
3699 #define EV_H "my_ev.h"
3700 #include "../libev/ev.c"
3701
3702And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
3703F<my_ev.c> into your project. When properly specifying include paths, you
3704can even use F<ev.h> as header file name directly.
3347 3705
3348 3706
3349=head1 LIBEVENT EMULATION 3707=head1 LIBEVENT EMULATION
3350 3708
3351Libev offers a compatibility emulation layer for libevent. It cannot 3709Libev offers a compatibility emulation layer for libevent. It cannot
3352emulate the internals of libevent, so here are some usage hints: 3710emulate the internals of libevent, so here are some usage hints:
3353 3711
3354=over 4 3712=over 4
3713
3714=item * Only the libevent-1.4.1-beta API is being emulated.
3715
3716This was the newest libevent version available when libev was implemented,
3717and is still mostly unchanged in 2010.
3355 3718
3356=item * Use it by including <event.h>, as usual. 3719=item * Use it by including <event.h>, as usual.
3357 3720
3358=item * The following members are fully supported: ev_base, ev_callback, 3721=item * The following members are fully supported: ev_base, ev_callback,
3359ev_arg, ev_fd, ev_res, ev_events. 3722ev_arg, ev_fd, ev_res, ev_events.
3365=item * Priorities are not currently supported. Initialising priorities 3728=item * Priorities are not currently supported. Initialising priorities
3366will fail and all watchers will have the same priority, even though there 3729will fail and all watchers will have the same priority, even though there
3367is an ev_pri field. 3730is an ev_pri field.
3368 3731
3369=item * In libevent, the last base created gets the signals, in libev, the 3732=item * In libevent, the last base created gets the signals, in libev, the
3370first base created (== the default loop) gets the signals. 3733base that registered the signal gets the signals.
3371 3734
3372=item * Other members are not supported. 3735=item * Other members are not supported.
3373 3736
3374=item * The libev emulation is I<not> ABI compatible to libevent, you need 3737=item * The libev emulation is I<not> ABI compatible to libevent, you need
3375to use the libev header file and library. 3738to use the libev header file and library.
3394Care has been taken to keep the overhead low. The only data member the C++ 3757Care has been taken to keep the overhead low. The only data member the C++
3395classes add (compared to plain C-style watchers) is the event loop pointer 3758classes add (compared to plain C-style watchers) is the event loop pointer
3396that the watcher is associated with (or no additional members at all if 3759that the watcher is associated with (or no additional members at all if
3397you disable C<EV_MULTIPLICITY> when embedding libev). 3760you disable C<EV_MULTIPLICITY> when embedding libev).
3398 3761
3399Currently, functions, and static and non-static member functions can be 3762Currently, functions, static and non-static member functions and classes
3400used as callbacks. Other types should be easy to add as long as they only 3763with C<operator ()> can be used as callbacks. Other types should be easy
3401need one additional pointer for context. If you need support for other 3764to add as long as they only need one additional pointer for context. If
3402types of functors please contact the author (preferably after implementing 3765you need support for other types of functors please contact the author
3403it). 3766(preferably after implementing it).
3404 3767
3405Here is a list of things available in the C<ev> namespace: 3768Here is a list of things available in the C<ev> namespace:
3406 3769
3407=over 4 3770=over 4
3408 3771
4276And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4639And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4277 4640
4278 #include "ev_cpp.h" 4641 #include "ev_cpp.h"
4279 #include "ev.c" 4642 #include "ev.c"
4280 4643
4281=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4644=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4282 4645
4283=head2 THREADS AND COROUTINES 4646=head2 THREADS AND COROUTINES
4284 4647
4285=head3 THREADS 4648=head3 THREADS
4286 4649
4337default loop and triggering an C<ev_async> watcher from the default loop 4700default loop and triggering an C<ev_async> watcher from the default loop
4338watcher callback into the event loop interested in the signal. 4701watcher callback into the event loop interested in the signal.
4339 4702
4340=back 4703=back
4341 4704
4342=head4 THREAD LOCKING EXAMPLE 4705See also L<THREAD LOCKING EXAMPLE>.
4343
4344Here is a fictitious example of how to run an event loop in a different
4345thread than where callbacks are being invoked and watchers are
4346created/added/removed.
4347
4348For a real-world example, see the C<EV::Loop::Async> perl module,
4349which uses exactly this technique (which is suited for many high-level
4350languages).
4351
4352The example uses a pthread mutex to protect the loop data, a condition
4353variable to wait for callback invocations, an async watcher to notify the
4354event loop thread and an unspecified mechanism to wake up the main thread.
4355
4356First, you need to associate some data with the event loop:
4357
4358 typedef struct {
4359 mutex_t lock; /* global loop lock */
4360 ev_async async_w;
4361 thread_t tid;
4362 cond_t invoke_cv;
4363 } userdata;
4364
4365 void prepare_loop (EV_P)
4366 {
4367 // for simplicity, we use a static userdata struct.
4368 static userdata u;
4369
4370 ev_async_init (&u->async_w, async_cb);
4371 ev_async_start (EV_A_ &u->async_w);
4372
4373 pthread_mutex_init (&u->lock, 0);
4374 pthread_cond_init (&u->invoke_cv, 0);
4375
4376 // now associate this with the loop
4377 ev_set_userdata (EV_A_ u);
4378 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4379 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4380
4381 // then create the thread running ev_loop
4382 pthread_create (&u->tid, 0, l_run, EV_A);
4383 }
4384
4385The callback for the C<ev_async> watcher does nothing: the watcher is used
4386solely to wake up the event loop so it takes notice of any new watchers
4387that might have been added:
4388
4389 static void
4390 async_cb (EV_P_ ev_async *w, int revents)
4391 {
4392 // just used for the side effects
4393 }
4394
4395The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4396protecting the loop data, respectively.
4397
4398 static void
4399 l_release (EV_P)
4400 {
4401 userdata *u = ev_userdata (EV_A);
4402 pthread_mutex_unlock (&u->lock);
4403 }
4404
4405 static void
4406 l_acquire (EV_P)
4407 {
4408 userdata *u = ev_userdata (EV_A);
4409 pthread_mutex_lock (&u->lock);
4410 }
4411
4412The event loop thread first acquires the mutex, and then jumps straight
4413into C<ev_run>:
4414
4415 void *
4416 l_run (void *thr_arg)
4417 {
4418 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4419
4420 l_acquire (EV_A);
4421 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4422 ev_run (EV_A_ 0);
4423 l_release (EV_A);
4424
4425 return 0;
4426 }
4427
4428Instead of invoking all pending watchers, the C<l_invoke> callback will
4429signal the main thread via some unspecified mechanism (signals? pipe
4430writes? C<Async::Interrupt>?) and then waits until all pending watchers
4431have been called (in a while loop because a) spurious wakeups are possible
4432and b) skipping inter-thread-communication when there are no pending
4433watchers is very beneficial):
4434
4435 static void
4436 l_invoke (EV_P)
4437 {
4438 userdata *u = ev_userdata (EV_A);
4439
4440 while (ev_pending_count (EV_A))
4441 {
4442 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4443 pthread_cond_wait (&u->invoke_cv, &u->lock);
4444 }
4445 }
4446
4447Now, whenever the main thread gets told to invoke pending watchers, it
4448will grab the lock, call C<ev_invoke_pending> and then signal the loop
4449thread to continue:
4450
4451 static void
4452 real_invoke_pending (EV_P)
4453 {
4454 userdata *u = ev_userdata (EV_A);
4455
4456 pthread_mutex_lock (&u->lock);
4457 ev_invoke_pending (EV_A);
4458 pthread_cond_signal (&u->invoke_cv);
4459 pthread_mutex_unlock (&u->lock);
4460 }
4461
4462Whenever you want to start/stop a watcher or do other modifications to an
4463event loop, you will now have to lock:
4464
4465 ev_timer timeout_watcher;
4466 userdata *u = ev_userdata (EV_A);
4467
4468 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4469
4470 pthread_mutex_lock (&u->lock);
4471 ev_timer_start (EV_A_ &timeout_watcher);
4472 ev_async_send (EV_A_ &u->async_w);
4473 pthread_mutex_unlock (&u->lock);
4474
4475Note that sending the C<ev_async> watcher is required because otherwise
4476an event loop currently blocking in the kernel will have no knowledge
4477about the newly added timer. By waking up the loop it will pick up any new
4478watchers in the next event loop iteration.
4479 4706
4480=head3 COROUTINES 4707=head3 COROUTINES
4481 4708
4482Libev is very accommodating to coroutines ("cooperative threads"): 4709Libev is very accommodating to coroutines ("cooperative threads"):
4483libev fully supports nesting calls to its functions from different 4710libev fully supports nesting calls to its functions from different
4752structure (guaranteed by POSIX but not by ISO C for example), but it also 4979structure (guaranteed by POSIX but not by ISO C for example), but it also
4753assumes that the same (machine) code can be used to call any watcher 4980assumes that the same (machine) code can be used to call any watcher
4754callback: The watcher callbacks have different type signatures, but libev 4981callback: The watcher callbacks have different type signatures, but libev
4755calls them using an C<ev_watcher *> internally. 4982calls them using an C<ev_watcher *> internally.
4756 4983
4984=item pointer accesses must be thread-atomic
4985
4986Accessing a pointer value must be atomic, it must both be readable and
4987writable in one piece - this is the case on all current architectures.
4988
4757=item C<sig_atomic_t volatile> must be thread-atomic as well 4989=item C<sig_atomic_t volatile> must be thread-atomic as well
4758 4990
4759The type C<sig_atomic_t volatile> (or whatever is defined as 4991The type C<sig_atomic_t volatile> (or whatever is defined as
4760C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4992C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4761threads. This is not part of the specification for C<sig_atomic_t>, but is 4993threads. This is not part of the specification for C<sig_atomic_t>, but is
4867=back 5099=back
4868 5100
4869 5101
4870=head1 PORTING FROM LIBEV 3.X TO 4.X 5102=head1 PORTING FROM LIBEV 3.X TO 4.X
4871 5103
4872The major version 4 introduced some minor incompatible changes to the API. 5104The major version 4 introduced some incompatible changes to the API.
4873 5105
4874At the moment, the C<ev.h> header file tries to implement superficial 5106At the moment, the C<ev.h> header file provides compatibility definitions
4875compatibility, so most programs should still compile. Those might be 5107for all changes, so most programs should still compile. The compatibility
4876removed in later versions of libev, so better update early than late. 5108layer might be removed in later versions of libev, so better update to the
5109new API early than late.
4877 5110
4878=over 4 5111=over 4
5112
5113=item C<EV_COMPAT3> backwards compatibility mechanism
5114
5115The backward compatibility mechanism can be controlled by
5116C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
5117section.
4879 5118
4880=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5119=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4881 5120
4882These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5121These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4883 5122
4909ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 5148ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4910as all other watcher types. Note that C<ev_loop_fork> is still called 5149as all other watcher types. Note that C<ev_loop_fork> is still called
4911C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> 5150C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4912typedef. 5151typedef.
4913 5152
4914=item C<EV_COMPAT3> backwards compatibility mechanism
4915
4916The backward compatibility mechanism can be controlled by
4917C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4918section.
4919
4920=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 5153=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4921 5154
4922The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 5155The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4923mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 5156mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4924and work, but the library code will of course be larger. 5157and work, but the library code will of course be larger.
4998 5231
4999=back 5232=back
5000 5233
5001=head1 AUTHOR 5234=head1 AUTHOR
5002 5235
5003Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5236Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5237Magnusson and Emanuele Giaquinta.
5004 5238

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines