466 lines
15 KiB
C
466 lines
15 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright held by original author
|
|
\\/ 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 2 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, write to the Free Software Foundation,
|
|
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
Description
|
|
Makes internal faces into boundary faces. Does not duplicate points, unlike
|
|
mergeOrSplitBaffles.
|
|
|
|
Note: if any coupled patch face is selected for baffling the opposite
|
|
member has to be selected for baffling as well. Note that this
|
|
is the same as repatching. This was added only for convenience so
|
|
you don't have to filter coupled boundary out of your set.
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "syncTools.H"
|
|
#include "argList.H"
|
|
#include "Time.H"
|
|
#include "faceSet.H"
|
|
#include "directTopoChange.H"
|
|
#include "polyModifyFace.H"
|
|
#include "polyAddFace.H"
|
|
#include "ReadFields.H"
|
|
#include "volFields.H"
|
|
#include "surfaceFields.H"
|
|
#include "ZoneIDs.H"
|
|
|
|
using namespace Foam;
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
void modifyOrAddFace
|
|
(
|
|
directTopoChange& meshMod,
|
|
const face& f,
|
|
const label faceI,
|
|
const label own,
|
|
const bool flipFaceFlux,
|
|
const label newPatchI,
|
|
const label zoneID,
|
|
const bool zoneFlip,
|
|
PackedBoolList& modifiedFace
|
|
)
|
|
{
|
|
if (!modifiedFace[faceI])
|
|
{
|
|
// First usage of face. Modify.
|
|
meshMod.setAction
|
|
(
|
|
polyModifyFace
|
|
(
|
|
f, // modified face
|
|
faceI, // label of face
|
|
own, // owner
|
|
-1, // neighbour
|
|
flipFaceFlux, // face flip
|
|
newPatchI, // patch for face
|
|
false, // remove from zone
|
|
zoneID, // zone for face
|
|
zoneFlip // face flip in zone
|
|
)
|
|
);
|
|
modifiedFace[faceI] = 1;
|
|
}
|
|
else
|
|
{
|
|
// Second or more usage of face. Add.
|
|
meshMod.setAction
|
|
(
|
|
polyAddFace
|
|
(
|
|
f, // modified face
|
|
own, // owner
|
|
-1, // neighbour
|
|
-1, // master point
|
|
-1, // master edge
|
|
faceI, // master face
|
|
flipFaceFlux, // face flip
|
|
newPatchI, // patch for face
|
|
zoneID, // zone for face
|
|
zoneFlip // face flip in zone
|
|
)
|
|
);
|
|
}
|
|
}
|
|
|
|
|
|
label findPatchID(const polyMesh& mesh, const word& name)
|
|
{
|
|
label patchI = mesh.boundaryMesh().findPatchID(name);
|
|
|
|
if (patchI == -1)
|
|
{
|
|
FatalErrorIn("findPatchID(const polyMesh&, const word&)")
|
|
<< "Cannot find patch " << name << endl
|
|
<< "Valid patches are " << mesh.boundaryMesh().names()
|
|
<< exit(FatalError);
|
|
}
|
|
return patchI;
|
|
}
|
|
|
|
|
|
// Main program:
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
# include "addRegionOption.H"
|
|
argList::validArgs.append("faceZone");
|
|
argList::validArgs.append("patch");
|
|
argList::validOptions.insert("additionalPatches", "(patch2 .. patchN)");
|
|
argList::validOptions.insert("internalFacesOnly", "");
|
|
argList::validOptions.insert("overwrite", "");
|
|
|
|
# include "setRootCase.H"
|
|
# include "createTime.H"
|
|
runTime.functionObjects().off();
|
|
# include "createNamedMesh.H"
|
|
const word oldInstance = mesh.pointsInstance();
|
|
|
|
const polyBoundaryMesh& patches = mesh.boundaryMesh();
|
|
const faceZoneMesh& faceZones = mesh.faceZones();
|
|
|
|
// Faces to baffle
|
|
faceZoneID zoneID(args.additionalArgs()[0], faceZones);
|
|
|
|
Info<< "Converting faces on zone " << zoneID.name()
|
|
<< " into baffles." << nl << endl;
|
|
|
|
if (zoneID.index() == -1)
|
|
{
|
|
FatalErrorIn(args.executable()) << "Cannot find faceZone "
|
|
<< zoneID.name() << endl
|
|
<< "Valid zones are " << faceZones.names()
|
|
<< exit(FatalError);
|
|
}
|
|
|
|
const faceZone& fZone = faceZones[zoneID.index()];
|
|
|
|
Info<< "Found " << returnReduce(fZone.size(), sumOp<label>())
|
|
<< " faces on zone " << zoneID.name() << nl << endl;
|
|
|
|
// Make sure patches and zoneFaces are synchronised across couples
|
|
patches.checkParallelSync(true);
|
|
fZone.checkParallelSync(true);
|
|
|
|
// Patches to put baffles into
|
|
DynamicList<label> newPatches(1);
|
|
|
|
word patchName(args.additionalArgs()[1]);
|
|
newPatches.append(findPatchID(mesh, patchName));
|
|
Info<< "Using patch " << patchName
|
|
<< " at index " << newPatches[0] << endl;
|
|
|
|
|
|
// Additional patches
|
|
if (args.optionFound("additionalPatches"))
|
|
{
|
|
const wordList patchNames
|
|
(
|
|
args.optionLookup("additionalPatches")()
|
|
);
|
|
|
|
newPatches.reserve(patchNames.size() + 1);
|
|
forAll(patchNames, i)
|
|
{
|
|
newPatches.append(findPatchID(mesh, patchNames[i]));
|
|
Info<< "Using additional patch " << patchNames[i]
|
|
<< " at index " << newPatches[newPatches.size()-1] << endl;
|
|
}
|
|
}
|
|
|
|
|
|
bool overwrite = args.optionFound("overwrite");
|
|
|
|
bool internalFacesOnly = args.optionFound("internalFacesOnly");
|
|
|
|
if (internalFacesOnly)
|
|
{
|
|
Info<< "Not converting faces on non-coupled patches." << nl << endl;
|
|
}
|
|
|
|
|
|
// Read objects in time directory
|
|
IOobjectList objects(mesh, runTime.timeName());
|
|
|
|
// Read vol fields.
|
|
|
|
PtrList<volScalarField> vsFlds;
|
|
ReadFields(mesh, objects, vsFlds);
|
|
|
|
PtrList<volVectorField> vvFlds;
|
|
ReadFields(mesh, objects, vvFlds);
|
|
|
|
PtrList<volSphericalTensorField> vstFlds;
|
|
ReadFields(mesh, objects, vstFlds);
|
|
|
|
PtrList<volSymmTensorField> vsymtFlds;
|
|
ReadFields(mesh, objects, vsymtFlds);
|
|
|
|
PtrList<volTensorField> vtFlds;
|
|
ReadFields(mesh, objects, vtFlds);
|
|
|
|
// Read surface fields.
|
|
|
|
PtrList<surfaceScalarField> ssFlds;
|
|
ReadFields(mesh, objects, ssFlds);
|
|
|
|
PtrList<surfaceVectorField> svFlds;
|
|
ReadFields(mesh, objects, svFlds);
|
|
|
|
PtrList<surfaceSphericalTensorField> sstFlds;
|
|
ReadFields(mesh, objects, sstFlds);
|
|
|
|
PtrList<surfaceSymmTensorField> ssymtFlds;
|
|
ReadFields(mesh, objects, ssymtFlds);
|
|
|
|
PtrList<surfaceTensorField> stFlds;
|
|
ReadFields(mesh, objects, stFlds);
|
|
|
|
|
|
// Mesh change container
|
|
directTopoChange meshMod(mesh);
|
|
|
|
|
|
// Do the actual changes. Note:
|
|
// - loop in incrementing face order (not necessary if faceZone ordered).
|
|
// Preserves any existing ordering on patch faces.
|
|
// - two passes, do non-flip faces first and flip faces second. This
|
|
// guarantees that when e.g. creating a cyclic all faces from one
|
|
// side come first and faces from the other side next.
|
|
|
|
// Whether first use of face (modify) or consecutive (add)
|
|
PackedBoolList modifiedFace(mesh.nFaces());
|
|
// Never modify coupled faces
|
|
forAll(patches, patchI)
|
|
{
|
|
const polyPatch& pp = patches[patchI];
|
|
if (pp.coupled())
|
|
{
|
|
forAll(pp, i)
|
|
{
|
|
modifiedFace[pp.start()+i] = 1;
|
|
}
|
|
}
|
|
}
|
|
label nModified = 0;
|
|
|
|
forAll(newPatches, i)
|
|
{
|
|
label newPatchI = newPatches[i];
|
|
|
|
// Pass 1. Do selected side of zone
|
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
|
|
|
for (label faceI = 0; faceI < mesh.nInternalFaces(); faceI++)
|
|
{
|
|
label zoneFaceI = fZone.whichFace(faceI);
|
|
|
|
if (zoneFaceI != -1)
|
|
{
|
|
if (!fZone.flipMap()[zoneFaceI])
|
|
{
|
|
// Use owner side of face
|
|
modifyOrAddFace
|
|
(
|
|
meshMod,
|
|
mesh.faces()[faceI], // modified face
|
|
faceI, // label of face
|
|
mesh.faceOwner()[faceI],// owner
|
|
false, // face flip
|
|
newPatchI, // patch for face
|
|
zoneID.index(), // zone for face
|
|
false, // face flip in zone
|
|
modifiedFace // modify or add status
|
|
);
|
|
}
|
|
else
|
|
{
|
|
// Use neighbour side of face
|
|
modifyOrAddFace
|
|
(
|
|
meshMod,
|
|
mesh.faces()[faceI].reverseFace(), // modified face
|
|
faceI, // label of face
|
|
mesh.faceNeighbour()[faceI],// owner
|
|
true, // face flip
|
|
newPatchI, // patch for face
|
|
zoneID.index(), // zone for face
|
|
true, // face flip in zone
|
|
modifiedFace // modify or add status
|
|
);
|
|
}
|
|
|
|
nModified++;
|
|
}
|
|
}
|
|
|
|
|
|
// Pass 2. Do other side of zone
|
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
|
|
|
for (label faceI = 0; faceI < mesh.nInternalFaces(); faceI++)
|
|
{
|
|
label zoneFaceI = fZone.whichFace(faceI);
|
|
|
|
if (zoneFaceI != -1)
|
|
{
|
|
if (!fZone.flipMap()[zoneFaceI])
|
|
{
|
|
// Use neighbour side of face
|
|
modifyOrAddFace
|
|
(
|
|
meshMod,
|
|
mesh.faces()[faceI].reverseFace(), // modified face
|
|
faceI, // label of face
|
|
mesh.faceNeighbour()[faceI], // owner
|
|
true, // face flip
|
|
newPatchI, // patch for face
|
|
zoneID.index(), // zone for face
|
|
true, // face flip in zone
|
|
modifiedFace // modify or add
|
|
);
|
|
}
|
|
else
|
|
{
|
|
// Use owner side of face
|
|
modifyOrAddFace
|
|
(
|
|
meshMod,
|
|
mesh.faces()[faceI], // modified face
|
|
faceI, // label of face
|
|
mesh.faceOwner()[faceI],// owner
|
|
false, // face flip
|
|
newPatchI, // patch for face
|
|
zoneID.index(), // zone for face
|
|
false, // face flip in zone
|
|
modifiedFace // modify or add status
|
|
);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
// Modify any boundary faces
|
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~
|
|
|
|
// Normal boundary:
|
|
// - move to new patch. Might already be back-to-back baffle
|
|
// you want to add cyclic to. Do warn though.
|
|
//
|
|
// Processor boundary:
|
|
// - do not move to cyclic
|
|
// - add normal patches though.
|
|
|
|
// For warning once per patch.
|
|
labelHashSet patchWarned;
|
|
|
|
forAll(patches, patchI)
|
|
{
|
|
const polyPatch& pp = patches[patchI];
|
|
|
|
if (pp.coupled() && patches[newPatchI].coupled())
|
|
{
|
|
// Do not allow coupled faces to be moved to different coupled
|
|
// patches.
|
|
}
|
|
else if (pp.coupled() || !internalFacesOnly)
|
|
{
|
|
forAll(pp, i)
|
|
{
|
|
label faceI = pp.start()+i;
|
|
|
|
label zoneFaceI = fZone.whichFace(faceI);
|
|
|
|
if (zoneFaceI != -1)
|
|
{
|
|
if (patchWarned.insert(patchI))
|
|
{
|
|
WarningIn(args.executable())
|
|
<< "Found boundary face (in patch "
|
|
<< pp.name()
|
|
<< ") in faceZone " << fZone.name()
|
|
<< " to convert to baffle patch "
|
|
<< patches[newPatchI].name()
|
|
<< endl
|
|
<< " Run with -internalFacesOnly option"
|
|
<< " if you don't wish to convert"
|
|
<< " boundary faces." << endl;
|
|
}
|
|
|
|
modifyOrAddFace
|
|
(
|
|
meshMod,
|
|
mesh.faces()[faceI], // modified face
|
|
faceI, // label of face
|
|
mesh.faceOwner()[faceI], // owner
|
|
false, // face flip
|
|
newPatchI, // patch for face
|
|
zoneID.index(), // zone for face
|
|
fZone.flipMap()[zoneFaceI], // face flip in zone
|
|
modifiedFace // modify or add status
|
|
);
|
|
|
|
nModified++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
Info<< "Converted " << returnReduce(nModified, sumOp<label>())
|
|
<< " faces into boundary faces on patch " << patchName << nl << endl;
|
|
|
|
if (!overwrite)
|
|
{
|
|
runTime++;
|
|
}
|
|
|
|
// Change the mesh. Change points directly (no inflation).
|
|
autoPtr<mapPolyMesh> map = meshMod.changeMesh(mesh, false);
|
|
|
|
// Update fields
|
|
mesh.updateMesh(map);
|
|
|
|
// Move mesh (since morphing might not do this)
|
|
if (map().hasMotionPoints())
|
|
{
|
|
mesh.movePoints(map().preMotionPoints());
|
|
}
|
|
|
|
if (overwrite)
|
|
{
|
|
mesh.setInstance(oldInstance);
|
|
}
|
|
Info<< "Writing mesh to " << runTime.timeName() << endl;
|
|
|
|
mesh.write();
|
|
|
|
Info<< "End\n" << endl;
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|