mirror of
https://github.com/apple/foundationdb.git
synced 2025-05-16 19:02:20 +08:00
73 lines
2.5 KiB
C++
73 lines
2.5 KiB
C++
/*
|
|
* BenchHash.cpp
|
|
*
|
|
* This source file is part of the FoundationDB open source project
|
|
*
|
|
* Copyright 2013-2020 Apple Inc. and the FoundationDB project 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.
|
|
*/
|
|
|
|
#include "benchmark/benchmark.h"
|
|
#include "flow/crc32c.h"
|
|
#include "flow/Hash3.h"
|
|
#include "flow/xxhash64.h"
|
|
#include "flowbench/GlobalData.h"
|
|
|
|
#include <stdint.h>
|
|
|
|
static void bench_hash_hashlittle2(benchmark::State& state) {
|
|
auto length = 1 << state.range(0);
|
|
auto key = getKey(length);
|
|
while (state.KeepRunning()) {
|
|
uint32_t part1;
|
|
uint32_t part2;
|
|
hashlittle2(key.begin(), length, &part1, &part2);
|
|
benchmark::DoNotOptimize(part1);
|
|
benchmark::DoNotOptimize(part2);
|
|
}
|
|
state.SetItemsProcessed(static_cast<long>(state.iterations()));
|
|
}
|
|
|
|
static void bench_hash_crc32c(benchmark::State& state) {
|
|
auto length = 1 << state.range(0);
|
|
auto key = getKey(length);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(crc32c_append(0xfdbeefdb, key.begin(), length));
|
|
}
|
|
state.SetItemsProcessed(static_cast<long>(state.iterations()));
|
|
}
|
|
|
|
static void bench_hash_xxhash64(benchmark::State& state) {
|
|
auto length = 1 << state.range(0);
|
|
auto key = getKey(length);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(XXHash64::hash(key.begin(), length, 0xfdbeefdbfdbeefdb));
|
|
}
|
|
state.SetItemsProcessed(static_cast<long>(state.iterations()));
|
|
}
|
|
|
|
static void bench_hash_xxhash64_unaligned(benchmark::State& state) {
|
|
auto length = 1 << state.range(0);
|
|
auto key = getKey(length + 1);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(XXHash64::hash(key.begin() + 1, length, 0xfdbeefdbfdbeefdb));
|
|
}
|
|
state.SetItemsProcessed(static_cast<long>(state.iterations()));
|
|
}
|
|
|
|
BENCHMARK(bench_hash_crc32c)->DenseRange(2, 16)->ReportAggregatesOnly(true);
|
|
BENCHMARK(bench_hash_hashlittle2)->DenseRange(2, 16)->ReportAggregatesOnly(true);
|
|
BENCHMARK(bench_hash_xxhash64)->DenseRange(2, 16)->ReportAggregatesOnly(true);
|
|
BENCHMARK(bench_hash_xxhash64_unaligned)->DenseRange(2, 16)->ReportAggregatesOnly(true);
|