mirrors/llvm-project
0
0
Fork 0
mirror of https://github.com/llvm/llvm-project.git synced 2025-04-25 19:16:05 +00:00
Code Issues Projects Releases Wiki Activity

[libc++][test] Speed up input generating functions for benchmark tests (#115544)

Browse Source 
The input generating functions for benchmark tests in the GenerateInput.h
file can be slightly improved by invoking vector::reserve before calling
vector::push_back. This slight performance improvement could potentially
speed-up all benchmark tests for containers and algorithms that use these
functions as inputs.
This commit is contained in:
Peng Liu 2024-11-18 10:32:54 -05:00 committed by GitHub
parent 8f8016fe66
commit c25e09e238
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 6 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
libcxx/test/benchmarks/GenerateInput.h
View File

@ -53,6 +53,7 @@ inline std::vector<IntT> getDuplicateIntegerInputs(std::size_t N) {
template <class IntT>
inline std::vector<IntT> getSortedIntegerInputs(std::size_t N) {
std::vector<IntT> inputs;
inputs.reserve(N);
for (std::size_t i = 0; i < N; i += 1)
inputs.push_back(i);
return inputs;
@ -61,6 +62,7 @@ inline std::vector<IntT> getSortedIntegerInputs(std::size_t N) {
template <class IntT>
std::vector<IntT> getSortedLargeIntegerInputs(std::size_t N) {
std::vector<IntT> inputs;
inputs.reserve(N);
for (std::size_t i = 0; i < N; ++i)
inputs.push_back(i + N);
return inputs;
@ -77,6 +79,7 @@ std::vector<IntT> getSortedTopBitsIntegerInputs(std::size_t N) {
template <class IntT>
inline std::vector<IntT> getReverseSortedIntegerInputs(std::size_t N) {
std::vector<IntT> inputs;
inputs.reserve(N);
std::size_t i = N;
while (i > 0) {
--i;
@ -99,6 +102,7 @@ std::vector<IntT> getPipeOrganIntegerInputs(std::size_t N) {
template <class IntT>
std::vector<IntT> getRandomIntegerInputs(std::size_t N) {
std::vector<IntT> inputs;
inputs.reserve(N);
for (std::size_t i = 0; i < N; ++i)
inputs.push_back(getRandomInteger<IntT>(0, std::numeric_limits<IntT>::max()));
return inputs;
@ -111,6 +115,7 @@ inline std::vector<std::string> getDuplicateStringInputs(std::size_t N) {
inline std::vector<std::string> getRandomStringInputs(std::size_t N) {
std::vector<std::string> inputs;
inputs.reserve(N);
for (std::size_t i = 0; i < N; ++i)
inputs.push_back(getRandomString(1024));
return inputs;
@ -118,6 +123,7 @@ inline std::vector<std::string> getRandomStringInputs(std::size_t N) {
inline std::vector<std::string> getPrefixedRandomStringInputs(std::size_t N) {
std::vector<std::string> inputs;
inputs.reserve(N);
constexpr int kSuffixLength = 32;
const std::string prefix = getRandomString(1024 - kSuffixLength);
for (std::size_t i = 0; i < N; ++i)