mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-26 14:36:08 +00:00
549a5fd0b7
Bumping down is significantly faster than bumping up. This is ABI breaking, but the ABI of `pmr::monotonic_buffer_resource` was only stabilized in this release cycle, so we can still change it. For a more detailed explanation why bumping down is better, see https://fitzgeraldnick.com/2019/11/01/always-bump-downwards.html. Reviewed By: ldionne, #libc Spies: libcxx-commits Differential Revision: https://reviews.llvm.org/D141435
29 lines
850 B
C++
29 lines
850 B
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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 <list>
|
|
#include <memory_resource>
|
|
|
|
#include "benchmark/benchmark.h"
|
|
|
|
static void bm_list(benchmark::State& state) {
|
|
char buffer[16384];
|
|
std::pmr::monotonic_buffer_resource resource(buffer, sizeof(buffer));
|
|
for (auto _ : state) {
|
|
std::pmr::list<int> l(&resource);
|
|
for (size_t i = 0; i != state.range(); ++i) {
|
|
l.push_back(1);
|
|
benchmark::DoNotOptimize(l);
|
|
}
|
|
resource.release();
|
|
}
|
|
}
|
|
BENCHMARK(bm_list)->Range(1, 2048);
|
|
|
|
BENCHMARK_MAIN();
|