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
//! A container which can store up to a fixed number of uninitialized bytes on
//! the stack and read into and from it.
use core::marker;
use core::mem::MaybeUninit;
use core::ptr;
use musli::error::Error;
use crate::error::BufferError;
use crate::writer::Writer;
/// A fixed-size bytes storage which keeps track of how much has been initialized.
pub struct FixedBytes<const N: usize, E = BufferError> {
/// Data storage.
data: [MaybeUninit<u8>; N],
/// How many bytes have been initialized.
init: usize,
/// Error type to raise when this is used as a `Writer` implementation.
_marker: marker::PhantomData<E>,
}
impl<const N: usize, E> FixedBytes<N, E> {
/// Construct a new fixed bytes array storage.
pub const fn new() -> Self {
Self {
// SAFETY: MaybeUnint::uninit_array is not stable.
data: unsafe { MaybeUninit::<[MaybeUninit<u8>; N]>::uninit().assume_init() },
init: 0,
_marker: marker::PhantomData,
}
}
/// Get the length of the collection.
pub const fn len(&self) -> usize {
self.init
}
/// Test if the current container is empty.
pub const fn is_empty(&self) -> bool {
self.init == 0
}
/// Clear the [FixedBytes] container.
pub fn clear(&mut self) {
self.init = 0;
}
/// Get the remaining capacity of the [FixedBytes].
pub const fn remaining(&self) -> usize {
N.saturating_sub(self.init)
}
/// Coerce into the underlying bytes if all of them have been initialized.
pub fn into_bytes(self) -> Option<[u8; N]> {
if self.init == N {
// SAFETY: All of the bytes in the sequence have been initialized
// and can be safety transmuted.
//
// Method of transmuting comes from the implementation of
// `MaybeUninit::array_assume_init` which is not yet stable.
unsafe { Some((&self.data as *const _ as *const [u8; N]).read()) }
} else {
None
}
}
/// Coerce into the slice of initialized memory which is present.
pub fn as_slice(&self) -> &[u8] {
if self.init == 0 {
return &[];
}
// SAFETY: We've asserted that `initialized` accounts for the number of
// bytes that have been initialized.
unsafe { core::slice::from_raw_parts(self.data.as_ptr().cast(), self.init) }
}
/// Coerce into the mutable slice of initialized memory which is present.
pub fn as_mut_slice(&mut self) -> &[u8] {
if self.init == 0 {
return &[];
}
// SAFETY: We've asserted that `initialized` accounts for the number of
// bytes that have been initialized.
unsafe { core::slice::from_raw_parts_mut(self.data.as_mut_ptr().cast(), self.init) }
}
/// Try and push a single byte.
pub fn push(&mut self, value: u8) -> bool {
if N.saturating_sub(self.init) == 0 {
return false;
}
unsafe {
self.data
.as_mut_ptr()
.cast::<u8>()
.add(self.init)
.write(value)
}
self.init += 1;
true
}
/// Try and extend from the given slice.
pub fn extend_from_slice(&mut self, source: &[u8]) -> bool {
if source.len() > N.saturating_sub(self.init) {
return false;
}
unsafe {
let dst = (self.data.as_mut_ptr() as *mut u8).add(self.init);
ptr::copy_nonoverlapping(source.as_ptr(), dst, source.len());
}
self.init += source.len();
true
}
}
impl<const N: usize, E> Default for FixedBytes<N, E> {
fn default() -> Self {
Self::new()
}
}
impl<const N: usize, E> Writer for FixedBytes<N, E>
where
E: Error,
{
type Error = E;
type Mut<'this> = &'this mut Self where Self: 'this;
#[inline]
fn borrow_mut(&mut self) -> Self::Mut<'_> {
self
}
#[inline]
fn write_bytes(&mut self, bytes: &[u8]) -> Result<(), Self::Error> {
if !self.extend_from_slice(bytes) {
return Err(E::message(format_args! {
"Overflow when writing {additional} bytes at {at} with capacity {capacity}",
at = self.init,
additional = bytes.len(),
capacity = N,
}));
}
Ok(())
}
}