|
| 1 | +use crate::de_mut::ValueCursor; |
| 2 | +use serde::{Deserialize, Serialize}; |
| 3 | + |
| 4 | +pub struct Matrix<'de, const T: usize> { |
| 5 | + data: &'de [u32], |
| 6 | +} |
| 7 | + |
| 8 | +pub struct MatrixItem<'de, const T: usize> { |
| 9 | + offset: usize, |
| 10 | + data: &'de [u32], |
| 11 | +} |
| 12 | + |
| 13 | +impl<'de, const T: usize> Matrix<'de, T> { |
| 14 | + #[inline(always)] |
| 15 | + pub fn get_block_size() -> usize { |
| 16 | + // Block size in bytes. |
| 17 | + T * 4 |
| 18 | + } |
| 19 | + |
| 20 | + #[inline(always)] |
| 21 | + pub fn iter(&self) -> MatrixItem<'de, T> { |
| 22 | + MatrixItem { |
| 23 | + offset: 0, |
| 24 | + data: self.data, |
| 25 | + } |
| 26 | + } |
| 27 | + |
| 28 | + #[inline(always)] |
| 29 | + pub fn len(&self) -> usize { |
| 30 | + self.data.len() / T |
| 31 | + } |
| 32 | + |
| 33 | + #[inline(always)] |
| 34 | + pub fn is_empty(&self) -> bool { |
| 35 | + self.data.len() != 0 |
| 36 | + } |
| 37 | + |
| 38 | + #[inline(always)] |
| 39 | + pub fn get(&self, i: usize) -> &'de [u32] { |
| 40 | + &self.data[i * T..(i + 1) * T] |
| 41 | + } |
| 42 | +} |
| 43 | + |
| 44 | +impl<'de, const T: usize> Iterator for MatrixItem<'de, T> { |
| 45 | + type Item = &'de [u32]; |
| 46 | + |
| 47 | + #[inline(always)] |
| 48 | + fn next(&mut self) -> Option<Self::Item> { |
| 49 | + if self.data.len() <= self.offset { |
| 50 | + return None; |
| 51 | + } |
| 52 | + let result = &self.data[self.offset..self.offset + T]; |
| 53 | + self.offset += T; |
| 54 | + Some(result) |
| 55 | + } |
| 56 | +} |
| 57 | + |
| 58 | +impl<'de, const T: usize> Deserialize<'de> for Matrix<'_, T> { |
| 59 | + fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> |
| 60 | + where |
| 61 | + D: serde::Deserializer<'de>, |
| 62 | + { |
| 63 | + let value_deserialzer = super::ValueDeserializer::deserialize(deserializer)?; |
| 64 | + let data = match value_deserialzer.cursor { |
| 65 | + ValueCursor::Prop(_, cursor) => cursor.data_on(value_deserialzer.dtb), |
| 66 | + _ => unreachable!(), |
| 67 | + }; |
| 68 | + if data.len() % Self::get_block_size() != 0 { |
| 69 | + panic!("unaligned matrix"); |
| 70 | + } |
| 71 | + let (prefix, data, suffix) = unsafe { data.align_to::<u32>() }; |
| 72 | + if !prefix.is_empty() || !suffix.is_empty() { |
| 73 | + panic!("Not support unaligned data"); |
| 74 | + } |
| 75 | + |
| 76 | + Ok(Self { data }) |
| 77 | + } |
| 78 | +} |
| 79 | + |
| 80 | +impl<const T: usize> Serialize for Matrix<'_, T> { |
| 81 | + fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> |
| 82 | + where |
| 83 | + S: serde::Serializer, |
| 84 | + { |
| 85 | + use serde::ser::SerializeSeq; |
| 86 | + let mut seq = serializer.serialize_seq(Some(self.data.len()))?; |
| 87 | + for x in self.data { |
| 88 | + seq.serialize_element(x)?; |
| 89 | + } |
| 90 | + seq.end() |
| 91 | + } |
| 92 | +} |
| 93 | + |
| 94 | +#[cfg(test)] |
| 95 | +mod tests { |
| 96 | + use super::Matrix; |
| 97 | + use crate::{Dtb, DtbPtr, buildin::Node, from_raw_mut}; |
| 98 | + use serde::Serialize; |
| 99 | + |
| 100 | + const MAX_SIZE: usize = 256; |
| 101 | + #[test] |
| 102 | + fn base_ser_test() { |
| 103 | + #[derive(Serialize)] |
| 104 | + struct Base { |
| 105 | + pub hello: [u32; 16], |
| 106 | + } |
| 107 | + let array: [u32; 16] = [0xdeadbeef; 16]; |
| 108 | + let mut buf1 = [0u8; MAX_SIZE]; |
| 109 | + |
| 110 | + { |
| 111 | + let base = Base { hello: array }; |
| 112 | + crate::ser::to_dtb(&base, &[], &mut buf1).unwrap(); |
| 113 | + } |
| 114 | + |
| 115 | + let ptr = DtbPtr::from_raw(buf1.as_mut_ptr()).unwrap(); |
| 116 | + let dtb = Dtb::from(ptr).share(); |
| 117 | + let node: Node = from_raw_mut(&dtb).unwrap(); |
| 118 | + let matrix = node.get_prop("hello").unwrap().deserialize::<Matrix<4>>(); |
| 119 | + let mut count = 0; |
| 120 | + for x in matrix.iter() { |
| 121 | + for y in x { |
| 122 | + count += 1; |
| 123 | + assert_eq!(u32::from_be(*y), 0xdeadbeef); |
| 124 | + } |
| 125 | + } |
| 126 | + assert_eq!(count, 16); |
| 127 | + } |
| 128 | +} |
0 commit comments