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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
//!
//! ```no_run
//! # use load_buffer::*;
//! # #[derive(Default)]
//! # struct Loader;
//! # impl Load for Loader {
//! #   type Error = core::convert::Infallible;
//! #   fn load(&mut self, destination: &mut [u8]) -> Result<(), Self::Error> { unimplemented!() }
//! # }
//! // Static, backed by the array size you give it:
//! let mut loader: BufferedLoader<[u8; 64], _> =
//!     BufferedLoader::new_static(Loader::default());
//!
//! // Dynamic, backed by alloc::vec::Vec<u8>:
//! let mut loader = BufferedLoader::new_dynamic(Loader::default(), 64);
//!
//! // Dynamic can be resized.  This invalidates the buffer.
//! loader.resize(268435456);
//!
//! // Heap, backed by alloc::boxed::Box<[u8]>:
//! let mut loader = BufferedLoader::new_heap(Loader::default(), 268435456);
//!
//! // Heap can not be resized, but will not fill the stack for huge sizes.
//! // You can also supply your own buffer type, as long as it implements
//! // AsRef<[u8]> + AsMut<[u8]> + Debug.
//! ```
#![cfg_attr(not(feature = "std"), no_std)]

#[cfg(feature = "alloc")]
extern crate alloc;

#[cfg(feature = "alloc")]
use alloc::vec;

#[cfg(feature = "alloc")]
use alloc::vec::Vec;

#[cfg(feature = "alloc")]
use alloc::boxed::Box;

use core::fmt::Debug;

/// Like [`std::io::Read`], but only supporting [`read_exact`], and with an
/// arbitrary error type.
///
/// [`std::io::Read`]: https://doc.rust-lang.org/std/io/trait.Read.html
/// [`read_exact`]: https://doc.rust-lang.org/std/io/trait.Read.html#method.read_exact
pub trait Load {
    type Error;

    fn load(&mut self, destination: &mut [u8]) -> Result<(), Self::Error>;
}

#[cfg(feature = "std")]
impl<T> Load for T
where
    T: std::io::Read,
{
    type Error = std::io::Error;
    fn load(&mut self, destination: &mut [u8]) -> Result<(), Self::Error> {
        self.read_exact(destination)
    }
}

/// A buffering wrapper around a [`Load`].
///
/// This fills some of the simpler niches of a [`std::io::BufReader`] for no_std
/// use-cases, and allowing a static buffer.
///
/// [`std::io::BufReader`]: https://doc.rust-lang.org/std/io/struct.BufReader.html
/// [`Load`]: trait.Load.html
#[derive(Clone, Debug)]
pub struct BufferedLoader<Buffer, Loader>
where
    Buffer: AsRef<[u8]> + AsMut<[u8]> + Debug,
    Loader: Load,
{
    loader: Loader,
    buffer: Buffer,

    /// The amount of buffer that has been read already.
    offset: usize,
}

impl<const N: usize, Loader> BufferedLoader<[u8; N], Loader>
where
    Loader: Load,
{
    /// Creates a new stack-based BufferedLoader.  Does not allocate.
    pub fn new_static(loader: Loader) -> Self {
        Self::new([0u8; N], loader)
    }
}

#[cfg(feature = "alloc")]
impl<Loader> BufferedLoader<Vec<u8>, Loader>
where
    Loader: Load,
{
    /// Creates a new heap-based BufferedLoader.  Allocates only once.
    pub fn new_dynamic(loader: Loader, buffer_size: usize) -> Self {
        Self::new(vec![0u8; buffer_size], loader)
    }

    pub fn resize(&mut self, new_size: usize) {
        self.buffer.resize(new_size, 0);
        self.offset = new_size;
    }
}

#[cfg(feature = "alloc")]
impl<Loader> BufferedLoader<Box<[u8]>, Loader>
where
    Loader: Load,
{
    /// Creates a new heap-based BufferedLoader.  Allocates only once.
    pub fn new_heap(loader: Loader, buffer_size: usize) -> Self {
        Self::new(vec![0u8; buffer_size].into_boxed_slice(), loader)
    }
}

impl<Buffer, Loader> BufferedLoader<Buffer, Loader>
where
    Buffer: AsRef<[u8]> + AsMut<[u8]> + Debug,
    Loader: Load,
{
    pub fn new(buffer: Buffer, loader: Loader) -> Self {
        let offset = buffer.as_ref().len();
        Self {
            loader,
            buffer,
            offset,
        }
    }

    /// Drop what's remaining in the buffer and give a mutable reference to the
    /// inner loader, so it can be seeked or otherwise manipulated.
    pub fn loader(&mut self) -> &mut Loader {
        self.offset = self.buffer.as_ref().len();
        &mut self.loader
    }
}

impl<Buffer, Loader> Load for BufferedLoader<Buffer, Loader>
where
    Buffer: AsRef<[u8]> + AsMut<[u8]> + Debug,
    Loader: Load,
{
    type Error = Loader::Error;

    /// Efficiently fill the destination buffer, calling the underlying
    /// [`Load::load`] as few times as possible.
    ///
    /// [`Load::Load`]: trait.Load.html#method.load
    fn load(&mut self, mut destination: &mut [u8]) -> Result<(), Self::Error> {
        if destination.is_empty() {
            return Ok(());
        }

        let buffer = self.buffer.as_mut();
        let buffer_size = buffer.len();

        let buffer_remaining = buffer_size - self.offset;

        if destination.len() <= buffer_remaining {
            // There are enough bytes left in the buffer to consume without
            // reading.
            let end = self.offset + destination.len();
            destination.copy_from_slice(&buffer[self.offset..end]);
            self.offset = end;
        } else {
            // First empty the buffer.
            if buffer_remaining > 0 {
                destination[..buffer_remaining].copy_from_slice(&buffer[self.offset..buffer_size]);
                let copied = buffer_size - self.offset;
                destination = &mut destination[copied..];
            }

            let buffers = destination.len() / buffer_size;
            let remainder = destination.len() % buffer_size;

            // Load full-sized chunks directly to the destination, bypassing
            // the buffer.
            if buffers > 0 {
                let buffers_bytes = buffers * buffer_size;
                self.loader.load(&mut destination[..buffers_bytes])?;
                destination = &mut destination[buffers_bytes..];
            }

            // Fill the buffer for the remainder, if there is any.
            if remainder > 0 {
                self.loader.load(buffer)?;
                destination.copy_from_slice(&buffer[..remainder]);
                self.offset = remainder;
            } else {
                // We have emptied the remaining buffer, so mark this empty.
                self.offset = buffer_size;
            }
        }
        Ok(())
    }
}

#[cfg(test)]
pub mod test {
    use core::convert::Infallible;

    use super::*;

    #[derive(Default)]
    struct Increment(u8);

    impl Load for Increment {
        type Error = Infallible;

        fn load(&mut self, destination: &mut [u8]) -> Result<(), Self::Error> {
            for each in destination {
                *each = self.0;
                self.0 = self.0.wrapping_add(1);
            }
            Ok(())
        }
    }

    #[test]
    fn test_static_buffered_loader() {
        let mut loader: BufferedLoader<[u8; 8], _> =
            BufferedLoader::new_static(Increment::default());
        let mut buf = [0u8; 4];
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [0, 1, 2, 3]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [4, 5, 6, 7]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [8, 9, 10, 11]);

        let mut buf = [0u8; 12];
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23]);

        let mut buf = [0u8; 3];

        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [24, 25, 26]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [27, 28, 29]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [30, 31, 32]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [33, 34, 35]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [36, 37, 38]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [39, 40, 41]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [42, 43, 44]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [45, 46, 47]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [48, 49, 50]);
    }

    #[test]
    fn test_dynamic_buffered_loader() {
        let mut loader = BufferedLoader::new_dynamic(Increment::default(), 8);
        let mut buf = [0u8; 4];
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [0, 1, 2, 3]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [4, 5, 6, 7]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [8, 9, 10, 11]);

        let mut buf = [0u8; 12];
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23]);

        let mut buf = [0u8; 3];

        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [24, 25, 26]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [27, 28, 29]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [30, 31, 32]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [33, 34, 35]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [36, 37, 38]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [39, 40, 41]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [42, 43, 44]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [45, 46, 47]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [48, 49, 50]);
    }

    #[test]
    fn test_boxed_slice_buffered_loader() {
        let mut loader = BufferedLoader::new_heap(Increment::default(), 8);
        let mut buf = [0u8; 4];
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [0, 1, 2, 3]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [4, 5, 6, 7]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [8, 9, 10, 11]);

        let mut buf = [0u8; 12];
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23]);

        let mut buf = [0u8; 3];

        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [24, 25, 26]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [27, 28, 29]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [30, 31, 32]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [33, 34, 35]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [36, 37, 38]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [39, 40, 41]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [42, 43, 44]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [45, 46, 47]);
        loader.load(&mut buf).unwrap();
        assert_eq!(buf, [48, 49, 50]);
    }
}