… | |
… | |
1625 | |
1625 | |
1626 | =back |
1626 | =back |
1627 | |
1627 | |
1628 | =head3 Examples |
1628 | =head3 Examples |
1629 | |
1629 | |
1630 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
1630 | Example: Try to exit cleanly on SIGINT. |
1631 | |
1631 | |
1632 | static void |
1632 | static void |
1633 | sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) |
1633 | sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) |
1634 | { |
1634 | { |
1635 | ev_unloop (loop, EVUNLOOP_ALL); |
1635 | ev_unloop (loop, EVUNLOOP_ALL); |
1636 | } |
1636 | } |
1637 | |
1637 | |
1638 | struct ev_signal signal_watcher; |
1638 | struct ev_signal signal_watcher; |
1639 | ev_signal_init (&signal_watcher, sigint_cb, SIGINT); |
1639 | ev_signal_init (&signal_watcher, sigint_cb, SIGINT); |
1640 | ev_signal_start (loop, &sigint_cb); |
1640 | ev_signal_start (loop, &signal_watcher); |
1641 | |
1641 | |
1642 | |
1642 | |
1643 | =head2 C<ev_child> - watch out for process status changes |
1643 | =head2 C<ev_child> - watch out for process status changes |
1644 | |
1644 | |
1645 | Child watchers trigger when your process receives a SIGCHLD in response to |
1645 | Child watchers trigger when your process receives a SIGCHLD in response to |
… | |
… | |
2242 | So when you want to use this feature you will always have to be prepared |
2242 | So when you want to use this feature you will always have to be prepared |
2243 | that you cannot get an embeddable loop. The recommended way to get around |
2243 | that you cannot get an embeddable loop. The recommended way to get around |
2244 | this is to have a separate variables for your embeddable loop, try to |
2244 | this is to have a separate variables for your embeddable loop, try to |
2245 | create it, and if that fails, use the normal loop for everything. |
2245 | create it, and if that fails, use the normal loop for everything. |
2246 | |
2246 | |
|
|
2247 | =head3 C<ev_embed> and fork |
|
|
2248 | |
|
|
2249 | While the C<ev_embed> watcher is running, forks in the embedding loop will |
|
|
2250 | automatically be applied to the embedded loop as well, so no special |
|
|
2251 | fork handling is required in that case. When the watcher is not running, |
|
|
2252 | however, it is still the task of the libev user to call C<ev_loop_fork ()> |
|
|
2253 | as applicable. |
|
|
2254 | |
2247 | =head3 Watcher-Specific Functions and Data Members |
2255 | =head3 Watcher-Specific Functions and Data Members |
2248 | |
2256 | |
2249 | =over 4 |
2257 | =over 4 |
2250 | |
2258 | |
2251 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
2259 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
… | |
… | |
3298 | And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: |
3306 | And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: |
3299 | |
3307 | |
3300 | #include "ev_cpp.h" |
3308 | #include "ev_cpp.h" |
3301 | #include "ev.c" |
3309 | #include "ev.c" |
3302 | |
3310 | |
|
|
3311 | =head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES |
3303 | |
3312 | |
3304 | =head1 THREADS AND COROUTINES |
3313 | =head2 THREADS AND COROUTINES |
3305 | |
3314 | |
3306 | =head2 THREADS |
3315 | =head3 THREADS |
3307 | |
3316 | |
3308 | All libev functions are reentrant and thread-safe unless explicitly |
3317 | All libev functions are reentrant and thread-safe unless explicitly |
3309 | documented otherwise, but it uses no locking itself. This means that you |
3318 | documented otherwise, but it uses no locking itself. This means that you |
3310 | can use as many loops as you want in parallel, as long as there are no |
3319 | can use as many loops as you want in parallel, as long as there are no |
3311 | concurrent calls into any libev function with the same loop parameter |
3320 | concurrent calls into any libev function with the same loop parameter |
… | |
… | |
3358 | default loop and triggering an C<ev_async> watcher from the default loop |
3367 | default loop and triggering an C<ev_async> watcher from the default loop |
3359 | watcher callback into the event loop interested in the signal. |
3368 | watcher callback into the event loop interested in the signal. |
3360 | |
3369 | |
3361 | =back |
3370 | =back |
3362 | |
3371 | |
3363 | =head2 COROUTINES |
3372 | =head3 COROUTINES |
3364 | |
3373 | |
3365 | Libev is much more accommodating to coroutines ("cooperative threads"): |
3374 | Libev is much more accommodating to coroutines ("cooperative threads"): |
3366 | libev fully supports nesting calls to it's functions from different |
3375 | libev fully supports nesting calls to it's functions from different |
3367 | coroutines (e.g. you can call C<ev_loop> on the same loop from two |
3376 | coroutines (e.g. you can call C<ev_loop> on the same loop from two |
3368 | different coroutines and switch freely between both coroutines running the |
3377 | different coroutines and switch freely between both coroutines running the |
… | |
… | |
3370 | you must not do this from C<ev_periodic> reschedule callbacks. |
3379 | you must not do this from C<ev_periodic> reschedule callbacks. |
3371 | |
3380 | |
3372 | Care has been taken to ensure that libev does not keep local state inside |
3381 | Care has been taken to ensure that libev does not keep local state inside |
3373 | C<ev_loop>, and other calls do not usually allow coroutine switches. |
3382 | C<ev_loop>, and other calls do not usually allow coroutine switches. |
3374 | |
3383 | |
|
|
3384 | =head2 COMPILER WARNINGS |
|
|
3385 | |
|
|
3386 | Depending on your compiler and compiler settings, you might get no or a |
|
|
3387 | lot of warnings when compiling libev code. Some people are apparently |
|
|
3388 | scared by this. |
|
|
3389 | |
|
|
3390 | However, these are unavoidable for many reasons. For one, each compiler |
|
|
3391 | has different warnings, and each user has different tastes regarding |
|
|
3392 | warning options. "Warn-free" code therefore cannot be a goal except when |
|
|
3393 | targeting a specific compiler and compiler-version. |
|
|
3394 | |
|
|
3395 | Another reason is that some compiler warnings require elaborate |
|
|
3396 | workarounds, or other changes to the code that make it less clear and less |
|
|
3397 | maintainable. |
|
|
3398 | |
|
|
3399 | And of course, some compiler warnings are just plain stupid, or simply |
|
|
3400 | wrong (because they don't actually warn about the condition their message |
|
|
3401 | seems to warn about). For example, certain older gcc versions had some |
|
|
3402 | warnings that resulted an extreme number of false positives. These have |
|
|
3403 | been fixed, but some people still insist on making code warn-free with |
|
|
3404 | such buggy versions. |
|
|
3405 | |
|
|
3406 | While libev is written to generate as few warnings as possible, |
|
|
3407 | "warn-free" code is not a goal, and it is recommended not to build libev |
|
|
3408 | with any compiler warnings enabled unless you are prepared to cope with |
|
|
3409 | them (e.g. by ignoring them). Remember that warnings are just that: |
|
|
3410 | warnings, not errors, or proof of bugs. |
|
|
3411 | |
|
|
3412 | |
|
|
3413 | =head2 VALGRIND |
|
|
3414 | |
|
|
3415 | Valgrind has a special section here because it is a popular tool that is |
|
|
3416 | highly useful. Unfortunately, valgrind reports are very hard to interpret. |
|
|
3417 | |
|
|
3418 | If you think you found a bug (memory leak, uninitialised data access etc.) |
|
|
3419 | in libev, then check twice: If valgrind reports something like: |
|
|
3420 | |
|
|
3421 | ==2274== definitely lost: 0 bytes in 0 blocks. |
|
|
3422 | ==2274== possibly lost: 0 bytes in 0 blocks. |
|
|
3423 | ==2274== still reachable: 256 bytes in 1 blocks. |
|
|
3424 | |
|
|
3425 | Then there is no memory leak, just as memory accounted to global variables |
|
|
3426 | is not a memleak - the memory is still being refernced, and didn't leak. |
|
|
3427 | |
|
|
3428 | Similarly, under some circumstances, valgrind might report kernel bugs |
|
|
3429 | as if it were a bug in libev (e.g. in realloc or in the poll backend, |
|
|
3430 | although an acceptable workaround has been found here), or it might be |
|
|
3431 | confused. |
|
|
3432 | |
|
|
3433 | Keep in mind that valgrind is a very good tool, but only a tool. Don't |
|
|
3434 | make it into some kind of religion. |
|
|
3435 | |
|
|
3436 | If you are unsure about something, feel free to contact the mailing list |
|
|
3437 | with the full valgrind report and an explanation on why you think this |
|
|
3438 | is a bug in libev (best check the archives, too :). However, don't be |
|
|
3439 | annoyed when you get a brisk "this is no bug" answer and take the chance |
|
|
3440 | of learning how to interpret valgrind properly. |
|
|
3441 | |
|
|
3442 | If you need, for some reason, empty reports from valgrind for your project |
|
|
3443 | I suggest using suppression lists. |
|
|
3444 | |
|
|
3445 | |
3375 | |
3446 | |
3376 | =head1 COMPLEXITIES |
3447 | =head1 COMPLEXITIES |
3377 | |
3448 | |
3378 | In this section the complexities of (many of) the algorithms used inside |
3449 | In this section the complexities of (many of) the algorithms used inside |
3379 | libev will be explained. For complexity discussions about backends see the |
3450 | libev will be explained. For complexity discussions about backends see the |
… | |
… | |
3441 | involves iterating over all running async watchers or all signal numbers. |
3512 | involves iterating over all running async watchers or all signal numbers. |
3442 | |
3513 | |
3443 | =back |
3514 | =back |
3444 | |
3515 | |
3445 | |
3516 | |
|
|
3517 | =head1 PORTABILITY NOTES |
|
|
3518 | |
3446 | =head1 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS |
3519 | =head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS |
3447 | |
3520 | |
3448 | Win32 doesn't support any of the standards (e.g. POSIX) that libev |
3521 | Win32 doesn't support any of the standards (e.g. POSIX) that libev |
3449 | requires, and its I/O model is fundamentally incompatible with the POSIX |
3522 | requires, and its I/O model is fundamentally incompatible with the POSIX |
3450 | model. Libev still offers limited functionality on this platform in |
3523 | model. Libev still offers limited functionality on this platform in |
3451 | the form of the C<EVBACKEND_SELECT> backend, and only supports socket |
3524 | the form of the C<EVBACKEND_SELECT> backend, and only supports socket |
… | |
… | |
3538 | wrap all I/O functions and provide your own fd management, but the cost of |
3611 | wrap all I/O functions and provide your own fd management, but the cost of |
3539 | calling select (O(n²)) will likely make this unworkable. |
3612 | calling select (O(n²)) will likely make this unworkable. |
3540 | |
3613 | |
3541 | =back |
3614 | =back |
3542 | |
3615 | |
3543 | |
|
|
3544 | =head1 PORTABILITY REQUIREMENTS |
3616 | =head2 PORTABILITY REQUIREMENTS |
3545 | |
3617 | |
3546 | In addition to a working ISO-C implementation, libev relies on a few |
3618 | In addition to a working ISO-C implementation and of course the |
3547 | additional extensions: |
3619 | backend-specific APIs, libev relies on a few additional extensions: |
3548 | |
3620 | |
3549 | =over 4 |
3621 | =over 4 |
3550 | |
3622 | |
3551 | =item C<void (*)(ev_watcher_type *, int revents)> must have compatible |
3623 | =item C<void (*)(ev_watcher_type *, int revents)> must have compatible |
3552 | calling conventions regardless of C<ev_watcher_type *>. |
3624 | calling conventions regardless of C<ev_watcher_type *>. |
… | |
… | |
3577 | except the initial one, and run the default loop in the initial thread as |
3649 | except the initial one, and run the default loop in the initial thread as |
3578 | well. |
3650 | well. |
3579 | |
3651 | |
3580 | =item C<long> must be large enough for common memory allocation sizes |
3652 | =item C<long> must be large enough for common memory allocation sizes |
3581 | |
3653 | |
3582 | To improve portability and simplify using libev, libev uses C<long> |
3654 | To improve portability and simplify its API, libev uses C<long> internally |
3583 | internally instead of C<size_t> when allocating its data structures. On |
3655 | instead of C<size_t> when allocating its data structures. On non-POSIX |
3584 | non-POSIX systems (Microsoft...) this might be unexpectedly low, but |
3656 | systems (Microsoft...) this might be unexpectedly low, but is still at |
3585 | is still at least 31 bits everywhere, which is enough for hundreds of |
3657 | least 31 bits everywhere, which is enough for hundreds of millions of |
3586 | millions of watchers. |
3658 | watchers. |
3587 | |
3659 | |
3588 | =item C<double> must hold a time value in seconds with enough accuracy |
3660 | =item C<double> must hold a time value in seconds with enough accuracy |
3589 | |
3661 | |
3590 | The type C<double> is used to represent timestamps. It is required to |
3662 | The type C<double> is used to represent timestamps. It is required to |
3591 | have at least 51 bits of mantissa (and 9 bits of exponent), which is good |
3663 | have at least 51 bits of mantissa (and 9 bits of exponent), which is good |
… | |
… | |
3595 | =back |
3667 | =back |
3596 | |
3668 | |
3597 | If you know of other additional requirements drop me a note. |
3669 | If you know of other additional requirements drop me a note. |
3598 | |
3670 | |
3599 | |
3671 | |
3600 | =head1 COMPILER WARNINGS |
|
|
3601 | |
|
|
3602 | Depending on your compiler and compiler settings, you might get no or a |
|
|
3603 | lot of warnings when compiling libev code. Some people are apparently |
|
|
3604 | scared by this. |
|
|
3605 | |
|
|
3606 | However, these are unavoidable for many reasons. For one, each compiler |
|
|
3607 | has different warnings, and each user has different tastes regarding |
|
|
3608 | warning options. "Warn-free" code therefore cannot be a goal except when |
|
|
3609 | targeting a specific compiler and compiler-version. |
|
|
3610 | |
|
|
3611 | Another reason is that some compiler warnings require elaborate |
|
|
3612 | workarounds, or other changes to the code that make it less clear and less |
|
|
3613 | maintainable. |
|
|
3614 | |
|
|
3615 | And of course, some compiler warnings are just plain stupid, or simply |
|
|
3616 | wrong (because they don't actually warn about the condition their message |
|
|
3617 | seems to warn about). |
|
|
3618 | |
|
|
3619 | While libev is written to generate as few warnings as possible, |
|
|
3620 | "warn-free" code is not a goal, and it is recommended not to build libev |
|
|
3621 | with any compiler warnings enabled unless you are prepared to cope with |
|
|
3622 | them (e.g. by ignoring them). Remember that warnings are just that: |
|
|
3623 | warnings, not errors, or proof of bugs. |
|
|
3624 | |
|
|
3625 | |
|
|
3626 | =head1 VALGRIND |
|
|
3627 | |
|
|
3628 | Valgrind has a special section here because it is a popular tool that is |
|
|
3629 | highly useful, but valgrind reports are very hard to interpret. |
|
|
3630 | |
|
|
3631 | If you think you found a bug (memory leak, uninitialised data access etc.) |
|
|
3632 | in libev, then check twice: If valgrind reports something like: |
|
|
3633 | |
|
|
3634 | ==2274== definitely lost: 0 bytes in 0 blocks. |
|
|
3635 | ==2274== possibly lost: 0 bytes in 0 blocks. |
|
|
3636 | ==2274== still reachable: 256 bytes in 1 blocks. |
|
|
3637 | |
|
|
3638 | Then there is no memory leak. Similarly, under some circumstances, |
|
|
3639 | valgrind might report kernel bugs as if it were a bug in libev, or it |
|
|
3640 | might be confused (it is a very good tool, but only a tool). |
|
|
3641 | |
|
|
3642 | If you are unsure about something, feel free to contact the mailing list |
|
|
3643 | with the full valgrind report and an explanation on why you think this is |
|
|
3644 | a bug in libev. However, don't be annoyed when you get a brisk "this is |
|
|
3645 | no bug" answer and take the chance of learning how to interpret valgrind |
|
|
3646 | properly. |
|
|
3647 | |
|
|
3648 | If you need, for some reason, empty reports from valgrind for your project |
|
|
3649 | I suggest using suppression lists. |
|
|
3650 | |
|
|
3651 | |
|
|
3652 | =head1 AUTHOR |
3672 | =head1 AUTHOR |
3653 | |
3673 | |
3654 | Marc Lehmann <libev@schmorp.de>. |
3674 | Marc Lehmann <libev@schmorp.de>. |
3655 | |
3675 | |