… | |
… | |
8 | |
8 | |
9 | =head2 EXAMPLE PROGRAM |
9 | =head2 EXAMPLE PROGRAM |
10 | |
10 | |
11 | // a single header file is required |
11 | // a single header file is required |
12 | #include <ev.h> |
12 | #include <ev.h> |
|
|
13 | |
|
|
14 | #include <stdio.h> // for puts |
13 | |
15 | |
14 | // every watcher type has its own typedef'd struct |
16 | // every watcher type has its own typedef'd struct |
15 | // with the name ev_TYPE |
17 | // with the name ev_TYPE |
16 | ev_io stdin_watcher; |
18 | ev_io stdin_watcher; |
17 | ev_timer timeout_watcher; |
19 | ev_timer timeout_watcher; |
… | |
… | |
41 | |
43 | |
42 | int |
44 | int |
43 | main (void) |
45 | main (void) |
44 | { |
46 | { |
45 | // use the default event loop unless you have special needs |
47 | // use the default event loop unless you have special needs |
46 | ev_loop *loop = ev_default_loop (0); |
48 | struct ev_loop *loop = ev_default_loop (0); |
47 | |
49 | |
48 | // initialise an io watcher, then start it |
50 | // initialise an io watcher, then start it |
49 | // this one will watch for stdin to become readable |
51 | // this one will watch for stdin to become readable |
50 | ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); |
52 | ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); |
51 | ev_io_start (loop, &stdin_watcher); |
53 | ev_io_start (loop, &stdin_watcher); |
… | |
… | |
298 | If you don't know what event loop to use, use the one returned from this |
300 | If you don't know what event loop to use, use the one returned from this |
299 | function. |
301 | function. |
300 | |
302 | |
301 | Note that this function is I<not> thread-safe, so if you want to use it |
303 | Note that this function is I<not> thread-safe, so if you want to use it |
302 | from multiple threads, you have to lock (note also that this is unlikely, |
304 | from multiple threads, you have to lock (note also that this is unlikely, |
303 | as loops cannot bes hared easily between threads anyway). |
305 | as loops cannot be shared easily between threads anyway). |
304 | |
306 | |
305 | The default loop is the only loop that can handle C<ev_signal> and |
307 | The default loop is the only loop that can handle C<ev_signal> and |
306 | C<ev_child> watchers, and to do this, it always registers a handler |
308 | C<ev_child> watchers, and to do this, it always registers a handler |
307 | for C<SIGCHLD>. If this is a problem for your application you can either |
309 | for C<SIGCHLD>. If this is a problem for your application you can either |
308 | create a dynamic loop with C<ev_loop_new> that doesn't do that, or you |
310 | create a dynamic loop with C<ev_loop_new> that doesn't do that, or you |
… | |
… | |
384 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
386 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
385 | |
387 | |
386 | For few fds, this backend is a bit little slower than poll and select, |
388 | For few fds, this backend is a bit little slower than poll and select, |
387 | but it scales phenomenally better. While poll and select usually scale |
389 | but it scales phenomenally better. While poll and select usually scale |
388 | like O(total_fds) where n is the total number of fds (or the highest fd), |
390 | like O(total_fds) where n is the total number of fds (or the highest fd), |
389 | epoll scales either O(1) or O(active_fds). The epoll design has a number |
391 | epoll scales either O(1) or O(active_fds). |
390 | of shortcomings, such as silently dropping events in some hard-to-detect |
392 | |
391 | cases and requiring a system call per fd change, no fork support and bad |
393 | The epoll mechanism deserves honorable mention as the most misdesigned |
392 | support for dup. |
394 | of the more advanced event mechanisms: mere annoyances include silently |
|
|
395 | dropping file descriptors, requiring a system call per change per file |
|
|
396 | descriptor (and unnecessary guessing of parameters), problems with dup and |
|
|
397 | so on. The biggest issue is fork races, however - if a program forks then |
|
|
398 | I<both> parent and child process have to recreate the epoll set, which can |
|
|
399 | take considerable time (one syscall per file descriptor) and is of course |
|
|
400 | hard to detect. |
|
|
401 | |
|
|
402 | Epoll is also notoriously buggy - embedding epoll fds I<should> work, but |
|
|
403 | of course I<doesn't>, and epoll just loves to report events for totally |
|
|
404 | I<different> file descriptors (even already closed ones, so one cannot |
|
|
405 | even remove them from the set) than registered in the set (especially |
|
|
406 | on SMP systems). Libev tries to counter these spurious notifications by |
|
|
407 | employing an additional generation counter and comparing that against the |
|
|
408 | events to filter out spurious ones, recreating the set when required. |
393 | |
409 | |
394 | While stopping, setting and starting an I/O watcher in the same iteration |
410 | While stopping, setting and starting an I/O watcher in the same iteration |
395 | will result in some caching, there is still a system call per such incident |
411 | will result in some caching, there is still a system call per such |
396 | (because the fd could point to a different file description now), so its |
412 | incident (because the same I<file descriptor> could point to a different |
397 | best to avoid that. Also, C<dup ()>'ed file descriptors might not work |
413 | I<file description> now), so its best to avoid that. Also, C<dup ()>'ed |
398 | very well if you register events for both fds. |
414 | file descriptors might not work very well if you register events for both |
399 | |
415 | file descriptors. |
400 | Please note that epoll sometimes generates spurious notifications, so you |
|
|
401 | need to use non-blocking I/O or other means to avoid blocking when no data |
|
|
402 | (or space) is available. |
|
|
403 | |
416 | |
404 | Best performance from this backend is achieved by not unregistering all |
417 | Best performance from this backend is achieved by not unregistering all |
405 | watchers for a file descriptor until it has been closed, if possible, |
418 | watchers for a file descriptor until it has been closed, if possible, |
406 | i.e. keep at least one watcher active per fd at all times. Stopping and |
419 | i.e. keep at least one watcher active per fd at all times. Stopping and |
407 | starting a watcher (without re-setting it) also usually doesn't cause |
420 | starting a watcher (without re-setting it) also usually doesn't cause |
408 | extra overhead. |
421 | extra overhead. A fork can both result in spurious notifications as well |
|
|
422 | as in libev having to destroy and recreate the epoll object, which can |
|
|
423 | take considerable time and thus should be avoided. |
|
|
424 | |
|
|
425 | All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or |
|
|
426 | faster than epoll for maybe up to a hundred file descriptors, depending on |
|
|
427 | the usage. So sad. |
409 | |
428 | |
410 | While nominally embeddable in other event loops, this feature is broken in |
429 | While nominally embeddable in other event loops, this feature is broken in |
411 | all kernel versions tested so far. |
430 | all kernel versions tested so far. |
412 | |
431 | |
413 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
432 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
414 | C<EVBACKEND_POLL>. |
433 | C<EVBACKEND_POLL>. |
415 | |
434 | |
416 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
435 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
417 | |
436 | |
418 | Kqueue deserves special mention, as at the time of this writing, it was |
437 | Kqueue deserves special mention, as at the time of this writing, it |
419 | broken on all BSDs except NetBSD (usually it doesn't work reliably with |
438 | was broken on all BSDs except NetBSD (usually it doesn't work reliably |
420 | anything but sockets and pipes, except on Darwin, where of course it's |
439 | with anything but sockets and pipes, except on Darwin, where of course |
421 | completely useless). For this reason it's not being "auto-detected" unless |
440 | it's completely useless). Unlike epoll, however, whose brokenness |
422 | you explicitly specify it in the flags (i.e. using C<EVBACKEND_KQUEUE>) or |
441 | is by design, these kqueue bugs can (and eventually will) be fixed |
423 | libev was compiled on a known-to-be-good (-enough) system like NetBSD. |
442 | without API changes to existing programs. For this reason it's not being |
|
|
443 | "auto-detected" unless you explicitly specify it in the flags (i.e. using |
|
|
444 | C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) |
|
|
445 | system like NetBSD. |
424 | |
446 | |
425 | You still can embed kqueue into a normal poll or select backend and use it |
447 | You still can embed kqueue into a normal poll or select backend and use it |
426 | only for sockets (after having made sure that sockets work with kqueue on |
448 | only for sockets (after having made sure that sockets work with kqueue on |
427 | the target platform). See C<ev_embed> watchers for more info. |
449 | the target platform). See C<ev_embed> watchers for more info. |
428 | |
450 | |
429 | It scales in the same way as the epoll backend, but the interface to the |
451 | It scales in the same way as the epoll backend, but the interface to the |
430 | kernel is more efficient (which says nothing about its actual speed, of |
452 | kernel is more efficient (which says nothing about its actual speed, of |
431 | course). While stopping, setting and starting an I/O watcher does never |
453 | course). While stopping, setting and starting an I/O watcher does never |
432 | cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to |
454 | cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to |
433 | two event changes per incident. Support for C<fork ()> is very bad and it |
455 | two event changes per incident. Support for C<fork ()> is very bad (but |
434 | drops fds silently in similarly hard-to-detect cases. |
456 | sane, unlike epoll) and it drops fds silently in similarly hard-to-detect |
|
|
457 | cases |
435 | |
458 | |
436 | This backend usually performs well under most conditions. |
459 | This backend usually performs well under most conditions. |
437 | |
460 | |
438 | While nominally embeddable in other event loops, this doesn't work |
461 | While nominally embeddable in other event loops, this doesn't work |
439 | everywhere, so you might need to test for this. And since it is broken |
462 | everywhere, so you might need to test for this. And since it is broken |
440 | almost everywhere, you should only use it when you have a lot of sockets |
463 | almost everywhere, you should only use it when you have a lot of sockets |
441 | (for which it usually works), by embedding it into another event loop |
464 | (for which it usually works), by embedding it into another event loop |
442 | (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and, did I mention it, |
465 | (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> (but C<poll> is of course |
443 | using it only for sockets. |
466 | also broken on OS X)) and, did I mention it, using it only for sockets. |
444 | |
467 | |
445 | This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with |
468 | This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with |
446 | C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with |
469 | C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with |
447 | C<NOTE_EOF>. |
470 | C<NOTE_EOF>. |
448 | |
471 | |
… | |
… | |
468 | might perform better. |
491 | might perform better. |
469 | |
492 | |
470 | On the positive side, with the exception of the spurious readiness |
493 | On the positive side, with the exception of the spurious readiness |
471 | notifications, this backend actually performed fully to specification |
494 | notifications, this backend actually performed fully to specification |
472 | in all tests and is fully embeddable, which is a rare feat among the |
495 | in all tests and is fully embeddable, which is a rare feat among the |
473 | OS-specific backends. |
496 | OS-specific backends (I vastly prefer correctness over speed hacks). |
474 | |
497 | |
475 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
498 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
476 | C<EVBACKEND_POLL>. |
499 | C<EVBACKEND_POLL>. |
477 | |
500 | |
478 | =item C<EVBACKEND_ALL> |
501 | =item C<EVBACKEND_ALL> |
… | |
… | |
531 | responsibility to either stop all watchers cleanly yourself I<before> |
554 | responsibility to either stop all watchers cleanly yourself I<before> |
532 | calling this function, or cope with the fact afterwards (which is usually |
555 | calling this function, or cope with the fact afterwards (which is usually |
533 | the easiest thing, you can just ignore the watchers and/or C<free ()> them |
556 | the easiest thing, you can just ignore the watchers and/or C<free ()> them |
534 | for example). |
557 | for example). |
535 | |
558 | |
536 | Note that certain global state, such as signal state, will not be freed by |
559 | Note that certain global state, such as signal state (and installed signal |
537 | this function, and related watchers (such as signal and child watchers) |
560 | handlers), will not be freed by this function, and related watchers (such |
538 | would need to be stopped manually. |
561 | as signal and child watchers) would need to be stopped manually. |
539 | |
562 | |
540 | In general it is not advisable to call this function except in the |
563 | In general it is not advisable to call this function except in the |
541 | rare occasion where you really need to free e.g. the signal handling |
564 | rare occasion where you really need to free e.g. the signal handling |
542 | pipe fds. If you need dynamically allocated loops it is better to use |
565 | pipe fds. If you need dynamically allocated loops it is better to use |
543 | C<ev_loop_new> and C<ev_loop_destroy>). |
566 | C<ev_loop_new> and C<ev_loop_destroy>). |
… | |
… | |
635 | the loop. |
658 | the loop. |
636 | |
659 | |
637 | A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if |
660 | A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if |
638 | necessary) and will handle those and any already outstanding ones. It |
661 | necessary) and will handle those and any already outstanding ones. It |
639 | will block your process until at least one new event arrives (which could |
662 | will block your process until at least one new event arrives (which could |
640 | be an event internal to libev itself, so there is no guarentee that a |
663 | be an event internal to libev itself, so there is no guarantee that a |
641 | user-registered callback will be called), and will return after one |
664 | user-registered callback will be called), and will return after one |
642 | iteration of the loop. |
665 | iteration of the loop. |
643 | |
666 | |
644 | This is useful if you are waiting for some external event in conjunction |
667 | This is useful if you are waiting for some external event in conjunction |
645 | with something not expressible using other libev watchers (i.e. "roll your |
668 | with something not expressible using other libev watchers (i.e. "roll your |
… | |
… | |
1398 | else |
1421 | else |
1399 | { |
1422 | { |
1400 | // callback was invoked, but there was some activity, re-arm |
1423 | // callback was invoked, but there was some activity, re-arm |
1401 | // the watcher to fire in last_activity + 60, which is |
1424 | // the watcher to fire in last_activity + 60, which is |
1402 | // guaranteed to be in the future, so "again" is positive: |
1425 | // guaranteed to be in the future, so "again" is positive: |
1403 | w->again = timeout - now; |
1426 | w->repeat = timeout - now; |
1404 | ev_timer_again (EV_A_ w); |
1427 | ev_timer_again (EV_A_ w); |
1405 | } |
1428 | } |
1406 | } |
1429 | } |
1407 | |
1430 | |
1408 | To summarise the callback: first calculate the real timeout (defined |
1431 | To summarise the callback: first calculate the real timeout (defined |
… | |
… | |
1573 | =head2 C<ev_periodic> - to cron or not to cron? |
1596 | =head2 C<ev_periodic> - to cron or not to cron? |
1574 | |
1597 | |
1575 | Periodic watchers are also timers of a kind, but they are very versatile |
1598 | Periodic watchers are also timers of a kind, but they are very versatile |
1576 | (and unfortunately a bit complex). |
1599 | (and unfortunately a bit complex). |
1577 | |
1600 | |
1578 | Unlike C<ev_timer>'s, they are not based on real time (or relative time) |
1601 | Unlike C<ev_timer>, periodic watchers are not based on real time (or |
1579 | but on wall clock time (absolute time). You can tell a periodic watcher |
1602 | relative time, the physical time that passes) but on wall clock time |
1580 | to trigger after some specific point in time. For example, if you tell a |
1603 | (absolute time, the thing you can read on your calender or clock). The |
1581 | periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now () |
1604 | difference is that wall clock time can run faster or slower than real |
1582 | + 10.>, that is, an absolute time not a delay) and then reset your system |
1605 | time, and time jumps are not uncommon (e.g. when you adjust your |
1583 | clock to January of the previous year, then it will take more than year |
1606 | wrist-watch). |
1584 | to trigger the event (unlike an C<ev_timer>, which would still trigger |
|
|
1585 | roughly 10 seconds later as it uses a relative timeout). |
|
|
1586 | |
1607 | |
|
|
1608 | You can tell a periodic watcher to trigger after some specific point |
|
|
1609 | in time: for example, if you tell a periodic watcher to trigger "in 10 |
|
|
1610 | seconds" (by specifying e.g. C<ev_now () + 10.>, that is, an absolute time |
|
|
1611 | not a delay) and then reset your system clock to January of the previous |
|
|
1612 | year, then it will take a year or more to trigger the event (unlike an |
|
|
1613 | C<ev_timer>, which would still trigger roughly 10 seconds after starting |
|
|
1614 | it, as it uses a relative timeout). |
|
|
1615 | |
1587 | C<ev_periodic>s can also be used to implement vastly more complex timers, |
1616 | C<ev_periodic> watchers can also be used to implement vastly more complex |
1588 | such as triggering an event on each "midnight, local time", or other |
1617 | timers, such as triggering an event on each "midnight, local time", or |
1589 | complicated rules. |
1618 | other complicated rules. This cannot be done with C<ev_timer> watchers, as |
|
|
1619 | those cannot react to time jumps. |
1590 | |
1620 | |
1591 | As with timers, the callback is guaranteed to be invoked only when the |
1621 | As with timers, the callback is guaranteed to be invoked only when the |
1592 | time (C<at>) has passed, but if multiple periodic timers become ready |
1622 | point in time where it is supposed to trigger has passed, but if multiple |
1593 | during the same loop iteration, then order of execution is undefined. |
1623 | periodic timers become ready during the same loop iteration, then order of |
|
|
1624 | execution is undefined. |
1594 | |
1625 | |
1595 | =head3 Watcher-Specific Functions and Data Members |
1626 | =head3 Watcher-Specific Functions and Data Members |
1596 | |
1627 | |
1597 | =over 4 |
1628 | =over 4 |
1598 | |
1629 | |
1599 | =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) |
1630 | =item ev_periodic_init (ev_periodic *, callback, ev_tstamp offset, ev_tstamp interval, reschedule_cb) |
1600 | |
1631 | |
1601 | =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) |
1632 | =item ev_periodic_set (ev_periodic *, ev_tstamp offset, ev_tstamp interval, reschedule_cb) |
1602 | |
1633 | |
1603 | Lots of arguments, lets sort it out... There are basically three modes of |
1634 | Lots of arguments, let's sort it out... There are basically three modes of |
1604 | operation, and we will explain them from simplest to most complex: |
1635 | operation, and we will explain them from simplest to most complex: |
1605 | |
1636 | |
1606 | =over 4 |
1637 | =over 4 |
1607 | |
1638 | |
1608 | =item * absolute timer (at = time, interval = reschedule_cb = 0) |
1639 | =item * absolute timer (offset = absolute time, interval = 0, reschedule_cb = 0) |
1609 | |
1640 | |
1610 | In this configuration the watcher triggers an event after the wall clock |
1641 | In this configuration the watcher triggers an event after the wall clock |
1611 | time C<at> has passed. It will not repeat and will not adjust when a time |
1642 | time C<offset> has passed. It will not repeat and will not adjust when a |
1612 | jump occurs, that is, if it is to be run at January 1st 2011 then it will |
1643 | time jump occurs, that is, if it is to be run at January 1st 2011 then it |
1613 | only run when the system clock reaches or surpasses this time. |
1644 | will be stopped and invoked when the system clock reaches or surpasses |
|
|
1645 | this point in time. |
1614 | |
1646 | |
1615 | =item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) |
1647 | =item * repeating interval timer (offset = offset within interval, interval > 0, reschedule_cb = 0) |
1616 | |
1648 | |
1617 | In this mode the watcher will always be scheduled to time out at the next |
1649 | In this mode the watcher will always be scheduled to time out at the next |
1618 | C<at + N * interval> time (for some integer N, which can also be negative) |
1650 | C<offset + N * interval> time (for some integer N, which can also be |
1619 | and then repeat, regardless of any time jumps. |
1651 | negative) and then repeat, regardless of any time jumps. The C<offset> |
|
|
1652 | argument is merely an offset into the C<interval> periods. |
1620 | |
1653 | |
1621 | This can be used to create timers that do not drift with respect to the |
1654 | This can be used to create timers that do not drift with respect to the |
1622 | system clock, for example, here is a C<ev_periodic> that triggers each |
1655 | system clock, for example, here is an C<ev_periodic> that triggers each |
1623 | hour, on the hour: |
1656 | hour, on the hour (with respect to UTC): |
1624 | |
1657 | |
1625 | ev_periodic_set (&periodic, 0., 3600., 0); |
1658 | ev_periodic_set (&periodic, 0., 3600., 0); |
1626 | |
1659 | |
1627 | This doesn't mean there will always be 3600 seconds in between triggers, |
1660 | This doesn't mean there will always be 3600 seconds in between triggers, |
1628 | but only that the callback will be called when the system time shows a |
1661 | but only that the callback will be called when the system time shows a |
1629 | full hour (UTC), or more correctly, when the system time is evenly divisible |
1662 | full hour (UTC), or more correctly, when the system time is evenly divisible |
1630 | by 3600. |
1663 | by 3600. |
1631 | |
1664 | |
1632 | Another way to think about it (for the mathematically inclined) is that |
1665 | Another way to think about it (for the mathematically inclined) is that |
1633 | C<ev_periodic> will try to run the callback in this mode at the next possible |
1666 | C<ev_periodic> will try to run the callback in this mode at the next possible |
1634 | time where C<time = at (mod interval)>, regardless of any time jumps. |
1667 | time where C<time = offset (mod interval)>, regardless of any time jumps. |
1635 | |
1668 | |
1636 | For numerical stability it is preferable that the C<at> value is near |
1669 | For numerical stability it is preferable that the C<offset> value is near |
1637 | C<ev_now ()> (the current time), but there is no range requirement for |
1670 | C<ev_now ()> (the current time), but there is no range requirement for |
1638 | this value, and in fact is often specified as zero. |
1671 | this value, and in fact is often specified as zero. |
1639 | |
1672 | |
1640 | Note also that there is an upper limit to how often a timer can fire (CPU |
1673 | Note also that there is an upper limit to how often a timer can fire (CPU |
1641 | speed for example), so if C<interval> is very small then timing stability |
1674 | speed for example), so if C<interval> is very small then timing stability |
1642 | will of course deteriorate. Libev itself tries to be exact to be about one |
1675 | will of course deteriorate. Libev itself tries to be exact to be about one |
1643 | millisecond (if the OS supports it and the machine is fast enough). |
1676 | millisecond (if the OS supports it and the machine is fast enough). |
1644 | |
1677 | |
1645 | =item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) |
1678 | =item * manual reschedule mode (offset ignored, interval ignored, reschedule_cb = callback) |
1646 | |
1679 | |
1647 | In this mode the values for C<interval> and C<at> are both being |
1680 | In this mode the values for C<interval> and C<offset> are both being |
1648 | ignored. Instead, each time the periodic watcher gets scheduled, the |
1681 | ignored. Instead, each time the periodic watcher gets scheduled, the |
1649 | reschedule callback will be called with the watcher as first, and the |
1682 | reschedule callback will be called with the watcher as first, and the |
1650 | current time as second argument. |
1683 | current time as second argument. |
1651 | |
1684 | |
1652 | NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, |
1685 | NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, ever, |
1653 | ever, or make ANY event loop modifications whatsoever>. |
1686 | or make ANY other event loop modifications whatsoever, unless explicitly |
|
|
1687 | allowed by documentation here>. |
1654 | |
1688 | |
1655 | If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop |
1689 | If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop |
1656 | it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the |
1690 | it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the |
1657 | only event loop modification you are allowed to do). |
1691 | only event loop modification you are allowed to do). |
1658 | |
1692 | |
… | |
… | |
1688 | a different time than the last time it was called (e.g. in a crond like |
1722 | a different time than the last time it was called (e.g. in a crond like |
1689 | program when the crontabs have changed). |
1723 | program when the crontabs have changed). |
1690 | |
1724 | |
1691 | =item ev_tstamp ev_periodic_at (ev_periodic *) |
1725 | =item ev_tstamp ev_periodic_at (ev_periodic *) |
1692 | |
1726 | |
1693 | When active, returns the absolute time that the watcher is supposed to |
1727 | When active, returns the absolute time that the watcher is supposed |
1694 | trigger next. |
1728 | to trigger next. This is not the same as the C<offset> argument to |
|
|
1729 | C<ev_periodic_set>, but indeed works even in interval and manual |
|
|
1730 | rescheduling modes. |
1695 | |
1731 | |
1696 | =item ev_tstamp offset [read-write] |
1732 | =item ev_tstamp offset [read-write] |
1697 | |
1733 | |
1698 | When repeating, this contains the offset value, otherwise this is the |
1734 | When repeating, this contains the offset value, otherwise this is the |
1699 | absolute point in time (the C<at> value passed to C<ev_periodic_set>). |
1735 | absolute point in time (the C<offset> value passed to C<ev_periodic_set>, |
|
|
1736 | although libev might modify this value for better numerical stability). |
1700 | |
1737 | |
1701 | Can be modified any time, but changes only take effect when the periodic |
1738 | Can be modified any time, but changes only take effect when the periodic |
1702 | timer fires or C<ev_periodic_again> is being called. |
1739 | timer fires or C<ev_periodic_again> is being called. |
1703 | |
1740 | |
1704 | =item ev_tstamp interval [read-write] |
1741 | =item ev_tstamp interval [read-write] |
… | |
… | |
1910 | |
1947 | |
1911 | |
1948 | |
1912 | =head2 C<ev_stat> - did the file attributes just change? |
1949 | =head2 C<ev_stat> - did the file attributes just change? |
1913 | |
1950 | |
1914 | This watches a file system path for attribute changes. That is, it calls |
1951 | This watches a file system path for attribute changes. That is, it calls |
1915 | C<stat> regularly (or when the OS says it changed) and sees if it changed |
1952 | C<stat> on that path in regular intervals (or when the OS says it changed) |
1916 | compared to the last time, invoking the callback if it did. |
1953 | and sees if it changed compared to the last time, invoking the callback if |
|
|
1954 | it did. |
1917 | |
1955 | |
1918 | The path does not need to exist: changing from "path exists" to "path does |
1956 | The path does not need to exist: changing from "path exists" to "path does |
1919 | not exist" is a status change like any other. The condition "path does |
1957 | not exist" is a status change like any other. The condition "path does not |
1920 | not exist" is signified by the C<st_nlink> field being zero (which is |
1958 | exist" (or more correctly "path cannot be stat'ed") is signified by the |
1921 | otherwise always forced to be at least one) and all the other fields of |
1959 | C<st_nlink> field being zero (which is otherwise always forced to be at |
1922 | the stat buffer having unspecified contents. |
1960 | least one) and all the other fields of the stat buffer having unspecified |
|
|
1961 | contents. |
1923 | |
1962 | |
1924 | The path I<should> be absolute and I<must not> end in a slash. If it is |
1963 | The path I<must not> end in a slash or contain special components such as |
|
|
1964 | C<.> or C<..>. The path I<should> be absolute: If it is relative and |
1925 | relative and your working directory changes, the behaviour is undefined. |
1965 | your working directory changes, then the behaviour is undefined. |
1926 | |
1966 | |
1927 | Since there is no standard kernel interface to do this, the portable |
1967 | Since there is no portable change notification interface available, the |
1928 | implementation simply calls C<stat (2)> regularly on the path to see if |
1968 | portable implementation simply calls C<stat(2)> regularly on the path |
1929 | it changed somehow. You can specify a recommended polling interval for |
1969 | to see if it changed somehow. You can specify a recommended polling |
1930 | this case. If you specify a polling interval of C<0> (highly recommended!) |
1970 | interval for this case. If you specify a polling interval of C<0> (highly |
1931 | then a I<suitable, unspecified default> value will be used (which |
1971 | recommended!) then a I<suitable, unspecified default> value will be used |
1932 | you can expect to be around five seconds, although this might change |
1972 | (which you can expect to be around five seconds, although this might |
1933 | dynamically). Libev will also impose a minimum interval which is currently |
1973 | change dynamically). Libev will also impose a minimum interval which is |
1934 | around C<0.1>, but thats usually overkill. |
1974 | currently around C<0.1>, but that's usually overkill. |
1935 | |
1975 | |
1936 | This watcher type is not meant for massive numbers of stat watchers, |
1976 | This watcher type is not meant for massive numbers of stat watchers, |
1937 | as even with OS-supported change notifications, this can be |
1977 | as even with OS-supported change notifications, this can be |
1938 | resource-intensive. |
1978 | resource-intensive. |
1939 | |
1979 | |
1940 | At the time of this writing, the only OS-specific interface implemented |
1980 | At the time of this writing, the only OS-specific interface implemented |
1941 | is the Linux inotify interface (implementing kqueue support is left as |
1981 | is the Linux inotify interface (implementing kqueue support is left as an |
1942 | an exercise for the reader. Note, however, that the author sees no way |
1982 | exercise for the reader. Note, however, that the author sees no way of |
1943 | of implementing C<ev_stat> semantics with kqueue). |
1983 | implementing C<ev_stat> semantics with kqueue, except as a hint). |
1944 | |
1984 | |
1945 | =head3 ABI Issues (Largefile Support) |
1985 | =head3 ABI Issues (Largefile Support) |
1946 | |
1986 | |
1947 | Libev by default (unless the user overrides this) uses the default |
1987 | Libev by default (unless the user overrides this) uses the default |
1948 | compilation environment, which means that on systems with large file |
1988 | compilation environment, which means that on systems with large file |
1949 | support disabled by default, you get the 32 bit version of the stat |
1989 | support disabled by default, you get the 32 bit version of the stat |
1950 | structure. When using the library from programs that change the ABI to |
1990 | structure. When using the library from programs that change the ABI to |
1951 | use 64 bit file offsets the programs will fail. In that case you have to |
1991 | use 64 bit file offsets the programs will fail. In that case you have to |
1952 | compile libev with the same flags to get binary compatibility. This is |
1992 | compile libev with the same flags to get binary compatibility. This is |
1953 | obviously the case with any flags that change the ABI, but the problem is |
1993 | obviously the case with any flags that change the ABI, but the problem is |
1954 | most noticeably disabled with ev_stat and large file support. |
1994 | most noticeably displayed with ev_stat and large file support. |
1955 | |
1995 | |
1956 | The solution for this is to lobby your distribution maker to make large |
1996 | The solution for this is to lobby your distribution maker to make large |
1957 | file interfaces available by default (as e.g. FreeBSD does) and not |
1997 | file interfaces available by default (as e.g. FreeBSD does) and not |
1958 | optional. Libev cannot simply switch on large file support because it has |
1998 | optional. Libev cannot simply switch on large file support because it has |
1959 | to exchange stat structures with application programs compiled using the |
1999 | to exchange stat structures with application programs compiled using the |
1960 | default compilation environment. |
2000 | default compilation environment. |
1961 | |
2001 | |
1962 | =head3 Inotify and Kqueue |
2002 | =head3 Inotify and Kqueue |
1963 | |
2003 | |
1964 | When C<inotify (7)> support has been compiled into libev (generally |
2004 | When C<inotify (7)> support has been compiled into libev and present at |
1965 | only available with Linux 2.6.25 or above due to bugs in earlier |
2005 | runtime, it will be used to speed up change detection where possible. The |
1966 | implementations) and present at runtime, it will be used to speed up |
2006 | inotify descriptor will be created lazily when the first C<ev_stat> |
1967 | change detection where possible. The inotify descriptor will be created |
2007 | watcher is being started. |
1968 | lazily when the first C<ev_stat> watcher is being started. |
|
|
1969 | |
2008 | |
1970 | Inotify presence does not change the semantics of C<ev_stat> watchers |
2009 | Inotify presence does not change the semantics of C<ev_stat> watchers |
1971 | except that changes might be detected earlier, and in some cases, to avoid |
2010 | except that changes might be detected earlier, and in some cases, to avoid |
1972 | making regular C<stat> calls. Even in the presence of inotify support |
2011 | making regular C<stat> calls. Even in the presence of inotify support |
1973 | there are many cases where libev has to resort to regular C<stat> polling, |
2012 | there are many cases where libev has to resort to regular C<stat> polling, |
1974 | but as long as the path exists, libev usually gets away without polling. |
2013 | but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too |
|
|
2014 | many bugs), the path exists (i.e. stat succeeds), and the path resides on |
|
|
2015 | a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and |
|
|
2016 | xfs are fully working) libev usually gets away without polling. |
1975 | |
2017 | |
1976 | There is no support for kqueue, as apparently it cannot be used to |
2018 | There is no support for kqueue, as apparently it cannot be used to |
1977 | implement this functionality, due to the requirement of having a file |
2019 | implement this functionality, due to the requirement of having a file |
1978 | descriptor open on the object at all times, and detecting renames, unlinks |
2020 | descriptor open on the object at all times, and detecting renames, unlinks |
1979 | etc. is difficult. |
2021 | etc. is difficult. |
1980 | |
2022 | |
|
|
2023 | =head3 C<stat ()> is a synchronous operation |
|
|
2024 | |
|
|
2025 | Libev doesn't normally do any kind of I/O itself, and so is not blocking |
|
|
2026 | the process. The exception are C<ev_stat> watchers - those call C<stat |
|
|
2027 | ()>, which is a synchronous operation. |
|
|
2028 | |
|
|
2029 | For local paths, this usually doesn't matter: unless the system is very |
|
|
2030 | busy or the intervals between stat's are large, a stat call will be fast, |
|
|
2031 | as the path data is usually in memory already (except when starting the |
|
|
2032 | watcher). |
|
|
2033 | |
|
|
2034 | For networked file systems, calling C<stat ()> can block an indefinite |
|
|
2035 | time due to network issues, and even under good conditions, a stat call |
|
|
2036 | often takes multiple milliseconds. |
|
|
2037 | |
|
|
2038 | Therefore, it is best to avoid using C<ev_stat> watchers on networked |
|
|
2039 | paths, although this is fully supported by libev. |
|
|
2040 | |
1981 | =head3 The special problem of stat time resolution |
2041 | =head3 The special problem of stat time resolution |
1982 | |
2042 | |
1983 | The C<stat ()> system call only supports full-second resolution portably, and |
2043 | The C<stat ()> system call only supports full-second resolution portably, |
1984 | even on systems where the resolution is higher, most file systems still |
2044 | and even on systems where the resolution is higher, most file systems |
1985 | only support whole seconds. |
2045 | still only support whole seconds. |
1986 | |
2046 | |
1987 | That means that, if the time is the only thing that changes, you can |
2047 | That means that, if the time is the only thing that changes, you can |
1988 | easily miss updates: on the first update, C<ev_stat> detects a change and |
2048 | easily miss updates: on the first update, C<ev_stat> detects a change and |
1989 | calls your callback, which does something. When there is another update |
2049 | calls your callback, which does something. When there is another update |
1990 | within the same second, C<ev_stat> will be unable to detect unless the |
2050 | within the same second, C<ev_stat> will be unable to detect unless the |
… | |
… | |
2133 | |
2193 | |
2134 | =head3 Watcher-Specific Functions and Data Members |
2194 | =head3 Watcher-Specific Functions and Data Members |
2135 | |
2195 | |
2136 | =over 4 |
2196 | =over 4 |
2137 | |
2197 | |
2138 | =item ev_idle_init (ev_signal *, callback) |
2198 | =item ev_idle_init (ev_idle *, callback) |
2139 | |
2199 | |
2140 | Initialises and configures the idle watcher - it has no parameters of any |
2200 | Initialises and configures the idle watcher - it has no parameters of any |
2141 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
2201 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
2142 | believe me. |
2202 | believe me. |
2143 | |
2203 | |
… | |
… | |
2382 | some fds have to be watched and handled very quickly (with low latency), |
2442 | some fds have to be watched and handled very quickly (with low latency), |
2383 | and even priorities and idle watchers might have too much overhead. In |
2443 | and even priorities and idle watchers might have too much overhead. In |
2384 | this case you would put all the high priority stuff in one loop and all |
2444 | this case you would put all the high priority stuff in one loop and all |
2385 | the rest in a second one, and embed the second one in the first. |
2445 | the rest in a second one, and embed the second one in the first. |
2386 | |
2446 | |
2387 | As long as the watcher is active, the callback will be invoked every time |
2447 | As long as the watcher is active, the callback will be invoked every |
2388 | there might be events pending in the embedded loop. The callback must then |
2448 | time there might be events pending in the embedded loop. The callback |
2389 | call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke |
2449 | must then call C<ev_embed_sweep (mainloop, watcher)> to make a single |
2390 | their callbacks (you could also start an idle watcher to give the embedded |
2450 | sweep and invoke their callbacks (the callback doesn't need to invoke the |
2391 | loop strictly lower priority for example). You can also set the callback |
2451 | C<ev_embed_sweep> function directly, it could also start an idle watcher |
2392 | to C<0>, in which case the embed watcher will automatically execute the |
2452 | to give the embedded loop strictly lower priority for example). |
2393 | embedded loop sweep. |
|
|
2394 | |
2453 | |
2395 | As long as the watcher is started it will automatically handle events. The |
2454 | You can also set the callback to C<0>, in which case the embed watcher |
2396 | callback will be invoked whenever some events have been handled. You can |
2455 | will automatically execute the embedded loop sweep whenever necessary. |
2397 | set the callback to C<0> to avoid having to specify one if you are not |
|
|
2398 | interested in that. |
|
|
2399 | |
2456 | |
2400 | Also, there have not currently been made special provisions for forking: |
2457 | Fork detection will be handled transparently while the C<ev_embed> watcher |
2401 | when you fork, you not only have to call C<ev_loop_fork> on both loops, |
2458 | is active, i.e., the embedded loop will automatically be forked when the |
2402 | but you will also have to stop and restart any C<ev_embed> watchers |
2459 | embedding loop forks. In other cases, the user is responsible for calling |
2403 | yourself - but you can use a fork watcher to handle this automatically, |
2460 | C<ev_loop_fork> on the embedded loop. |
2404 | and future versions of libev might do just that. |
|
|
2405 | |
2461 | |
2406 | Unfortunately, not all backends are embeddable: only the ones returned by |
2462 | Unfortunately, not all backends are embeddable: only the ones returned by |
2407 | C<ev_embeddable_backends> are, which, unfortunately, does not include any |
2463 | C<ev_embeddable_backends> are, which, unfortunately, does not include any |
2408 | portable one. |
2464 | portable one. |
2409 | |
2465 | |
… | |
… | |
2629 | =over 4 |
2685 | =over 4 |
2630 | |
2686 | |
2631 | =item ev_async_init (ev_async *, callback) |
2687 | =item ev_async_init (ev_async *, callback) |
2632 | |
2688 | |
2633 | Initialises and configures the async watcher - it has no parameters of any |
2689 | Initialises and configures the async watcher - it has no parameters of any |
2634 | kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, |
2690 | kind. There is a C<ev_async_set> macro, but using it is utterly pointless, |
2635 | trust me. |
2691 | trust me. |
2636 | |
2692 | |
2637 | =item ev_async_send (loop, ev_async *) |
2693 | =item ev_async_send (loop, ev_async *) |
2638 | |
2694 | |
2639 | Sends/signals/activates the given C<ev_async> watcher, that is, feeds |
2695 | Sends/signals/activates the given C<ev_async> watcher, that is, feeds |
2640 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
2696 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
2641 | C<ev_feed_event>, this call is safe to do from other threads, signal or |
2697 | C<ev_feed_event>, this call is safe to do from other threads, signal or |
2642 | similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding |
2698 | similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding |
2643 | section below on what exactly this means). |
2699 | section below on what exactly this means). |
2644 | |
2700 | |
|
|
2701 | Note that, as with other watchers in libev, multiple events might get |
|
|
2702 | compressed into a single callback invocation (another way to look at this |
|
|
2703 | is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>, |
|
|
2704 | reset when the event loop detects that). |
|
|
2705 | |
2645 | This call incurs the overhead of a system call only once per loop iteration, |
2706 | This call incurs the overhead of a system call only once per event loop |
2646 | so while the overhead might be noticeable, it doesn't apply to repeated |
2707 | iteration, so while the overhead might be noticeable, it doesn't apply to |
2647 | calls to C<ev_async_send>. |
2708 | repeated calls to C<ev_async_send> for the same event loop. |
2648 | |
2709 | |
2649 | =item bool = ev_async_pending (ev_async *) |
2710 | =item bool = ev_async_pending (ev_async *) |
2650 | |
2711 | |
2651 | Returns a non-zero value when C<ev_async_send> has been called on the |
2712 | Returns a non-zero value when C<ev_async_send> has been called on the |
2652 | watcher but the event has not yet been processed (or even noted) by the |
2713 | watcher but the event has not yet been processed (or even noted) by the |
… | |
… | |
2655 | C<ev_async_send> sets a flag in the watcher and wakes up the loop. When |
2716 | C<ev_async_send> sets a flag in the watcher and wakes up the loop. When |
2656 | the loop iterates next and checks for the watcher to have become active, |
2717 | the loop iterates next and checks for the watcher to have become active, |
2657 | it will reset the flag again. C<ev_async_pending> can be used to very |
2718 | it will reset the flag again. C<ev_async_pending> can be used to very |
2658 | quickly check whether invoking the loop might be a good idea. |
2719 | quickly check whether invoking the loop might be a good idea. |
2659 | |
2720 | |
2660 | Not that this does I<not> check whether the watcher itself is pending, only |
2721 | Not that this does I<not> check whether the watcher itself is pending, |
2661 | whether it has been requested to make this watcher pending. |
2722 | only whether it has been requested to make this watcher pending: there |
|
|
2723 | is a time window between the event loop checking and resetting the async |
|
|
2724 | notification, and the callback being invoked. |
2662 | |
2725 | |
2663 | =back |
2726 | =back |
2664 | |
2727 | |
2665 | |
2728 | |
2666 | =head1 OTHER FUNCTIONS |
2729 | =head1 OTHER FUNCTIONS |
… | |
… | |
2845 | |
2908 | |
2846 | myclass obj; |
2909 | myclass obj; |
2847 | ev::io iow; |
2910 | ev::io iow; |
2848 | iow.set <myclass, &myclass::io_cb> (&obj); |
2911 | iow.set <myclass, &myclass::io_cb> (&obj); |
2849 | |
2912 | |
|
|
2913 | =item w->set (object *) |
|
|
2914 | |
|
|
2915 | This is an B<experimental> feature that might go away in a future version. |
|
|
2916 | |
|
|
2917 | This is a variation of a method callback - leaving out the method to call |
|
|
2918 | will default the method to C<operator ()>, which makes it possible to use |
|
|
2919 | functor objects without having to manually specify the C<operator ()> all |
|
|
2920 | the time. Incidentally, you can then also leave out the template argument |
|
|
2921 | list. |
|
|
2922 | |
|
|
2923 | The C<operator ()> method prototype must be C<void operator ()(watcher &w, |
|
|
2924 | int revents)>. |
|
|
2925 | |
|
|
2926 | See the method-C<set> above for more details. |
|
|
2927 | |
|
|
2928 | Example: use a functor object as callback. |
|
|
2929 | |
|
|
2930 | struct myfunctor |
|
|
2931 | { |
|
|
2932 | void operator() (ev::io &w, int revents) |
|
|
2933 | { |
|
|
2934 | ... |
|
|
2935 | } |
|
|
2936 | } |
|
|
2937 | |
|
|
2938 | myfunctor f; |
|
|
2939 | |
|
|
2940 | ev::io w; |
|
|
2941 | w.set (&f); |
|
|
2942 | |
2850 | =item w->set<function> (void *data = 0) |
2943 | =item w->set<function> (void *data = 0) |
2851 | |
2944 | |
2852 | Also sets a callback, but uses a static method or plain function as |
2945 | Also sets a callback, but uses a static method or plain function as |
2853 | callback. The optional C<data> argument will be stored in the watcher's |
2946 | callback. The optional C<data> argument will be stored in the watcher's |
2854 | C<data> member and is free for you to use. |
2947 | C<data> member and is free for you to use. |
… | |
… | |
2953 | Tony Arcieri has written a ruby extension that offers access to a subset |
3046 | Tony Arcieri has written a ruby extension that offers access to a subset |
2954 | of the libev API and adds file handle abstractions, asynchronous DNS and |
3047 | of the libev API and adds file handle abstractions, asynchronous DNS and |
2955 | more on top of it. It can be found via gem servers. Its homepage is at |
3048 | more on top of it. It can be found via gem servers. Its homepage is at |
2956 | L<http://rev.rubyforge.org/>. |
3049 | L<http://rev.rubyforge.org/>. |
2957 | |
3050 | |
|
|
3051 | Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190> |
|
|
3052 | makes rev work even on mingw. |
|
|
3053 | |
2958 | =item D |
3054 | =item D |
2959 | |
3055 | |
2960 | Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to |
3056 | Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to |
2961 | be found at L<http://proj.llucax.com.ar/wiki/evd>. |
3057 | be found at L<http://proj.llucax.com.ar/wiki/evd>. |
2962 | |
3058 | |
… | |
… | |
3072 | |
3168 | |
3073 | #define EV_STANDALONE 1 |
3169 | #define EV_STANDALONE 1 |
3074 | #include "ev.h" |
3170 | #include "ev.h" |
3075 | |
3171 | |
3076 | Both header files and implementation files can be compiled with a C++ |
3172 | Both header files and implementation files can be compiled with a C++ |
3077 | compiler (at least, thats a stated goal, and breakage will be treated |
3173 | compiler (at least, that's a stated goal, and breakage will be treated |
3078 | as a bug). |
3174 | as a bug). |
3079 | |
3175 | |
3080 | You need the following files in your source tree, or in a directory |
3176 | You need the following files in your source tree, or in a directory |
3081 | in your include path (e.g. in libev/ when using -Ilibev): |
3177 | in your include path (e.g. in libev/ when using -Ilibev): |
3082 | |
3178 | |
… | |
… | |
3138 | keeps libev from including F<config.h>, and it also defines dummy |
3234 | keeps libev from including F<config.h>, and it also defines dummy |
3139 | implementations for some libevent functions (such as logging, which is not |
3235 | implementations for some libevent functions (such as logging, which is not |
3140 | supported). It will also not define any of the structs usually found in |
3236 | supported). It will also not define any of the structs usually found in |
3141 | F<event.h> that are not directly supported by the libev core alone. |
3237 | F<event.h> that are not directly supported by the libev core alone. |
3142 | |
3238 | |
|
|
3239 | In stanbdalone mode, libev will still try to automatically deduce the |
|
|
3240 | configuration, but has to be more conservative. |
|
|
3241 | |
3143 | =item EV_USE_MONOTONIC |
3242 | =item EV_USE_MONOTONIC |
3144 | |
3243 | |
3145 | If defined to be C<1>, libev will try to detect the availability of the |
3244 | If defined to be C<1>, libev will try to detect the availability of the |
3146 | monotonic clock option at both compile time and runtime. Otherwise no use |
3245 | monotonic clock option at both compile time and runtime. Otherwise no |
3147 | of the monotonic clock option will be attempted. If you enable this, you |
3246 | use of the monotonic clock option will be attempted. If you enable this, |
3148 | usually have to link against librt or something similar. Enabling it when |
3247 | you usually have to link against librt or something similar. Enabling it |
3149 | the functionality isn't available is safe, though, although you have |
3248 | when the functionality isn't available is safe, though, although you have |
3150 | to make sure you link against any libraries where the C<clock_gettime> |
3249 | to make sure you link against any libraries where the C<clock_gettime> |
3151 | function is hiding in (often F<-lrt>). |
3250 | function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>. |
3152 | |
3251 | |
3153 | =item EV_USE_REALTIME |
3252 | =item EV_USE_REALTIME |
3154 | |
3253 | |
3155 | If defined to be C<1>, libev will try to detect the availability of the |
3254 | If defined to be C<1>, libev will try to detect the availability of the |
3156 | real-time clock option at compile time (and assume its availability at |
3255 | real-time clock option at compile time (and assume its availability |
3157 | runtime if successful). Otherwise no use of the real-time clock option will |
3256 | at runtime if successful). Otherwise no use of the real-time clock |
3158 | be attempted. This effectively replaces C<gettimeofday> by C<clock_get |
3257 | option will be attempted. This effectively replaces C<gettimeofday> |
3159 | (CLOCK_REALTIME, ...)> and will not normally affect correctness. See the |
3258 | by C<clock_get (CLOCK_REALTIME, ...)> and will not normally affect |
3160 | note about libraries in the description of C<EV_USE_MONOTONIC>, though. |
3259 | correctness. See the note about libraries in the description of |
|
|
3260 | C<EV_USE_MONOTONIC>, though. Defaults to the opposite value of |
|
|
3261 | C<EV_USE_CLOCK_SYSCALL>. |
|
|
3262 | |
|
|
3263 | =item EV_USE_CLOCK_SYSCALL |
|
|
3264 | |
|
|
3265 | If defined to be C<1>, libev will try to use a direct syscall instead |
|
|
3266 | of calling the system-provided C<clock_gettime> function. This option |
|
|
3267 | exists because on GNU/Linux, C<clock_gettime> is in C<librt>, but C<librt> |
|
|
3268 | unconditionally pulls in C<libpthread>, slowing down single-threaded |
|
|
3269 | programs needlessly. Using a direct syscall is slightly slower (in |
|
|
3270 | theory), because no optimised vdso implementation can be used, but avoids |
|
|
3271 | the pthread dependency. Defaults to C<1> on GNU/Linux with glibc 2.x or |
|
|
3272 | higher, as it simplifies linking (no need for C<-lrt>). |
3161 | |
3273 | |
3162 | =item EV_USE_NANOSLEEP |
3274 | =item EV_USE_NANOSLEEP |
3163 | |
3275 | |
3164 | If defined to be C<1>, libev will assume that C<nanosleep ()> is available |
3276 | If defined to be C<1>, libev will assume that C<nanosleep ()> is available |
3165 | and will use it for delays. Otherwise it will use C<select ()>. |
3277 | and will use it for delays. Otherwise it will use C<select ()>. |
… | |
… | |
3181 | |
3293 | |
3182 | =item EV_SELECT_USE_FD_SET |
3294 | =item EV_SELECT_USE_FD_SET |
3183 | |
3295 | |
3184 | If defined to C<1>, then the select backend will use the system C<fd_set> |
3296 | If defined to C<1>, then the select backend will use the system C<fd_set> |
3185 | structure. This is useful if libev doesn't compile due to a missing |
3297 | structure. This is useful if libev doesn't compile due to a missing |
3186 | C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on |
3298 | C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout |
3187 | exotic systems. This usually limits the range of file descriptors to some |
3299 | on exotic systems. This usually limits the range of file descriptors to |
3188 | low limit such as 1024 or might have other limitations (winsocket only |
3300 | some low limit such as 1024 or might have other limitations (winsocket |
3189 | allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might |
3301 | only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, |
3190 | influence the size of the C<fd_set> used. |
3302 | configures the maximum size of the C<fd_set>. |
3191 | |
3303 | |
3192 | =item EV_SELECT_IS_WINSOCKET |
3304 | =item EV_SELECT_IS_WINSOCKET |
3193 | |
3305 | |
3194 | When defined to C<1>, the select backend will assume that |
3306 | When defined to C<1>, the select backend will assume that |
3195 | select/socket/connect etc. don't understand file descriptors but |
3307 | select/socket/connect etc. don't understand file descriptors but |
… | |
… | |
3554 | loop, as long as you don't confuse yourself). The only exception is that |
3666 | loop, as long as you don't confuse yourself). The only exception is that |
3555 | you must not do this from C<ev_periodic> reschedule callbacks. |
3667 | you must not do this from C<ev_periodic> reschedule callbacks. |
3556 | |
3668 | |
3557 | Care has been taken to ensure that libev does not keep local state inside |
3669 | Care has been taken to ensure that libev does not keep local state inside |
3558 | C<ev_loop>, and other calls do not usually allow for coroutine switches as |
3670 | C<ev_loop>, and other calls do not usually allow for coroutine switches as |
3559 | they do not clal any callbacks. |
3671 | they do not call any callbacks. |
3560 | |
3672 | |
3561 | =head2 COMPILER WARNINGS |
3673 | =head2 COMPILER WARNINGS |
3562 | |
3674 | |
3563 | Depending on your compiler and compiler settings, you might get no or a |
3675 | Depending on your compiler and compiler settings, you might get no or a |
3564 | lot of warnings when compiling libev code. Some people are apparently |
3676 | lot of warnings when compiling libev code. Some people are apparently |
… | |
… | |
3598 | ==2274== definitely lost: 0 bytes in 0 blocks. |
3710 | ==2274== definitely lost: 0 bytes in 0 blocks. |
3599 | ==2274== possibly lost: 0 bytes in 0 blocks. |
3711 | ==2274== possibly lost: 0 bytes in 0 blocks. |
3600 | ==2274== still reachable: 256 bytes in 1 blocks. |
3712 | ==2274== still reachable: 256 bytes in 1 blocks. |
3601 | |
3713 | |
3602 | Then there is no memory leak, just as memory accounted to global variables |
3714 | Then there is no memory leak, just as memory accounted to global variables |
3603 | is not a memleak - the memory is still being refernced, and didn't leak. |
3715 | is not a memleak - the memory is still being referenced, and didn't leak. |
3604 | |
3716 | |
3605 | Similarly, under some circumstances, valgrind might report kernel bugs |
3717 | Similarly, under some circumstances, valgrind might report kernel bugs |
3606 | as if it were a bug in libev (e.g. in realloc or in the poll backend, |
3718 | as if it were a bug in libev (e.g. in realloc or in the poll backend, |
3607 | although an acceptable workaround has been found here), or it might be |
3719 | although an acceptable workaround has been found here), or it might be |
3608 | confused. |
3720 | confused. |
… | |
… | |
3846 | =back |
3958 | =back |
3847 | |
3959 | |
3848 | |
3960 | |
3849 | =head1 AUTHOR |
3961 | =head1 AUTHOR |
3850 | |
3962 | |
3851 | Marc Lehmann <libev@schmorp.de>. |
3963 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
3852 | |
3964 | |