Lines Matching refs:how

522 no way to know when and by how much, so sometimes you have to busy-wait
867    - Calculate for how long to sleep or block, if at all
898 =item ev_break (loop, how)
901 has processed all outstanding events). The C<how> argument must be either
1469 There are two common ways how these these priorities are being interpreted
1506 For example, to emulate how many other event libraries handle priorities,
1629 This is how one would do it normally anyway, the important point is that
1651 notification as soon as the kernel knows whether and how much data is
1908 To summarise the callback: first calculate in how many seconds the
2288 Note also that there is an upper limit to how often a timer can fire (CPU
2745 C<path>. The C<interval> is a hint on how quickly a change is expected to
3002 into libev. Here are some ideas on how to include libadns into libev
3272 =head3 The special problem of life after fork - how is it possible?
3359 =head2 C<ev_async> - how to wake up an event loop
3387 queue. But at least I can tell you how to implement locking around your
3725 Here is a fictitious example of how to run an event loop in a different
4298    // this is how ev_unref is being declared
4301    // this is how you can declare your typical callback
4665 of how the F<event.h> header can be found, the default is C<"event.h">.
4872 Controls how much internal verification (see C<ev_verify ()>) will
5097 of learning how to interpret valgrind properly.
5535 The model used to describe how an event loop handles and processes