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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
use core::{cmp, ptr};
use core::borrow::{Borrow, BorrowMut};
pub struct Buffer<S: BorrowMut<[u8]>> {
store: S,
rpos: usize,
wpos: usize,
}
impl<S: BorrowMut<[u8]>> Buffer<S> {
pub fn new(store: S) -> Self {
Self {
store,
rpos: 0,
wpos: 0,
}
}
pub fn clear(&mut self) {
self.rpos = 0;
self.wpos = 0;
}
pub fn available_read(&self) -> usize {
self.wpos - self.rpos
}
pub fn available_write(&self) -> usize {
self.available_write_without_discard() + self.rpos
}
fn available_write_without_discard(&self) -> usize {
self.store.borrow().len() - self.wpos
}
pub fn write(&mut self, data: &[u8]) -> usize {
if data.len() > self.available_write_without_discard() && self.rpos > 0 {
self.discard_already_read_data();
}
let count = cmp::min(self.available_write_without_discard(), data.len());
if count == 0 {
return 0;
}
&self.store.borrow_mut()[self.wpos..self.wpos+count].copy_from_slice(&data[..count]);
self.wpos += count;
count
}
pub fn write_all<E>(&mut self, max_count: usize, f: impl FnOnce(&mut [u8]) -> Result<usize, E>)
-> Result<usize, E>
{
if max_count > self.available_write_without_discard() {
if max_count > self.available_write() {
return Ok(0);
}
self.discard_already_read_data();
}
assert!(self.available_write_without_discard() >= max_count);
f(&mut self.store.borrow_mut()[self.wpos..self.wpos+max_count]).map(|count| {
self.wpos += count;
count
})
}
pub fn read<E>(&mut self, max_count: usize, f: impl FnOnce(&[u8]) -> Result<usize, E>)
-> Result<usize, E>
{
let count = cmp::min(max_count, self.available_read());
f(&self.store.borrow()[self.rpos..self.rpos+count]).map(|count| {
self.rpos += count;
count
})
}
fn discard_already_read_data(&mut self) {
let data = self.store.borrow_mut();
if self.rpos != data.len() {
unsafe {
ptr::copy(
&data[self.rpos] as *const u8,
&mut data[0] as *mut u8,
self.available_read());
}
}
self.wpos -= self.rpos;
self.rpos = 0;
}
}
pub struct DefaultBufferStore([u8; 128]);
impl Borrow<[u8]> for DefaultBufferStore {
fn borrow(&self) -> &[u8] {
&self.0
}
}
impl BorrowMut<[u8]> for DefaultBufferStore {
fn borrow_mut(&mut self) -> &mut [u8] {
&mut self.0
}
}
#[cfg(test)]
mod tests {
extern crate std;
const DATA: &[u8] = &[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12];
const LEN: usize = 5;
type Buf = crate::buffer::Buffer<generic_array::typenum::consts::U5>;
#[test]
fn write() {
let mut b = Buf::new();
assert_eq!(b.write(&DATA[0..2]), 2);
assert_eq!(b.available_write(), LEN - 2);
assert_eq!(b.available_read(), 2);
assert_eq!(b.write(&DATA[0..5]), 3);
assert_eq!(b.available_write(), 0);
assert_eq!(b.available_read(), LEN);
}
#[test]
fn read() {
let mut b = Buf::new();
assert_eq!(b.write(&DATA[0..4]), 4);
b.read(3, |data| {
assert_eq!(data, &DATA[0..3]);
});
b.read(1, |data| {
assert_eq!(data, &DATA[3..4]);
});
b.read(1, |data| {
assert_eq!(data, &[]);
});
}
#[test]
fn clear() {
let mut b = Buf::new();
b.write(&DATA[0..2]);
b.clear();
assert_eq!(b.available_write(), LEN);
assert_eq!(b.available_read(), 0);
}
#[test]
fn discard() {
let mut b = Buf::new();
assert_eq!(b.write(&DATA[0..4]), 4);
b.read(2, |data| {
assert_eq!(data, &DATA[0..2]);
});
assert_eq!(b.write(&DATA[4..7]), 3);
b.read(5, |data| {
assert_eq!(data, &DATA[2..7]);
});
assert_eq!(b.available_read(), 0);
}
}