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

Comparing libev/ev.pod (file contents):
Revision 1.332 by root, Sun Oct 24 23:30:23 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
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
470on SMP systems). Libev tries to counter these spurious notifications by 480on SMP systems). Libev tries to counter these spurious notifications by
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...).
485
486Epoll is truly the train wreck analog among event poll mechanisms.
475 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
815Can 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
816has processed all outstanding events). The C<how> argument must be either 828has 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 829C<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. 830C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
819 831
820This "unloop state" will be cleared when entering C<ev_run> again. 832This "break state" will be cleared when entering C<ev_run> again.
821 833
822It 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.
823 835
824=item ev_ref (loop) 836=item ev_ref (loop)
825 837
826=item ev_unref (loop) 838=item ev_unref (loop)
827 839
1146programs, 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
1147thing, so beware. 1159thing, so beware.
1148 1160
1149=back 1161=back
1150 1162
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 1163=head2 GENERIC WATCHER FUNCTIONS
1211 1164
1212=over 4 1165=over 4
1213 1166
1214=item C<ev_init> (ev_TYPE *watcher, callback) 1167=item C<ev_init> (ev_TYPE *watcher, callback)
1355 1308
1356See 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
1357functions that do not need a watcher. 1310functions that do not need a watcher.
1358 1311
1359=back 1312=back
1360
1361 1313
1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1314=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1363 1315
1364Each 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
1365and 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
1421 t2_cb (EV_P_ ev_timer *w, int revents) 1373 t2_cb (EV_P_ ev_timer *w, int revents)
1422 { 1374 {
1423 struct my_biggy big = (struct my_biggy *) 1375 struct my_biggy big = (struct my_biggy *)
1424 (((char *)w) - offsetof (struct my_biggy, t2)); 1376 (((char *)w) - offsetof (struct my_biggy, t2));
1425 } 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
1426 1437
1427=head2 WATCHER PRIORITY MODELS 1438=head2 WATCHER PRIORITY MODELS
1428 1439
1429Many event loops support I<watcher priorities>, which are usually small 1440Many event loops support I<watcher priorities>, which are usually small
1430integers that influence the ordering of event callback invocation 1441integers that influence the ordering of event callback invocation
4757structure (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
4758assumes 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
4759callback: The watcher callbacks have different type signatures, but libev 4770callback: The watcher callbacks have different type signatures, but libev
4760calls them using an C<ev_watcher *> internally. 4771calls them using an C<ev_watcher *> internally.
4761 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
4762=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
4763 4779
4764The type C<sig_atomic_t volatile> (or whatever is defined as 4780The type C<sig_atomic_t volatile> (or whatever is defined as
4765C<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
4766threads. 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
5004 5020
5005=back 5021=back
5006 5022
5007=head1 AUTHOR 5023=head1 AUTHOR
5008 5024
5009Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5025Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5026Magnusson and Emanuele Giaquinta.
5010 5027

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines