Lines Matching refs:data
24 // this callback is called when data is readable on stdin
439 it possible to get the queued signal data. It can also simplify signal
1060 =item ev_set_userdata (loop, void *data)
1068 These two functions can be used to associate arbitrary data with a loop,
1083 data structures consistent.
1493 C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle
1494 timeouts. Under load, data might be received while the program handles
1496 handler will be executed before checking for data. In that case, giving
1510 continuously poll and process kernel event data for the watcher, but when
1521 priority than the default, and which should only process data when no
1584 some data. This behaviour is called level-triggering because you keep
1597 because there is no data. It is very easy to get into this situation even
1600 preferable to a program hanging until some data arrives.
1651 notification as soon as the kernel knows whether and how much data is
1657 devices and so on, there is another party (the sender) that delivers data
1659 will not send data on its own, simply because it doesn't know what you
1660 wish to read - you would first have to request some data.
1810 data or other life sign was received).
1831 data structure and then add it again. Libev tries to be fast, but it's
1841 successfully read or write some data. If you go into an idle state where
1842 you do not expect data to travel on the socket, you can C<ev_timer_stop>
1867 remove and re-insert the timer from/into its internal data structure.
2700 as the path data is usually in memory already (except when starting the
2720 stat data does change in other ways (e.g. file size).
2930 you cache some data and want to flush it before blocking (for example,
3079 adns_state ads = (adns_state)w->data;
3088 adns_state ads = (adns_state)w->data;
3380 C<ev_async> does not support queueing of data in any way. The reason
3386 That means that if you want to queue data, you have to provide your own
3403 sometype data;
3406 queue_put (data);
3413 sometype data;
3420 while (queue_get (&data))
3421 process (data);
3445 queue_put (data);
3456 while (queue_get (&data))
3457 process (data);
3545 Example: wait up to ten seconds for data to appear on STDIN_FILENO.
3550 /* stdin might have data for us, joy! */;
3578 Each watcher has, by default, a C<void *data> member that you can read
3580 to associate arbitrary data with your watcher. If you need more data and
3582 data member, you can also "subclass" the watcher type and provide your own
3583 data:
3611 Another common scenario is to use some data structure with multiple
3624 the C<data> member of the watcher (for woozies or C++ coders), or you need
3733 The example uses a pthread mutex to protect the loop data, a condition
3737 First, you need to associate some data with the event loop:
3777 protecting the loop data, respectively.
4003 Care has been taken to keep the overhead low. The only data member the C++
4067 parameter and is stored in the C<data> member of the watcher.
4114 =item w->set<function> (void *data = 0)
4117 callback. The optional C<data> argument will be stored in the watcher's
4118 C<data> member and is free for you to use.
4749 =item C<2> - faster/larger data structures
4753 and can additionally have an effect on the size of data structures at
4790 reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
4791 code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
4885 By default, all watchers have a C<void *data> member. By redefining
4976 of course): libev guarantees that different event loops share no data
5075 If you think you found a bug (memory leak, uninitialised data access etc.)
5333 instead of C<size_t> when allocating its data structures. On non-POSIX
5517 A change of state of some external event, such as data now being available
5555 A data structure that describes interest in certain events. Watchers need