Lines Matching +full:fifo +full:- +full:depth

11     :depth: 2
25 - a semaphore becomes available
26 - a kernel FIFO contains data ready to be retrieved
27 - a kernel message queue contains data ready to be retrieved
28 - a kernel pipe contains data ready to be retrieved
29 - a poll signal is raised
48 Apart from the kernel objects, there is also a **poll signal** pseudo-object
54 :c:func:`k_poll` was called, or due to the preemptive multi-threading
91 .. code-block:: c
110 .. code-block:: c
145 A list of pollers is offered on each semaphore or FIFO and as many events
147 Notice that the waiters will be served in first-come-first-serve order,
151 -:c:macro:`EAGAIN`.
153 .. code-block:: c
155     // assume there is no contention on this semaphore and FIFO
156     // -EADDRINUSE will not occur; the semaphore and/or data will be available
165                 data = k_fifo_get(events[1].fifo, 0);
182 .. code-block:: c
192                 data = k_fifo_get(events[1].fifo, 0);
218 must be attached to a k_poll_event, similar to a semaphore or FIFO. It must
222 .. code-block:: c
234 .. code-block:: c
256             // A-OK!
273 .. code-block:: c
294                 // A-OK!
313 FIFOs are more error-proof in this sense because they can't "miss"