mirror of
https://codeberg.org/icewind/bitbuffer.git
synced 2026-06-03 08:34:07 +02:00
optimizte reading alligned unsized strings
This commit is contained in:
parent
c85d4e4fa6
commit
296b2e1092
3 changed files with 48 additions and 30 deletions
|
|
@ -13,6 +13,7 @@ travis-ci = { repository = "icewind1991/bitstream_reader" }
|
|||
[dependencies]
|
||||
num-traits = "0.2"
|
||||
bitstream_reader_derive = { version = "0.6", path = "bitstream_reader_derive" }
|
||||
bytecount = "0.5"
|
||||
|
||||
[dev-dependencies]
|
||||
maplit = "1.0.1"
|
||||
|
|
|
|||
|
|
@ -184,7 +184,7 @@ fn perf_bytes_be(b: &mut Bencher) {
|
|||
|
||||
#[bench]
|
||||
fn perf_bytes_le(b: &mut Bencher) {
|
||||
let buffer = BitBuffer::new(get_string_buffer(), BigEndian);
|
||||
let buffer = BitBuffer::new(get_string_buffer(), LittleEndian);
|
||||
|
||||
b.iter(|| {
|
||||
let mut pos = 0;
|
||||
|
|
@ -205,7 +205,7 @@ fn perf_bytes_be_unaligned(b: &mut Bencher) {
|
|||
let buffer = BitBuffer::new(get_string_buffer(), BigEndian);
|
||||
|
||||
b.iter(|| {
|
||||
let mut pos = 0;
|
||||
let mut pos = 3;
|
||||
let len = buffer.bit_len();
|
||||
loop {
|
||||
if pos + (128 * 8) > len {
|
||||
|
|
@ -220,7 +220,7 @@ fn perf_bytes_be_unaligned(b: &mut Bencher) {
|
|||
|
||||
#[bench]
|
||||
fn perf_bytes_le_unaligned(b: &mut Bencher) {
|
||||
let buffer = BitBuffer::new(get_string_buffer(), BigEndian);
|
||||
let buffer = BitBuffer::new(get_string_buffer(), LittleEndian);
|
||||
|
||||
b.iter(|| {
|
||||
let mut pos = 3;
|
||||
|
|
|
|||
|
|
@ -435,39 +435,56 @@ where
|
|||
}
|
||||
}
|
||||
|
||||
#[inline]
|
||||
fn find_null_byte(&self, byte_index: usize) -> usize {
|
||||
self.bytes
|
||||
.iter()
|
||||
.enumerate()
|
||||
.skip(byte_index)
|
||||
.find(|(_, byte)| **byte == 0)
|
||||
.map(|(i, _)| i)
|
||||
.unwrap_or(self.byte_len())
|
||||
}
|
||||
|
||||
#[inline]
|
||||
fn read_string_bytes(&self, position: usize) -> Result<Vec<u8>> {
|
||||
let mut acc = Vec::with_capacity(32);
|
||||
let mut pos = position;
|
||||
loop {
|
||||
let read = min((USIZE_SIZE - 1) * 8, self.bit_len() - pos);
|
||||
let raw_bytes = self.read_usize(pos, read);
|
||||
let bytes: [u8; USIZE_SIZE] = if E::is_le() {
|
||||
raw_bytes.to_le_bytes()
|
||||
} else {
|
||||
raw_bytes.to_be_bytes()
|
||||
};
|
||||
if false && position & 7 == 0 {
|
||||
let byte_index = position / 8;
|
||||
Ok(self.bytes[byte_index..self.find_null_byte(byte_index)].to_vec())
|
||||
} else {
|
||||
let mut acc = Vec::with_capacity(32);
|
||||
let mut pos = position;
|
||||
loop {
|
||||
let read = min((USIZE_SIZE - 1) * 8, self.bit_len() - pos);
|
||||
let raw_bytes = self.read_usize(pos, read);
|
||||
let bytes: [u8; USIZE_SIZE] = if E::is_le() {
|
||||
raw_bytes.to_le_bytes()
|
||||
} else {
|
||||
raw_bytes.to_be_bytes()
|
||||
};
|
||||
|
||||
let bytes_read = read / 8;
|
||||
let bytes_read = read / 8;
|
||||
|
||||
let (start, end) = if E::is_le() {
|
||||
(0usize, bytes_read)
|
||||
} else {
|
||||
(USIZE_SIZE - bytes_read, USIZE_SIZE)
|
||||
};
|
||||
let (start, end) = if E::is_le() {
|
||||
(0usize, bytes_read)
|
||||
} else {
|
||||
(USIZE_SIZE - bytes_read, USIZE_SIZE)
|
||||
};
|
||||
|
||||
for i in start..end {
|
||||
if bytes[i] == 0 {
|
||||
acc.extend_from_slice(&bytes[start..i]);
|
||||
for i in start..end {
|
||||
if bytes[i] == 0 {
|
||||
acc.extend_from_slice(&bytes[start..i]);
|
||||
return Ok(acc);
|
||||
}
|
||||
}
|
||||
acc.extend_from_slice(&bytes[start..end]);
|
||||
|
||||
if bytes_read < (USIZE_SIZE - 1) {
|
||||
return Ok(acc);
|
||||
}
|
||||
}
|
||||
acc.extend_from_slice(&bytes[start..end]);
|
||||
|
||||
if bytes_read < (USIZE_SIZE - 1) {
|
||||
return Ok(acc);
|
||||
pos += read;
|
||||
}
|
||||
|
||||
pos += read;
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue