Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Cargo.lock

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion Cargo.toml
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
[package]
name = "parity-codec"
description = "Lightweight, efficient, binary serialization and deserialization codec"
version = "4.1.1-alpha.0"
version = "4.1.1"
authors = ["Parity Technologies <admin@parity.io>"]
license = "Apache-2.0"
repository = "https://github.com/paritytech/parity-codec"
Expand Down
52 changes: 48 additions & 4 deletions src/codec.rs
Original file line number Diff line number Diff line change
Expand Up @@ -18,6 +18,10 @@ use crate::alloc::vec::Vec;
use crate::alloc::boxed::Box;
use crate::alloc::collections::btree_map::BTreeMap;

/// When decoding input we don't allocate too much in advance so a small crafted input can't
/// trigger a big allocation.
const MAX_PREALLOCATION_SIZE: usize = 4 * 1024;

#[cfg(any(feature = "std", feature = "full"))]
use crate::alloc::{
string::String,
Expand Down Expand Up @@ -789,10 +793,32 @@ impl Decode for Vec<u8> {
fn decode<I: Input>(input: &mut I) -> Option<Self> {
<Compact<u32>>::decode(input).and_then(move |Compact(len)| {
let len = len as usize;
let mut vec = vec![0; len];
if input.read(&mut vec[..len]) != len {
None

if len < MAX_PREALLOCATION_SIZE {
let mut vec = vec![0; len]; // len is ok here
if input.read(&mut vec[..]) != len {
None
} else {
Some(vec)
}
} else {
// if len is considered too much for preallocation then use dynamic allocation
let mut vec = Vec::new();
let mut remains = len;
let buffer_len = MAX_PREALLOCATION_SIZE;
let mut buffer = vec![0; buffer_len];

while remains != 0 {
let len_read = input.read(&mut buffer[..buffer_len.min(remains)]);

if len_read == 0 {
return None
}

remains -= len_read;
vec.extend_from_slice(&buffer[..len_read]);
}

Some(vec)
}
})
Expand Down Expand Up @@ -872,7 +898,11 @@ impl<T: Encode> Encode for Vec<T> {
impl<T: Decode> Decode for Vec<T> {
fn decode<I: Input>(input: &mut I) -> Option<Self> {
<Compact<u32>>::decode(input).and_then(move |Compact(len)| {
let mut r = Vec::with_capacity(len as usize);
let max_pre_allocated_len = MAX_PREALLOCATION_SIZE.checked_div(mem::size_of::<T>())
.unwrap_or(0);

let pre_allocated_len = (len as usize).min(max_pre_allocated_len);
let mut r = Vec::with_capacity(pre_allocated_len);
for _ in 0..len {
r.push(T::decode(input)?);
}
Expand Down Expand Up @@ -1507,4 +1537,18 @@ mod tests {
CompactRef(&std::u64::MAX).using_encoded(|_| {});
CompactRef(&std::u128::MAX).using_encoded(|_| {});
}

#[test]
fn encode_for_very_large_vec_works() {
let vec_u8: Vec<u8> = (0..MAX_PREALLOCATION_SIZE*3).map(|i| i as u8).collect();
let vec_u16: Vec<u16> = (0..MAX_PREALLOCATION_SIZE*3).map(|i| i as u16).collect();
assert_eq!(Vec::<u8>::decode(&mut &vec_u8.encode()[..][..]).unwrap(), vec_u8);
assert_eq!(Vec::<u16>::decode(&mut &vec_u16.encode()[..][..]).unwrap(), vec_u16);
}

#[test]
fn encode_for_null_size_vec_works() {
let vec: Vec<()> = vec![(); 10];
assert_eq!(Vec::<()>::decode(&mut &vec.encode()[..][..]).unwrap(), vec);
}
}