67ab0b5abd
- in FOAM library updated containers backported PackedBoolList, hashedWordList, nullObject, wordRe, backported functions to backported int32 support backported tableReaders backported Function1, TimeFunction1 backported dynamicCode (for codedBCs, ...) -- needs to be mapped out advanced error macros (FatalIOErrorInFunction, ...) -- needs to be mapped out backported IOobject::MUST_READ_IF_MODIFIED and added IOobject::READ_IF_PRESENT_IF_MODIFIED (only in FO) - in postProcessing backported IO FOs (partialWrite, removeRegisteredObject, writeDictionary, writeRegisteredObject) backported field FOs (fieldCoordinateSystemTransform, fieldValues, nearWallFields, processorField, readFields, regionSizeDistribution, streamLine, wallBoundedStreamLine) backported fvTools FOs (calcFvcDiv, calcFvcGrad, calcMag) backported jobControl FOs (abortCalculation) backported utilities FOs (ourantNo, Lambda2, Peclet, Q, codedFunctionObject, pressureTools, residuals, scalarTransport, setTimeStep, timeActivatedFileUpdate, turbulenceFields, vorticity, wallShearStress)
275 lines
7.5 KiB
C++
275 lines
7.5 KiB
C++
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | foam-extend: Open Source CFD
|
|
\\ / O peration | Version: 4.0
|
|
\\ / A nd | Web: http://www.foam-extend.org
|
|
\\/ M anipulation | For copyright notice see file Copyright
|
|
-------------------------------------------------------------------------------
|
|
License
|
|
This file is part of foam-extend.
|
|
|
|
foam-extend 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.
|
|
|
|
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.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with foam-extend. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
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"
|
|
|
|
// Add option to write empty sets
|
|
argList::validOptions.insert("writeEmptySets", "");
|
|
argList::validOptions.insert("liveObjectsOnly", "");
|
|
|
|
# include "setRootCase.H"
|
|
# include "createTime.H"
|
|
|
|
Info<< "Time = " << runTime.timeName() << endl;
|
|
|
|
bool writeEmptySets = args.optionFound("writeEmptySets");
|
|
bool liveObjectsOnly = args.optionFound("liveObjectsOnly");
|
|
|
|
// 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, 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];
|
|
|
|
const label nProcPoints = procMeshes.meshes()[procI].nPoints();
|
|
|
|
labelHashSet procSet;
|
|
|
|
forAll (addr, pointI)
|
|
{
|
|
// Skip list when nPoints is reached
|
|
if (liveObjectsOnly && pointI >= nProcPoints)
|
|
{
|
|
break;
|
|
}
|
|
|
|
if (set.found(addr[pointI]))
|
|
{
|
|
procSet.insert(pointI);
|
|
}
|
|
}
|
|
|
|
if (!procSet.empty() || writeEmptySets)
|
|
{
|
|
// Set created, write it
|
|
Info<< "Writing point set " << set.name()
|
|
<< " on processor " << procI << endl;
|
|
pointSet ps
|
|
(
|
|
procMeshes.meshes()[procI],
|
|
set.name(),
|
|
procSet,
|
|
IOobject::NO_WRITE
|
|
);
|
|
ps.write();
|
|
}
|
|
}
|
|
}
|
|
|
|
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];
|
|
|
|
const label nProcFaces = procMeshes.meshes()[procI].nFaces();
|
|
|
|
labelHashSet procSet;
|
|
|
|
forAll (addr, faceI)
|
|
{
|
|
// Skip list when nPoints is reached
|
|
if (liveObjectsOnly && faceI >= nProcFaces)
|
|
{
|
|
break;
|
|
}
|
|
|
|
// Note faceProcAddressing peculiarity:
|
|
// change of sign and offset. HJ, 7/Mar/2011
|
|
if (set.found(mag(addr[faceI]) - 1))
|
|
{
|
|
procSet.insert(faceI);
|
|
}
|
|
}
|
|
|
|
if (!procSet.empty() || writeEmptySets)
|
|
{
|
|
// Set created, write it
|
|
Info<< "Writing face set " << set.name()
|
|
<< " on processor " << procI << endl;
|
|
faceSet fs
|
|
(
|
|
procMeshes.meshes()[procI],
|
|
set.name(),
|
|
procSet,
|
|
IOobject::NO_WRITE
|
|
);
|
|
fs.write();
|
|
}
|
|
}
|
|
}
|
|
|
|
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];
|
|
|
|
// There are no retired cells: no special handling required
|
|
|
|
labelHashSet procSet;
|
|
|
|
forAll (addr, cellI)
|
|
{
|
|
if (set.found(addr[cellI]))
|
|
{
|
|
procSet.insert(cellI);
|
|
}
|
|
}
|
|
|
|
if (!procSet.empty() || writeEmptySets)
|
|
{
|
|
// 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;
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|