78dbbdd7d3
The nWeights argument is now reduced if any of the weights are zero for all points on all processors and removed.
354 lines
12 KiB
C++
354 lines
12 KiB
C++
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration | Website: https://openfoam.org
|
|
\\ / A nd | Copyright (C) 2011-2024 OpenFOAM Foundation
|
|
\\/ M anipulation |
|
|
-------------------------------------------------------------------------------
|
|
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/>.
|
|
|
|
Class
|
|
Foam::decompositionMethod
|
|
|
|
Description
|
|
Abstract base class for decomposition
|
|
|
|
SourceFiles
|
|
decompositionMethod.C
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#ifndef decompositionMethod_H
|
|
#define decompositionMethod_H
|
|
|
|
#include "polyMesh.H"
|
|
#include "CompactListList.H"
|
|
#include "decompositionConstraint.H"
|
|
#include "IOdictionary.H"
|
|
|
|
namespace Foam
|
|
{
|
|
|
|
/*---------------------------------------------------------------------------*\
|
|
Class decompositionMethod Declaration
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
class decompositionMethod
|
|
{
|
|
protected:
|
|
|
|
// Protected data
|
|
|
|
dictionary decompositionDict_;
|
|
|
|
label nProcessors_;
|
|
|
|
//- Optional constraints
|
|
PtrList<decompositionConstraint> constraints_;
|
|
|
|
|
|
// Protected member functions
|
|
|
|
//- Return the number of weights per point
|
|
label nWeights
|
|
(
|
|
const pointField& points,
|
|
const scalarField& pointWeights
|
|
) const;
|
|
|
|
//- Check the weights against the points
|
|
// and return the number of weights per point
|
|
label checkWeights
|
|
(
|
|
const pointField& points,
|
|
const scalarField& pointWeights
|
|
) const;
|
|
|
|
|
|
public:
|
|
|
|
//- Runtime type information
|
|
TypeName("decompositionMethod");
|
|
|
|
|
|
// Declare run-time constructor selection tables
|
|
|
|
declareRunTimeSelectionTable
|
|
(
|
|
autoPtr,
|
|
decompositionMethod,
|
|
decomposer,
|
|
(
|
|
const dictionary& decompositionDict
|
|
),
|
|
(decompositionDict)
|
|
);
|
|
|
|
declareRunTimeSelectionTable
|
|
(
|
|
autoPtr,
|
|
decompositionMethod,
|
|
distributor,
|
|
(
|
|
const dictionary& decompositionDict
|
|
),
|
|
(decompositionDict)
|
|
);
|
|
|
|
|
|
// Constructors
|
|
|
|
//- Construct given the decomposition dictionary
|
|
decompositionMethod(const dictionary& decompositionDict);
|
|
|
|
//- Disallow default bitwise copy construction
|
|
decompositionMethod(const decompositionMethod&) = delete;
|
|
|
|
|
|
// Selectors
|
|
|
|
//- Return a reference to the selected decomposition method
|
|
static autoPtr<decompositionMethod> NewDecomposer
|
|
(
|
|
const dictionary& decompositionDict
|
|
);
|
|
|
|
//- Return a reference to the selected decomposition method
|
|
static autoPtr<decompositionMethod> NewDistributor
|
|
(
|
|
const dictionary& decompositionDict
|
|
);
|
|
|
|
|
|
//- Destructor
|
|
virtual ~decompositionMethod()
|
|
{}
|
|
|
|
|
|
// Member Functions
|
|
|
|
label nDomains() const
|
|
{
|
|
return nProcessors_;
|
|
}
|
|
|
|
//- Read and return the decomposeParDict
|
|
static IOdictionary decomposeParDict(const Time& time);
|
|
|
|
|
|
// No topology (implemented by geometric decomposers)
|
|
|
|
//- Return for every coordinate the wanted processor number.
|
|
virtual labelList decompose
|
|
(
|
|
const pointField& points,
|
|
const scalarField& pointWeights
|
|
)
|
|
{
|
|
NotImplemented;
|
|
return labelList(0);
|
|
}
|
|
|
|
//- Like decompose but with uniform weights on the points
|
|
virtual labelList decompose(const pointField&)
|
|
{
|
|
NotImplemented;
|
|
return labelList(0);
|
|
}
|
|
|
|
|
|
// Topology provided by mesh
|
|
|
|
//- Return for every coordinate the wanted processor number. Use the
|
|
// mesh connectivity (if needed)
|
|
virtual labelList decompose
|
|
(
|
|
const polyMesh& mesh,
|
|
const pointField& points,
|
|
const scalarField& pointWeights
|
|
) = 0;
|
|
|
|
//- Like decompose but with uniform weights on the points
|
|
virtual labelList decompose(const polyMesh&, const pointField&);
|
|
|
|
//- Return for every coordinate the wanted processor number. Gets
|
|
// passed agglomeration map (from fine to coarse cells) and coarse
|
|
// cell location. Can be overridden by decomposers that provide
|
|
// this functionality natively. Coarse cells are local to the
|
|
// processor (if in parallel). If you want to have coarse cells
|
|
// spanning processors use the globalCellCells instead.
|
|
virtual labelList decompose
|
|
(
|
|
const polyMesh& mesh,
|
|
const labelList& cellToRegion,
|
|
const pointField& regionPoints,
|
|
const scalarField& regionWeights
|
|
);
|
|
|
|
//- Like decompose but with uniform weights on the regions
|
|
virtual labelList decompose
|
|
(
|
|
const polyMesh& mesh,
|
|
const labelList& cellToRegion,
|
|
const pointField& regionPoints
|
|
);
|
|
|
|
|
|
// Topology provided explicitly addressing
|
|
|
|
//- Return for every coordinate the wanted processor number.
|
|
// The connectivity is equal to mesh.cellCells() except for
|
|
// - in parallel the cell numbers are global cell numbers
|
|
// (starting
|
|
// from 0 at processor0 and then incrementing all through the
|
|
// processors)
|
|
// - the connections are across coupled patches
|
|
virtual labelList decompose
|
|
(
|
|
const labelListList& globalCellCells,
|
|
const pointField& cellCentres,
|
|
const scalarField& cellWeights
|
|
) = 0;
|
|
|
|
//- Like decompose but with uniform weights on the cells
|
|
virtual labelList decompose
|
|
(
|
|
const labelListList& globalCellCells,
|
|
const pointField& cellCentres
|
|
);
|
|
|
|
|
|
// Other
|
|
|
|
//- Convert the given scalar weights to labels
|
|
// in the range 0-labelMax/2
|
|
// Removes 0 weights and updates nWeights accordingly
|
|
static labelList scaleWeights
|
|
(
|
|
const scalarField& weights,
|
|
label& nWeights,
|
|
const bool distributed = true
|
|
);
|
|
|
|
//- Helper: determine (local or global) cellCells from mesh
|
|
// agglomeration. Agglomeration is local to the processor.
|
|
// local : connections are in local indices. Coupled across
|
|
// cyclics but not processor patches.
|
|
// global : connections are in global indices. Coupled across
|
|
// cyclics and processor patches.
|
|
static void calcCellCells
|
|
(
|
|
const polyMesh& mesh,
|
|
const labelList& agglom,
|
|
const label nLocalCoarse,
|
|
const bool global,
|
|
CompactListList<label>& cellCells
|
|
);
|
|
|
|
//- Helper: determine (local or global) cellCells and face weights
|
|
// from mesh agglomeration.
|
|
// Uses mag of faceArea as weights
|
|
static void calcCellCells
|
|
(
|
|
const polyMesh& mesh,
|
|
const labelList& agglom,
|
|
const label nLocalCoarse,
|
|
const bool parallel,
|
|
CompactListList<label>& cellCells,
|
|
CompactListList<scalar>& cellCellWeights
|
|
);
|
|
|
|
//- Helper: extract constraints:
|
|
// blockedface: existing faces where owner and neighbour on same
|
|
// proc
|
|
// explicitConnections: sets of boundary faces ,, ,,
|
|
// specifiedProcessorFaces: groups of faces with all cells on
|
|
// same processor.
|
|
void setConstraints
|
|
(
|
|
const polyMesh& mesh,
|
|
boolList& blockedFace,
|
|
PtrList<labelList>& specifiedProcessorFaces,
|
|
labelList& specifiedProcessor,
|
|
List<labelPair>& explicitConnections
|
|
);
|
|
|
|
//- Helper: apply constraints to a decomposition. This gives
|
|
// constraints opportunity to modify decomposition in case
|
|
// the native decomposition method has not obeyed all constraints
|
|
void applyConstraints
|
|
(
|
|
const polyMesh& mesh,
|
|
const boolList& blockedFace,
|
|
const PtrList<labelList>& specifiedProcessorFaces,
|
|
const labelList& specifiedProcessor,
|
|
const List<labelPair>& explicitConnections,
|
|
labelList& finalDecomp
|
|
);
|
|
|
|
// Decompose a mesh with constraints:
|
|
// - blockedFace : whether owner and neighbour should be on same
|
|
// processor
|
|
// - specifiedProcessorFaces, specifiedProcessor : sets of faces
|
|
// that should go to same processor (as specified in
|
|
// specifiedProcessor, can be -1)
|
|
// - explicitConnections : connections between baffle faces
|
|
// (blockedFace should be false on these). Owner and
|
|
// neighbour on same processor.
|
|
// Set all to zero size to have unconstrained decomposition.
|
|
virtual labelList decompose
|
|
(
|
|
const polyMesh& mesh,
|
|
const scalarField& cellWeights,
|
|
const boolList& blockedFace,
|
|
const PtrList<labelList>& specifiedProcessorFaces,
|
|
const labelList& specifiedProcessor,
|
|
const List<labelPair>& explicitConnections
|
|
);
|
|
|
|
//- Decompose a mesh. Apply all constraints from decomposeParDict
|
|
// ('preserveFaceZones' etc). Calls either
|
|
// - no constraints, empty weights:
|
|
// decompose(mesh, cellCentres())
|
|
// - no constraints, set weights:
|
|
// decompose(mesh, cellCentres(), cellWeights)
|
|
// - valid constraints:
|
|
// decompose(mesh, cellToRegion, regionPoints, regionWeights)
|
|
labelList decompose
|
|
(
|
|
const polyMesh& mesh,
|
|
const scalarField& cellWeights
|
|
);
|
|
|
|
|
|
// Member Operators
|
|
|
|
//- Disallow default bitwise assignment
|
|
void operator=(const decompositionMethod&) = delete;
|
|
};
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
} // End namespace Foam
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
#endif
|
|
|
|
// ************************************************************************* //
|