forked from tiny-http/tiny-http
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
perf: stack alloc buf might be faster
If the requests are ok most of the time, then a 256 byte array should be faster. test stack_buf_128 ... bench: 2,520,140 ns/iter (+/- 175,758) test stack_buf_192 ... bench: 2,429,559 ns/iter (+/- 145,934) test stack_buf_256 ... bench: 2,368,500 ns/iter (+/- 77,421) test stack_buf_384 ... bench: 5,179,250 ns/iter (+/- 171,965) test stack_buf_512 ... bench: 5,457,417 ns/iter (+/- 219,768) test vec_128 ... bench: 10,220,704 ns/iter (+/- 317,712) test vec_192 ... bench: 10,855,938 ns/iter (+/- 407,135) test vec_256 ... bench: 10,921,623 ns/iter (+/- 782,854) test vec_384 ... bench: 10,206,575 ns/iter (+/- 363,215) test vec_512 ... bench: 10,810,583 ns/iter (+/- 255,277) test vec_stack_buf_128 ... bench: 6,190,262 ns/iter (+/- 172,463) test vec_stack_buf_192 ... bench: 7,972,014 ns/iter (+/- 279,520) test vec_stack_buf_256 ... bench: 6,722,798 ns/iter (+/- 308,850) test vec_stack_buf_384 ... bench: 6,945,378 ns/iter (+/- 289,744) test vec_stack_buf_512 ... bench: 6,915,483 ns/iter (+/- 301,180)
- Loading branch information
Showing
2 changed files
with
207 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,195 @@ | ||
#![feature(test)] | ||
|
||
use std::io::{Cursor, Read}; | ||
|
||
extern crate test; | ||
|
||
const READERS: &[&[u8]] = &[ | ||
&[1u8; 0], | ||
&[2u8; 1], | ||
&[3u8; 8], | ||
&[4u8; 12], | ||
&[5u8; 80], | ||
&[6u8; 200], | ||
&[7u8; 1024], | ||
&[8u8; 4096], | ||
&[9u8; 8192], | ||
&[10u8; 25_000_000], | ||
]; | ||
|
||
const COUNTS: [usize; 10] = [10000, 100, 100, 50, 50, 10, 10, 10, 5, 1]; | ||
|
||
const SIZES: [usize; 34] = [ | ||
0_usize, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 79, 80, 81, 199, 200, 201, 1023, | ||
1024, 1025, 4095, 4096, 4097, 8191, 8192, 8193, 24_999_999, 25_000_000, 25_000_001, | ||
]; | ||
|
||
fn stack_buf_bench<const N: usize>(bencher: &mut test::Bencher) { | ||
let readers = std::hint::black_box(READERS); | ||
|
||
bencher.iter(|| { | ||
for (idx, reader) in readers.iter().enumerate() { | ||
for _ in 0..COUNTS[idx] { | ||
let mut reader = Cursor::new(*reader); | ||
|
||
for size in SIZES { | ||
let mut size = size; | ||
if size == 0 { | ||
continue; | ||
} | ||
|
||
let mut buf = &mut [0u8; N][..]; | ||
if size < N { | ||
buf = &mut buf[..size]; | ||
} | ||
|
||
while size > 0 { | ||
match reader.read(buf) { | ||
Ok(0) => { | ||
break; | ||
} | ||
Ok(nr_bytes) => size -= nr_bytes, | ||
Err(err) => { | ||
unreachable!("{}", err); | ||
} | ||
} | ||
|
||
if size < N { | ||
buf = &mut buf[..size]; | ||
} | ||
} | ||
|
||
std::hint::black_box(buf); | ||
} | ||
} | ||
} | ||
}); | ||
} | ||
|
||
fn vec_bench<const N: usize>(bencher: &mut test::Bencher) { | ||
let readers = std::hint::black_box(READERS); | ||
|
||
bencher.iter(|| { | ||
for (idx, reader) in readers.iter().enumerate() { | ||
for _ in 0..COUNTS[idx] { | ||
let mut reader = Cursor::new(*reader); | ||
|
||
for size in SIZES { | ||
let mut size = size; | ||
if size == 0 { | ||
continue; | ||
} | ||
|
||
let mut buf = vec![0u8; if size > N { N } else { size }]; | ||
|
||
while size > 0 { | ||
match reader.read(&mut buf) { | ||
Ok(0) => { | ||
break; | ||
} | ||
Ok(nr_bytes) => size -= nr_bytes, | ||
Err(err) => { | ||
unreachable!("{}", err); | ||
} | ||
} | ||
|
||
buf.truncate(size); | ||
} | ||
std::hint::black_box(buf); | ||
} | ||
} | ||
} | ||
}); | ||
} | ||
|
||
fn vec_stack_buf_bench<const N: usize>(bencher: &mut test::Bencher) { | ||
let readers = std::hint::black_box(READERS); | ||
|
||
bencher.iter(|| { | ||
for (idx, reader) in readers.iter().enumerate() { | ||
for _ in 0..COUNTS[idx] { | ||
let mut reader = Cursor::new(*reader); | ||
|
||
for size in SIZES { | ||
let mut size = size; | ||
if size == 0 { | ||
continue; | ||
} | ||
|
||
if size <= N { | ||
let mut buf = &mut [0u8; N][..]; | ||
while size > 0 { | ||
match reader.read(buf) { | ||
Ok(0) => { | ||
break; | ||
} | ||
Ok(nr_bytes) => size -= nr_bytes, | ||
Err(err) => { | ||
unreachable!("{}", err); | ||
} | ||
} | ||
|
||
if size < N { | ||
buf = &mut buf[..size]; | ||
} | ||
} | ||
std::hint::black_box(buf); | ||
} else { | ||
let buf = &mut vec![0u8; N]; | ||
while size > 0 { | ||
match reader.read(buf) { | ||
Ok(0) => { | ||
break; | ||
} | ||
Ok(nr_bytes) => size -= nr_bytes, | ||
Err(err) => { | ||
unreachable!("{}", err); | ||
} | ||
} | ||
|
||
buf.truncate(size); | ||
} | ||
std::hint::black_box(buf); | ||
}; | ||
} | ||
} | ||
} | ||
}); | ||
} | ||
|
||
macro_rules! create_benches { | ||
( $($fstack:ident, $fvec:ident, $fvecstack:ident, $s:expr),+ ) => { | ||
$( | ||
// #[ignore] | ||
#[bench] | ||
fn $fstack(bencher: &mut test::Bencher) { | ||
stack_buf_bench::<$s>(bencher); | ||
} | ||
|
||
// #[ignore] | ||
#[bench] | ||
fn $fvec(bencher: &mut test::Bencher) { | ||
vec_bench::<$s>(bencher); | ||
} | ||
|
||
// #[ignore] | ||
#[bench] | ||
fn $fvecstack(bencher: &mut test::Bencher) { | ||
vec_stack_buf_bench::<$s>(bencher); | ||
} | ||
)+ | ||
}; | ||
( $([$f1:ident, $f2:ident, $f3:ident, $s:expr]),+ ) => { | ||
$( | ||
create_benches!($f1, $f2, $f3, $s); | ||
)+ | ||
}; | ||
} | ||
|
||
create_benches!( | ||
[stack_buf_128, vec_128, vec_stack_buf_128, 128_usize], | ||
[stack_buf_192, vec_192, vec_stack_buf_192, 192_usize], | ||
[stack_buf_256, vec_256, vec_stack_buf_256, 256_usize], | ||
[stack_buf_384, vec_384, vec_stack_buf_384, 384_usize], | ||
[stack_buf_512, vec_512, vec_stack_buf_512, 512_usize] | ||
); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters