3b6bb15e86
d9b8fa6098d fix: Fake broadcast address for 127.x.x.x aa649165a57 chore: Add code for future netprof TCP testing 9e5693de5ac chore: add to_string functions for netprof enums 52d915e6a90 cleanup: Heap allocate network profile objects 80fabd4a729 feat: Implement Tox network profiler 05abe083cb6 cleanup: Some random cleanups, mostly related to mem. 5cca24513b8 cleanup: Check that onion IP/Port packing worked. e092ecd1244 cleanup: Use tox memory allocator in some more places. 3cfe41c7587 fix: Avoid `memcpy`-ing structs into onion ping id data. e32ac001938 fix: Add more information on why the frame was not sent. ab887003687 fix: Allow TCP connections to fail `connect` calls. 7603170e663 refactor: Use tox memory in group connection allocations. 5bd8a85eb89 cleanup: Align internal logger with external on type of source line. e9bf524d9e1 cleanup: Add missing `#include` to sort_test.cc. d10c966b998 feat: Add `to_string` functions for toxencryptsave errors. 7bfd0dc8003 docs: Update the docs for group join functions 380dde9f2ae test: Add more logging to TCP connection constructor. 0f12f384c8c cleanup: Reduce stack frame sizes to below 4096 bytes. bc43cec0626 chore: Happy new year! fbe78f1702e cleanup: Add a `TOX_HIDE_DEPRECATED` check to hide deprecated symbols. 44d9da07e77 refactor: Use tox memory for group moderation/pack allocations. 7f26d520168 refactor: Use tox memory in group chats allocations. 2f62f3d0e77 refactor: Use tox Memory for group allocations. 8a968162041 chore: Add dispatch/events headers to bazel export. 2bbfb35abf6 docs: Output the error code string instead of int. in toxav logging d55d0e4eaef cleanup: Remove redundant code for checking if group exists 2a6dc643338 chore: Upgrade dependencies for websockify. fc0650601c1 fix: Allow peers to reconnect to group chats using a password git-subtree-dir: external/toxcore/c-toxcore git-subtree-split: d9b8fa6098de6c074038b6664d2572627540b148
141 lines
3.6 KiB
C++
141 lines
3.6 KiB
C++
/* SPDX-License-Identifier: GPL-3.0-or-later
|
|
* Copyright © 2023-2025 The TokTok team.
|
|
*/
|
|
|
|
#include <benchmark/benchmark.h>
|
|
|
|
#include <algorithm>
|
|
#include <array>
|
|
#include <cstdint>
|
|
#include <random>
|
|
|
|
#include "mem.h"
|
|
#include "sort.h"
|
|
#include "sort_test_util.hh"
|
|
|
|
namespace {
|
|
|
|
std::pair<std::vector<Some_Type>, std::mt19937> random_vec(benchmark::State &state)
|
|
{
|
|
std::mt19937 rng;
|
|
// INT_MAX-1 so later we have room to add 1 larger element if needed.
|
|
std::uniform_int_distribution<uint32_t> dist{
|
|
std::numeric_limits<uint32_t>::min(), std::numeric_limits<uint32_t>::max() - 1};
|
|
|
|
std::vector<Some_Type> vec(state.range(0));
|
|
std::generate(std::begin(vec), std::end(vec), [&]() {
|
|
std::array<uint32_t, 8> compare_value;
|
|
std::generate(
|
|
std::begin(compare_value), std::end(compare_value), [&]() { return dist(rng); });
|
|
return Some_Type{nullptr, compare_value, "hello there"};
|
|
});
|
|
|
|
return {vec, rng};
|
|
}
|
|
|
|
std::vector<Some_Type> mostly_sorted_vec(benchmark::State &state)
|
|
{
|
|
auto [vec, rng] = random_vec(state);
|
|
std::sort(vec.begin(), vec.end());
|
|
|
|
// Randomly swap 5% of the vector.
|
|
std::uniform_int_distribution<std::size_t> dist{0, vec.size() - 1};
|
|
for (std::size_t i = 0; i < vec.size() / 20; ++i) {
|
|
const auto a = dist(rng);
|
|
const auto b = dist(rng);
|
|
std::swap(vec[a], vec[b]);
|
|
}
|
|
|
|
return vec;
|
|
}
|
|
|
|
void BM_merge_sort(benchmark::State &state)
|
|
{
|
|
const auto vec = random_vec(state).first;
|
|
|
|
for (auto _ : state) {
|
|
auto unsorted = vec;
|
|
merge_sort(unsorted.data(), unsorted.size(), &state, &Some_Type::funcs);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_merge_sort)->RangeMultiplier(2)->Range(8, 8 << 8);
|
|
|
|
void BM_merge_sort_with_buf(benchmark::State &state)
|
|
{
|
|
const auto vec = random_vec(state).first;
|
|
std::vector<Some_Type> buf(vec.size());
|
|
|
|
for (auto _ : state) {
|
|
auto unsorted = vec;
|
|
merge_sort_with_buf(
|
|
unsorted.data(), unsorted.size(), buf.data(), buf.size(), &state, &Some_Type::funcs);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_merge_sort_with_buf)->RangeMultiplier(2)->Range(8, 8 << 8);
|
|
|
|
void BM_merge_sort_mostly_sorted(benchmark::State &state)
|
|
{
|
|
auto vec = mostly_sorted_vec(state);
|
|
|
|
for (auto _ : state) {
|
|
auto unsorted = vec;
|
|
merge_sort(unsorted.data(), unsorted.size(), &state, &Some_Type::funcs);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_merge_sort_mostly_sorted)->RangeMultiplier(2)->Range(8, 8 << 8);
|
|
|
|
void BM_qsort(benchmark::State &state)
|
|
{
|
|
const auto vec = random_vec(state).first;
|
|
|
|
for (auto _ : state) {
|
|
auto unsorted = vec;
|
|
qsort(unsorted.data(), unsorted.size(), sizeof(unsorted[0]), my_type_cmp);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_qsort)->RangeMultiplier(2)->Range(8, 8 << 8);
|
|
|
|
void BM_qsort_mostly_sorted(benchmark::State &state)
|
|
{
|
|
auto vec = mostly_sorted_vec(state);
|
|
|
|
for (auto _ : state) {
|
|
auto unsorted = vec;
|
|
qsort(unsorted.data(), unsorted.size(), sizeof(unsorted[0]), my_type_cmp);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_qsort_mostly_sorted)->RangeMultiplier(2)->Range(8, 8 << 8);
|
|
|
|
void BM_std_sort(benchmark::State &state)
|
|
{
|
|
const auto vec = random_vec(state).first;
|
|
|
|
for (auto _ : state) {
|
|
auto unsorted = vec;
|
|
std::sort(unsorted.begin(), unsorted.end());
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_std_sort)->RangeMultiplier(2)->Range(8, 8 << 8);
|
|
|
|
void BM_std_sort_mostly_sorted(benchmark::State &state)
|
|
{
|
|
auto vec = mostly_sorted_vec(state);
|
|
|
|
for (auto _ : state) {
|
|
auto unsorted = vec;
|
|
std::sort(unsorted.begin(), unsorted.end());
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_std_sort_mostly_sorted)->RangeMultiplier(2)->Range(8, 8 << 8);
|
|
|
|
}
|
|
|
|
BENCHMARK_MAIN();
|