|
| 1 | +use crate::UDP_BODY_LEN; |
| 2 | +use alloc::{vec, vec::Vec}; |
| 3 | +use thiserror::Error; |
| 4 | + |
| 5 | +const PACKET_LEN: usize = UDP_BODY_LEN - 32; |
| 6 | +const HEADER_LEN: usize = 2; |
| 7 | +const BODY_LEN: usize = PACKET_LEN - HEADER_LEN; |
| 8 | + |
| 9 | +const MIN_SIZE: usize = HEADER_LEN; |
| 10 | +const MAX_SIZE: usize = PACKET_LEN; |
| 11 | + |
| 12 | +#[derive(Error, Debug)] |
| 13 | +pub enum DecoderError { |
| 14 | + #[error("Packet too small; got {0} bytes, expected at least {MIN_SIZE} bytes")] |
| 15 | + PacketTooSmall(usize), |
| 16 | + #[error("Packet too big; got {0} bytes, expected at most {MAX_SIZE} bytes")] |
| 17 | + PacketTooBig(usize), |
| 18 | + #[error("Invalid index: 0x{0:04x}")] |
| 19 | + InvalidIndex(u16), |
| 20 | +} |
| 21 | + |
| 22 | +pub struct Decoder { |
| 23 | + data: Vec<u8>, |
| 24 | + missing_first: Vec<bool>, |
| 25 | + missing_second: [u16; 32], |
| 26 | + missing_third: u16, |
| 27 | +} |
| 28 | + |
| 29 | +impl Decoder { |
| 30 | + pub fn new(size: usize) -> Self { |
| 31 | + let num_packets = size.div_ceil(BODY_LEN); |
| 32 | + let data = vec![0; 32 * BODY_LEN + size]; |
| 33 | + let missing_first = vec![true; 32 + num_packets]; |
| 34 | + let missing_second: [u16; 32] = (0..32) |
| 35 | + .map(|i| ((num_packets + 31 - i) / 32) as u16) |
| 36 | + .collect::<Vec<_>>() |
| 37 | + .try_into() |
| 38 | + .unwrap(); |
| 39 | + let missing_third = missing_second.iter().map(|&x| (x != 0) as u16).sum(); |
| 40 | + Decoder { |
| 41 | + data, |
| 42 | + missing_first, |
| 43 | + missing_second, |
| 44 | + missing_third, |
| 45 | + } |
| 46 | + } |
| 47 | + |
| 48 | + pub fn add_packet(&mut self, buf: &[u8]) -> Result<(), DecoderError> { |
| 49 | + if buf.len() < MIN_SIZE { |
| 50 | + return Err(DecoderError::PacketTooSmall(buf.len())); |
| 51 | + } |
| 52 | + if buf.len() > MAX_SIZE { |
| 53 | + return Err(DecoderError::PacketTooBig(buf.len())); |
| 54 | + } |
| 55 | + |
| 56 | + let index = u16::from_le_bytes(buf[..2].try_into().unwrap()); |
| 57 | + |
| 58 | + let rot_index = index.wrapping_add(32) as usize; |
| 59 | + let missing = self |
| 60 | + .missing_first |
| 61 | + .get_mut(rot_index) |
| 62 | + .ok_or(DecoderError::InvalidIndex(index))?; |
| 63 | + match missing { |
| 64 | + false => return Ok(()), |
| 65 | + x @ true => *x = false, |
| 66 | + } |
| 67 | + |
| 68 | + let start = rot_index * BODY_LEN; |
| 69 | + self.data[start..start + buf.len() - 2].clone_from_slice(&buf[2..]); |
| 70 | + |
| 71 | + let group = index & 31; |
| 72 | + match &mut self.missing_second[group as usize] { |
| 73 | + 0 => return Ok(()), |
| 74 | + x @ 1 => *x = 0, |
| 75 | + x @ 2.. => { |
| 76 | + *x -= 1; |
| 77 | + return Ok(()); |
| 78 | + } |
| 79 | + } |
| 80 | + |
| 81 | + match &mut self.missing_third { |
| 82 | + 0 => unreachable!(), |
| 83 | + x @ 1.. => *x -= 1, |
| 84 | + } |
| 85 | + |
| 86 | + Ok(()) |
| 87 | + } |
| 88 | + |
| 89 | + pub fn finish(&mut self) -> Option<Vec<u8>> { |
| 90 | + if self.missing_third != 0 { |
| 91 | + return None; |
| 92 | + } |
| 93 | + |
| 94 | + let mut xor = [[0; BODY_LEN]; 32]; |
| 95 | + for packet in 0..self.missing_first.len() { |
| 96 | + if !self.missing_first[packet] { |
| 97 | + let group = packet & 31; |
| 98 | + self.data[BODY_LEN * packet..] |
| 99 | + .iter() |
| 100 | + .zip(xor[group].iter_mut()) |
| 101 | + .for_each(|(a, b)| *b ^= a); |
| 102 | + } |
| 103 | + } |
| 104 | + for packet in 0..self.missing_first.len() { |
| 105 | + if self.missing_first[packet] { |
| 106 | + let group = packet & 31; |
| 107 | + self.data[BODY_LEN * packet..] |
| 108 | + .iter_mut() |
| 109 | + .zip(xor[group].iter()) |
| 110 | + .for_each(|(a, b)| *a = *b); |
| 111 | + } |
| 112 | + } |
| 113 | + Some(self.data[32 * BODY_LEN..].to_vec()) |
| 114 | + } |
| 115 | +} |
| 116 | + |
| 117 | +pub struct Encoder { |
| 118 | + data: Vec<u8>, |
| 119 | + groups: usize, |
| 120 | + idx: usize, |
| 121 | +} |
| 122 | + |
| 123 | +impl Encoder { |
| 124 | + pub fn new(data: Vec<u8>) -> Self { |
| 125 | + let idx = 0; |
| 126 | + let groups = data.len().div_ceil(BODY_LEN).min(32); |
| 127 | + Encoder { data, groups, idx } |
| 128 | + } |
| 129 | + |
| 130 | + pub fn next_packet(&mut self, out_buf: &mut [u8]) -> Option<usize> { |
| 131 | + let start = self.idx * BODY_LEN; |
| 132 | + if start < self.data.len() { |
| 133 | + let end = self.data.len().min(start + BODY_LEN); |
| 134 | + let len = end - start; |
| 135 | + out_buf[0..2].copy_from_slice(&(self.idx as u16).to_le_bytes()); |
| 136 | + out_buf[2..2 + len].copy_from_slice(&self.data[start..end]); |
| 137 | + self.idx += 1; |
| 138 | + Some(2 + len) |
| 139 | + } else if self.groups > 0 { |
| 140 | + self.groups -= 1; |
| 141 | + out_buf[0..2].copy_from_slice(&(self.groups as u16).wrapping_sub(32).to_le_bytes()); |
| 142 | + out_buf[2..].fill(0); |
| 143 | + (0..) |
| 144 | + .map(|x| (x * 32 + self.groups) * BODY_LEN) |
| 145 | + .take_while(|x| *x < self.data.len()) |
| 146 | + .for_each(|start| { |
| 147 | + let end = self.data.len().min(start + BODY_LEN); |
| 148 | + out_buf[2..2 + end - start] |
| 149 | + .iter_mut() |
| 150 | + .zip(self.data[start..end].iter()) |
| 151 | + .for_each(|(a, b)| *a ^= *b); |
| 152 | + }); |
| 153 | + Some(2 + BODY_LEN.min(self.data.len() - self.groups * BODY_LEN)) |
| 154 | + } else { |
| 155 | + None |
| 156 | + } |
| 157 | + } |
| 158 | +} |
| 159 | + |
| 160 | +#[cfg(test)] |
| 161 | +mod tests { |
| 162 | + use super::*; |
| 163 | + use crate::UDP_BODY_LEN; |
| 164 | + |
| 165 | + fn test_chunk_skip_packet(chunk: &[u8]) { |
| 166 | + let mut encoder = Encoder::new(chunk.to_vec()); |
| 167 | + let mut packets = Vec::new(); |
| 168 | + let mut buf = [0u8; UDP_BODY_LEN]; |
| 169 | + while let Some(len) = encoder.next_packet(&mut buf) { |
| 170 | + packets.push(buf[..len].to_vec()); |
| 171 | + } |
| 172 | + |
| 173 | + packets.sort_by_key(|p| { |
| 174 | + p.iter().take(6).fold(0u64, |acc, &x| { |
| 175 | + acc.wrapping_mul(0x5DEECE66D).wrapping_add(x as u64) |
| 176 | + }) |
| 177 | + }); |
| 178 | + |
| 179 | + for skip_idx in 0..packets.len() { |
| 180 | + let mut decoder = Decoder::new(chunk.len()); |
| 181 | + for (idx, packet) in packets.iter().enumerate() { |
| 182 | + if idx != skip_idx { |
| 183 | + decoder.add_packet(packet).expect("Failed to add packet"); |
| 184 | + } |
| 185 | + } |
| 186 | + let decoded = decoder.finish().expect("Failed to decode chunk"); |
| 187 | + assert_eq!( |
| 188 | + decoded, chunk, |
| 189 | + "Failed to decode chunk with skip index {skip_idx}" |
| 190 | + ); |
| 191 | + } |
| 192 | + |
| 193 | + let mut decoder = Decoder::new(chunk.len()); |
| 194 | + for (idx, packet) in packets.iter().enumerate() { |
| 195 | + if !(idx.is_multiple_of(33) && idx / 33 < 32) { |
| 196 | + decoder.add_packet(packet).expect("Failed to add packet"); |
| 197 | + } |
| 198 | + } |
| 199 | + let decoded = decoder.finish().expect("Failed to decode chunk"); |
| 200 | + assert_eq!(decoded, chunk, "Failed to decode chunk with multiple skips"); |
| 201 | + } |
| 202 | + |
| 203 | + #[test] |
| 204 | + fn test_small_chunk() { |
| 205 | + let mut chunk = vec![0u8; 20]; |
| 206 | + let mut val = u64::MAX / 5; |
| 207 | + for x in &mut chunk { |
| 208 | + val = val.wrapping_mul(0x5DEECE66D).wrapping_add(0xB); |
| 209 | + *x = val.to_be_bytes()[0]; |
| 210 | + } |
| 211 | + test_chunk_skip_packet(&chunk); |
| 212 | + } |
| 213 | + |
| 214 | + #[test] |
| 215 | + fn test_big_chunk() { |
| 216 | + let mut chunk = vec![0u8; 200 << 10]; |
| 217 | + let mut val = u64::MAX / 5; |
| 218 | + for x in &mut chunk { |
| 219 | + val = val.wrapping_mul(0x5DEECE66D).wrapping_add(0xB); |
| 220 | + *x = val.to_be_bytes()[0]; |
| 221 | + } |
| 222 | + test_chunk_skip_packet(&chunk); |
| 223 | + } |
| 224 | +} |
0 commit comments