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
|
/**
*
* Author: Dylan Muller
* Copyright (c) 2025
* All rights reserved.
*
* - Commercial/IP use prohibited.
* - Attribution required.
* See License.txt
*
*/
#include "peripheral/ring.h"
#define RING_INC_ROLL_OVER(n, s, e) (((n)+1>=(e)) ? (s) : (n)+1)
ring_t ring_init(
uint8_t *buf,
size_t len
)
{
return RING_INIT(buf, len);
}
bool ring_is_empty(
ring_t ring
)
{
return ring.read == ring.write;
}
bool ring_is_full(
ring_t ring
)
{
return RING_INC_ROLL_OVER(ring.write, ring.buf, ring.end) == ring.read;
}
size_t ring_push_available(
ring_t ring
)
{
if(ring.write < ring.read)
return ring.read - ring.write - 1;
else
return (ring.end - ring.buf) - (ring.write - ring.read) - 1;
}
size_t ring_pop_available(
ring_t ring
)
{
if(ring.read <= ring.write)
return ring.write - ring.read;
else
return (ring.end - ring.buf) - (ring.read - ring.write);
}
bool ring_push(
ring_t *ring,
uint8_t data
)
{
if(ring_is_full(*ring))
return 1;
*ring->write = data;
ring->write = RING_INC_ROLL_OVER(ring->write, ring->buf, ring->end);
return 0;
}
bool ring_push_over(
ring_t *ring,
uint8_t data
)
{
*ring->write = data;
ring->write = RING_INC_ROLL_OVER(ring->write, ring->buf, ring->end);
if(ring->read == ring->write)
{
ring->read = RING_INC_ROLL_OVER(ring->read, ring->buf, ring->end);
return 1;
}
return 0;
}
bool ring_pop(
ring_t *ring,
uint8_t *data
)
{
if(ring_is_empty(*ring))
return 1;
*data = *ring->read;
ring->read = RING_INC_ROLL_OVER(ring->read, ring->buf, ring->end);
return 0;
}
bool ring_peek(
ring_t *ring,
uint8_t *data
)
{
if(ring_is_empty(*ring))
return 1;
*data = *ring->read;
return 0;
}
|
