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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113 | // *****************************************************************************
/*!
\file src/Inciter/IntegralReducer.cpp
\copyright 2012-2015 J. Bakosi,
2016-2018 Los Alamos National Security, LLC.,
2019-2021 Triad National Security, LLC.,
2022-2024 J. Bakosi
All rights reserved. See the LICENSE file for details.
\brief Custom Charm++ reducer for merging integrals across PEs
\details Custom Charm++ reducer for merging integrals across PEs.
*/
// *****************************************************************************
#include <memory>
#include "Integrals.hpp"
#include "IntegralReducer.hpp"
#include "Exception.hpp"
namespace inciter {
namespace integrals {
std::pair< int, std::unique_ptr<char[]> >
serialize( std::size_t meshid, const std::vector< std::map<int,tk::real> >& d )
// *****************************************************************************
// Serialize integrals to raw memory stream
//! \param[in] meshid Mesh ID
//! \param[in] d Integral contributions
//! \return Pair of the length and the raw stream containing the serialized
//! vectors
// *****************************************************************************
{
// Prepare for serializing integrals to a raw binary stream, compute size
PUP::sizer sizer;
// cppcheck-suppress uninitvar
sizer | meshid;<--- Unmatched suppression: uninitvar
sizer | const_cast< std::vector< std::map< int, tk::real > >& >( d );
// Create raw character stream to store the serialized vectors
std::unique_ptr<char[]> flatData = std::make_unique<char[]>( sizer.size() );
// Serialize integrals
PUP::toMem packer( flatData.get() );
// cppcheck-suppress uninitvar
packer | meshid;<--- Unmatched suppression: uninitvar
packer | const_cast< std::vector< std::map< int, tk::real > >& >( d );
// Return size of and raw stream
return { sizer.size(), std::move(flatData) };
}
CkReductionMsg*
mergeIntegrals( int nmsg, CkReductionMsg **msgs )
// *****************************************************************************
// Charm++ custom reducer for merging integrals during reduction across PEs
//! \param[in] nmsg Number of messages in msgs
//! \param[in] msgs Charm++ reduction message containing the serialized
//! integrals
//! \return Aggregated integrals built for further aggregation if needed
// *****************************************************************************
{
// Will store deserialized integrals
std::size_t meshid;
std::vector< std::map< int, tk::real > > v;
// Create PUP deserializer based on message passed in
PUP::fromMem creator( msgs[0]->getData() );
// Deserialize vector from raw stream
// cppcheck-suppress uninitvar
creator | meshid;
creator | v;
for (int m=1; m<nmsg; ++m) {
// Unpack vector
std::size_t mid;
std::vector< std::map< int, tk::real > > w;
PUP::fromMem curCreator( msgs[m]->getData() );
// cppcheck-suppress uninitvar
curCreator | mid;
curCreator | w;
// Aggregate integrals
// cppcheck-suppress uninitvar
// cppcheck-suppress unreadVariable
meshid = mid;<--- Unmatched suppression: uninitvar
Assert( v.size() == w.size(), "Size mismatch during integrals aggregation");
Assert( v.size() == NUMINT, "Size mismatch during integrals aggregation" );
// Aggregate applying integrals aggregation policy
// Copy ITER, TIME, DT
// cppcheck-suppress containerOutOfBounds
v[ITER] = w[ITER];
// cppcheck-suppress containerOutOfBounds
v[TIME] = w[TIME];
// cppcheck-suppress containerOutOfBounds
v[DT] = w[DT];
// Sum integrals
// cppcheck-suppress containerOutOfBounds
for (const auto& [s,d] : w[MASS_FLOW_RATE]) v[MASS_FLOW_RATE][s] += d;<--- Assuming container is not empty<--- Assuming container is not empty<--- Assuming container is not empty<--- Assuming container is not empty<--- Assuming container is not empty<--- Assuming container is not empty
for (const auto& [s,d] : w[FORCE_X]) v[FORCE_X][s] += d;<--- Access out of bounds<--- Assuming container is not empty<--- Access out of bounds<--- Assuming container is not empty<--- Assuming container is not empty<--- Assuming container is not empty<--- Assuming container is not empty<--- Assuming container is not empty
for (const auto& [s,d] : w[FORCE_Y]) v[FORCE_Y][s] += d;<--- Access out of bounds<--- Assuming container is not empty<--- Access out of bounds<--- Assuming container is not empty<--- Assuming container is not empty<--- Assuming container is not empty
for (const auto& [s,d] : w[FORCE_Z]) v[FORCE_Z][s] += d;<--- Access out of bounds<--- Assuming container is not empty<--- Access out of bounds<--- Assuming container is not empty
}
// Serialize concatenated diagnostics vector to raw stream
// cppcheck-suppress uninitvar
auto stream = serialize( meshid, v );<--- Unmatched suppression: uninitvar
// Forward serialized diagnostics
return CkReductionMsg::buildNew( stream.first, stream.second.get() );
}
} // integrals::
} // inciter::
|