mirror of
https://develop.openfoam.com/Development/openfoam.git
synced 2025-11-28 03:28:01 +00:00
- redistributePar to have almost (complete) functionality of decomposePar+reconstructPar - low-level distributed Field mapping - support for mapping surfaceFields (including flipping faces) - support for decomposing/reconstructing refinement data
239 lines
6.3 KiB
C
239 lines
6.3 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright (C) 2011-2013 OpenFOAM Foundation
|
|
\\/ M anipulation | Copyright (C) 2015 OpenCFD Ltd.
|
|
-------------------------------------------------------------------------------
|
|
License
|
|
This file is part of OpenFOAM.
|
|
|
|
OpenFOAM 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.
|
|
|
|
OpenFOAM 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 OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
Description
|
|
Gather data from all processors onto single processor according to some
|
|
communication schedule (usually linear-to-master or tree-to-master).
|
|
The gathered data will be a single value constructed from the values
|
|
on individual processors using a user-specified operator.
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "UOPstream.H"
|
|
#include "OPstream.H"
|
|
#include "UIPstream.H"
|
|
#include "IPstream.H"
|
|
#include "contiguous.H"
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
namespace Foam
|
|
{
|
|
|
|
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
|
|
|
|
template<class T, class BinaryOp>
|
|
void Pstream::gather
|
|
(
|
|
const List<UPstream::commsStruct>& comms,
|
|
T& Value,
|
|
const BinaryOp& bop,
|
|
const int tag,
|
|
const label comm
|
|
)
|
|
{
|
|
if (UPstream::parRun() && UPstream::nProcs(comm) > 1)
|
|
{
|
|
// Get my communication order
|
|
const commsStruct& myComm = comms[UPstream::myProcNo(comm)];
|
|
|
|
// Receive from my downstairs neighbours
|
|
forAll(myComm.below(), belowI)
|
|
{
|
|
T value;
|
|
|
|
if (contiguous<T>())
|
|
{
|
|
UIPstream::read
|
|
(
|
|
UPstream::scheduled,
|
|
myComm.below()[belowI],
|
|
reinterpret_cast<char*>(&value),
|
|
sizeof(T),
|
|
tag,
|
|
comm
|
|
);
|
|
}
|
|
else
|
|
{
|
|
IPstream fromBelow
|
|
(
|
|
UPstream::scheduled,
|
|
myComm.below()[belowI],
|
|
0,
|
|
tag,
|
|
comm
|
|
);
|
|
fromBelow >> value;
|
|
}
|
|
|
|
Value = bop(Value, value);
|
|
}
|
|
|
|
// Send up Value
|
|
if (myComm.above() != -1)
|
|
{
|
|
if (contiguous<T>())
|
|
{
|
|
UOPstream::write
|
|
(
|
|
UPstream::scheduled,
|
|
myComm.above(),
|
|
reinterpret_cast<const char*>(&Value),
|
|
sizeof(T),
|
|
tag,
|
|
comm
|
|
);
|
|
}
|
|
else
|
|
{
|
|
OPstream toAbove
|
|
(
|
|
UPstream::scheduled,
|
|
myComm.above(),
|
|
0,
|
|
tag,
|
|
comm
|
|
);
|
|
toAbove << Value;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
template <class T, class BinaryOp>
|
|
void Pstream::gather
|
|
(
|
|
T& Value,
|
|
const BinaryOp& bop,
|
|
const int tag,
|
|
const label comm
|
|
)
|
|
{
|
|
if (UPstream::nProcs(comm) < UPstream::nProcsSimpleSum)
|
|
{
|
|
gather(UPstream::linearCommunication(comm), Value, bop, tag, comm);
|
|
}
|
|
else
|
|
{
|
|
gather(UPstream::treeCommunication(comm), Value, bop, tag, comm);
|
|
}
|
|
}
|
|
|
|
|
|
template<class T>
|
|
void Pstream::scatter
|
|
(
|
|
const List<UPstream::commsStruct>& comms,
|
|
T& Value,
|
|
const int tag,
|
|
const label comm
|
|
)
|
|
{
|
|
if (UPstream::parRun() && UPstream::nProcs(comm) > 1)
|
|
{
|
|
// Get my communication order
|
|
const commsStruct& myComm = comms[UPstream::myProcNo(comm)];
|
|
|
|
// Reveive from up
|
|
if (myComm.above() != -1)
|
|
{
|
|
if (contiguous<T>())
|
|
{
|
|
UIPstream::read
|
|
(
|
|
UPstream::scheduled,
|
|
myComm.above(),
|
|
reinterpret_cast<char*>(&Value),
|
|
sizeof(T),
|
|
tag,
|
|
comm
|
|
);
|
|
}
|
|
else
|
|
{
|
|
IPstream fromAbove
|
|
(
|
|
UPstream::scheduled,
|
|
myComm.above(),
|
|
0,
|
|
tag,
|
|
comm
|
|
);
|
|
fromAbove >> Value;
|
|
}
|
|
}
|
|
|
|
// Send to my downstairs neighbours
|
|
forAll(myComm.below(), belowI)
|
|
{
|
|
if (contiguous<T>())
|
|
{
|
|
UOPstream::write
|
|
(
|
|
UPstream::scheduled,
|
|
myComm.below()[belowI],
|
|
reinterpret_cast<const char*>(&Value),
|
|
sizeof(T),
|
|
tag,
|
|
comm
|
|
);
|
|
}
|
|
else
|
|
{
|
|
OPstream toBelow
|
|
(
|
|
UPstream::scheduled,
|
|
myComm.below()[belowI],
|
|
0,
|
|
tag,
|
|
comm
|
|
);
|
|
toBelow << Value;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
template <class T>
|
|
void Pstream::scatter(T& Value, const int tag, const label comm)
|
|
{
|
|
if (UPstream::nProcs(comm) < UPstream::nProcsSimpleSum)
|
|
{
|
|
scatter(UPstream::linearCommunication(comm), Value, tag, comm);
|
|
}
|
|
else
|
|
{
|
|
scatter(UPstream::treeCommunication(comm), Value, tag, comm);
|
|
}
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
} // End namespace Foam
|
|
|
|
// ************************************************************************* //
|