1438f7fc0SSiva Chandra Reddy //===-- Benchmark memory specific tools -----------------------------------===//
2438f7fc0SSiva Chandra Reddy //
3438f7fc0SSiva Chandra Reddy // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4438f7fc0SSiva Chandra Reddy // See https://llvm.org/LICENSE.txt for license information.
5438f7fc0SSiva Chandra Reddy // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6438f7fc0SSiva Chandra Reddy //
7438f7fc0SSiva Chandra Reddy //===----------------------------------------------------------------------===//
8438f7fc0SSiva Chandra Reddy 
9438f7fc0SSiva Chandra Reddy #include "LibcMemoryBenchmark.h"
10438f7fc0SSiva Chandra Reddy #include "llvm/ADT/SmallVector.h"
11d3c70d9fSGuillaume Chatelet #include "llvm/ADT/Twine.h"
12438f7fc0SSiva Chandra Reddy #include "llvm/Support/ErrorHandling.h"
13438f7fc0SSiva Chandra Reddy #include "llvm/Support/MathExtras.h"
14438f7fc0SSiva Chandra Reddy #include <algorithm>
15438f7fc0SSiva Chandra Reddy 
16438f7fc0SSiva Chandra Reddy namespace llvm {
17438f7fc0SSiva Chandra Reddy namespace libc_benchmarks {
18438f7fc0SSiva Chandra Reddy 
19438f7fc0SSiva Chandra Reddy // Returns a distribution that samples the buffer to satisfy the required
20438f7fc0SSiva Chandra Reddy // alignment.
21438f7fc0SSiva Chandra Reddy // When alignment is set, the distribution is scaled down by `Factor` and scaled
22438f7fc0SSiva Chandra Reddy // up again by the same amount during sampling.
23438f7fc0SSiva Chandra Reddy static std::uniform_int_distribution<uint32_t>
getOffsetDistribution(size_t BufferSize,size_t MaxSizeValue,MaybeAlign AccessAlignment)24deae7e98SGuillaume Chatelet getOffsetDistribution(size_t BufferSize, size_t MaxSizeValue,
25deae7e98SGuillaume Chatelet                       MaybeAlign AccessAlignment) {
26deae7e98SGuillaume Chatelet   if (AccessAlignment && *AccessAlignment > AlignedBuffer::Alignment)
27438f7fc0SSiva Chandra Reddy     report_fatal_error(
28deae7e98SGuillaume Chatelet         "AccessAlignment must be less or equal to AlignedBuffer::Alignment");
29deae7e98SGuillaume Chatelet   if (!AccessAlignment)
30438f7fc0SSiva Chandra Reddy     return std::uniform_int_distribution<uint32_t>(0, 0); // Always 0.
31438f7fc0SSiva Chandra Reddy   // If we test up to Size bytes, the returned offset must stay under
32438f7fc0SSiva Chandra Reddy   // BuffersSize - Size.
33deae7e98SGuillaume Chatelet   int64_t MaxOffset = BufferSize;
34deae7e98SGuillaume Chatelet   MaxOffset -= MaxSizeValue;
35438f7fc0SSiva Chandra Reddy   MaxOffset -= 1;
36438f7fc0SSiva Chandra Reddy   if (MaxOffset < 0)
37438f7fc0SSiva Chandra Reddy     report_fatal_error(
38438f7fc0SSiva Chandra Reddy         "BufferSize too small to exercise specified Size configuration");
39deae7e98SGuillaume Chatelet   MaxOffset /= AccessAlignment->value();
40438f7fc0SSiva Chandra Reddy   return std::uniform_int_distribution<uint32_t>(0, MaxOffset);
41438f7fc0SSiva Chandra Reddy }
42438f7fc0SSiva Chandra Reddy 
OffsetDistribution(size_t BufferSize,size_t MaxSizeValue,MaybeAlign AccessAlignment)43deae7e98SGuillaume Chatelet OffsetDistribution::OffsetDistribution(size_t BufferSize, size_t MaxSizeValue,
44deae7e98SGuillaume Chatelet                                        MaybeAlign AccessAlignment)
45deae7e98SGuillaume Chatelet     : Distribution(
46deae7e98SGuillaume Chatelet           getOffsetDistribution(BufferSize, MaxSizeValue, AccessAlignment)),
47deae7e98SGuillaume Chatelet       Factor(AccessAlignment.valueOrOne().value()) {}
48438f7fc0SSiva Chandra Reddy 
49438f7fc0SSiva Chandra Reddy // Precomputes offset where to insert mismatches between the two buffers.
MismatchOffsetDistribution(size_t BufferSize,size_t MaxSizeValue,size_t MismatchAt)50deae7e98SGuillaume Chatelet MismatchOffsetDistribution::MismatchOffsetDistribution(size_t BufferSize,
51deae7e98SGuillaume Chatelet                                                        size_t MaxSizeValue,
52deae7e98SGuillaume Chatelet                                                        size_t MismatchAt)
53deae7e98SGuillaume Chatelet     : MismatchAt(MismatchAt) {
54438f7fc0SSiva Chandra Reddy   if (MismatchAt <= 1)
55438f7fc0SSiva Chandra Reddy     return;
56deae7e98SGuillaume Chatelet   for (size_t I = MaxSizeValue + 1; I < BufferSize; I += MaxSizeValue)
57438f7fc0SSiva Chandra Reddy     MismatchIndices.push_back(I);
58438f7fc0SSiva Chandra Reddy   if (MismatchIndices.empty())
59deae7e98SGuillaume Chatelet     report_fatal_error("Unable to generate mismatch");
60438f7fc0SSiva Chandra Reddy   MismatchIndexSelector =
61438f7fc0SSiva Chandra Reddy       std::uniform_int_distribution<size_t>(0, MismatchIndices.size() - 1);
62438f7fc0SSiva Chandra Reddy }
63438f7fc0SSiva Chandra Reddy 
getL1DataCacheSize()64d3c70d9fSGuillaume Chatelet static size_t getL1DataCacheSize() {
65d3c70d9fSGuillaume Chatelet   const std::vector<CacheInfo> &CacheInfos = HostState::get().Caches;
66d3c70d9fSGuillaume Chatelet   const auto IsL1DataCache = [](const CacheInfo &CI) {
67d3c70d9fSGuillaume Chatelet     return CI.Type == "Data" && CI.Level == 1;
68d3c70d9fSGuillaume Chatelet   };
69d3c70d9fSGuillaume Chatelet   const auto CacheIt = find_if(CacheInfos, IsL1DataCache);
70d3c70d9fSGuillaume Chatelet   if (CacheIt != CacheInfos.end())
71d3c70d9fSGuillaume Chatelet     return CacheIt->Size;
72d3c70d9fSGuillaume Chatelet   report_fatal_error("Unable to read L1 Cache Data Size");
73d3c70d9fSGuillaume Chatelet }
74d3c70d9fSGuillaume Chatelet 
getAvailableBufferSize()75d3c70d9fSGuillaume Chatelet static size_t getAvailableBufferSize() {
76d3c70d9fSGuillaume Chatelet   static constexpr int64_t KiB = 1024;
77d3c70d9fSGuillaume Chatelet   static constexpr int64_t ParameterStorageBytes = 4 * KiB;
78d3c70d9fSGuillaume Chatelet   static constexpr int64_t L1LeftAsideBytes = 1 * KiB;
79d3c70d9fSGuillaume Chatelet   return getL1DataCacheSize() - L1LeftAsideBytes - ParameterStorageBytes;
80d3c70d9fSGuillaume Chatelet }
81d3c70d9fSGuillaume Chatelet 
ParameterBatch(size_t BufferCount)82d3c70d9fSGuillaume Chatelet ParameterBatch::ParameterBatch(size_t BufferCount)
83d3c70d9fSGuillaume Chatelet     : BufferSize(getAvailableBufferSize() / BufferCount),
84d3c70d9fSGuillaume Chatelet       BatchSize(BufferSize / sizeof(ParameterType)), Parameters(BatchSize) {
85d3c70d9fSGuillaume Chatelet   if (BufferSize <= 0 || BatchSize < 100)
86d3c70d9fSGuillaume Chatelet     report_fatal_error("Not enough L1 cache");
87d3c70d9fSGuillaume Chatelet }
88d3c70d9fSGuillaume Chatelet 
getBatchBytes() const89d3c70d9fSGuillaume Chatelet size_t ParameterBatch::getBatchBytes() const {
90d3c70d9fSGuillaume Chatelet   size_t BatchBytes = 0;
91d3c70d9fSGuillaume Chatelet   for (auto &P : Parameters)
92d3c70d9fSGuillaume Chatelet     BatchBytes += P.SizeBytes;
93d3c70d9fSGuillaume Chatelet   return BatchBytes;
94d3c70d9fSGuillaume Chatelet }
95d3c70d9fSGuillaume Chatelet 
checkValid(const ParameterType & P) const96d3c70d9fSGuillaume Chatelet void ParameterBatch::checkValid(const ParameterType &P) const {
97d3c70d9fSGuillaume Chatelet   if (P.OffsetBytes + P.SizeBytes >= BufferSize)
98d3c70d9fSGuillaume Chatelet     report_fatal_error(
99d3c70d9fSGuillaume Chatelet         llvm::Twine("Call would result in buffer overflow: Offset=")
100d3c70d9fSGuillaume Chatelet             .concat(llvm::Twine(P.OffsetBytes))
101d3c70d9fSGuillaume Chatelet             .concat(", Size=")
102d3c70d9fSGuillaume Chatelet             .concat(llvm::Twine(P.SizeBytes))
103d3c70d9fSGuillaume Chatelet             .concat(", BufferSize=")
104d3c70d9fSGuillaume Chatelet             .concat(llvm::Twine(BufferSize)));
105d3c70d9fSGuillaume Chatelet }
106d3c70d9fSGuillaume Chatelet 
CopySetup()107e4dee762SGuillaume Chatelet CopySetup::CopySetup()
108d3c70d9fSGuillaume Chatelet     : ParameterBatch(2), SrcBuffer(ParameterBatch::BufferSize),
109d3c70d9fSGuillaume Chatelet       DstBuffer(ParameterBatch::BufferSize) {}
110d3c70d9fSGuillaume Chatelet 
MoveSetup()111*de21f346SGuillaume Chatelet MoveSetup::MoveSetup()
112*de21f346SGuillaume Chatelet     : ParameterBatch(3), Buffer(ParameterBatch::BufferSize * 3) {}
113*de21f346SGuillaume Chatelet 
ComparisonSetup()114e4dee762SGuillaume Chatelet ComparisonSetup::ComparisonSetup()
115d3c70d9fSGuillaume Chatelet     : ParameterBatch(2), LhsBuffer(ParameterBatch::BufferSize),
116d3c70d9fSGuillaume Chatelet       RhsBuffer(ParameterBatch::BufferSize) {
117d3c70d9fSGuillaume Chatelet   // The memcmp buffers always compare equal.
118d3c70d9fSGuillaume Chatelet   memset(LhsBuffer.begin(), 0xF, BufferSize);
119d3c70d9fSGuillaume Chatelet   memset(RhsBuffer.begin(), 0xF, BufferSize);
120d3c70d9fSGuillaume Chatelet }
121d3c70d9fSGuillaume Chatelet 
SetSetup()122e4dee762SGuillaume Chatelet SetSetup::SetSetup()
123d3c70d9fSGuillaume Chatelet     : ParameterBatch(1), DstBuffer(ParameterBatch::BufferSize) {}
124d3c70d9fSGuillaume Chatelet 
125438f7fc0SSiva Chandra Reddy } // namespace libc_benchmarks
126438f7fc0SSiva Chandra Reddy } // namespace llvm
127