mirror of
https://github.com/Gericom/teak-llvm.git
synced 2025-06-18 19:15:51 -04:00
aba80d0734
Summary:
This patch adds a benchmarking infrastructure for llvm-libc memory functions.
In a nutshell, the code can benchmark small and large buffers for the memcpy, memset and memcmp functions.
It also produces graphs of size vs latency by running targets of the form `render-libc-{memcpy|memset|memcmp}-benchmark-{small|big}`.
The configurations are provided as JSON files and the benchmark also produces a JSON file.
This file is then parsed and rendered as a PNG file via the `render.py` script (make sure to run `pip3 install matplotlib scipy numpy`).
The script can take several JSON files as input and will superimpose the curves if they are from the same host.
TODO:
- The code benchmarks whatever is available on the host but should be configured to benchmark the -to be added- llvm-libc memory functions.
- Add a README file with instructions and rationale.
- Produce scores to track the performance of the functions over time to allow for regression detection.
Reviewers: sivachandra, ckennelly
Subscribers: mgorny, MaskRay, libc-commits
Tags: #libc-project
Differential Revision: https://reviews.llvm.org/D72516
63 lines
2.4 KiB
C++
63 lines
2.4 KiB
C++
//===-------- Benchmark memory specific tools -----------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "LibcMemoryBenchmark.h"
|
|
#include "llvm/ADT/SmallVector.h"
|
|
#include "llvm/Support/ErrorHandling.h"
|
|
#include "llvm/Support/MathExtras.h"
|
|
#include <algorithm>
|
|
|
|
namespace llvm {
|
|
namespace libc_benchmarks {
|
|
|
|
// Returns a distribution that samples the buffer to satisfy the required
|
|
// alignment.
|
|
// When alignment is set, the distribution is scaled down by `Factor` and scaled
|
|
// up again by the same amount during sampling.
|
|
static std::uniform_int_distribution<uint32_t>
|
|
GetOffsetDistribution(const StudyConfiguration &Conf) {
|
|
if (Conf.AddressAlignment &&
|
|
*Conf.AddressAlignment > AlignedBuffer::Alignment)
|
|
report_fatal_error(
|
|
"AddressAlignment must be less or equal to AlignedBuffer::Alignment");
|
|
if (!Conf.AddressAlignment)
|
|
return std::uniform_int_distribution<uint32_t>(0, 0); // Always 0.
|
|
// If we test up to Size bytes, the returned offset must stay under
|
|
// BuffersSize - Size.
|
|
int64_t MaxOffset = Conf.BufferSize;
|
|
MaxOffset -= Conf.Size.To;
|
|
MaxOffset -= 1;
|
|
if (MaxOffset < 0)
|
|
report_fatal_error(
|
|
"BufferSize too small to exercise specified Size configuration");
|
|
MaxOffset /= Conf.AddressAlignment->value();
|
|
return std::uniform_int_distribution<uint32_t>(0, MaxOffset);
|
|
}
|
|
|
|
OffsetDistribution::OffsetDistribution(const StudyConfiguration &Conf)
|
|
: Distribution(GetOffsetDistribution(Conf)),
|
|
Factor(Conf.AddressAlignment.valueOrOne().value()) {}
|
|
|
|
// Precomputes offset where to insert mismatches between the two buffers.
|
|
MismatchOffsetDistribution::MismatchOffsetDistribution(
|
|
const StudyConfiguration &Conf)
|
|
: MismatchAt(Conf.MemcmpMismatchAt) {
|
|
if (MismatchAt <= 1)
|
|
return;
|
|
const auto ToSize = Conf.Size.To;
|
|
for (size_t I = ToSize + 1; I < Conf.BufferSize; I += ToSize)
|
|
MismatchIndices.push_back(I);
|
|
if (MismatchIndices.empty())
|
|
llvm::report_fatal_error("Unable to generate mismatch");
|
|
MismatchIndexSelector =
|
|
std::uniform_int_distribution<size_t>(0, MismatchIndices.size() - 1);
|
|
}
|
|
|
|
} // namespace libc_benchmarks
|
|
} // namespace llvm
|