… | |
… | |
298 | If you don't know what event loop to use, use the one returned from this |
298 | If you don't know what event loop to use, use the one returned from this |
299 | function. |
299 | function. |
300 | |
300 | |
301 | Note that this function is I<not> thread-safe, so if you want to use it |
301 | 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, |
302 | from multiple threads, you have to lock (note also that this is unlikely, |
303 | as loops cannot bes hared easily between threads anyway). |
303 | as loops cannot be shared easily between threads anyway). |
304 | |
304 | |
305 | The default loop is the only loop that can handle C<ev_signal> and |
305 | 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 |
306 | 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 |
307 | 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 |
308 | create a dynamic loop with C<ev_loop_new> that doesn't do that, or you |
… | |
… | |
386 | For few fds, this backend is a bit little slower than poll and select, |
386 | 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 |
387 | 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), |
388 | 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). |
389 | epoll scales either O(1) or O(active_fds). |
390 | |
390 | |
391 | The epoll syscalls are the most misdesigned of the more advanced event |
391 | The epoll mechanism deserves honorable mention as the most misdesigned |
392 | mechanisms: problems include silently dropping fds, requiring a system |
392 | of the more advanced event mechanisms: mere annoyances include silently |
393 | call per change per fd (and unnecessary guessing of parameters), problems |
393 | dropping file descriptors, requiring a system call per change per file |
|
|
394 | descriptor (and unnecessary guessing of parameters), problems with dup and |
394 | with dup and so on. The biggest issue is fork races, however - if a |
395 | so on. The biggest issue is fork races, however - if a program forks then |
395 | program forks then I<both> parent and child process have to recreate the |
396 | I<both> parent and child process have to recreate the epoll set, which can |
396 | epoll set, which can take considerable time (one syscall per fd) and is of |
397 | take considerable time (one syscall per file descriptor) and is of course |
397 | course hard to detect. |
398 | hard to detect. |
398 | |
399 | |
399 | Epoll is also notoriously buggy - embedding epoll fds should work, but |
400 | Epoll is also notoriously buggy - embedding epoll fds I<should> work, but |
400 | of course doesn't, and epoll just loves to report events for totally |
401 | of course I<doesn't>, and epoll just loves to report events for totally |
401 | I<different> file descriptors (even already closed ones, so one cannot |
402 | I<different> file descriptors (even already closed ones, so one cannot |
402 | even remove them from the set) than registered in the set (especially |
403 | even remove them from the set) than registered in the set (especially |
403 | on SMP systems). Libev tries to counter these spurious notifications by |
404 | on SMP systems). Libev tries to counter these spurious notifications by |
404 | employing an additional generation counter and comparing that against the |
405 | employing an additional generation counter and comparing that against the |
405 | events to filter out spurious ones. |
406 | events to filter out spurious ones, recreating the set when required. |
406 | |
407 | |
407 | While stopping, setting and starting an I/O watcher in the same iteration |
408 | While stopping, setting and starting an I/O watcher in the same iteration |
408 | will result in some caching, there is still a system call per such incident |
409 | will result in some caching, there is still a system call per such |
409 | (because the fd could point to a different file description now), so its |
410 | incident (because the same I<file descriptor> could point to a different |
410 | best to avoid that. Also, C<dup ()>'ed file descriptors might not work |
411 | I<file description> now), so its best to avoid that. Also, C<dup ()>'ed |
411 | very well if you register events for both fds. |
412 | file descriptors might not work very well if you register events for both |
|
|
413 | file descriptors. |
412 | |
414 | |
413 | Best performance from this backend is achieved by not unregistering all |
415 | Best performance from this backend is achieved by not unregistering all |
414 | watchers for a file descriptor until it has been closed, if possible, |
416 | watchers for a file descriptor until it has been closed, if possible, |
415 | i.e. keep at least one watcher active per fd at all times. Stopping and |
417 | i.e. keep at least one watcher active per fd at all times. Stopping and |
416 | starting a watcher (without re-setting it) also usually doesn't cause |
418 | starting a watcher (without re-setting it) also usually doesn't cause |
… | |
… | |
424 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
426 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
425 | C<EVBACKEND_POLL>. |
427 | C<EVBACKEND_POLL>. |
426 | |
428 | |
427 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
429 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
428 | |
430 | |
429 | Kqueue deserves special mention, as at the time of this writing, it was |
431 | Kqueue deserves special mention, as at the time of this writing, it |
430 | broken on all BSDs except NetBSD (usually it doesn't work reliably with |
432 | was broken on all BSDs except NetBSD (usually it doesn't work reliably |
431 | anything but sockets and pipes, except on Darwin, where of course it's |
433 | with anything but sockets and pipes, except on Darwin, where of course |
432 | completely useless). For this reason it's not being "auto-detected" unless |
434 | it's completely useless). Unlike epoll, however, whose brokenness |
433 | you explicitly specify it in the flags (i.e. using C<EVBACKEND_KQUEUE>) or |
435 | is by design, these kqueue bugs can (and eventually will) be fixed |
434 | libev was compiled on a known-to-be-good (-enough) system like NetBSD. |
436 | without API changes to existing programs. For this reason it's not being |
|
|
437 | "auto-detected" unless you explicitly specify it in the flags (i.e. using |
|
|
438 | C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) |
|
|
439 | system like NetBSD. |
435 | |
440 | |
436 | You still can embed kqueue into a normal poll or select backend and use it |
441 | You still can embed kqueue into a normal poll or select backend and use it |
437 | only for sockets (after having made sure that sockets work with kqueue on |
442 | only for sockets (after having made sure that sockets work with kqueue on |
438 | the target platform). See C<ev_embed> watchers for more info. |
443 | the target platform). See C<ev_embed> watchers for more info. |
439 | |
444 | |
… | |
… | |
647 | the loop. |
652 | the loop. |
648 | |
653 | |
649 | A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if |
654 | A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if |
650 | necessary) and will handle those and any already outstanding ones. It |
655 | necessary) and will handle those and any already outstanding ones. It |
651 | will block your process until at least one new event arrives (which could |
656 | will block your process until at least one new event arrives (which could |
652 | be an event internal to libev itself, so there is no guarentee that a |
657 | be an event internal to libev itself, so there is no guarantee that a |
653 | user-registered callback will be called), and will return after one |
658 | user-registered callback will be called), and will return after one |
654 | iteration of the loop. |
659 | iteration of the loop. |
655 | |
660 | |
656 | This is useful if you are waiting for some external event in conjunction |
661 | This is useful if you are waiting for some external event in conjunction |
657 | with something not expressible using other libev watchers (i.e. "roll your |
662 | with something not expressible using other libev watchers (i.e. "roll your |
… | |
… | |
1922 | |
1927 | |
1923 | |
1928 | |
1924 | =head2 C<ev_stat> - did the file attributes just change? |
1929 | =head2 C<ev_stat> - did the file attributes just change? |
1925 | |
1930 | |
1926 | This watches a file system path for attribute changes. That is, it calls |
1931 | This watches a file system path for attribute changes. That is, it calls |
1927 | C<stat> regularly (or when the OS says it changed) and sees if it changed |
1932 | C<stat> on that path in regular intervals (or when the OS says it changed) |
1928 | compared to the last time, invoking the callback if it did. |
1933 | and sees if it changed compared to the last time, invoking the callback if |
|
|
1934 | it did. |
1929 | |
1935 | |
1930 | The path does not need to exist: changing from "path exists" to "path does |
1936 | The path does not need to exist: changing from "path exists" to "path does |
1931 | not exist" is a status change like any other. The condition "path does |
1937 | not exist" is a status change like any other. The condition "path does |
1932 | not exist" is signified by the C<st_nlink> field being zero (which is |
1938 | not exist" is signified by the C<st_nlink> field being zero (which is |
1933 | otherwise always forced to be at least one) and all the other fields of |
1939 | otherwise always forced to be at least one) and all the other fields of |
1934 | the stat buffer having unspecified contents. |
1940 | the stat buffer having unspecified contents. |
1935 | |
1941 | |
1936 | The path I<should> be absolute and I<must not> end in a slash. If it is |
1942 | The path I<must not> end in a slash or contain special components such as |
|
|
1943 | C<.> or C<..>. The path I<should> be absolute: If it is relative and |
1937 | relative and your working directory changes, the behaviour is undefined. |
1944 | your working directory changes, then the behaviour is undefined. |
1938 | |
1945 | |
1939 | Since there is no standard kernel interface to do this, the portable |
1946 | Since there is no portable change notification interface available, the |
1940 | implementation simply calls C<stat (2)> regularly on the path to see if |
1947 | portable implementation simply calls C<stat(2)> regularly on the path |
1941 | it changed somehow. You can specify a recommended polling interval for |
1948 | to see if it changed somehow. You can specify a recommended polling |
1942 | this case. If you specify a polling interval of C<0> (highly recommended!) |
1949 | interval for this case. If you specify a polling interval of C<0> (highly |
1943 | then a I<suitable, unspecified default> value will be used (which |
1950 | recommended!) then a I<suitable, unspecified default> value will be used |
1944 | you can expect to be around five seconds, although this might change |
1951 | (which you can expect to be around five seconds, although this might |
1945 | dynamically). Libev will also impose a minimum interval which is currently |
1952 | change dynamically). Libev will also impose a minimum interval which is |
1946 | around C<0.1>, but thats usually overkill. |
1953 | currently around C<0.1>, but that's usually overkill. |
1947 | |
1954 | |
1948 | This watcher type is not meant for massive numbers of stat watchers, |
1955 | This watcher type is not meant for massive numbers of stat watchers, |
1949 | as even with OS-supported change notifications, this can be |
1956 | as even with OS-supported change notifications, this can be |
1950 | resource-intensive. |
1957 | resource-intensive. |
1951 | |
1958 | |
… | |
… | |
1961 | support disabled by default, you get the 32 bit version of the stat |
1968 | support disabled by default, you get the 32 bit version of the stat |
1962 | structure. When using the library from programs that change the ABI to |
1969 | structure. When using the library from programs that change the ABI to |
1963 | use 64 bit file offsets the programs will fail. In that case you have to |
1970 | use 64 bit file offsets the programs will fail. In that case you have to |
1964 | compile libev with the same flags to get binary compatibility. This is |
1971 | compile libev with the same flags to get binary compatibility. This is |
1965 | obviously the case with any flags that change the ABI, but the problem is |
1972 | obviously the case with any flags that change the ABI, but the problem is |
1966 | most noticeably disabled with ev_stat and large file support. |
1973 | most noticeably displayed with ev_stat and large file support. |
1967 | |
1974 | |
1968 | The solution for this is to lobby your distribution maker to make large |
1975 | The solution for this is to lobby your distribution maker to make large |
1969 | file interfaces available by default (as e.g. FreeBSD does) and not |
1976 | file interfaces available by default (as e.g. FreeBSD does) and not |
1970 | optional. Libev cannot simply switch on large file support because it has |
1977 | optional. Libev cannot simply switch on large file support because it has |
1971 | to exchange stat structures with application programs compiled using the |
1978 | to exchange stat structures with application programs compiled using the |
… | |
… | |
1990 | descriptor open on the object at all times, and detecting renames, unlinks |
1997 | descriptor open on the object at all times, and detecting renames, unlinks |
1991 | etc. is difficult. |
1998 | etc. is difficult. |
1992 | |
1999 | |
1993 | =head3 The special problem of stat time resolution |
2000 | =head3 The special problem of stat time resolution |
1994 | |
2001 | |
1995 | The C<stat ()> system call only supports full-second resolution portably, and |
2002 | The C<stat ()> system call only supports full-second resolution portably, |
1996 | even on systems where the resolution is higher, most file systems still |
2003 | and even on systems where the resolution is higher, most file systems |
1997 | only support whole seconds. |
2004 | still only support whole seconds. |
1998 | |
2005 | |
1999 | That means that, if the time is the only thing that changes, you can |
2006 | That means that, if the time is the only thing that changes, you can |
2000 | easily miss updates: on the first update, C<ev_stat> detects a change and |
2007 | easily miss updates: on the first update, C<ev_stat> detects a change and |
2001 | calls your callback, which does something. When there is another update |
2008 | calls your callback, which does something. When there is another update |
2002 | within the same second, C<ev_stat> will be unable to detect unless the |
2009 | within the same second, C<ev_stat> will be unable to detect unless the |
… | |
… | |
2641 | =over 4 |
2648 | =over 4 |
2642 | |
2649 | |
2643 | =item ev_async_init (ev_async *, callback) |
2650 | =item ev_async_init (ev_async *, callback) |
2644 | |
2651 | |
2645 | Initialises and configures the async watcher - it has no parameters of any |
2652 | Initialises and configures the async watcher - it has no parameters of any |
2646 | kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, |
2653 | kind. There is a C<ev_async_set> macro, but using it is utterly pointless, |
2647 | trust me. |
2654 | trust me. |
2648 | |
2655 | |
2649 | =item ev_async_send (loop, ev_async *) |
2656 | =item ev_async_send (loop, ev_async *) |
2650 | |
2657 | |
2651 | Sends/signals/activates the given C<ev_async> watcher, that is, feeds |
2658 | Sends/signals/activates the given C<ev_async> watcher, that is, feeds |
… | |
… | |
3084 | |
3091 | |
3085 | #define EV_STANDALONE 1 |
3092 | #define EV_STANDALONE 1 |
3086 | #include "ev.h" |
3093 | #include "ev.h" |
3087 | |
3094 | |
3088 | Both header files and implementation files can be compiled with a C++ |
3095 | Both header files and implementation files can be compiled with a C++ |
3089 | compiler (at least, thats a stated goal, and breakage will be treated |
3096 | compiler (at least, that's a stated goal, and breakage will be treated |
3090 | as a bug). |
3097 | as a bug). |
3091 | |
3098 | |
3092 | You need the following files in your source tree, or in a directory |
3099 | You need the following files in your source tree, or in a directory |
3093 | in your include path (e.g. in libev/ when using -Ilibev): |
3100 | in your include path (e.g. in libev/ when using -Ilibev): |
3094 | |
3101 | |
… | |
… | |
3566 | loop, as long as you don't confuse yourself). The only exception is that |
3573 | loop, as long as you don't confuse yourself). The only exception is that |
3567 | you must not do this from C<ev_periodic> reschedule callbacks. |
3574 | you must not do this from C<ev_periodic> reschedule callbacks. |
3568 | |
3575 | |
3569 | Care has been taken to ensure that libev does not keep local state inside |
3576 | Care has been taken to ensure that libev does not keep local state inside |
3570 | C<ev_loop>, and other calls do not usually allow for coroutine switches as |
3577 | C<ev_loop>, and other calls do not usually allow for coroutine switches as |
3571 | they do not clal any callbacks. |
3578 | they do not call any callbacks. |
3572 | |
3579 | |
3573 | =head2 COMPILER WARNINGS |
3580 | =head2 COMPILER WARNINGS |
3574 | |
3581 | |
3575 | Depending on your compiler and compiler settings, you might get no or a |
3582 | Depending on your compiler and compiler settings, you might get no or a |
3576 | lot of warnings when compiling libev code. Some people are apparently |
3583 | lot of warnings when compiling libev code. Some people are apparently |
… | |
… | |
3610 | ==2274== definitely lost: 0 bytes in 0 blocks. |
3617 | ==2274== definitely lost: 0 bytes in 0 blocks. |
3611 | ==2274== possibly lost: 0 bytes in 0 blocks. |
3618 | ==2274== possibly lost: 0 bytes in 0 blocks. |
3612 | ==2274== still reachable: 256 bytes in 1 blocks. |
3619 | ==2274== still reachable: 256 bytes in 1 blocks. |
3613 | |
3620 | |
3614 | Then there is no memory leak, just as memory accounted to global variables |
3621 | Then there is no memory leak, just as memory accounted to global variables |
3615 | is not a memleak - the memory is still being refernced, and didn't leak. |
3622 | is not a memleak - the memory is still being referenced, and didn't leak. |
3616 | |
3623 | |
3617 | Similarly, under some circumstances, valgrind might report kernel bugs |
3624 | Similarly, under some circumstances, valgrind might report kernel bugs |
3618 | as if it were a bug in libev (e.g. in realloc or in the poll backend, |
3625 | as if it were a bug in libev (e.g. in realloc or in the poll backend, |
3619 | although an acceptable workaround has been found here), or it might be |
3626 | although an acceptable workaround has been found here), or it might be |
3620 | confused. |
3627 | confused. |
… | |
… | |
3858 | =back |
3865 | =back |
3859 | |
3866 | |
3860 | |
3867 | |
3861 | =head1 AUTHOR |
3868 | =head1 AUTHOR |
3862 | |
3869 | |
3863 | Marc Lehmann <libev@schmorp.de>. |
3870 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
3864 | |
3871 | |