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
//! C-compatible dynamic inline structure
use crate::helpers::{AsBytes, FromBytes};
use core::alloc::Layout;
use core::{mem, ptr, slice};
use std::ptr::addr_of;
/// C-compatible dynamic inline structure.
///
/// Can be used to house data with a header structure of a statically known size
/// but with trailing data of size dependent on the header field values.
///
/// # Layout
/// The structure is marked as `#[repr(C, packed)]` to be layout-compatible with
/// regular byte slice (`[u8]`) since it's mostly constructed from `Box<[u8]>`
/// via C FFI.
///
/// It's worth noting that heap allocation will often align to pointer size, so
/// no unaligned load should happen once the value is constructed from
/// heap-allocated bytes.
#[repr(C, packed)]
pub struct Blob<T: BlobLayout>(T::Header, [u8]);
/// Marker trait for dynamic struct layouts prefixed with [`Self::Header`] type
/// of a statically-known size. Used in tandem with [`Blob`].
pub trait BlobLayout {
type Header: AsBytes + FromBytes;
}
impl<T: BlobLayout> Blob<T> {
pub fn header(&self) -> &T::Header {
// SAFETY: The only way to construct `Blob` is via
// `Self::from_boxed`, which requires that the source reference is
// aligned at least as `T::Header` and since `Blob` is
// `#[repr(C)]` (and so is `T::Header`, because it implements `AsBytes`
// which requires being `#[repr(C)]`), so the pointer to its first
// field will be aligned at least as `T::Header`, and can be safely
// cast to a reference
let header_ptr = addr_of!(self.0);
unsafe { &*header_ptr }
}
pub(crate) fn tail(&self) -> &[u8] {
&self.1
}
pub fn as_bytes(&self) -> &[u8] {
AsBytes::as_bytes(self)
}
pub fn into_bytes(self: Box<Self>) -> Box<[u8]> {
AsBytes::into_bytes(self)
}
pub fn from_boxed(boxed: Box<[u8]>) -> Box<Self> {
FromBytes::from_boxed(boxed)
}
pub(crate) unsafe fn ref_cast<U: BlobLayout>(&self) -> &Blob<U> {
Blob::<U>::from_bytes(self.as_bytes())
}
}
// SAFETY: The struct is `#[repr(C)]` and so is the header because it implements
// [`AsBytes`] as well, so the layout is well-defined and data can be converted to
// bytes
unsafe impl<T: BlobLayout> AsBytes for Blob<T> {}
unsafe impl<T: BlobLayout> FromBytes for Blob<T> {
// Require that the allocation is at least as aligned as its header to
// safely reference it as the first field. (despite
// [`Blob`] being technically `#[repr(packed)]`)
const MIN_LAYOUT: Layout = Layout::new::<T::Header>();
unsafe fn ptr_cast(source: *const [u8]) -> *const Self {
assert_ne!(source as *const (), ptr::null());
// SAFETY: [u8] is 1-byte aligned so no need to check before deref
let len = (*source).len();
let tail_len = len - mem::size_of::<T::Header>();
// SAFETY: This assumes that the pointer to slices and slice-based DSTs
// have the same metadata (verified by the compiler at compile-time)
let slice = slice::from_raw_parts(source as *const T::Header, tail_len);
slice as *const [T::Header] as *const _
}
}
/// Defines a trait for accessing dynamic fields (byte slices) for structs that
/// have a header of a known size which also defines the rest of the struct
/// layout.
/// Assumes a contiguous byte buffer.
#[macro_export]
macro_rules! blob {
(
$(#[$wrapper_meta:meta])*
enum $wrapper_ident: ident {},
header: $header: ty,
$(#[$outer:meta])*
view: struct ref $tail_ident: ident {
$(
$(#[$meta:meta])*
$field: ident [$($len: tt)*],
)*
}
) => {
$(#[$wrapper_meta])*
pub enum $wrapper_ident {}
$(#[$outer])*
pub struct $tail_ident<'a> {
$(
$(#[$meta])*
pub $field: &'a [u8],
)*
}
impl<'a> $crate::helpers::BlobLayout for $wrapper_ident {
type Header = $header;
}
impl $crate::helpers::Blob<$wrapper_ident> {
/// Create a [`$wrapper_ident`] blob instance from its parts.
///
/// SAFETY: The header might contain length information about the payload
/// (i.e. the `tail` argument). An mismatch between the two won't cause a
/// memory corruption, but it will panic. Careful validation of the
/// arguments must be done to ensure proper behaviour.
#[allow(unused_assignments)]
pub fn clone_from_parts(header: &$header, tail: &$tail_ident) -> Box<Self> {
let header_len = core::mem::size_of_val(header);
let tail_len: usize = 0 $( + blob! { size: header, $($len)*} )*;
// NOTE: There's no trailing padding due to `Blob` being `repr(packed)`
let mut boxed = vec![0u8; header_len + tail_len].into_boxed_slice();
let header_bytes = $crate::helpers::AsBytes::as_bytes(header);
boxed[..header_len].copy_from_slice(header_bytes);
let mut offset = header_len;
$(
let field_len = blob! { size: header, $($len)*};
boxed[offset..offset + field_len].copy_from_slice(tail.$field);
offset += field_len;
)*
Self::from_boxed(boxed)
}
}
impl $crate::helpers::Blob<$wrapper_ident> {
blob! { fields: ;
$(
$(#[$meta])*
$field [$($len)*],
)*
}
}
};
// Expand fields. Recursively expand each field, pushing the processed field
// identifier to a queue which is later used to calculate field offset for
// subsequent fields
(
fields: $($prev: ident,)* ;
$(#[$curr_meta:meta])*
$curr: ident [$($curr_len: tt)*],
$(
$(#[$field_meta:meta])*
$field: ident [$($field_len: tt)*],
)*
) => {
$(#[$curr_meta])*
#[inline(always)]
pub fn $curr(&self) -> &[u8] {
let size: usize = blob! { size: self.header(), $($curr_len)* };
let offset = 0 $(+ self.$prev().len())*;
&self.tail()[offset..offset + size]
}
// Once expanded, push the processed ident and recursively expand other
// fields
blob! {
fields: $($prev,)* $curr, ;
$(
$(#[$field_meta])*
$field [$($field_len)*],
)*
}
};
// Stop after expanding every field
(fields: $($prev: ident,)* ; ) => {};
// Accept either header member values or arbitrary expressions (e.g. numeric
// constants)
(size: $this: expr, $ident: ident) => { $this.$ident as usize };
(size: $this: expr, $expr: expr) => { $expr };
}
#[cfg(test)]
mod tests {
use super::*;
use crate::helpers::bytes::Pod;
#[test]
fn test() {
#[repr(C)]
pub struct Header {
count: u16,
}
blob! {
enum MyDynStruct {},
header: Header,
view: struct ref TailView {
some_member[count], // Refers to run-time value of `count` field
}
}
unsafe impl Pod for Header {}
let inline = Blob::<MyDynStruct>::clone_from_parts(
&Header { count: 4 },
&TailView {
some_member: &[1u8, 2, 3, 4],
},
);
assert_eq!(6, mem::size_of_val(&*inline));
let inline = Blob::<MyDynStruct>::clone_from_parts(
&Header { count: 5 },
&TailView {
some_member: &[1u8, 2, 3, 4, 5],
},
);
// *NO* trailing padding (Due to Blob being `#[repr(C, packed)])`
assert_eq!(7, mem::size_of_val(&*inline));
}
}