Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
//======================================================================================================================
//
// This file is part of waLBerla. waLBerla is free software: you can
// redistribute it and/or modify it under the terms of the GNU General Public
// License as published by the Free Software Foundation, either version 3 of
// the License, or (at your option) any later version.
//
// waLBerla is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
// for more details.
//
// You should have received a copy of the GNU General Public License along
// with waLBerla (see COPYING.txt). If not, see <http://www.gnu.org/licenses/>.
//
//! \file TimeloopSweepManagementTest.cpp
//! \ingroup timeloop
//! \author Markus Holzer <markus.holzer@fau.de>
//! \author Christoph Schwarzmeier <christoph.schwarzmeier@fau.de>
//! \brief Test if a sweep in the timeloop works on its members rather can re-initializing them in every time step.
//
//======================================================================================================================
#include "blockforest/Initialization.h"
#include "core/DataTypes.h"
#include "core/Environment.h"
#include "core/debug/TestSubsystem.h"
#include "timeloop/SweepTimeloop.h"
namespace walberla
{
namespace timeloop
{
namespace TimeloopSweepManagementTest
{
class CounterSweep
{
public:
CounterSweep(const std::shared_ptr< uint_t >& externalCounter)
: externalCounter_(externalCounter), internalCounter_(uint_c(0))
{}
void operator()(IBlock*)
{
++(*externalCounter_);
++internalCounter_;
WALBERLA_CHECK_EQUAL(*externalCounter_, internalCounter_);
}
private:
std::shared_ptr< uint_t > externalCounter_;
uint_t internalCounter_;
}; // class CounterSweep
int main(int argc, char** argv)
{
debug::enterTestMode();
mpi::Environment env(argc, argv);
shared_ptr< StructuredBlockForest > blockForest =
blockforest::createUniformBlockGrid(uint_c(1), uint_c(1), uint_c(1), uint_c(1), uint_c(1), uint_c(1), real_c(1));
SweepTimeloop timeloop(blockForest, uint_c(10));
const std::shared_ptr< uint_t > counter = std::make_shared< uint_t >(uint_c(0));
auto TestSweep = Sweep(CounterSweep(counter), "Counter sweep");
timeloop.add() << TestSweep;
timeloop.run();
return EXIT_SUCCESS;
}
} // namespace TimeloopSweepManagementTest
} // namespace timeloop
} // namespace walberla
int main(int argc, char** argv) { return walberla::timeloop::TimeloopSweepManagementTest::main(argc, argv); }