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 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136
|
//===----------------------------------------------------------------------===//
//
// 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 "benchmark/benchmark.h"
#include <new>
#include <vector>
#include <cassert>
struct PointerList {
PointerList* Next = nullptr;
};
struct MallocWrapper {
__attribute__((always_inline))
static void* Allocate(size_t N) {
return std::malloc(N);
}
__attribute__((always_inline))
static void Deallocate(void* P, size_t) {
std::free(P);
}
};
struct NewWrapper {
__attribute__((always_inline))
static void* Allocate(size_t N) {
return ::operator new(N);
}
__attribute__((always_inline))
static void Deallocate(void* P, size_t) {
::operator delete(P);
}
};
struct BuiltinNewWrapper {
__attribute__((always_inline))
static void* Allocate(size_t N) {
return __builtin_operator_new(N);
}
__attribute__((always_inline))
static void Deallocate(void* P, size_t) {
__builtin_operator_delete(P);
}
};
struct BuiltinSizedNewWrapper {
__attribute__((always_inline))
static void* Allocate(size_t N) {
return __builtin_operator_new(N);
}
__attribute__((always_inline))
static void Deallocate(void* P, size_t N) {
__builtin_operator_delete(P, N);
}
};
template <class AllocWrapper>
static void BM_AllocateAndDeallocate(benchmark::State& st) {
const size_t alloc_size = st.range(0);
while (st.KeepRunning()) {
void* p = AllocWrapper::Allocate(alloc_size);
benchmark::DoNotOptimize(p);
AllocWrapper::Deallocate(p, alloc_size);
}
}
template <class AllocWrapper>
static void BM_AllocateOnly(benchmark::State& st) {
const size_t alloc_size = st.range(0);
PointerList *Start = nullptr;
while (st.KeepRunning()) {
PointerList* p = (PointerList*)AllocWrapper::Allocate(alloc_size);
benchmark::DoNotOptimize(p);
p->Next = Start;
Start = p;
}
PointerList *Next = Start;
while (Next) {
PointerList *Tmp = Next;
Next = Tmp->Next;
AllocWrapper::Deallocate(Tmp, alloc_size);
}
}
template <class AllocWrapper>
static void BM_DeallocateOnly(benchmark::State& st) {
const size_t alloc_size = st.range(0);
const auto NumAllocs = st.max_iterations;
using PtrT = void*;
std::vector<void*> Pointers(NumAllocs);
for (auto& p : Pointers) {
p = AllocWrapper::Allocate(alloc_size);
}
void** Data = Pointers.data();
void** const End = Pointers.data() + Pointers.size();
while (st.KeepRunning()) {
AllocWrapper::Deallocate(*Data, alloc_size);
Data += 1;
}
assert(Data == End);
}
static int RegisterAllocBenchmarks() {
using FnType = void(*)(benchmark::State&);
struct {
const char* name;
FnType func;
} TestCases[] = {
{"BM_Malloc", &BM_AllocateAndDeallocate<MallocWrapper>},
{"BM_New", &BM_AllocateAndDeallocate<NewWrapper>},
{"BM_BuiltinNewDelete", BM_AllocateAndDeallocate<BuiltinNewWrapper>},
{"BM_BuiltinSizedNewDelete", BM_AllocateAndDeallocate<BuiltinSizedNewWrapper>},
{"BM_BuiltinNewAllocateOnly", BM_AllocateOnly<BuiltinSizedNewWrapper>},
{"BM_BuiltinNewSizedDeallocateOnly", BM_DeallocateOnly<BuiltinSizedNewWrapper>},
};
for (auto TC : TestCases) {
benchmark::RegisterBenchmark(TC.name, TC.func)->Range(16, 4096 * 2);
}
return 0;
}
int Sink = RegisterAllocBenchmarks();
BENCHMARK_MAIN();
|