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.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
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 requiring additional iterations and so
468so 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
469I<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
470take considerable time (one syscall per file descriptor) and is of course 472take considerable time (one syscall per file descriptor) and is of course
471hard to detect. 473hard to detect.
472 474
473Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 475Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
589Example: Try to create a event loop that uses epoll and nothing else. 591Example: Try to create a event loop that uses epoll and nothing else.
590 592
591 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 593 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
592 if (!epoller) 594 if (!epoller)
593 fatal ("no epoll found here, maybe it hides under your chair"); 595 fatal ("no epoll found here, maybe it hides under your chair");
596
597Example: Use whatever libev has to offer, but make sure that kqueue is
598used if available.
599
600 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
594 601
595=item ev_loop_destroy (loop) 602=item ev_loop_destroy (loop)
596 603
597Destroys an event loop object (frees all memory and kernel state 604Destroys an event loop object (frees all memory and kernel state
598etc.). None of the active event watchers will be stopped in the normal 605etc.). 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 824Can 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 825has 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 826C<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. 827C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
821 828
822This "unloop state" will be cleared when entering C<ev_run> again. 829This "break state" will be cleared when entering C<ev_run> again.
823 830
824It 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.
825 832
826=item ev_ref (loop) 833=item ev_ref (loop)
827 834
828=item ev_unref (loop) 835=item ev_unref (loop)
829 836
1114=item C<EV_FORK> 1121=item C<EV_FORK>
1115 1122
1116The 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
1117C<ev_fork>). 1124C<ev_fork>).
1118 1125
1126=item C<EV_CLEANUP>
1127
1128The event loop is about to be destroyed (see C<ev_cleanup>).
1129
1119=item C<EV_ASYNC> 1130=item C<EV_ASYNC>
1120 1131
1121The given async watcher has been asynchronously notified (see C<ev_async>). 1132The given async watcher has been asynchronously notified (see C<ev_async>).
1122 1133
1123=item C<EV_CUSTOM> 1134=item C<EV_CUSTOM>
1144programs, 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
1145thing, so beware. 1156thing, so beware.
1146 1157
1147=back 1158=back
1148 1159
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 1160=head2 GENERIC WATCHER FUNCTIONS
1209 1161
1210=over 4 1162=over 4
1211 1163
1212=item C<ev_init> (ev_TYPE *watcher, callback) 1164=item C<ev_init> (ev_TYPE *watcher, callback)
1353 1305
1354See 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
1355functions that do not need a watcher. 1307functions that do not need a watcher.
1356 1308
1357=back 1309=back
1358
1359 1310
1360=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1311=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1361 1312
1362Each 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
1363and 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
1419 t2_cb (EV_P_ ev_timer *w, int revents) 1370 t2_cb (EV_P_ ev_timer *w, int revents)
1420 { 1371 {
1421 struct my_biggy big = (struct my_biggy *) 1372 struct my_biggy big = (struct my_biggy *)
1422 (((char *)w) - offsetof (struct my_biggy, t2)); 1373 (((char *)w) - offsetof (struct my_biggy, t2));
1423 } 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
1424 1434
1425=head2 WATCHER PRIORITY MODELS 1435=head2 WATCHER PRIORITY MODELS
1426 1436
1427Many event loops support I<watcher priorities>, which are usually small 1437Many event loops support I<watcher priorities>, which are usually small
1428integers that influence the ordering of event callback invocation 1438integers that influence the ordering of event callback invocation
3092 3102
3093=head3 Watcher-Specific Functions and Data Members 3103=head3 Watcher-Specific Functions and Data Members
3094 3104
3095=over 4 3105=over 4
3096 3106
3097=item ev_fork_init (ev_signal *, callback) 3107=item ev_fork_init (ev_fork *, callback)
3098 3108
3099Initialises and configures the fork watcher - it has no parameters of any 3109Initialises 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, 3110kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3101believe me. 3111really.
3102 3112
3103=back 3113=back
3114
3115
3116=head2 C<ev_cleanup> - even the best things end
3117
3118Cleanup watchers are called just before the event loop is being destroyed
3119by a call to C<ev_loop_destroy>.
3120
3121While there is no guarantee that the event loop gets destroyed, cleanup
3122watchers provide a convenient method to install cleanup hooks for your
3123program, worker threads and so on - you just to make sure to destroy the
3124loop when you want them to be invoked.
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
3131=head3 Watcher-Specific Functions and Data Members
3132
3133=over 4
3134
3135=item ev_cleanup_init (ev_cleanup *, callback)
3136
3137Initialises and configures the cleanup watcher - it has no parameters of
3138any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3139pointless, I assure you.
3140
3141=back
3142
3143Example: Register an atexit handler to destroy the default loop, so any
3144cleanup functions are called.
3145
3146 static void
3147 program_exits (void)
3148 {
3149 ev_loop_destroy (EV_DEFAULT_UC);
3150 }
3151
3152 ...
3153 atexit (program_exits);
3104 3154
3105 3155
3106=head2 C<ev_async> - how to wake up an event loop 3156=head2 C<ev_async> - how to wake up an event loop
3107 3157
3108In general, you cannot use an C<ev_run> from multiple threads or other 3158In 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 4765structure (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 4766assumes that the same (machine) code can be used to call any watcher
4717callback: The watcher callbacks have different type signatures, but libev 4767callback: The watcher callbacks have different type signatures, but libev
4718calls them using an C<ev_watcher *> internally. 4768calls them using an C<ev_watcher *> internally.
4719 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
4720=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
4721 4776
4722The type C<sig_atomic_t volatile> (or whatever is defined as 4777The type C<sig_atomic_t volatile> (or whatever is defined as
4723C<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
4724threads. 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
4830=back 4885=back
4831 4886
4832 4887
4833=head1 PORTING FROM LIBEV 3.X TO 4.X 4888=head1 PORTING FROM LIBEV 3.X TO 4.X
4834 4889
4835The major version 4 introduced some minor incompatible changes to the API. 4890The major version 4 introduced some incompatible changes to the API.
4836 4891
4837At the moment, the C<ev.h> header file tries to implement superficial 4892At the moment, the C<ev.h> header file provides compatibility definitions
4838compatibility, so most programs should still compile. Those might be 4893for all changes, so most programs should still compile. The compatibility
4839removed 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.
4840 4896
4841=over 4 4897=over 4
4842 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
4843=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
4844 4906
4845These 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:
4846 4908
4847 ev_loop_destroy (EV_DEFAULT); 4909 ev_loop_destroy (EV_DEFAULT_UC);
4848 ev_loop_fork (EV_DEFAULT); 4910 ev_loop_fork (EV_DEFAULT);
4849 4911
4850=item function/symbol renames 4912=item function/symbol renames
4851 4913
4852A number of functions and symbols have been renamed: 4914A number of functions and symbols have been renamed:
4872ev_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
4873as 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
4874C<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>
4875typedef. 4937typedef.
4876 4938
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> 4939=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4884 4940
4885The preprocessor symbol C<EV_MINIMAL> has been replaced by a different 4941The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4886mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile 4942mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4887and work, but the library code will of course be larger. 4943and work, but the library code will of course be larger.
4961 5017
4962=back 5018=back
4963 5019
4964=head1 AUTHOR 5020=head1 AUTHOR
4965 5021
4966Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5022Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5023Magnusson and Emanuele Giaquinta.
4967 5024

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines