use crate::error::{Error, Result};
pub fn apply_bitfield(availability: &mut [u32], bitfield: &[u8]) {
for (index, count) in availability.iter_mut().enumerate() {
let byte = index / 8;
let bit = 7 - (index % 8);
if byte < bitfield.len() && (bitfield[byte] >> bit) & 1 == 1 {
*count = count.saturating_add(1);
}
}
}
pub fn remove_bitfield(availability: &mut [u32], bitfield: &[u8]) {
for (index, count) in availability.iter_mut().enumerate() {
let byte = index / 8;
let bit = 7 - (index % 8);
if byte < bitfield.len() && (bitfield[byte] >> bit) & 1 == 1 {
*count = count.saturating_sub(1);
}
}
}
pub fn max_bitfield_len(piece_count: u32) -> usize {
piece_count.div_ceil(8) as usize
}
pub fn validate_bitfield(bitfield: &[u8], piece_count: u32) -> Result<()> {
let expected = max_bitfield_len(piece_count);
if bitfield.len() != expected {
return Err(Error::Peer(format!(
"bitfield length {} != expected {expected} for {piece_count} pieces",
bitfield.len()
)));
}
if piece_count == 0 {
return Ok(());
}
let spare = (8 - (piece_count % 8) as u8) % 8;
if spare > 0 {
let last = *bitfield.last().expect("non-empty when piece_count > 0");
let mask = (1u8 << spare) - 1;
if last & mask != 0 {
return Err(Error::Peer(
"bitfield spare bits must be zero".into(),
));
}
}
Ok(())
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn rejects_oversized_bitfield() {
assert!(validate_bitfield(&[0xff; 8], 10).is_err());
}
}