File: ring-buffer.rst

package info (click to toggle)
libcork 0.15.0%2Bds-11
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 1,680 kB
  • ctags: 1,967
  • sloc: ansic: 12,216; python: 95; sh: 85; makefile: 9
file content (73 lines) | stat: -rw-r--r-- 2,946 bytes parent folder | download | duplicates (7)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
.. _ring-buffer:

************
Ring buffers
************

.. highlight:: c

::

  #include <libcork/ds.h>


.. type:: struct cork_ring_buffer

   A ring buffer data structure that can be easily embedded into other
   types.  All of the fields in ``cork_ring_buffer`` are private; you
   should only access the contents of the ring buffer via the functions
   defined below.

   The elements of a ring buffer are ``void *`` pointers.  (You can also
   store integers via the :c:type:`intptr_t` and :c:type:`uintptr_t`
   types.)  Ring buffers have a fixed capacity, which must be specified
   when the ring buffer instance is initialized.  You cannot add extra
   space to an existing ring buffer.

   Ring buffers implement a FIFO queue structure; elements will be
   returned by :c:func:`cork_ring_buffer_pop()` in the same order that
   they're added by :c:func:`cork_ring_buffer_add()`.


.. function:: int cork_ring_buffer_init(struct cork_ring_buffer \*buf, size_t size)
              struct cork_ring_buffer \*cork_ring_buffer_new(size_t size)

   Initializes a ring buffer instance, having a capacity of *size* elements.
   The ``_init`` version should be used to initialize an instance you
   allocated yourself on the stack.  The ``_new`` version will allocate an
   instance from the heap.  If memory allocation fails in either function,
   the program will abort with an error.


.. function:: void cork_ring_buffer_done(struct cork_ring_buffer \*buf)
              void cork_ring_buffer_free(struct cork_ring_buffer \*buf)

   Finalizes a ring buffer instance.  The ``_done`` variant should be used to
   finalize an instance that you allocated yourself (i.e., on the stack).  The
   ``_free`` version should be used on instance allocated on the heap by using
   :c:func:`cork_hash_table_new()`.  Nothing special is done to any
   remaining elements in the ring buffer; if they need to be finalized,
   you should do that yourself before calling this function.


.. function:: bool cork_ring_buffer_is_empty(struct cork_ring_buffer \*buf)
              bool cork_ring_buffer_is_full(struct cork_ring_buffer \*buf)

   Returns whether the ring buffer is empty or full.  (You cannot add
   elements to a full ring buffer, and you cannot pop elemenst from an
   empty one.)


.. function:: int cork_ring_buffer_add(struct cork_ring_buffer \*buf, void \*element)

   Adds *element* to a ring buffer.  If the ring buffer is full, we
   return ``-1``, and the ring buffer will be unchanged.  Otherwise we
   return ``0``.

.. function:: void \*cork_ring_buffer_pop(struct cork_ring_buffer \*buf)
              void \*cork_ring_buffer_peek(struct cork_ring_buffer \*buf)

   Returns the next element in the ring buffer.  If the ring buffer is
   empty, we return ``NULL``.  The ``_pop`` variant will remove the
   returned element from the ring buffer before returning it; the
   ``_peek`` variant will leave the element in the ring buffer.