1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
use std::hint::black_box;
use azalea_core::position::{BlockPos, ChunkBlockPos, ChunkPos};
use azalea_registry::builtin::BlockKind;
use azalea_world::{BitStorage, Chunk, ChunkStorage};
use criterion::{BatchSize, Bencher, Criterion, criterion_group, criterion_main};
fn bench_chunks(c: &mut Criterion) {
c.bench_function("Chunk::set", |b| {
b.iter(|| {
let mut chunk = Chunk::default();
for x in 0..16 {
for z in 0..16 {
chunk.set_block_state(
&ChunkBlockPos::new(x, 1, z),
BlockKind::Bedrock.into(),
0,
);
}
}
black_box(chunk);
});
});
c.bench_function("ChunkStorage::get_block_state", |b| {
b.iter(|| {
let mut storage = ChunkStorage::default();
let chunk = storage.upsert(ChunkPos::new(0, 0), Chunk::default());
for x in 0..16 {
for z in 0..16 {
for y in 0..16 {
black_box(storage.get_block_state(BlockPos::new(x, y, z)));
}
}
}
black_box(chunk);
});
});
}
fn bench_bitstorage_with(b: &mut Bencher, bits: usize, size: usize) {
let mut storage = BitStorage::new(bits, size, None).unwrap();
b.iter_batched(
|| {
// let index = rand
let mut vec = Vec::with_capacity(size);
for _ in 0..size {
vec.push(rand::random_range(0..size));
}
vec
},
|indices| {
for index in indices {
storage.set(index, 1);
}
},
BatchSize::SmallInput,
);
black_box(storage);
}
fn bench_bitstorage(c: &mut Criterion) {
c.bench_function("BitStorage::set (1 bit per entry)", |b| {
bench_bitstorage_with(b, 1, 4096)
});
c.bench_function("BitStorage::set (2 bits per entry)", |b| {
bench_bitstorage_with(b, 2, 4096)
});
c.bench_function("BitStorage::set (3 bits per entry)", |b| {
bench_bitstorage_with(b, 3, 4096)
});
}
criterion_group!(benches, bench_chunks, bench_bitstorage);
criterion_main!(benches);
|
