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

Comparing libev/ev.pod (file contents):
Revision 1.210 by root, Thu Oct 30 08:09:30 2008 UTC vs.
Revision 1.228 by root, Sat Mar 28 08:22:30 2009 UTC

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);
418starting a watcher (without re-setting it) also usually doesn't cause 420starting a watcher (without re-setting it) also usually doesn't cause
419extra overhead. A fork can both result in spurious notifications as well 421extra overhead. A fork can both result in spurious notifications as well
420as in libev having to destroy and recreate the epoll object, which can 422as in libev having to destroy and recreate the epoll object, which can
421take considerable time and thus should be avoided. 423take considerable time and thus should be avoided.
422 424
425All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
426faster than epoll for maybe up to a hundred file descriptors, depending on
427the usage. So sad.
428
423While nominally embeddable in other event loops, this feature is broken in 429While nominally embeddable in other event loops, this feature is broken in
424all kernel versions tested so far. 430all kernel versions tested so far.
425 431
426This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 432This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
427C<EVBACKEND_POLL>. 433C<EVBACKEND_POLL>.
454 460
455While nominally embeddable in other event loops, this doesn't work 461While nominally embeddable in other event loops, this doesn't work
456everywhere, so you might need to test for this. And since it is broken 462everywhere, so you might need to test for this. And since it is broken
457almost everywhere, you should only use it when you have a lot of sockets 463almost everywhere, you should only use it when you have a lot of sockets
458(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
459(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
460using it only for sockets. 466also broken on OS X)) and, did I mention it, using it only for sockets.
461 467
462This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with 468This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with
463C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with 469C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with
464C<NOTE_EOF>. 470C<NOTE_EOF>.
465 471
1415 else 1421 else
1416 { 1422 {
1417 // callback was invoked, but there was some activity, re-arm 1423 // callback was invoked, but there was some activity, re-arm
1418 // the watcher to fire in last_activity + 60, which is 1424 // the watcher to fire in last_activity + 60, which is
1419 // guaranteed to be in the future, so "again" is positive: 1425 // guaranteed to be in the future, so "again" is positive:
1420 w->again = timeout - now; 1426 w->repeat = timeout - now;
1421 ev_timer_again (EV_A_ w); 1427 ev_timer_again (EV_A_ w);
1422 } 1428 }
1423 } 1429 }
1424 1430
1425To summarise the callback: first calculate the real timeout (defined 1431To summarise the callback: first calculate the real timeout (defined
1590=head2 C<ev_periodic> - to cron or not to cron? 1596=head2 C<ev_periodic> - to cron or not to cron?
1591 1597
1592Periodic watchers are also timers of a kind, but they are very versatile 1598Periodic watchers are also timers of a kind, but they are very versatile
1593(and unfortunately a bit complex). 1599(and unfortunately a bit complex).
1594 1600
1595Unlike C<ev_timer>'s, they are not based on real time (or relative time) 1601Unlike C<ev_timer>, periodic watchers are not based on real time (or
1596but on wall clock time (absolute time). You can tell a periodic watcher 1602relative time, the physical time that passes) but on wall clock time
1597to 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
1598periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now () 1604difference is that wall clock time can run faster or slower than real
1599+ 10.>, that is, an absolute time not a delay) and then reset your system 1605time, and time jumps are not uncommon (e.g. when you adjust your
1600clock to January of the previous year, then it will take more than year 1606wrist-watch).
1601to trigger the event (unlike an C<ev_timer>, which would still trigger
1602roughly 10 seconds later as it uses a relative timeout).
1603 1607
1608You can tell a periodic watcher to trigger after some specific point
1609in time: for example, if you tell a periodic watcher to trigger "in 10
1610seconds" (by specifying e.g. C<ev_now () + 10.>, that is, an absolute time
1611not a delay) and then reset your system clock to January of the previous
1612year, then it will take a year or more to trigger the event (unlike an
1613C<ev_timer>, which would still trigger roughly 10 seconds after starting
1614it, as it uses a relative timeout).
1615
1604C<ev_periodic>s can also be used to implement vastly more complex timers, 1616C<ev_periodic> watchers can also be used to implement vastly more complex
1605such as triggering an event on each "midnight, local time", or other 1617timers, such as triggering an event on each "midnight, local time", or
1606complicated rules. 1618other complicated rules. This cannot be done with C<ev_timer> watchers, as
1619those cannot react to time jumps.
1607 1620
1608As with timers, the callback is guaranteed to be invoked only when the 1621As with timers, the callback is guaranteed to be invoked only when the
1609time (C<at>) has passed, but if multiple periodic timers become ready 1622point in time where it is supposed to trigger has passed, but if multiple
1610during the same loop iteration, then order of execution is undefined. 1623periodic timers become ready during the same loop iteration, then order of
1624execution is undefined.
1611 1625
1612=head3 Watcher-Specific Functions and Data Members 1626=head3 Watcher-Specific Functions and Data Members
1613 1627
1614=over 4 1628=over 4
1615 1629
1616=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)
1617 1631
1618=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)
1619 1633
1620Lots of arguments, lets sort it out... There are basically three modes of 1634Lots of arguments, let's sort it out... There are basically three modes of
1621operation, and we will explain them from simplest to most complex: 1635operation, and we will explain them from simplest to most complex:
1622 1636
1623=over 4 1637=over 4
1624 1638
1625=item * absolute timer (at = time, interval = reschedule_cb = 0) 1639=item * absolute timer (offset = absolute time, interval = 0, reschedule_cb = 0)
1626 1640
1627In this configuration the watcher triggers an event after the wall clock 1641In this configuration the watcher triggers an event after the wall clock
1628time C<at> has passed. It will not repeat and will not adjust when a time 1642time C<offset> has passed. It will not repeat and will not adjust when a
1629jump occurs, that is, if it is to be run at January 1st 2011 then it will 1643time jump occurs, that is, if it is to be run at January 1st 2011 then it
1630only run when the system clock reaches or surpasses this time. 1644will be stopped and invoked when the system clock reaches or surpasses
1645this point in time.
1631 1646
1632=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)
1633 1648
1634In this mode the watcher will always be scheduled to time out at the next 1649In this mode the watcher will always be scheduled to time out at the next
1635C<at + N * interval> time (for some integer N, which can also be negative) 1650C<offset + N * interval> time (for some integer N, which can also be
1636and then repeat, regardless of any time jumps. 1651negative) and then repeat, regardless of any time jumps. The C<offset>
1652argument is merely an offset into the C<interval> periods.
1637 1653
1638This can be used to create timers that do not drift with respect to the 1654This can be used to create timers that do not drift with respect to the
1639system clock, for example, here is a C<ev_periodic> that triggers each 1655system clock, for example, here is an C<ev_periodic> that triggers each
1640hour, on the hour: 1656hour, on the hour (with respect to UTC):
1641 1657
1642 ev_periodic_set (&periodic, 0., 3600., 0); 1658 ev_periodic_set (&periodic, 0., 3600., 0);
1643 1659
1644This doesn't mean there will always be 3600 seconds in between triggers, 1660This doesn't mean there will always be 3600 seconds in between triggers,
1645but only that the callback will be called when the system time shows a 1661but only that the callback will be called when the system time shows a
1646full hour (UTC), or more correctly, when the system time is evenly divisible 1662full hour (UTC), or more correctly, when the system time is evenly divisible
1647by 3600. 1663by 3600.
1648 1664
1649Another way to think about it (for the mathematically inclined) is that 1665Another way to think about it (for the mathematically inclined) is that
1650C<ev_periodic> will try to run the callback in this mode at the next possible 1666C<ev_periodic> will try to run the callback in this mode at the next possible
1651time where C<time = at (mod interval)>, regardless of any time jumps. 1667time where C<time = offset (mod interval)>, regardless of any time jumps.
1652 1668
1653For numerical stability it is preferable that the C<at> value is near 1669For numerical stability it is preferable that the C<offset> value is near
1654C<ev_now ()> (the current time), but there is no range requirement for 1670C<ev_now ()> (the current time), but there is no range requirement for
1655this value, and in fact is often specified as zero. 1671this value, and in fact is often specified as zero.
1656 1672
1657Note also that there is an upper limit to how often a timer can fire (CPU 1673Note also that there is an upper limit to how often a timer can fire (CPU
1658speed for example), so if C<interval> is very small then timing stability 1674speed for example), so if C<interval> is very small then timing stability
1659will of course deteriorate. Libev itself tries to be exact to be about one 1675will of course deteriorate. Libev itself tries to be exact to be about one
1660millisecond (if the OS supports it and the machine is fast enough). 1676millisecond (if the OS supports it and the machine is fast enough).
1661 1677
1662=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) 1678=item * manual reschedule mode (offset ignored, interval ignored, reschedule_cb = callback)
1663 1679
1664In this mode the values for C<interval> and C<at> are both being 1680In this mode the values for C<interval> and C<offset> are both being
1665ignored. Instead, each time the periodic watcher gets scheduled, the 1681ignored. Instead, each time the periodic watcher gets scheduled, the
1666reschedule callback will be called with the watcher as first, and the 1682reschedule callback will be called with the watcher as first, and the
1667current time as second argument. 1683current time as second argument.
1668 1684
1669NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1685NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, ever,
1670ever, or make ANY event loop modifications whatsoever>. 1686or make ANY other event loop modifications whatsoever, unless explicitly
1687allowed by documentation here>.
1671 1688
1672If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop 1689If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
1673it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the 1690it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
1674only event loop modification you are allowed to do). 1691only event loop modification you are allowed to do).
1675 1692
1705a different time than the last time it was called (e.g. in a crond like 1722a different time than the last time it was called (e.g. in a crond like
1706program when the crontabs have changed). 1723program when the crontabs have changed).
1707 1724
1708=item ev_tstamp ev_periodic_at (ev_periodic *) 1725=item ev_tstamp ev_periodic_at (ev_periodic *)
1709 1726
1710When active, returns the absolute time that the watcher is supposed to 1727When active, returns the absolute time that the watcher is supposed
1711trigger next. 1728to trigger next. This is not the same as the C<offset> argument to
1729C<ev_periodic_set>, but indeed works even in interval and manual
1730rescheduling modes.
1712 1731
1713=item ev_tstamp offset [read-write] 1732=item ev_tstamp offset [read-write]
1714 1733
1715When repeating, this contains the offset value, otherwise this is the 1734When repeating, this contains the offset value, otherwise this is the
1716absolute point in time (the C<at> value passed to C<ev_periodic_set>). 1735absolute point in time (the C<offset> value passed to C<ev_periodic_set>,
1736although libev might modify this value for better numerical stability).
1717 1737
1718Can be modified any time, but changes only take effect when the periodic 1738Can be modified any time, but changes only take effect when the periodic
1719timer fires or C<ev_periodic_again> is being called. 1739timer fires or C<ev_periodic_again> is being called.
1720 1740
1721=item ev_tstamp interval [read-write] 1741=item ev_tstamp interval [read-write]
1932C<stat> on that path in regular intervals (or when the OS says it changed) 1952C<stat> on that path in regular intervals (or when the OS says it changed)
1933and sees if it changed compared to the last time, invoking the callback if 1953and sees if it changed compared to the last time, invoking the callback if
1934it did. 1954it did.
1935 1955
1936The path does not need to exist: changing from "path exists" to "path does 1956The path does not need to exist: changing from "path exists" to "path does
1937not exist" is a status change like any other. The condition "path does 1957not exist" is a status change like any other. The condition "path does not
1938not exist" is signified by the C<st_nlink> field being zero (which is 1958exist" (or more correctly "path cannot be stat'ed") is signified by the
1939otherwise always forced to be at least one) and all the other fields of 1959C<st_nlink> field being zero (which is otherwise always forced to be at
1940the stat buffer having unspecified contents. 1960least one) and all the other fields of the stat buffer having unspecified
1961contents.
1941 1962
1942The path I<must not> end in a slash or contain special components such as 1963The path I<must not> end in a slash or contain special components such as
1943C<.> or C<..>. The path I<should> be absolute: If it is relative and 1964C<.> or C<..>. The path I<should> be absolute: If it is relative and
1944your working directory changes, then the behaviour is undefined. 1965your working directory changes, then the behaviour is undefined.
1945 1966
1955This watcher type is not meant for massive numbers of stat watchers, 1976This watcher type is not meant for massive numbers of stat watchers,
1956as even with OS-supported change notifications, this can be 1977as even with OS-supported change notifications, this can be
1957resource-intensive. 1978resource-intensive.
1958 1979
1959At the time of this writing, the only OS-specific interface implemented 1980At the time of this writing, the only OS-specific interface implemented
1960is the Linux inotify interface (implementing kqueue support is left as 1981is the Linux inotify interface (implementing kqueue support is left as an
1961an exercise for the reader. Note, however, that the author sees no way 1982exercise for the reader. Note, however, that the author sees no way of
1962of implementing C<ev_stat> semantics with kqueue). 1983implementing C<ev_stat> semantics with kqueue, except as a hint).
1963 1984
1964=head3 ABI Issues (Largefile Support) 1985=head3 ABI Issues (Largefile Support)
1965 1986
1966Libev by default (unless the user overrides this) uses the default 1987Libev by default (unless the user overrides this) uses the default
1967compilation environment, which means that on systems with large file 1988compilation environment, which means that on systems with large file
1978to exchange stat structures with application programs compiled using the 1999to exchange stat structures with application programs compiled using the
1979default compilation environment. 2000default compilation environment.
1980 2001
1981=head3 Inotify and Kqueue 2002=head3 Inotify and Kqueue
1982 2003
1983When C<inotify (7)> support has been compiled into libev (generally 2004When C<inotify (7)> support has been compiled into libev and present at
1984only available with Linux 2.6.25 or above due to bugs in earlier 2005runtime, it will be used to speed up change detection where possible. The
1985implementations) and present at runtime, it will be used to speed up 2006inotify descriptor will be created lazily when the first C<ev_stat>
1986change detection where possible. The inotify descriptor will be created 2007watcher is being started.
1987lazily when the first C<ev_stat> watcher is being started.
1988 2008
1989Inotify presence does not change the semantics of C<ev_stat> watchers 2009Inotify presence does not change the semantics of C<ev_stat> watchers
1990except that changes might be detected earlier, and in some cases, to avoid 2010except that changes might be detected earlier, and in some cases, to avoid
1991making regular C<stat> calls. Even in the presence of inotify support 2011making regular C<stat> calls. Even in the presence of inotify support
1992there are many cases where libev has to resort to regular C<stat> polling, 2012there are many cases where libev has to resort to regular C<stat> polling,
1993but as long as the path exists, libev usually gets away without polling. 2013but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too
2014many bugs), the path exists (i.e. stat succeeds), and the path resides on
2015a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and
2016xfs are fully working) libev usually gets away without polling.
1994 2017
1995There is no support for kqueue, as apparently it cannot be used to 2018There is no support for kqueue, as apparently it cannot be used to
1996implement this functionality, due to the requirement of having a file 2019implement this functionality, due to the requirement of having a file
1997descriptor open on the object at all times, and detecting renames, unlinks 2020descriptor open on the object at all times, and detecting renames, unlinks
1998etc. is difficult. 2021etc. is difficult.
2022
2023=head3 C<stat ()> is a synchronous operation
2024
2025Libev doesn't normally do any kind of I/O itself, and so is not blocking
2026the process. The exception are C<ev_stat> watchers - those call C<stat
2027()>, which is a synchronous operation.
2028
2029For local paths, this usually doesn't matter: unless the system is very
2030busy or the intervals between stat's are large, a stat call will be fast,
2031as the path data is usually in memory already (except when starting the
2032watcher).
2033
2034For networked file systems, calling C<stat ()> can block an indefinite
2035time due to network issues, and even under good conditions, a stat call
2036often takes multiple milliseconds.
2037
2038Therefore, it is best to avoid using C<ev_stat> watchers on networked
2039paths, although this is fully supported by libev.
1999 2040
2000=head3 The special problem of stat time resolution 2041=head3 The special problem of stat time resolution
2001 2042
2002The C<stat ()> system call only supports full-second resolution portably, 2043The C<stat ()> system call only supports full-second resolution portably,
2003and even on systems where the resolution is higher, most file systems 2044and even on systems where the resolution is higher, most file systems
2152 2193
2153=head3 Watcher-Specific Functions and Data Members 2194=head3 Watcher-Specific Functions and Data Members
2154 2195
2155=over 4 2196=over 4
2156 2197
2157=item ev_idle_init (ev_signal *, callback) 2198=item ev_idle_init (ev_idle *, callback)
2158 2199
2159Initialises and configures the idle watcher - it has no parameters of any 2200Initialises and configures the idle watcher - it has no parameters of any
2160kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, 2201kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
2161believe me. 2202believe me.
2162 2203
2401some fds have to be watched and handled very quickly (with low latency), 2442some fds have to be watched and handled very quickly (with low latency),
2402and even priorities and idle watchers might have too much overhead. In 2443and even priorities and idle watchers might have too much overhead. In
2403this case you would put all the high priority stuff in one loop and all 2444this case you would put all the high priority stuff in one loop and all
2404the rest in a second one, and embed the second one in the first. 2445the rest in a second one, and embed the second one in the first.
2405 2446
2406As long as the watcher is active, the callback will be invoked every time 2447As long as the watcher is active, the callback will be invoked every
2407there might be events pending in the embedded loop. The callback must then 2448time there might be events pending in the embedded loop. The callback
2408call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke 2449must then call C<ev_embed_sweep (mainloop, watcher)> to make a single
2409their callbacks (you could also start an idle watcher to give the embedded 2450sweep and invoke their callbacks (the callback doesn't need to invoke the
2410loop strictly lower priority for example). You can also set the callback 2451C<ev_embed_sweep> function directly, it could also start an idle watcher
2411to C<0>, in which case the embed watcher will automatically execute the 2452to give the embedded loop strictly lower priority for example).
2412embedded loop sweep.
2413 2453
2414As long as the watcher is started it will automatically handle events. The 2454You can also set the callback to C<0>, in which case the embed watcher
2415callback will be invoked whenever some events have been handled. You can 2455will automatically execute the embedded loop sweep whenever necessary.
2416set the callback to C<0> to avoid having to specify one if you are not
2417interested in that.
2418 2456
2419Also, there have not currently been made special provisions for forking: 2457Fork detection will be handled transparently while the C<ev_embed> watcher
2420when you fork, you not only have to call C<ev_loop_fork> on both loops, 2458is active, i.e., the embedded loop will automatically be forked when the
2421but you will also have to stop and restart any C<ev_embed> watchers 2459embedding loop forks. In other cases, the user is responsible for calling
2422yourself - but you can use a fork watcher to handle this automatically, 2460C<ev_loop_fork> on the embedded loop.
2423and future versions of libev might do just that.
2424 2461
2425Unfortunately, not all backends are embeddable: only the ones returned by 2462Unfortunately, not all backends are embeddable: only the ones returned by
2426C<ev_embeddable_backends> are, which, unfortunately, does not include any 2463C<ev_embeddable_backends> are, which, unfortunately, does not include any
2427portable one. 2464portable one.
2428 2465
2659an C<EV_ASYNC> event on the watcher into the event loop. Unlike 2696an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2660C<ev_feed_event>, this call is safe to do from other threads, signal or 2697C<ev_feed_event>, this call is safe to do from other threads, signal or
2661similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding 2698similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2662section below on what exactly this means). 2699section below on what exactly this means).
2663 2700
2701Note that, as with other watchers in libev, multiple events might get
2702compressed into a single callback invocation (another way to look at this
2703is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
2704reset when the event loop detects that).
2705
2664This call incurs the overhead of a system call only once per loop iteration, 2706This call incurs the overhead of a system call only once per event loop
2665so while the overhead might be noticeable, it doesn't apply to repeated 2707iteration, so while the overhead might be noticeable, it doesn't apply to
2666calls to C<ev_async_send>. 2708repeated calls to C<ev_async_send> for the same event loop.
2667 2709
2668=item bool = ev_async_pending (ev_async *) 2710=item bool = ev_async_pending (ev_async *)
2669 2711
2670Returns a non-zero value when C<ev_async_send> has been called on the 2712Returns a non-zero value when C<ev_async_send> has been called on the
2671watcher but the event has not yet been processed (or even noted) by the 2713watcher but the event has not yet been processed (or even noted) by the
2674C<ev_async_send> sets a flag in the watcher and wakes up the loop. When 2716C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
2675the loop iterates next and checks for the watcher to have become active, 2717the loop iterates next and checks for the watcher to have become active,
2676it will reset the flag again. C<ev_async_pending> can be used to very 2718it will reset the flag again. C<ev_async_pending> can be used to very
2677quickly check whether invoking the loop might be a good idea. 2719quickly check whether invoking the loop might be a good idea.
2678 2720
2679Not that this does I<not> check whether the watcher itself is pending, only 2721Not that this does I<not> check whether the watcher itself is pending,
2680whether it has been requested to make this watcher pending. 2722only whether it has been requested to make this watcher pending: there
2723is a time window between the event loop checking and resetting the async
2724notification, and the callback being invoked.
2681 2725
2682=back 2726=back
2683 2727
2684 2728
2685=head1 OTHER FUNCTIONS 2729=head1 OTHER FUNCTIONS
2864 2908
2865 myclass obj; 2909 myclass obj;
2866 ev::io iow; 2910 ev::io iow;
2867 iow.set <myclass, &myclass::io_cb> (&obj); 2911 iow.set <myclass, &myclass::io_cb> (&obj);
2868 2912
2913=item w->set (object *)
2914
2915This is an B<experimental> feature that might go away in a future version.
2916
2917This is a variation of a method callback - leaving out the method to call
2918will default the method to C<operator ()>, which makes it possible to use
2919functor objects without having to manually specify the C<operator ()> all
2920the time. Incidentally, you can then also leave out the template argument
2921list.
2922
2923The C<operator ()> method prototype must be C<void operator ()(watcher &w,
2924int revents)>.
2925
2926See the method-C<set> above for more details.
2927
2928Example: 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
2869=item w->set<function> (void *data = 0) 2943=item w->set<function> (void *data = 0)
2870 2944
2871Also sets a callback, but uses a static method or plain function as 2945Also sets a callback, but uses a static method or plain function as
2872callback. The optional C<data> argument will be stored in the watcher's 2946callback. The optional C<data> argument will be stored in the watcher's
2873C<data> member and is free for you to use. 2947C<data> member and is free for you to use.
2959L<http://software.schmorp.de/pkg/EV>. 3033L<http://software.schmorp.de/pkg/EV>.
2960 3034
2961=item Python 3035=item Python
2962 3036
2963Python bindings can be found at L<http://code.google.com/p/pyev/>. It 3037Python bindings can be found at L<http://code.google.com/p/pyev/>. It
2964seems to be quite complete and well-documented. Note, however, that the 3038seems to be quite complete and well-documented.
2965patch they require for libev is outright dangerous as it breaks the ABI
2966for everybody else, and therefore, should never be applied in an installed
2967libev (if python requires an incompatible ABI then it needs to embed
2968libev).
2969 3039
2970=item Ruby 3040=item Ruby
2971 3041
2972Tony Arcieri has written a ruby extension that offers access to a subset 3042Tony Arcieri has written a ruby extension that offers access to a subset
2973of the libev API and adds file handle abstractions, asynchronous DNS and 3043of the libev API and adds file handle abstractions, asynchronous DNS and
2974more on top of it. It can be found via gem servers. Its homepage is at 3044more on top of it. It can be found via gem servers. Its homepage is at
2975L<http://rev.rubyforge.org/>. 3045L<http://rev.rubyforge.org/>.
3046
3047Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190>
3048makes rev work even on mingw.
3049
3050=item Haskell
3051
3052A haskell binding to libev is available at
3053L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
2976 3054
2977=item D 3055=item D
2978 3056
2979Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to 3057Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2980be found at L<http://proj.llucax.com.ar/wiki/evd>. 3058be found at L<http://proj.llucax.com.ar/wiki/evd>.
3157keeps libev from including F<config.h>, and it also defines dummy 3235keeps libev from including F<config.h>, and it also defines dummy
3158implementations for some libevent functions (such as logging, which is not 3236implementations for some libevent functions (such as logging, which is not
3159supported). It will also not define any of the structs usually found in 3237supported). It will also not define any of the structs usually found in
3160F<event.h> that are not directly supported by the libev core alone. 3238F<event.h> that are not directly supported by the libev core alone.
3161 3239
3240In stanbdalone mode, libev will still try to automatically deduce the
3241configuration, but has to be more conservative.
3242
3162=item EV_USE_MONOTONIC 3243=item EV_USE_MONOTONIC
3163 3244
3164If defined to be C<1>, libev will try to detect the availability of the 3245If defined to be C<1>, libev will try to detect the availability of the
3165monotonic clock option at both compile time and runtime. Otherwise no use 3246monotonic clock option at both compile time and runtime. Otherwise no
3166of the monotonic clock option will be attempted. If you enable this, you 3247use of the monotonic clock option will be attempted. If you enable this,
3167usually have to link against librt or something similar. Enabling it when 3248you usually have to link against librt or something similar. Enabling it
3168the functionality isn't available is safe, though, although you have 3249when the functionality isn't available is safe, though, although you have
3169to make sure you link against any libraries where the C<clock_gettime> 3250to make sure you link against any libraries where the C<clock_gettime>
3170function is hiding in (often F<-lrt>). 3251function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>.
3171 3252
3172=item EV_USE_REALTIME 3253=item EV_USE_REALTIME
3173 3254
3174If defined to be C<1>, libev will try to detect the availability of the 3255If defined to be C<1>, libev will try to detect the availability of the
3175real-time clock option at compile time (and assume its availability at 3256real-time clock option at compile time (and assume its availability
3176runtime if successful). Otherwise no use of the real-time clock option will 3257at runtime if successful). Otherwise no use of the real-time clock
3177be attempted. This effectively replaces C<gettimeofday> by C<clock_get 3258option will be attempted. This effectively replaces C<gettimeofday>
3178(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the 3259by C<clock_get (CLOCK_REALTIME, ...)> and will not normally affect
3179note about libraries in the description of C<EV_USE_MONOTONIC>, though. 3260correctness. See the note about libraries in the description of
3261C<EV_USE_MONOTONIC>, though. Defaults to the opposite value of
3262C<EV_USE_CLOCK_SYSCALL>.
3263
3264=item EV_USE_CLOCK_SYSCALL
3265
3266If defined to be C<1>, libev will try to use a direct syscall instead
3267of calling the system-provided C<clock_gettime> function. This option
3268exists because on GNU/Linux, C<clock_gettime> is in C<librt>, but C<librt>
3269unconditionally pulls in C<libpthread>, slowing down single-threaded
3270programs needlessly. Using a direct syscall is slightly slower (in
3271theory), because no optimised vdso implementation can be used, but avoids
3272the pthread dependency. Defaults to C<1> on GNU/Linux with glibc 2.x or
3273higher, as it simplifies linking (no need for C<-lrt>).
3180 3274
3181=item EV_USE_NANOSLEEP 3275=item EV_USE_NANOSLEEP
3182 3276
3183If defined to be C<1>, libev will assume that C<nanosleep ()> is available 3277If defined to be C<1>, libev will assume that C<nanosleep ()> is available
3184and will use it for delays. Otherwise it will use C<select ()>. 3278and will use it for delays. Otherwise it will use C<select ()>.
3200 3294
3201=item EV_SELECT_USE_FD_SET 3295=item EV_SELECT_USE_FD_SET
3202 3296
3203If defined to C<1>, then the select backend will use the system C<fd_set> 3297If defined to C<1>, then the select backend will use the system C<fd_set>
3204structure. This is useful if libev doesn't compile due to a missing 3298structure. This is useful if libev doesn't compile due to a missing
3205C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on 3299C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout
3206exotic systems. This usually limits the range of file descriptors to some 3300on exotic systems. This usually limits the range of file descriptors to
3207low limit such as 1024 or might have other limitations (winsocket only 3301some low limit such as 1024 or might have other limitations (winsocket
3208allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might 3302only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation,
3209influence the size of the C<fd_set> used. 3303configures the maximum size of the C<fd_set>.
3210 3304
3211=item EV_SELECT_IS_WINSOCKET 3305=item EV_SELECT_IS_WINSOCKET
3212 3306
3213When defined to C<1>, the select backend will assume that 3307When defined to C<1>, the select backend will assume that
3214select/socket/connect etc. don't understand file descriptors but 3308select/socket/connect etc. don't understand file descriptors but

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines