This repository has been archived on 2023-11-20. You can view files and clone it, but cannot push or open issues or pull requests.
foam-extend4.1-coherent-io/applications/utilities/parallelProcessing/decomposeSets/decomposeSets.C

276 lines
7.6 KiB
C++
Raw Normal View History

2011-03-07 15:04:04 +00:00
/*---------------------------------------------------------------------------*\
========= |
2013-12-11 16:09:41 +00:00
\\ / F ield | foam-extend: Open Source CFD
2016-06-20 15:00:40 +00:00
\\ / O peration | Version: 4.0
\\ / A nd | Web: http://www.foam-extend.org
\\/ M anipulation | For copyright notice see file Copyright
2011-03-07 15:04:04 +00:00
-------------------------------------------------------------------------------
License
2013-12-11 16:09:41 +00:00
This file is part of foam-extend.
2011-03-07 15:04:04 +00:00
2013-12-11 16:09:41 +00:00
foam-extend is free software: you can redistribute it and/or modify it
2011-03-07 15:04:04 +00:00
under the terms of the GNU General Public License as published by the
2013-12-11 16:09:41 +00:00
Free Software Foundation, either version 3 of the License, or (at your
2011-03-07 15:04:04 +00:00
option) any later version.
2013-12-11 16:09:41 +00:00
foam-extend 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.
2011-03-07 15:04:04 +00:00
You should have received a copy of the GNU General Public License
2013-12-11 16:09:41 +00:00
along with foam-extend. If not, see <http://www.gnu.org/licenses/>.
2011-03-07 15:04:04 +00:00
Application
reconstructPar
Description
Decompose point, face and cell sets after the case has been decomposed
\*---------------------------------------------------------------------------*/
#include "fvCFD.H"
#include "processorMeshes.H"
#include "cellSet.H"
#include "faceSet.H"
#include "pointSet.H"
#include "IOobjectList.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
int main(int argc, char *argv[])
{
argList::noParallel();
# include "addRegionOption.H"
2014-04-11 14:47:17 +00:00
// Add option to write empty sets
argList::validOptions.insert("writeEmptySets", "");
2015-08-17 19:38:31 +00:00
argList::validOptions.insert("liveObjectsOnly", "");
2014-04-11 14:47:17 +00:00
2011-03-07 15:04:04 +00:00
# include "setRootCase.H"
# include "createTime.H"
Info<< "Time = " << runTime.timeName() << endl;
2014-04-11 14:47:17 +00:00
bool writeEmptySets = args.optionFound("writeEmptySets");
2015-08-17 19:38:31 +00:00
bool liveObjectsOnly = args.optionFound("liveObjectsOnly");
2014-04-11 14:47:17 +00:00
2011-03-07 15:04:04 +00:00
// Determine the processor count directly
label nProcs = 0;
while (isDir(args.path()/(word("processor") + name(nProcs))))
{
++nProcs;
}
if (!nProcs)
{
FatalErrorIn(args.executable())
<< "No processor* directories found"
<< exit(FatalError);
}
PtrList<Time> databases(nProcs);
forAll (databases, procI)
{
databases.set
(
procI,
new Time
(
Time::controlDictName,
args.rootPath(),
args.caseName()/fileName(word("processor") + name(procI))
)
);
}
# include "createNamedMesh.H"
// Set all times on processor meshes equal to decomposed mesh
forAll (databases, procI)
{
databases[procI].setTime(runTime.timeName(), runTime.timeIndex());
}
// Read all meshes and addressing to reconstructed mesh
processorMeshes procMeshes(databases, regionName);
// Find all sets on complete mesh
// Search for list of objects for the time of the mesh
IOobjectList objects
(
mesh,
mesh.facesInstance(),
polyMesh::meshSubDir/"sets"
);
Info<< "Searched : " << mesh.facesInstance()/polyMesh::meshSubDir/"sets"
<< nl
<< "Found : " << objects.names() << nl
<< endl;
IOobjectList pointObjects(objects.lookupClass(pointSet::typeName));
for
(
IOobjectList::const_iterator iter = pointObjects.begin();
iter != pointObjects.end();
++iter
)
{
// Set not in memory. Load it.
pointSet set(*iter());
// Go through all processors
forAll (procMeshes.meshes(), procI)
{
const labelList& addr = procMeshes.pointProcAddressing()[procI];
2015-08-17 19:38:31 +00:00
const label nProcPoints = procMeshes.meshes()[procI].nPoints();
2011-03-07 15:04:04 +00:00
labelHashSet procSet;
forAll (addr, pointI)
{
2015-08-17 19:38:31 +00:00
// Skip list when nPoints is reached
if (liveObjectsOnly && pointI >= nProcPoints)
{
break;
}
2011-03-07 15:04:04 +00:00
if (set.found(addr[pointI]))
{
procSet.insert(pointI);
}
}
2014-04-11 14:47:17 +00:00
if (!procSet.empty() || writeEmptySets)
2011-03-07 15:04:04 +00:00
{
// Set created, write it
Info<< "Writing point set " << set.name()
<< " on processor " << procI << endl;
2015-08-17 19:38:31 +00:00
pointSet ps
2011-03-07 15:04:04 +00:00
(
procMeshes.meshes()[procI],
set.name(),
procSet,
IOobject::NO_WRITE
);
2015-08-17 19:38:31 +00:00
ps.write();
2011-03-07 15:04:04 +00:00
}
}
}
IOobjectList faceObjects(objects.lookupClass(faceSet::typeName));
for
(
IOobjectList::const_iterator iter = faceObjects.begin();
iter != faceObjects.end();
++iter
)
{
// Set not in memory. Load it.
faceSet set(*iter());
// Go through all processors
forAll (procMeshes.meshes(), procI)
{
const labelList& addr = procMeshes.faceProcAddressing()[procI];
2015-08-17 19:38:31 +00:00
const label nProcFaces = procMeshes.meshes()[procI].nFaces();
2011-03-07 15:04:04 +00:00
labelHashSet procSet;
forAll (addr, faceI)
{
2015-08-17 19:38:31 +00:00
// Skip list when nPoints is reached
if (liveObjectsOnly && faceI >= nProcFaces)
{
break;
}
2011-03-07 15:04:04 +00:00
// Note faceProcAddressing peculiarity:
// change of sign and offset. HJ, 7/Mar/2011
if (set.found(mag(addr[faceI]) - 1))
{
procSet.insert(faceI);
}
}
2014-04-11 14:47:17 +00:00
if (!procSet.empty() || writeEmptySets)
2011-03-07 15:04:04 +00:00
{
// Set created, write it
Info<< "Writing face set " << set.name()
<< " on processor " << procI << endl;
2015-08-17 19:38:31 +00:00
faceSet fs
2011-03-07 15:04:04 +00:00
(
procMeshes.meshes()[procI],
set.name(),
procSet,
IOobject::NO_WRITE
);
2015-08-17 19:38:31 +00:00
fs.write();
2011-03-07 15:04:04 +00:00
}
}
}
IOobjectList cellObjects(objects.lookupClass(cellSet::typeName));
for
(
IOobjectList::const_iterator iter = cellObjects.begin();
iter != cellObjects.end();
++iter
)
{
// Set not in memory. Load it.
cellSet set(*iter());
// Go through all processors
forAll (procMeshes.meshes(), procI)
{
const labelList& addr = procMeshes.cellProcAddressing()[procI];
2015-08-17 19:38:31 +00:00
// There are no retired cells: no special handling required
2011-03-07 15:04:04 +00:00
labelHashSet procSet;
forAll (addr, cellI)
{
if (set.found(addr[cellI]))
{
procSet.insert(cellI);
}
}
2014-04-11 14:47:17 +00:00
if (!procSet.empty() || writeEmptySets)
2011-03-07 15:04:04 +00:00
{
// Set created, write it
Info<< "Writing cell set " << set.name()
<< " on processor " << procI << endl;
cellSet cs
(
procMeshes.meshes()[procI],
set.name(),
procSet,
IOobject::NO_WRITE
);
cs.write();
}
}
}
Info<< "End.\n" << endl;
return 0;
}
// ************************************************************************* //