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

Comparing libev/ev.pod (file contents):
Revision 1.324 by root, Sun Oct 24 19:38:20 2010 UTC vs.
Revision 1.337 by root, Sun Oct 31 20:20:20 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
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
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 requiring additional iterations and so
461so on. The biggest issue is fork races, however - if a program forks then 470on. The biggest issue is fork races, however - if a program forks then
462I<both> parent and child process have to recreate the epoll set, which can 471I<both> parent and child process have to recreate the epoll set, which can
463take considerable time (one syscall per file descriptor) and is of course 472take considerable time (one syscall per file descriptor) and is of course
464hard to detect. 473hard to detect.
465 474
466Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 475Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
815Can be used to make a call to C<ev_run> return early (but only after it 824Can 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 825has 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 826C<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. 827C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
819 828
820This "unloop state" will be cleared when entering C<ev_run> again. 829This "break state" will be cleared when entering C<ev_run> again.
821 830
822It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## 831It is safe to call C<ev_break> from outside any C<ev_run> calls, too.
823 832
824=item ev_ref (loop) 833=item ev_ref (loop)
825 834
826=item ev_unref (loop) 835=item ev_unref (loop)
827 836
1114The event loop has been resumed in the child process after fork (see 1123The event loop has been resumed in the child process after fork (see
1115C<ev_fork>). 1124C<ev_fork>).
1116 1125
1117=item C<EV_CLEANUP> 1126=item C<EV_CLEANUP>
1118 1127
1119The event loop is abotu to be destroyed (see C<ev_cleanup>). 1128The event loop is about to be destroyed (see C<ev_cleanup>).
1120 1129
1121=item C<EV_ASYNC> 1130=item C<EV_ASYNC>
1122 1131
1123The given async watcher has been asynchronously notified (see C<ev_async>). 1132The given async watcher has been asynchronously notified (see C<ev_async>).
1124 1133
1146programs, though, as the fd could already be closed and reused for another 1155programs, though, as the fd could already be closed and reused for another
1147thing, so beware. 1156thing, so beware.
1148 1157
1149=back 1158=back
1150 1159
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 1160=head2 GENERIC WATCHER FUNCTIONS
1211 1161
1212=over 4 1162=over 4
1213 1163
1214=item C<ev_init> (ev_TYPE *watcher, callback) 1164=item C<ev_init> (ev_TYPE *watcher, callback)
1355 1305
1356See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1306See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1357functions that do not need a watcher. 1307functions that do not need a watcher.
1358 1308
1359=back 1309=back
1360
1361 1310
1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1311=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1363 1312
1364Each watcher has, by default, a member C<void *data> that you can change 1313Each 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 1314and read at any time: libev will completely ignore it. This can be used
1421 t2_cb (EV_P_ ev_timer *w, int revents) 1370 t2_cb (EV_P_ ev_timer *w, int revents)
1422 { 1371 {
1423 struct my_biggy big = (struct my_biggy *) 1372 struct my_biggy big = (struct my_biggy *)
1424 (((char *)w) - offsetof (struct my_biggy, t2)); 1373 (((char *)w) - offsetof (struct my_biggy, t2));
1425 } 1374 }
1375
1376=head2 WATCHER STATES
1377
1378There are various watcher states mentioned throughout this manual -
1379active, pending and so on. In this section these states and the rules to
1380transition between them will be described in more detail - and while these
1381rules might look complicated, they usually do "the right thing".
1382
1383=over 4
1384
1385=item initialiased
1386
1387Before a watcher can be registered with the event looop it has to be
1388initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1389C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1390
1391In this state it is simply some block of memory that is suitable for use
1392in an event loop. It can be moved around, freed, reused etc. at will.
1393
1394=item started/running/active
1395
1396Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1397property of the event loop, and is actively waiting for events. While in
1398this state it cannot be accessed (except in a few documented ways), moved,
1399freed or anything else - the only legal thing is to keep a pointer to it,
1400and call libev functions on it that are documented to work on active watchers.
1401
1402=item pending
1403
1404If a watcher is active and libev determines that an event it is interested
1405in has occurred (such as a timer expiring), it will become pending. It will
1406stay in this pending state until either it is stopped or its callback is
1407about to be invoked, so it is not normally pending inside the watcher
1408callback.
1409
1410The watcher might or might not be active while it is pending (for example,
1411an expired non-repeating timer can be pending but no longer active). If it
1412is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1413but it is still property of the event loop at this time, so cannot be
1414moved, freed or reused. And if it is active the rules described in the
1415previous item still apply.
1416
1417It is also possible to feed an event on a watcher that is not active (e.g.
1418via C<ev_feed_event>), in which case it becomes pending without being
1419active.
1420
1421=item stopped
1422
1423A watcher can be stopped implicitly by libev (in which case it might still
1424be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1425latter will clear any pending state the watcher might be in, regardless
1426of whether it was active or not, so stopping a watcher explicitly before
1427freeing it is often a good idea.
1428
1429While stopped (and not pending) the watcher is essentially in the
1430initialised state, that is it can be reused, moved, modified in any way
1431you wish.
1432
1433=back
1426 1434
1427=head2 WATCHER PRIORITY MODELS 1435=head2 WATCHER PRIORITY MODELS
1428 1436
1429Many event loops support I<watcher priorities>, which are usually small 1437Many event loops support I<watcher priorities>, which are usually small
1430integers that influence the ordering of event callback invocation 1438integers that influence the ordering of event callback invocation
3094 3102
3095=head3 Watcher-Specific Functions and Data Members 3103=head3 Watcher-Specific Functions and Data Members
3096 3104
3097=over 4 3105=over 4
3098 3106
3099=item ev_fork_init (ev_signal *, callback) 3107=item ev_fork_init (ev_fork *, callback)
3100 3108
3101Initialises and configures the fork watcher - it has no parameters of any 3109Initialises 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, 3110kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3103believe me. 3111really.
3104 3112
3105=back 3113=back
3106 3114
3107 3115
3108=head2 C<ev_cleanup> - even the best things end 3116=head2 C<ev_cleanup> - even the best things end
3109 3117
3110Cleanup watchers are called just before the event loop they are registered 3118Cleanup watchers are called just before the event loop is being destroyed
3111with is being destroyed. 3119by a call to C<ev_loop_destroy>.
3112 3120
3113While there is no guarantee that the event loop gets destroyed, cleanup 3121While there is no guarantee that the event loop gets destroyed, cleanup
3114watchers provide a convenient method to install cleanup watchers for your 3122watchers provide a convenient method to install cleanup hooks for your
3115program, worker threads and so on - you just to make sure to destroy the 3123program, worker threads and so on - you just to make sure to destroy the
3116loop when you want them to be invoked. 3124loop when you want them to be invoked.
3117 3125
3126Cleanup watchers are invoked in the same way as any other watcher. Unlike
3127all other watchers, they do not keep a reference to the event loop (which
3128makes a lot of sense if you think about it). Like all other watchers, you
3129can call libev functions in the callback, except C<ev_cleanup_start>.
3130
3118=head3 Watcher-Specific Functions and Data Members 3131=head3 Watcher-Specific Functions and Data Members
3119 3132
3120=over 4 3133=over 4
3121 3134
3122=item ev_cleanup_init (ev_signal *, callback) 3135=item ev_cleanup_init (ev_cleanup *, callback)
3123 3136
3124Initialises and configures the cleanup watcher - it has no parameters of 3137Initialises 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 3138any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3126pointless, believe me. 3139pointless, I assure you.
3127 3140
3128=back 3141=back
3129 3142
3130Example: Register an atexit handler to destroy the default loop, so any 3143Example: Register an atexit handler to destroy the default loop, so any
3131cleanup functions are called. 3144cleanup functions are called.
4752structure (guaranteed by POSIX but not by ISO C for example), but it also 4765structure (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 4766assumes that the same (machine) code can be used to call any watcher
4754callback: The watcher callbacks have different type signatures, but libev 4767callback: The watcher callbacks have different type signatures, but libev
4755calls them using an C<ev_watcher *> internally. 4768calls them using an C<ev_watcher *> internally.
4756 4769
4770=item pointer accesses must be thread-atomic
4771
4772Accessing a pointer value must be atomic, it must both be readable and
4773writable in one piece - this is the case on all current architectures.
4774
4757=item C<sig_atomic_t volatile> must be thread-atomic as well 4775=item C<sig_atomic_t volatile> must be thread-atomic as well
4758 4776
4759The type C<sig_atomic_t volatile> (or whatever is defined as 4777The type C<sig_atomic_t volatile> (or whatever is defined as
4760C<EV_ATOMIC_T>) must be atomic with respect to accesses from different 4778C<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 4779threads. This is not part of the specification for C<sig_atomic_t>, but is
4867=back 4885=back
4868 4886
4869 4887
4870=head1 PORTING FROM LIBEV 3.X TO 4.X 4888=head1 PORTING FROM LIBEV 3.X TO 4.X
4871 4889
4872The major version 4 introduced some minor incompatible changes to the API. 4890The major version 4 introduced some incompatible changes to the API.
4873 4891
4874At the moment, the C<ev.h> header file tries to implement superficial 4892At the moment, the C<ev.h> header file provides compatibility definitions
4875compatibility, so most programs should still compile. Those might be 4893for all changes, so most programs should still compile. The compatibility
4876removed in later versions of libev, so better update early than late. 4894layer might be removed in later versions of libev, so better update to the
4895new API early than late.
4877 4896
4878=over 4 4897=over 4
4879 4898
4899=item C<EV_COMPAT3> backwards compatibility mechanism
4900
4901The backward compatibility mechanism can be controlled by
4902C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4903section.
4904
4880=item C<ev_default_destroy> and C<ev_default_fork> have been removed 4905=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4881 4906
4882These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 4907These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4883 4908
4884 ev_loop_destroy (EV_DEFAULT); 4909 ev_loop_destroy (EV_DEFAULT_UC);
4885 ev_loop_fork (EV_DEFAULT); 4910 ev_loop_fork (EV_DEFAULT);
4886 4911
4887=item function/symbol renames 4912=item function/symbol renames
4888 4913
4889A number of functions and symbols have been renamed: 4914A number of functions and symbols have been renamed:
4909ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme 4934ev_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 4935as 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> 4936C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4912typedef. 4937typedef.
4913 4938
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> 4939=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4921 4940
4922The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 4941The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4923mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 4942mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4924and work, but the library code will of course be larger. 4943and work, but the library code will of course be larger.
4998 5017
4999=back 5018=back
5000 5019
5001=head1 AUTHOR 5020=head1 AUTHOR
5002 5021
5003Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5022Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5023Magnusson and Emanuele Giaquinta.
5004 5024

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines