luanti-org/luanti
1
0
Fork 0
mirror of https://github.com/luanti-org/luanti.git synced 2025-11-04 09:15:29 +01:00
Code Activity

Add test benchmark for Map

Browse Source
This commit is contained in:
Lars
2025-06-20 12:15:04 -07:00
committed by SmallJoker
parent 49f48e0a7c
commit d41de3da79
2 changed files with 178 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
src/benchmark/CMakeLists.txt
View File

@@ -4,6 +4,7 @@ set (BENCHMARK_SRCS
${CMAKE_CURRENT_SOURCE_DIR}/benchmark_lighting.cpp
${CMAKE_CURRENT_SOURCE_DIR}/benchmark_serialize.cpp
${CMAKE_CURRENT_SOURCE_DIR}/benchmark_mapblock.cpp
${CMAKE_CURRENT_SOURCE_DIR}/benchmark_map.cpp
${CMAKE_CURRENT_SOURCE_DIR}/benchmark_mapmodify.cpp
${CMAKE_CURRENT_SOURCE_DIR}/benchmark_sha.cpp
PARENT_SCOPE)

177
src/benchmark/benchmark_map.cpp Normal file
View File

@@ -0,0 +1,177 @@
// Luanti
// SPDX-License-Identifier: LGPL-2.1-or-later
// Copyright (C) 2023 Minetest Authors
#include "catch.h"
#include "dummygamedef.h"
#include "map.h"
#include "mapsector.h"
class TestMap : public Map {
public:
TestMap(IGameDef *gamedef) : Map(gamedef) {}
MapBlock * createBlockTest(v3s16 p)
{
v2s16 p2d(p.X, p.Z);
s16 block_y = p.Y;
MapSector *sector = getSectorNoGenerate(p2d);
if (!sector) {
sector = new MapSector(this, p2d, m_gamedef);
m_sectors[p2d] = sector;
}
MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
if (block)
return block;
return sector->createBlankBlock(block_y);
}
};
static void fillMap(TestMap &map, s16 n)
{
for(s16 z=0; z<n; z++)
for(s16 y=0; y<n; y++)
for(s16 x=0; x<n; x++) {
v3s16 p(x,y,z);
// create an empty block
map.createBlockTest(p);
}
}
static int readBlocks(Map &map, s16 n)
{
int result = 0;
for(s16 z=0; z<n; z++)
for(s16 y=0; y<n; y++)
for(s16 x=0; x<n; x++) {
v3s16 p(x,y,z);
MapBlock *block = map.getBlockNoCreateNoEx(p);
if (block) {
result++;
}
}
return result;
}
static int readRandomBlocks(Map &map, s16 n)
{
int result = 0;
for(int i=0; i < n * n * n; i++) {
v3s16 p(myrand_range(0, n), myrand_range(0, n), myrand_range(0, n));
MapBlock *block = map.getBlockNoCreateNoEx(p);
if (block) {
result++;
}
}
return result;
}
static int readYColumn(Map &map, s16 n)
{
int result = 0;
for(s16 z=0; z<n; z++)
for(s16 x=0; x<n; x++)
for(s16 y=n-1; y>0; y--) {
v3s16 p(x,y,z);
MapBlock *block = map.getBlockNoCreateNoEx(p);
if (block) {
result++;
}
}
return result;
}
static int readNodes(Map &map, s16 n)
{
int result = 0;
for(s16 z=0; z<n * MAP_BLOCKSIZE; z+=8)
for(s16 y=0; y<n * MAP_BLOCKSIZE; y+=4)
for(s16 x=0; x<n * MAP_BLOCKSIZE; x++) {
v3s16 p(x,y,z);
MapNode n = map.getNode(p);
if (n.getContent() != CONTENT_IGNORE)
result++;
}
return result;
}
#define BENCH1(_count) \
BENCHMARK_ADVANCED("create_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
meter.measure([&] { \
fillMap(map, _count); \
}); \
}; \
BENCHMARK_ADVANCED("readEmpty_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
meter.measure([&] { \
return readBlocks(map, _count); \
}); \
}; \
BENCHMARK_ADVANCED("readFilled_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
fillMap(map, _count); \
meter.measure([&] { \
return readBlocks(map, _count); \
}); \
}; \
BENCHMARK_ADVANCED("readEmptyYCol_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
meter.measure([&] { \
return readYColumn(map, _count); \
}); \
}; \
BENCHMARK_ADVANCED("readFilledYCol_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
fillMap(map, _count); \
meter.measure([&] { \
return readYColumn(map, _count); \
}); \
}; \
BENCHMARK_ADVANCED("readEmptyRandom_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
meter.measure([&] { \
return readRandomBlocks(map, _count); \
}); \
}; \
BENCHMARK_ADVANCED("readFilledRandom_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
fillMap(map, _count); \
meter.measure([&] { \
return readRandomBlocks(map, _count); \
}); \
}; \
BENCHMARK_ADVANCED("readEmptyNodes_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
meter.measure([&] { \
return readNodes(map, _count); \
}); \
}; \
BENCHMARK_ADVANCED("readFilledNodes_" #_count)(Catch::Benchmark::Chronometer meter) { \
DummyGameDef gamedef; \
TestMap map(&gamedef); \
fillMap(map, _count); \
meter.measure([&] { \
return readNodes(map, _count); \
}); \
}; \
TEST_CASE("benchmark_map") {
BENCH1(10)
BENCH1(40) // 64.000 blocks
}