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

Comparing libev/ev.pod (file contents):
Revision 1.322 by root, Sun Oct 24 17:58:41 2010 UTC vs.
Revision 1.339 by root, Sun Oct 31 22:19:38 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
341 349
342Example: Restrict libev to the select and poll backends, and do not allow 350Example: Restrict libev to the select and poll backends, and do not allow
343environment settings to be taken into account: 351environment settings to be taken into account:
344 352
345 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV); 353 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
346
347Example: Use whatever libev has to offer, but make sure that kqueue is
348used if available (warning, breaks stuff, best use only with your own
349private event loop and only if you know the OS supports your types of
350fds):
351
352 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
353 354
354=item struct ev_loop *ev_loop_new (unsigned int flags) 355=item struct ev_loop *ev_loop_new (unsigned int flags)
355 356
356This 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
357could not be initialised, returns false. 358could not be initialised, returns false.
462epoll scales either O(1) or O(active_fds). 463epoll scales either O(1) or O(active_fds).
463 464
464The epoll mechanism deserves honorable mention as the most misdesigned 465The epoll mechanism deserves honorable mention as the most misdesigned
465of the more advanced event mechanisms: mere annoyances include silently 466of the more advanced event mechanisms: mere annoyances include silently
466dropping file descriptors, requiring a system call per change per file 467dropping file descriptors, requiring a system call per change per file
467descriptor (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
468so 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
469I<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
470take considerable time (one syscall per file descriptor) and is of course 473set, which can take considerable time (one syscall per file descriptor)
471hard to detect. 474and is of course hard to detect.
472 475
473Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 476Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
474of 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
475I<different> file descriptors (even already closed ones, so one cannot 478I<different> file descriptors (even already closed ones, so one cannot
476even remove them from the set) than registered in the set (especially 479even remove them from the set) than registered in the set (especially
478employing an additional generation counter and comparing that against the 481employing an additional generation counter and comparing that against the
479events to filter out spurious ones, recreating the set when required. Last 482events to filter out spurious ones, recreating the set when required. Last
480not 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
481perfectly fine with C<select> (files, many character devices...). 484perfectly fine with C<select> (files, many character devices...).
482 485
486Epoll is truly the train wreck analog among event poll mechanisms.
487
483While 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
484will 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
485incident (because the same I<file descriptor> could point to a different 490incident (because the same I<file descriptor> could point to a different
486I<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
487file 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
589Example: Try to create a event loop that uses epoll and nothing else. 594Example: Try to create a event loop that uses epoll and nothing else.
590 595
591 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 596 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
592 if (!epoller) 597 if (!epoller)
593 fatal ("no epoll found here, maybe it hides under your chair"); 598 fatal ("no epoll found here, maybe it hides under your chair");
599
600Example: Use whatever libev has to offer, but make sure that kqueue is
601used if available.
602
603 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
594 604
595=item ev_loop_destroy (loop) 605=item ev_loop_destroy (loop)
596 606
597Destroys an event loop object (frees all memory and kernel state 607Destroys an event loop object (frees all memory and kernel state
598etc.). None of the active event watchers will be stopped in the normal 608etc.). None of the active event watchers will be stopped in the normal
817Can be used to make a call to C<ev_run> return early (but only after it 827Can be used to make a call to C<ev_run> return early (but only after it
818has processed all outstanding events). The C<how> argument must be either 828has processed all outstanding events). The C<how> argument must be either
819C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or 829C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
820C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return. 830C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
821 831
822This "unloop state" will be cleared when entering C<ev_run> again. 832This "break state" will be cleared when entering C<ev_run> again.
823 833
824It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## 834It is safe to call C<ev_break> from outside any C<ev_run> calls, too.
825 835
826=item ev_ref (loop) 836=item ev_ref (loop)
827 837
828=item ev_unref (loop) 838=item ev_unref (loop)
829 839
1114=item C<EV_FORK> 1124=item C<EV_FORK>
1115 1125
1116The event loop has been resumed in the child process after fork (see 1126The event loop has been resumed in the child process after fork (see
1117C<ev_fork>). 1127C<ev_fork>).
1118 1128
1129=item C<EV_CLEANUP>
1130
1131The event loop is about to be destroyed (see C<ev_cleanup>).
1132
1119=item C<EV_ASYNC> 1133=item C<EV_ASYNC>
1120 1134
1121The given async watcher has been asynchronously notified (see C<ev_async>). 1135The given async watcher has been asynchronously notified (see C<ev_async>).
1122 1136
1123=item C<EV_CUSTOM> 1137=item C<EV_CUSTOM>
1144programs, though, as the fd could already be closed and reused for another 1158programs, though, as the fd could already be closed and reused for another
1145thing, so beware. 1159thing, so beware.
1146 1160
1147=back 1161=back
1148 1162
1149=head2 WATCHER STATES
1150
1151There are various watcher states mentioned throughout this manual -
1152active, pending and so on. In this section these states and the rules to
1153transition between them will be described in more detail - and while these
1154rules might look complicated, they usually do "the right thing".
1155
1156=over 4
1157
1158=item initialiased
1159
1160Before a watcher can be registered with the event looop it has to be
1161initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1162C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1163
1164In this state it is simply some block of memory that is suitable for use
1165in an event loop. It can be moved around, freed, reused etc. at will.
1166
1167=item started/running/active
1168
1169Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1170property of the event loop, and is actively waiting for events. While in
1171this state it cannot be accessed (except in a few documented ways), moved,
1172freed or anything else - the only legal thing is to keep a pointer to it,
1173and call libev functions on it that are documented to work on active watchers.
1174
1175=item pending
1176
1177If a watcher is active and libev determines that an event it is interested
1178in has occurred (such as a timer expiring), it will become pending. It will
1179stay in this pending state until either it is stopped or its callback is
1180about to be invoked, so it is not normally pending inside the watcher
1181callback.
1182
1183The watcher might or might not be active while it is pending (for example,
1184an expired non-repeating timer can be pending but no longer active). If it
1185is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1186but it is still property of the event loop at this time, so cannot be
1187moved, freed or reused. And if it is active the rules described in the
1188previous item still apply.
1189
1190It is also possible to feed an event on a watcher that is not active (e.g.
1191via C<ev_feed_event>), in which case it becomes pending without being
1192active.
1193
1194=item stopped
1195
1196A watcher can be stopped implicitly by libev (in which case it might still
1197be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1198latter will clear any pending state the watcher might be in, regardless
1199of whether it was active or not, so stopping a watcher explicitly before
1200freeing it is often a good idea.
1201
1202While stopped (and not pending) the watcher is essentially in the
1203initialised state, that is it can be reused, moved, modified in any way
1204you wish.
1205
1206=back
1207
1208=head2 GENERIC WATCHER FUNCTIONS 1163=head2 GENERIC WATCHER FUNCTIONS
1209 1164
1210=over 4 1165=over 4
1211 1166
1212=item C<ev_init> (ev_TYPE *watcher, callback) 1167=item C<ev_init> (ev_TYPE *watcher, callback)
1353 1308
1354See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1309See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1355functions that do not need a watcher. 1310functions that do not need a watcher.
1356 1311
1357=back 1312=back
1358
1359 1313
1360=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1314=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1361 1315
1362Each watcher has, by default, a member C<void *data> that you can change 1316Each watcher has, by default, a member C<void *data> that you can change
1363and read at any time: libev will completely ignore it. This can be used 1317and read at any time: libev will completely ignore it. This can be used
1419 t2_cb (EV_P_ ev_timer *w, int revents) 1373 t2_cb (EV_P_ ev_timer *w, int revents)
1420 { 1374 {
1421 struct my_biggy big = (struct my_biggy *) 1375 struct my_biggy big = (struct my_biggy *)
1422 (((char *)w) - offsetof (struct my_biggy, t2)); 1376 (((char *)w) - offsetof (struct my_biggy, t2));
1423 } 1377 }
1378
1379=head2 WATCHER STATES
1380
1381There are various watcher states mentioned throughout this manual -
1382active, pending and so on. In this section these states and the rules to
1383transition between them will be described in more detail - and while these
1384rules might look complicated, they usually do "the right thing".
1385
1386=over 4
1387
1388=item initialiased
1389
1390Before a watcher can be registered with the event looop it has to be
1391initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1392C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1393
1394In this state it is simply some block of memory that is suitable for use
1395in an event loop. It can be moved around, freed, reused etc. at will.
1396
1397=item started/running/active
1398
1399Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1400property of the event loop, and is actively waiting for events. While in
1401this state it cannot be accessed (except in a few documented ways), moved,
1402freed or anything else - the only legal thing is to keep a pointer to it,
1403and call libev functions on it that are documented to work on active watchers.
1404
1405=item pending
1406
1407If a watcher is active and libev determines that an event it is interested
1408in has occurred (such as a timer expiring), it will become pending. It will
1409stay in this pending state until either it is stopped or its callback is
1410about to be invoked, so it is not normally pending inside the watcher
1411callback.
1412
1413The watcher might or might not be active while it is pending (for example,
1414an expired non-repeating timer can be pending but no longer active). If it
1415is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1416but it is still property of the event loop at this time, so cannot be
1417moved, freed or reused. And if it is active the rules described in the
1418previous item still apply.
1419
1420It is also possible to feed an event on a watcher that is not active (e.g.
1421via C<ev_feed_event>), in which case it becomes pending without being
1422active.
1423
1424=item stopped
1425
1426A watcher can be stopped implicitly by libev (in which case it might still
1427be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1428latter will clear any pending state the watcher might be in, regardless
1429of whether it was active or not, so stopping a watcher explicitly before
1430freeing it is often a good idea.
1431
1432While stopped (and not pending) the watcher is essentially in the
1433initialised state, that is it can be reused, moved, modified in any way
1434you wish.
1435
1436=back
1424 1437
1425=head2 WATCHER PRIORITY MODELS 1438=head2 WATCHER PRIORITY MODELS
1426 1439
1427Many event loops support I<watcher priorities>, which are usually small 1440Many event loops support I<watcher priorities>, which are usually small
1428integers that influence the ordering of event callback invocation 1441integers that influence the ordering of event callback invocation
3092 3105
3093=head3 Watcher-Specific Functions and Data Members 3106=head3 Watcher-Specific Functions and Data Members
3094 3107
3095=over 4 3108=over 4
3096 3109
3097=item ev_fork_init (ev_signal *, callback) 3110=item ev_fork_init (ev_fork *, callback)
3098 3111
3099Initialises and configures the fork watcher - it has no parameters of any 3112Initialises and configures the fork watcher - it has no parameters of any
3100kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 3113kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3101believe me. 3114really.
3102 3115
3103=back 3116=back
3117
3118
3119=head2 C<ev_cleanup> - even the best things end
3120
3121Cleanup watchers are called just before the event loop is being destroyed
3122by a call to C<ev_loop_destroy>.
3123
3124While there is no guarantee that the event loop gets destroyed, cleanup
3125watchers provide a convenient method to install cleanup hooks for your
3126program, worker threads and so on - you just to make sure to destroy the
3127loop when you want them to be invoked.
3128
3129Cleanup watchers are invoked in the same way as any other watcher. Unlike
3130all other watchers, they do not keep a reference to the event loop (which
3131makes a lot of sense if you think about it). Like all other watchers, you
3132can call libev functions in the callback, except C<ev_cleanup_start>.
3133
3134=head3 Watcher-Specific Functions and Data Members
3135
3136=over 4
3137
3138=item ev_cleanup_init (ev_cleanup *, callback)
3139
3140Initialises and configures the cleanup watcher - it has no parameters of
3141any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3142pointless, I assure you.
3143
3144=back
3145
3146Example: Register an atexit handler to destroy the default loop, so any
3147cleanup functions are called.
3148
3149 static void
3150 program_exits (void)
3151 {
3152 ev_loop_destroy (EV_DEFAULT_UC);
3153 }
3154
3155 ...
3156 atexit (program_exits);
3104 3157
3105 3158
3106=head2 C<ev_async> - how to wake up an event loop 3159=head2 C<ev_async> - how to wake up an event loop
3107 3160
3108In general, you cannot use an C<ev_run> from multiple threads or other 3161In general, you cannot use an C<ev_run> from multiple threads or other
4715structure (guaranteed by POSIX but not by ISO C for example), but it also 4768structure (guaranteed by POSIX but not by ISO C for example), but it also
4716assumes that the same (machine) code can be used to call any watcher 4769assumes that the same (machine) code can be used to call any watcher
4717callback: The watcher callbacks have different type signatures, but libev 4770callback: The watcher callbacks have different type signatures, but libev
4718calls them using an C<ev_watcher *> internally. 4771calls them using an C<ev_watcher *> internally.
4719 4772
4773=item pointer accesses must be thread-atomic
4774
4775Accessing a pointer value must be atomic, it must both be readable and
4776writable in one piece - this is the case on all current architectures.
4777
4720=item C<sig_atomic_t volatile> must be thread-atomic as well 4778=item C<sig_atomic_t volatile> must be thread-atomic as well
4721 4779
4722The type C<sig_atomic_t volatile> (or whatever is defined as 4780The type C<sig_atomic_t volatile> (or whatever is defined as
4723C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4781C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4724threads. This is not part of the specification for C<sig_atomic_t>, but is 4782threads. This is not part of the specification for C<sig_atomic_t>, but is
4830=back 4888=back
4831 4889
4832 4890
4833=head1 PORTING FROM LIBEV 3.X TO 4.X 4891=head1 PORTING FROM LIBEV 3.X TO 4.X
4834 4892
4835The major version 4 introduced some minor incompatible changes to the API. 4893The major version 4 introduced some incompatible changes to the API.
4836 4894
4837At the moment, the C<ev.h> header file tries to implement superficial 4895At the moment, the C<ev.h> header file provides compatibility definitions
4838compatibility, so most programs should still compile. Those might be 4896for all changes, so most programs should still compile. The compatibility
4839removed in later versions of libev, so better update early than late. 4897layer might be removed in later versions of libev, so better update to the
4898new API early than late.
4840 4899
4841=over 4 4900=over 4
4842 4901
4902=item C<EV_COMPAT3> backwards compatibility mechanism
4903
4904The backward compatibility mechanism can be controlled by
4905C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4906section.
4907
4843=item C<ev_default_destroy> and C<ev_default_fork> have been removed 4908=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4844 4909
4845These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 4910These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4846 4911
4847 ev_loop_destroy (EV_DEFAULT); 4912 ev_loop_destroy (EV_DEFAULT_UC);
4848 ev_loop_fork (EV_DEFAULT); 4913 ev_loop_fork (EV_DEFAULT);
4849 4914
4850=item function/symbol renames 4915=item function/symbol renames
4851 4916
4852A number of functions and symbols have been renamed: 4917A number of functions and symbols have been renamed:
4872ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 4937ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4873as all other watcher types. Note that C<ev_loop_fork> is still called 4938as all other watcher types. Note that C<ev_loop_fork> is still called
4874C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> 4939C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4875typedef. 4940typedef.
4876 4941
4877=item C<EV_COMPAT3> backwards compatibility mechanism
4878
4879The backward compatibility mechanism can be controlled by
4880C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4881section.
4882
4883=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> 4942=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4884 4943
4885The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 4944The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4886mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 4945mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4887and work, but the library code will of course be larger. 4946and work, but the library code will of course be larger.
4961 5020
4962=back 5021=back
4963 5022
4964=head1 AUTHOR 5023=head1 AUTHOR
4965 5024
4966Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5025Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5026Magnusson and Emanuele Giaquinta.
4967 5027

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines