Rebekah Rowe
6c4b2e9186
Commit is being made to allow additions of GPL3+ code previously un-addable. With these changes, contributions back to cuberite are possible with the backporting exemtion, as well as adding stuff in minetest with minetest code properly being read through and implimented to upgrade it to GPL3 from GPL2. project still has Apache2.0 license and credits to all its contributers, but now has the freedom of GPL3+ and all the code that can be implimented and shared with it.
106 lines
2.8 KiB
C++
106 lines
2.8 KiB
C++
|
|
/*
|
|
* Copyright 2011-2022 Cuberite Contributors
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
// PieceGeneratorBFSTreeTest.cpp
|
|
|
|
// Implements the test for the cPieceGeneratorBFSTree class
|
|
|
|
/*
|
|
Unlike most tests, this is actually not meant as much for unit-testing, but more like performance-testing.
|
|
Compile this project in Release mode, then run it in folder that has NetherFort.cubeset prefabs, too, using
|
|
a higher number of repetitions (each repetition takes time on the order of a second); investigate the
|
|
runtime performance with a profiler.
|
|
|
|
The syntax to execute this test:
|
|
PieceGeneratorBFSTreeTest [<numRepetitions>]
|
|
numRepetitions is the number of NetherFort structures to be generated (default = 1)
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include "Globals.h"
|
|
#include "Generating/PrefabPiecePool.h"
|
|
#include "Generating/PieceGeneratorBFSTree.h"
|
|
|
|
|
|
|
|
|
|
|
|
static int test(int a_NumRepetitions)
|
|
{
|
|
// Load the piece pool:
|
|
cPrefabPiecePool pool;
|
|
if (!pool.LoadFromFile("NetherFort.cubeset", true))
|
|
{
|
|
LOGERROR("Cannot load the NetherFort cubeset. Please make sure that the NetherFort.cubeset file is present in the current dir and that it is a valid .cubeset file.");
|
|
return -1;
|
|
}
|
|
auto & generatorParams = pool.GetAllMetadata();
|
|
auto maxDepth = GetStringMapInteger<int>(generatorParams, "MaxDepth", 5);
|
|
|
|
// Perform repeated test of the generator:
|
|
auto start = std::chrono::high_resolution_clock::now();
|
|
cPieceGeneratorBFSTree pg(pool, 1);
|
|
for (int i = 0; i < a_NumRepetitions; ++i)
|
|
{
|
|
cPlacedPieces placedPieces;
|
|
pg.PlacePieces(i * 512, 0, maxDepth, placedPieces);
|
|
placedPieces.clear();
|
|
} // for i - numRepetitions
|
|
auto end = std::chrono::high_resolution_clock::now();
|
|
|
|
auto dur = std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
|
|
LOG("Performed %d repetition(s), took %.3f seconds", a_NumRepetitions, static_cast<double>(dur) / 1000);
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int main(int argc, char * argv[])
|
|
{
|
|
LOGD("Starting the PieceGeneratorBFSTree test.");
|
|
|
|
// Parse the cmdline parameters:
|
|
int numRepetitions = 1;
|
|
for (int i = 1; i < argc; ++i)
|
|
{
|
|
int rep = atoi(argv[i]);
|
|
if (rep > 0)
|
|
{
|
|
numRepetitions = rep;
|
|
}
|
|
}
|
|
LOGD("Performing %d repetitions", numRepetitions);
|
|
|
|
auto res = test(numRepetitions);
|
|
if (res != 0)
|
|
{
|
|
LOGD("Test failed.");
|
|
return res;
|
|
}
|
|
|
|
LOGD("The PieceGeneratorBFSTree test competed successfully.");
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
|