-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathringbuffer.c
119 lines (91 loc) · 2.14 KB
/
ringbuffer.c
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/*
* ringbuffer.c
*
* Created on: Apr 21, 2016
* Author: krcka
*/
#include <stdio.h>
#if __STDC_VERSION__ >= 199901L
/* C99 code */
# include <stdint.h>
# include <stdbool.h>
#else
# error "Compiler must support C99"
#endif
#include "ringbuffer.h"
static inline bool ringbuffer_check_validity(const struct ringbuffer_t *buffer) {
if (buffer == NULL || buffer->data == NULL)
return false;
if ((buffer->head >= buffer->max_length)
|| (buffer->tail >= buffer->max_length))
return false;
if (buffer->count > buffer->max_length)
return false;
return true;
}
/**
* Reset buffer to empty state
*
* buffer: ringbuffer
*/
void ringbuffer_reset(struct ringbuffer_t *buffer)
{
buffer->count = 0;
buffer->head = 0;
buffer->tail = 0;
}
/**
* buffer: ringbuffer
* data: pointer to data for storing result
*
* returns: true if pop was performed without any error
*/
bool ringbuffer_pop(struct ringbuffer_t *buffer, uint32_t *data) {
if ((data == NULL) || (!ringbuffer_check_validity(buffer))) {
return false;
}
if (RINGBUFFER_EMPTY(buffer) >= 1)
return false;
*data = buffer->data[buffer->tail];
int next = buffer->tail + 1;
if (next >= buffer->max_length)
next = 0;
buffer->tail = next;
buffer->count--;
return true;
}
/**
* buffer: ringbuffer
* data: data for storing to buffer
*
* returns: true if push was performed without any error
*/
bool ringbuffer_push(struct ringbuffer_t *buffer, uint32_t data) {
if (!ringbuffer_check_validity(buffer))
return false;
if (RINGBUFFER_FULL(buffer) >= 1)
return false;
buffer->data[buffer->head] = data;
int next = buffer->head + 1;
if (next >= buffer->max_length)
next = 0;
buffer->head = next;
buffer->count++;
return true;
}
/**
* Value which is stored on peak of buffer
*
* buffer: ringbuffer
* data: pointer to data for storing result
*
* returns: true if peek was performed without any error
*/
bool ringbuffer_peek(const struct ringbuffer_t *buffer, uint32_t *data) {
if ((data == NULL) || (!ringbuffer_check_validity(buffer)))
return false;
if (RINGBUFFER_EMPTY(buffer) >= 1)
return false;
*data = buffer->data[buffer->tail];
return true;
}