mirror of
https://develop.openfoam.com/Development/openfoam.git
synced 2025-11-28 03:28:01 +00:00
BUG: label overflow in multiLevel decomposition (closes #619)
- previously when more than two levels were used. Now calculate the required final target domain segment directly.
This commit is contained in:
@ -3,7 +3,7 @@
|
|||||||
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
||||||
\\ / O peration |
|
\\ / O peration |
|
||||||
\\ / A nd | Copyright (C) 2011-2017 OpenFOAM Foundation
|
\\ / A nd | Copyright (C) 2011-2017 OpenFOAM Foundation
|
||||||
\\/ M anipulation |
|
\\/ M anipulation | Copyright (C) 2017 OpenCFD Ltd.
|
||||||
-------------------------------------------------------------------------------
|
-------------------------------------------------------------------------------
|
||||||
License
|
License
|
||||||
This file is part of OpenFOAM.
|
This file is part of OpenFOAM.
|
||||||
@ -99,7 +99,7 @@ void Foam::multiLevelDecomp::subsetGlobalCellCells
|
|||||||
forAll(cCells, i)
|
forAll(cCells, i)
|
||||||
{
|
{
|
||||||
// Get locally-compact cell index of neighbouring cell
|
// Get locally-compact cell index of neighbouring cell
|
||||||
label nbrCelli = oldToNew[cCells[i]];
|
const label nbrCelli = oldToNew[cCells[i]];
|
||||||
if (nbrCelli == -1)
|
if (nbrCelli == -1)
|
||||||
{
|
{
|
||||||
cutConnections[allDist[cCells[i]]]++;
|
cutConnections[allDist[cCells[i]]]++;
|
||||||
@ -109,10 +109,10 @@ void Foam::multiLevelDecomp::subsetGlobalCellCells
|
|||||||
// Reconvert local cell index into global one
|
// Reconvert local cell index into global one
|
||||||
|
|
||||||
// Get original neighbour
|
// Get original neighbour
|
||||||
label celli = set[subCelli];
|
const label celli = set[subCelli];
|
||||||
label oldNbrCelli = cellCells[celli][i];
|
const label oldNbrCelli = cellCells[celli][i];
|
||||||
// Get processor from original neighbour
|
// Get processor from original neighbour
|
||||||
label proci = globalCells.whichProcID(oldNbrCelli);
|
const label proci = globalCells.whichProcID(oldNbrCelli);
|
||||||
// Convert into global compact numbering
|
// Convert into global compact numbering
|
||||||
cCells[newI++] = globalSubCells.toGlobal(proci, nbrCelli);
|
cCells[newI++] = globalSubCells.toGlobal(proci, nbrCelli);
|
||||||
}
|
}
|
||||||
@ -127,15 +127,16 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
const labelListList& pointPoints,
|
const labelListList& pointPoints,
|
||||||
const pointField& points,
|
const pointField& points,
|
||||||
const scalarField& pointWeights,
|
const scalarField& pointWeights,
|
||||||
const labelList& pointMap, // map back to original points
|
const labelUList& pointMap, // map back to original points
|
||||||
const label levelI,
|
const label currLevel,
|
||||||
|
const label leafOffset,
|
||||||
|
|
||||||
labelField& finalDecomp
|
labelList& finalDecomp
|
||||||
)
|
)
|
||||||
{
|
{
|
||||||
labelList dist
|
labelList dist
|
||||||
(
|
(
|
||||||
methods_[levelI].decompose
|
methods_[currLevel].decompose
|
||||||
(
|
(
|
||||||
pointPoints,
|
pointPoints,
|
||||||
points,
|
points,
|
||||||
@ -143,30 +144,62 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
)
|
)
|
||||||
);
|
);
|
||||||
|
|
||||||
forAll(pointMap, i)
|
// The next recursion level
|
||||||
|
const label nextLevel = currLevel+1;
|
||||||
|
|
||||||
|
// Number of domains at this current level
|
||||||
|
const label nCurrDomains = methods_[currLevel].nDomains();
|
||||||
|
|
||||||
|
// Calculate the domain remapping.
|
||||||
|
// The decompose() method delivers a distribution of [0..nDomains-1]
|
||||||
|
// which we map to the final location according to the decomposition
|
||||||
|
// leaf we are on.
|
||||||
|
|
||||||
|
labelList domainLookup(nCurrDomains);
|
||||||
{
|
{
|
||||||
label orig = pointMap[i];
|
label sizes = 1; // Cumulative number of domains
|
||||||
finalDecomp[orig] += dist[i];
|
for (label i = 0; i <= currLevel; ++i)
|
||||||
|
{
|
||||||
|
sizes *= methods_[i].nDomains();
|
||||||
|
}
|
||||||
|
|
||||||
|
// Distribution of domains at this level
|
||||||
|
sizes = this->nDomains() / sizes;
|
||||||
|
|
||||||
|
forAll(domainLookup, i)
|
||||||
|
{
|
||||||
|
domainLookup[i] = i * sizes + leafOffset;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (levelI != methods_.size()-1)
|
if (debug)
|
||||||
|
{
|
||||||
|
Info<< "Distribute at level " << currLevel
|
||||||
|
<< " to domains" << nl
|
||||||
|
<< flatOutput(domainLookup) << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Extract processor+local index from point-point addressing
|
||||||
|
forAll(pointMap, i)
|
||||||
|
{
|
||||||
|
const label orig = pointMap[i];
|
||||||
|
finalDecomp[orig] = domainLookup[dist[i]];
|
||||||
|
}
|
||||||
|
|
||||||
|
if (nextLevel < methods_.size())
|
||||||
{
|
{
|
||||||
// Recurse
|
// Recurse
|
||||||
|
|
||||||
// Determine points per domain
|
// Determine points per domain
|
||||||
label n = methods_[levelI].nDomains();
|
labelListList domainToPoints(invertOneToMany(nCurrDomains, dist));
|
||||||
labelListList domainToPoints(invertOneToMany(n, dist));
|
|
||||||
|
|
||||||
// 'Make space' for new levels of decomposition
|
|
||||||
finalDecomp *= methods_[levelI+1].nDomains();
|
|
||||||
|
|
||||||
// Extract processor+local index from point-point addressing
|
// Extract processor+local index from point-point addressing
|
||||||
if (debug && Pstream::master())
|
if (debug && Pstream::master())
|
||||||
{
|
{
|
||||||
Pout<< "Decomposition at level " << levelI << " :" << endl;
|
Pout<< "Decomposition at level " << currLevel << " :" << endl;
|
||||||
}
|
}
|
||||||
|
|
||||||
for (label domainI = 0; domainI < n; domainI++)
|
for (label domainI = 0; domainI < nCurrDomains; domainI++)
|
||||||
{
|
{
|
||||||
// Extract elements for current domain
|
// Extract elements for current domain
|
||||||
const labelList domainPoints(findIndices(dist, domainI));
|
const labelList domainPoints(findIndices(dist, domainI));
|
||||||
@ -180,7 +213,7 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
labelList nOutsideConnections;
|
labelList nOutsideConnections;
|
||||||
subsetGlobalCellCells
|
subsetGlobalCellCells
|
||||||
(
|
(
|
||||||
n,
|
nCurrDomains,
|
||||||
domainI,
|
domainI,
|
||||||
dist,
|
dist,
|
||||||
|
|
||||||
@ -196,12 +229,12 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
Pstream::listCombineScatter(nOutsideConnections);
|
Pstream::listCombineScatter(nOutsideConnections);
|
||||||
label nPatches = 0;
|
label nPatches = 0;
|
||||||
label nFaces = 0;
|
label nFaces = 0;
|
||||||
forAll(nOutsideConnections, i)
|
for (const label nConnect : nOutsideConnections)
|
||||||
{
|
{
|
||||||
if (nOutsideConnections[i] > 0)
|
if (nConnect > 0)
|
||||||
{
|
{
|
||||||
nPatches++;
|
++nPatches;
|
||||||
nFaces += nOutsideConnections[i];
|
nFaces += nConnect;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -224,7 +257,8 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
subPoints,
|
subPoints,
|
||||||
subWeights,
|
subWeights,
|
||||||
subPointMap,
|
subPointMap,
|
||||||
levelI+1,
|
nextLevel,
|
||||||
|
domainLookup[domainI], // The offset for this level and leaf
|
||||||
|
|
||||||
finalDecomp
|
finalDecomp
|
||||||
);
|
);
|
||||||
@ -238,8 +272,8 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
if (debug)
|
if (debug)
|
||||||
{
|
{
|
||||||
// Do straight decompose of two levels
|
// Do straight decompose of two levels
|
||||||
label nNext = methods_[levelI+1].nDomains();
|
const label nNext = methods_[nextLevel].nDomains();
|
||||||
label nTotal = n*nNext;
|
const label nTotal = nCurrDomains * nNext;
|
||||||
|
|
||||||
// Retrieve original level0 dictionary and modify number of domains
|
// Retrieve original level0 dictionary and modify number of domains
|
||||||
dictionary::const_iterator iter =
|
dictionary::const_iterator iter =
|
||||||
@ -267,12 +301,12 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
)
|
)
|
||||||
);
|
);
|
||||||
|
|
||||||
for (label blockI = 0; blockI < n; blockI++)
|
for (label blockI = 0; blockI < nCurrDomains; blockI++)
|
||||||
{
|
{
|
||||||
// Count the number inbetween blocks of nNext size
|
// Count the number inbetween blocks of nNext size
|
||||||
|
|
||||||
label nPoints = 0;
|
label nPoints = 0;
|
||||||
labelList nOutsideConnections(n, 0);
|
labelList nOutsideConnections(nCurrDomains, 0);
|
||||||
forAll(pointPoints, pointi)
|
forAll(pointPoints, pointi)
|
||||||
{
|
{
|
||||||
if ((dist[pointi] / nNext) == blockI)
|
if ((dist[pointi] / nNext) == blockI)
|
||||||
@ -283,7 +317,7 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
|
|
||||||
forAll(pPoints, i)
|
forAll(pPoints, i)
|
||||||
{
|
{
|
||||||
label distBlockI = dist[pPoints[i]] / nNext;
|
const label distBlockI = dist[pPoints[i]] / nNext;
|
||||||
if (distBlockI != blockI)
|
if (distBlockI != blockI)
|
||||||
{
|
{
|
||||||
nOutsideConnections[distBlockI]++;
|
nOutsideConnections[distBlockI]++;
|
||||||
@ -301,12 +335,12 @@ void Foam::multiLevelDecomp::decompose
|
|||||||
Pstream::listCombineScatter(nOutsideConnections);
|
Pstream::listCombineScatter(nOutsideConnections);
|
||||||
label nPatches = 0;
|
label nPatches = 0;
|
||||||
label nFaces = 0;
|
label nFaces = 0;
|
||||||
forAll(nOutsideConnections, i)
|
for (const label nConnect : nOutsideConnections)
|
||||||
{
|
{
|
||||||
if (nOutsideConnections[i] > 0)
|
if (nConnect > 0)
|
||||||
{
|
{
|
||||||
nPatches++;
|
++nPatches;
|
||||||
nFaces += nOutsideConnections[i];
|
nFaces += nConnect;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -385,7 +419,7 @@ Foam::labelList Foam::multiLevelDecomp::decompose
|
|||||||
CompactListList<label> cellCells;
|
CompactListList<label> cellCells;
|
||||||
calcCellCells(mesh, identity(cc.size()), cc.size(), true, cellCells);
|
calcCellCells(mesh, identity(cc.size()), cc.size(), true, cellCells);
|
||||||
|
|
||||||
labelField finalDecomp(cc.size(), 0);
|
labelList finalDecomp(cc.size(), 0);
|
||||||
labelList cellMap(identity(cc.size()));
|
labelList cellMap(identity(cc.size()));
|
||||||
|
|
||||||
decompose
|
decompose
|
||||||
@ -395,6 +429,7 @@ Foam::labelList Foam::multiLevelDecomp::decompose
|
|||||||
cWeights,
|
cWeights,
|
||||||
cellMap, // map back to original cells
|
cellMap, // map back to original cells
|
||||||
0,
|
0,
|
||||||
|
0,
|
||||||
|
|
||||||
finalDecomp
|
finalDecomp
|
||||||
);
|
);
|
||||||
@ -410,7 +445,7 @@ Foam::labelList Foam::multiLevelDecomp::decompose
|
|||||||
const scalarField& pointWeights
|
const scalarField& pointWeights
|
||||||
)
|
)
|
||||||
{
|
{
|
||||||
labelField finalDecomp(points.size(), 0);
|
labelList finalDecomp(points.size(), 0);
|
||||||
labelList pointMap(identity(points.size()));
|
labelList pointMap(identity(points.size()));
|
||||||
|
|
||||||
decompose
|
decompose
|
||||||
@ -420,6 +455,7 @@ Foam::labelList Foam::multiLevelDecomp::decompose
|
|||||||
pointWeights,
|
pointWeights,
|
||||||
pointMap, // map back to original points
|
pointMap, // map back to original points
|
||||||
0,
|
0,
|
||||||
|
0,
|
||||||
|
|
||||||
finalDecomp
|
finalDecomp
|
||||||
);
|
);
|
||||||
|
|||||||
@ -3,7 +3,7 @@
|
|||||||
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
||||||
\\ / O peration |
|
\\ / O peration |
|
||||||
\\ / A nd | Copyright (C) 2011-2015 OpenFOAM Foundation
|
\\ / A nd | Copyright (C) 2011-2015 OpenFOAM Foundation
|
||||||
\\/ M anipulation |
|
\\/ M anipulation | Copyright (C) 2017 OpenCFD Ltd.
|
||||||
-------------------------------------------------------------------------------
|
-------------------------------------------------------------------------------
|
||||||
License
|
License
|
||||||
This file is part of OpenFOAM.
|
This file is part of OpenFOAM.
|
||||||
@ -71,21 +71,22 @@ class multiLevelDecomp
|
|||||||
labelList& cutConnections
|
labelList& cutConnections
|
||||||
) const;
|
) const;
|
||||||
|
|
||||||
//- Decompose level methodI without addressing
|
//- Decompose at 'currLevel' without addressing
|
||||||
void decompose
|
void decompose
|
||||||
(
|
(
|
||||||
const labelListList& pointPoints,
|
const labelListList& pointPoints,
|
||||||
const pointField& points,
|
const pointField& points,
|
||||||
const scalarField& pointWeights,
|
const scalarField& pointWeights,
|
||||||
const labelList& pointMap, // map back to original points
|
const labelUList& pointMap, // map back to original points
|
||||||
const label levelI,
|
const label currLevel,
|
||||||
|
const label leafOffset,
|
||||||
|
|
||||||
labelField& finalDecomp
|
labelList& finalDecomp
|
||||||
);
|
);
|
||||||
|
|
||||||
//- Disallow default bitwise copy construct and assignment
|
//- Disallow default bitwise copy construct and assignment
|
||||||
void operator=(const multiLevelDecomp&);
|
void operator=(const multiLevelDecomp&) = delete;
|
||||||
multiLevelDecomp(const multiLevelDecomp&);
|
multiLevelDecomp(const multiLevelDecomp&) = delete;
|
||||||
|
|
||||||
|
|
||||||
public:
|
public:
|
||||||
|
|||||||
Reference in New Issue
Block a user