blob: 56c762016dddecc5d757eb8c9a484eac1d261388 (
plain)
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
|
#include <math.h>
#include "ring-buffer.h"
RingBuffer *
ring_buffer_new (gsize block_size,
gsize n_blocks)
{
RingBuffer *buffer;
buffer = g_new0 (RingBuffer, 1);
buffer->block_size = block_size;
buffer->n_blocks_total = n_blocks;
buffer->n_blocks_used = 0;
buffer->start_index = 0;
buffer->data = g_malloc0 (n_blocks * buffer->block_size);
return buffer;
}
void
ring_buffer_free (RingBuffer *buffer)
{
g_free (buffer->data);
g_free (buffer);
}
void
ring_buffer_reset (RingBuffer *buffer)
{
buffer->n_blocks_used = 0;
buffer->start_index = 0;
}
gpointer
ring_buffer_get_current_pointer (RingBuffer *buffer)
{
return ring_buffer_get_pointer (buffer, 0);
}
gpointer
ring_buffer_get_pointer (RingBuffer *buffer,
guint index)
{
g_assert (index < buffer->n_blocks_total);
return buffer->data + ((buffer->start_index + index) % buffer->n_blocks_total) * buffer->block_size;
}
guint
ring_buffer_get_num_blocks (RingBuffer *buffer)
{
return buffer->n_blocks_used;
}
void
ring_buffer_proceed (RingBuffer *buffer)
{
buffer->start_index++;
if (buffer->n_blocks_used < buffer->n_blocks_total)
buffer->n_blocks_used++;
else
buffer->start_index = buffer->start_index % buffer->n_blocks_total;
}
|
