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

Comparing libev/ev.pod (file contents):
Revision 1.329 by root, Sun Oct 24 20:16:00 2010 UTC vs.
Revision 1.343 by root, Wed Nov 10 13:39:10 2010 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
300An event loop is described by a C<struct ev_loop *> (the C<struct> is 308An 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 309I<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). 310libev 3 had an C<ev_loop> function colliding with the struct name).
303 311
304The library knows two types of such loops, the I<default> loop, which 312The library knows two types of such loops, the I<default> loop, which
305supports signals and child events, and dynamically created event loops 313supports child process events, and dynamically created event loops which
306which do not. 314do not.
307 315
308=over 4 316=over 4
309 317
310=item struct ev_loop *ev_default_loop (unsigned int flags) 318=item struct ev_loop *ev_default_loop (unsigned int flags)
311 319
347=item struct ev_loop *ev_loop_new (unsigned int flags) 355=item struct ev_loop *ev_loop_new (unsigned int flags)
348 356
349This will create and initialise a new event loop object. If the loop 357This will create and initialise a new event loop object. If the loop
350could not be initialised, returns false. 358could not be initialised, returns false.
351 359
352Note that this function I<is> thread-safe, and one common way to use 360This 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 361threads is indeed to create one loop per thread, and using the default
354default loop in the "main" or "initial" thread. 362loop in the "main" or "initial" thread.
355 363
356The flags argument can be used to specify special behaviour or specific 364The 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>). 365backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
358 366
359The following flags are supported: 367The following flags are supported:
394environment variable. 402environment variable.
395 403
396=item C<EVFLAG_NOINOTIFY> 404=item C<EVFLAG_NOINOTIFY>
397 405
398When this flag is specified, then libev will not attempt to use the 406When 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 407I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
400testing, this flag can be useful to conserve inotify file descriptors, as 408testing, this flag can be useful to conserve inotify file descriptors, as
401otherwise each loop using C<ev_stat> watchers consumes one inotify handle. 409otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
402 410
403=item C<EVFLAG_SIGNALFD> 411=item C<EVFLAG_SIGNALFD>
404 412
405When this flag is specified, then libev will attempt to use the 413When 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 414I<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 415delivers signals synchronously, which makes it both faster and might make
408it possible to get the queued signal data. It can also simplify signal 416it possible to get the queued signal data. It can also simplify signal
409handling with threads, as long as you properly block signals in your 417handling with threads, as long as you properly block signals in your
410threads that are not interested in handling them. 418threads that are not interested in handling them.
411 419
455epoll scales either O(1) or O(active_fds). 463epoll scales either O(1) or O(active_fds).
456 464
457The epoll mechanism deserves honorable mention as the most misdesigned 465The epoll mechanism deserves honorable mention as the most misdesigned
458of the more advanced event mechanisms: mere annoyances include silently 466of the more advanced event mechanisms: mere annoyances include silently
459dropping file descriptors, requiring a system call per change per file 467dropping file descriptors, requiring a system call per change per file
460descriptor (and unnecessary guessing of parameters), problems with dup and 468descriptor (and unnecessary guessing of parameters), problems with dup,
469returning before the timeout value, resulting in additional iterations
470(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 4710.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 472forks then I<both> parent and child process have to recreate the epoll
463take considerable time (one syscall per file descriptor) and is of course 473set, which can take considerable time (one syscall per file descriptor)
464hard to detect. 474and is of course hard to detect.
465 475
466Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 476Epoll 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 477of course I<doesn't>, and epoll just loves to report events for totally
468I<different> file descriptors (even already closed ones, so one cannot 478I<different> file descriptors (even already closed ones, so one cannot
469even remove them from the set) than registered in the set (especially 479even remove them from the set) than registered in the set (especially
471employing an additional generation counter and comparing that against the 481employing an additional generation counter and comparing that against the
472events to filter out spurious ones, recreating the set when required. Last 482events to filter out spurious ones, recreating the set when required. Last
473not least, it also refuses to work with some file descriptors which work 483not least, it also refuses to work with some file descriptors which work
474perfectly fine with C<select> (files, many character devices...). 484perfectly fine with C<select> (files, many character devices...).
475 485
486Epoll is truly the train wreck analog among event poll mechanisms.
487
476While stopping, setting and starting an I/O watcher in the same iteration 488While 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 489will result in some caching, there is still a system call per such
478incident (because the same I<file descriptor> could point to a different 490incident (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 491I<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 492file descriptors might not work very well if you register events for both
607This function is normally used on loop objects allocated by 619This 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 620C<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. 621C<ev_default_loop>, in which case it is not thread-safe.
610 622
611Note that it is not advisable to call this function on the default loop 623Note 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. 624except 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> 625If you need dynamically allocated loops it is better to use C<ev_loop_new>
614and C<ev_loop_destroy>. 626and C<ev_loop_destroy>.
615 627
616=item ev_loop_fork (loop) 628=item ev_loop_fork (loop)
617 629
665prepare and check phases. 677prepare and check phases.
666 678
667=item unsigned int ev_depth (loop) 679=item unsigned int ev_depth (loop)
668 680
669Returns the number of times C<ev_run> was entered minus the number of 681Returns 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. 682times C<ev_run> was exited normally, in other words, the recursion depth.
671 683
672Outside C<ev_run>, this number is zero. In a callback, this number is 684Outside 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), 685C<1>, unless C<ev_run> was invoked recursively (or from another thread),
674in which case it is higher. 686in which case it is higher.
675 687
676Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread 688Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
677etc.), doesn't count as "exit" - consider this as a hint to avoid such 689throwing an exception etc.), doesn't count as "exit" - consider this
678ungentleman-like behaviour unless it's really convenient. 690as a hint to avoid such ungentleman-like behaviour unless it's really
691convenient, in which case it is fully supported.
679 692
680=item unsigned int ev_backend (loop) 693=item unsigned int ev_backend (loop)
681 694
682Returns one of the C<EVBACKEND_*> flags indicating the event backend in 695Returns one of the C<EVBACKEND_*> flags indicating the event backend in
683use. 696use.
744relying on all watchers to be stopped when deciding when a program has 757relying on all watchers to be stopped when deciding when a program has
745finished (especially in interactive programs), but having a program 758finished (especially in interactive programs), but having a program
746that automatically loops as long as it has to and no longer by virtue 759that 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 760of relying on its watchers stopping correctly, that is truly a thing of
748beauty. 761beauty.
762
763This function is also I<mostly> exception-safe - you can break out of
764a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
765exception and so on. This does not decrement the C<ev_depth> value, nor
766will it clear any outstanding C<EVBREAK_ONE> breaks.
749 767
750A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 768A 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 769those 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 770block 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 771iteration 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 833Can 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 834has 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 835C<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. 836C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
819 837
820This "unloop state" will be cleared when entering C<ev_run> again. 838This "break state" will be cleared on the next call to C<ev_run>.
821 839
822It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## 840It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
841which case it will have no effect.
823 842
824=item ev_ref (loop) 843=item ev_ref (loop)
825 844
826=item ev_unref (loop) 845=item ev_unref (loop)
827 846
974 993
975=item ev_userdata (loop) 994=item ev_userdata (loop)
976 995
977Set and retrieve a single C<void *> associated with a loop. When 996Set and retrieve a single C<void *> associated with a loop. When
978C<ev_set_userdata> has never been called, then C<ev_userdata> returns 997C<ev_set_userdata> has never been called, then C<ev_userdata> returns
979C<0.> 998C<0>.
980 999
981These two functions can be used to associate arbitrary data with a loop, 1000These 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 1001and 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 1002C<acquire> callbacks described above, but of course can be (ab-)used for
984any other purpose as well. 1003any other purpose as well.
1114The event loop has been resumed in the child process after fork (see 1133The event loop has been resumed in the child process after fork (see
1115C<ev_fork>). 1134C<ev_fork>).
1116 1135
1117=item C<EV_CLEANUP> 1136=item C<EV_CLEANUP>
1118 1137
1119The event loop is abotu to be destroyed (see C<ev_cleanup>). 1138The event loop is about to be destroyed (see C<ev_cleanup>).
1120 1139
1121=item C<EV_ASYNC> 1140=item C<EV_ASYNC>
1122 1141
1123The given async watcher has been asynchronously notified (see C<ev_async>). 1142The given async watcher has been asynchronously notified (see C<ev_async>).
1124 1143
1146programs, though, as the fd could already be closed and reused for another 1165programs, though, as the fd could already be closed and reused for another
1147thing, so beware. 1166thing, so beware.
1148 1167
1149=back 1168=back
1150 1169
1151=head2 WATCHER STATES
1152
1153There are various watcher states mentioned throughout this manual -
1154active, 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
1156rules might look complicated, they usually do "the right thing".
1157
1158=over 4
1159
1160=item initialiased
1161
1162Before a watcher can be registered with the event looop it has to be
1163initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1164C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1165
1166In this state it is simply some block of memory that is suitable for use
1167in an event loop. It can be moved around, freed, reused etc. at will.
1168
1169=item started/running/active
1170
1171Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1172property of the event loop, and is actively waiting for events. While in
1173this state it cannot be accessed (except in a few documented ways), moved,
1174freed or anything else - the only legal thing is to keep a pointer to it,
1175and call libev functions on it that are documented to work on active watchers.
1176
1177=item pending
1178
1179If a watcher is active and libev determines that an event it is interested
1180in has occurred (such as a timer expiring), it will become pending. It will
1181stay in this pending state until either it is stopped or its callback is
1182about to be invoked, so it is not normally pending inside the watcher
1183callback.
1184
1185The watcher might or might not be active while it is pending (for example,
1186an expired non-repeating timer can be pending but no longer active). If it
1187is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1188but it is still property of the event loop at this time, so cannot be
1189moved, freed or reused. And if it is active the rules described in the
1190previous item still apply.
1191
1192It is also possible to feed an event on a watcher that is not active (e.g.
1193via C<ev_feed_event>), in which case it becomes pending without being
1194active.
1195
1196=item stopped
1197
1198A watcher can be stopped implicitly by libev (in which case it might still
1199be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1200latter will clear any pending state the watcher might be in, regardless
1201of whether it was active or not, so stopping a watcher explicitly before
1202freeing it is often a good idea.
1203
1204While stopped (and not pending) the watcher is essentially in the
1205initialised state, that is it can be reused, moved, modified in any way
1206you wish.
1207
1208=back
1209
1210=head2 GENERIC WATCHER FUNCTIONS 1170=head2 GENERIC WATCHER FUNCTIONS
1211 1171
1212=over 4 1172=over 4
1213 1173
1214=item C<ev_init> (ev_TYPE *watcher, callback) 1174=item C<ev_init> (ev_TYPE *watcher, callback)
1355 1315
1356See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1316See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1357functions that do not need a watcher. 1317functions that do not need a watcher.
1358 1318
1359=back 1319=back
1360
1361 1320
1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1321=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1363 1322
1364Each watcher has, by default, a member C<void *data> that you can change 1323Each 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 1324and read at any time: libev will completely ignore it. This can be used
1421 t2_cb (EV_P_ ev_timer *w, int revents) 1380 t2_cb (EV_P_ ev_timer *w, int revents)
1422 { 1381 {
1423 struct my_biggy big = (struct my_biggy *) 1382 struct my_biggy big = (struct my_biggy *)
1424 (((char *)w) - offsetof (struct my_biggy, t2)); 1383 (((char *)w) - offsetof (struct my_biggy, t2));
1425 } 1384 }
1385
1386=head2 WATCHER STATES
1387
1388There are various watcher states mentioned throughout this manual -
1389active, pending and so on. In this section these states and the rules to
1390transition between them will be described in more detail - and while these
1391rules might look complicated, they usually do "the right thing".
1392
1393=over 4
1394
1395=item initialiased
1396
1397Before a watcher can be registered with the event looop it has to be
1398initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1399C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1400
1401In this state it is simply some block of memory that is suitable for use
1402in an event loop. It can be moved around, freed, reused etc. at will.
1403
1404=item started/running/active
1405
1406Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1407property of the event loop, and is actively waiting for events. While in
1408this state it cannot be accessed (except in a few documented ways), moved,
1409freed or anything else - the only legal thing is to keep a pointer to it,
1410and call libev functions on it that are documented to work on active watchers.
1411
1412=item pending
1413
1414If a watcher is active and libev determines that an event it is interested
1415in has occurred (such as a timer expiring), it will become pending. It will
1416stay in this pending state until either it is stopped or its callback is
1417about to be invoked, so it is not normally pending inside the watcher
1418callback.
1419
1420The watcher might or might not be active while it is pending (for example,
1421an expired non-repeating timer can be pending but no longer active). If it
1422is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1423but it is still property of the event loop at this time, so cannot be
1424moved, freed or reused. And if it is active the rules described in the
1425previous item still apply.
1426
1427It is also possible to feed an event on a watcher that is not active (e.g.
1428via C<ev_feed_event>), in which case it becomes pending without being
1429active.
1430
1431=item stopped
1432
1433A watcher can be stopped implicitly by libev (in which case it might still
1434be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1435latter will clear any pending state the watcher might be in, regardless
1436of whether it was active or not, so stopping a watcher explicitly before
1437freeing it is often a good idea.
1438
1439While stopped (and not pending) the watcher is essentially in the
1440initialised state, that is it can be reused, moved, modified in any way
1441you wish.
1442
1443=back
1426 1444
1427=head2 WATCHER PRIORITY MODELS 1445=head2 WATCHER PRIORITY MODELS
1428 1446
1429Many event loops support I<watcher priorities>, which are usually small 1447Many event loops support I<watcher priorities>, which are usually small
1430integers that influence the ordering of event callback invocation 1448integers that influence the ordering of event callback invocation
2249 2267
2250=head2 C<ev_signal> - signal me when a signal gets signalled! 2268=head2 C<ev_signal> - signal me when a signal gets signalled!
2251 2269
2252Signal watchers will trigger an event when the process receives a specific 2270Signal watchers will trigger an event when the process receives a specific
2253signal one or more times. Even though signals are very asynchronous, libev 2271signal 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 2272will try its best to deliver signals synchronously, i.e. as part of the
2255normal event processing, like any other event. 2273normal event processing, like any other event.
2256 2274
2257If you want signals to be delivered truly asynchronously, just use 2275If you want signals to be delivered truly asynchronously, just use
2258C<sigaction> as you would do without libev and forget about sharing 2276C<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 2277the signal. You can even use C<ev_async> from a signal handler to
3370=item * Priorities are not currently supported. Initialising priorities 3388=item * Priorities are not currently supported. Initialising priorities
3371will fail and all watchers will have the same priority, even though there 3389will fail and all watchers will have the same priority, even though there
3372is an ev_pri field. 3390is an ev_pri field.
3373 3391
3374=item * In libevent, the last base created gets the signals, in libev, the 3392=item * In libevent, the last base created gets the signals, in libev, the
3375first base created (== the default loop) gets the signals. 3393base that registered the signal gets the signals.
3376 3394
3377=item * Other members are not supported. 3395=item * Other members are not supported.
3378 3396
3379=item * The libev emulation is I<not> ABI compatible to libevent, you need 3397=item * The libev emulation is I<not> ABI compatible to libevent, you need
3380to use the libev header file and library. 3398to use the libev header file and library.
4757structure (guaranteed by POSIX but not by ISO C for example), but it also 4775structure (guaranteed by POSIX but not by ISO C for example), but it also
4758assumes that the same (machine) code can be used to call any watcher 4776assumes that the same (machine) code can be used to call any watcher
4759callback: The watcher callbacks have different type signatures, but libev 4777callback: The watcher callbacks have different type signatures, but libev
4760calls them using an C<ev_watcher *> internally. 4778calls them using an C<ev_watcher *> internally.
4761 4779
4780=item pointer accesses must be thread-atomic
4781
4782Accessing a pointer value must be atomic, it must both be readable and
4783writable in one piece - this is the case on all current architectures.
4784
4762=item C<sig_atomic_t volatile> must be thread-atomic as well 4785=item C<sig_atomic_t volatile> must be thread-atomic as well
4763 4786
4764The type C<sig_atomic_t volatile> (or whatever is defined as 4787The type C<sig_atomic_t volatile> (or whatever is defined as
4765C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4788C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4766threads. This is not part of the specification for C<sig_atomic_t>, but is 4789threads. This is not part of the specification for C<sig_atomic_t>, but is
4872=back 4895=back
4873 4896
4874 4897
4875=head1 PORTING FROM LIBEV 3.X TO 4.X 4898=head1 PORTING FROM LIBEV 3.X TO 4.X
4876 4899
4877The major version 4 introduced some minor incompatible changes to the API. 4900The major version 4 introduced some incompatible changes to the API.
4878 4901
4879At the moment, the C<ev.h> header file tries to implement superficial 4902At the moment, the C<ev.h> header file provides compatibility definitions
4880compatibility, so most programs should still compile. Those might be 4903for all changes, so most programs should still compile. The compatibility
4881removed in later versions of libev, so better update early than late. 4904layer might be removed in later versions of libev, so better update to the
4905new API early than late.
4882 4906
4883=over 4 4907=over 4
4908
4909=item C<EV_COMPAT3> backwards compatibility mechanism
4910
4911The backward compatibility mechanism can be controlled by
4912C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4913section.
4884 4914
4885=item C<ev_default_destroy> and C<ev_default_fork> have been removed 4915=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4886 4916
4887These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 4917These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4888 4918
4914ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 4944ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4915as all other watcher types. Note that C<ev_loop_fork> is still called 4945as all other watcher types. Note that C<ev_loop_fork> is still called
4916C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> 4946C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4917typedef. 4947typedef.
4918 4948
4919=item C<EV_COMPAT3> backwards compatibility mechanism
4920
4921The backward compatibility mechanism can be controlled by
4922C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4923section.
4924
4925=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 4949=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4926 4950
4927The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 4951The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4928mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 4952mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4929and work, but the library code will of course be larger. 4953and work, but the library code will of course be larger.
5003 5027
5004=back 5028=back
5005 5029
5006=head1 AUTHOR 5030=head1 AUTHOR
5007 5031
5008Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5032Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5033Magnusson and Emanuele Giaquinta.
5009 5034

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines