449 lines
13 KiB
Rust
449 lines
13 KiB
Rust
/*
|
|
* Copyright 2025 The Dragonfly Authors
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
use bytesize::ByteSize;
|
|
use criterion::{black_box, criterion_group, criterion_main, BenchmarkId, Criterion};
|
|
use dragonfly_client_storage::cache::lru_cache::LruCache;
|
|
|
|
// Number of operations to perform in each benchmark
|
|
const OPERATION_COUNT: usize = 1000;
|
|
|
|
pub fn lru_cache_put(c: &mut Criterion) {
|
|
let mut group = c.benchmark_group("Lru Cache Put");
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Put", "4MB"),
|
|
&ByteSize::mb(4),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| LruCache::new(OPERATION_COUNT),
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Put", "10MB"),
|
|
&ByteSize::mb(10),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| LruCache::new(OPERATION_COUNT),
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Put", "16MB"),
|
|
&ByteSize::mb(16),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| LruCache::new(OPERATION_COUNT),
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.finish();
|
|
}
|
|
|
|
pub fn lru_cache_get(c: &mut Criterion) {
|
|
let mut group = c.benchmark_group("Lru Cache Get");
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Get", "4MB"),
|
|
&ByteSize::mb(4),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.get(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Get", "10MB"),
|
|
&ByteSize::mb(10),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.get(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Get", "16MB"),
|
|
&ByteSize::mb(16),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.get(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.finish();
|
|
}
|
|
|
|
pub fn lru_cache_peek(c: &mut Criterion) {
|
|
let mut group = c.benchmark_group("Lru Cache Peek");
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Peek", "4MB"),
|
|
&ByteSize::mb(4),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.peek(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Peek", "10MB"),
|
|
&ByteSize::mb(10),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.peek(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Peek", "16MB"),
|
|
&ByteSize::mb(16),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.peek(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.finish();
|
|
}
|
|
|
|
pub fn lru_cache_contains(c: &mut Criterion) {
|
|
let mut group = c.benchmark_group("Lru Cache Contains");
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Contains", "4MB"),
|
|
&ByteSize::mb(4),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.contains(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Contains", "10MB"),
|
|
&ByteSize::mb(10),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.contains(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Contains", "16MB"),
|
|
&ByteSize::mb(16),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.contains(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.finish();
|
|
}
|
|
|
|
pub fn lru_cache_pop(c: &mut Criterion) {
|
|
let mut group = c.benchmark_group("Lru Cache Pop");
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Pop", "4MB"),
|
|
&ByteSize::mb(4),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.pop(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Pop", "10MB"),
|
|
&ByteSize::mb(10),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.pop(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Pop", "16MB"),
|
|
&ByteSize::mb(16),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
for i in 0..OPERATION_COUNT {
|
|
black_box(cache.pop(&format!("key{}", i)));
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.finish();
|
|
}
|
|
|
|
pub fn lru_cache_pop_lru(c: &mut Criterion) {
|
|
let mut group = c.benchmark_group("Lru Cache Pop Lru");
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Pop Lru", "4MB"),
|
|
&ByteSize::mb(4),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
while !cache.is_empty() {
|
|
black_box(cache.pop_lru());
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Pop Lru", "10MB"),
|
|
&ByteSize::mb(10),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
while !cache.is_empty() {
|
|
black_box(cache.pop_lru());
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.bench_with_input(
|
|
BenchmarkId::new("Lru Cache Pop Lru", "16MB"),
|
|
&ByteSize::mb(16),
|
|
|b, size| {
|
|
b.iter_batched(
|
|
|| {
|
|
let mut cache = LruCache::new(OPERATION_COUNT);
|
|
for i in 0..OPERATION_COUNT {
|
|
cache.put(format!("key{}", i), size.as_u64());
|
|
}
|
|
cache
|
|
},
|
|
|mut cache| {
|
|
while !cache.is_empty() {
|
|
black_box(cache.pop_lru());
|
|
}
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
);
|
|
},
|
|
);
|
|
|
|
group.finish();
|
|
}
|
|
|
|
criterion_group!(
|
|
benches,
|
|
lru_cache_put,
|
|
lru_cache_get,
|
|
lru_cache_peek,
|
|
lru_cache_contains,
|
|
lru_cache_pop,
|
|
lru_cache_pop_lru,
|
|
);
|
|
|
|
criterion_main!(benches);
|