/*---------------------------------------------------------------------------*\ ========= | \\ / F ield | OpenFOAM: The Open Source CFD Toolbox \\ / O peration | \\ / A nd | Copyright (C) 2011-2013 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 . Application foamUpgradeCyclics Description Tool to upgrade mesh and fields for split cyclics. Usage - foamUpgradeCyclics [OPTION] \param -test \n Suppress writing the updated files with split cyclics \param -enableFunctionEntries \n By default all dictionary preprocessing of fields is disabled \*---------------------------------------------------------------------------*/ #include "argList.H" #include "Time.H" #include "timeSelector.H" #include "IOdictionary.H" #include "polyMesh.H" #include "entry.H" #include "IOPtrList.H" #include "cyclicPolyPatch.H" #include "dictionaryEntry.H" #include "IOobjectList.H" #include "volFields.H" #include "pointFields.H" #include "surfaceFields.H" #include "string.H" using namespace Foam; // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // namespace Foam { defineTemplateTypeNameAndDebug(IOPtrList, 0); } // Read boundary file without reading mesh void rewriteBoundary ( const bool isTestRun, const IOobject& io, const fileName& regionPrefix, HashTable& thisNames, HashTable& nbrNames ) { Info<< "Reading boundary from " << io.filePath() << endl; // Read PtrList of dictionary. const word oldTypeName = IOPtrList::typeName; const_cast(IOPtrList::typeName) = word::null; IOPtrList patches(io); const_cast(IOPtrList::typeName) = oldTypeName; // Fake type back to what was in field const_cast(patches.type()) = patches.headerClassName(); // Replace any 'cyclic' label nOldCyclics = 0; forAll(patches, patchI) { const dictionary& patchDict = patches[patchI].dict(); if (word(patchDict["type"]) == cyclicPolyPatch::typeName) { if (!patchDict.found("neighbourPatch")) { Info<< "Patch " << patches[patchI].keyword() << " does not have 'neighbourPatch' entry; assuming it" << " is of the old type." << endl; nOldCyclics++; } } } Info<< "Detected " << nOldCyclics << " old cyclics." << nl << endl; // Save old patches. PtrList oldPatches(patches); // Extend label nOldPatches = patches.size(); patches.setSize(nOldPatches+nOldCyclics); // Create reordering map labelList oldToNew(patches.size()); // Add new entries label addedPatchI = nOldPatches; label newPatchI = 0; forAll(oldPatches, patchI) { const dictionary& patchDict = oldPatches[patchI].dict(); if ( word(patchDict["type"]) == cyclicPolyPatch::typeName ) { const word& name = oldPatches[patchI].keyword(); if (patchDict.found("neighbourPatch")) { patches.set(patchI, oldPatches.set(patchI, NULL)); oldToNew[patchI] = newPatchI++; // Check if patches come from automatic conversion word oldName; string::size_type i = name.rfind("_half0"); if (i != string::npos) { oldName = name.substr(0, i); thisNames.insert(oldName, name); Info<< "Detected converted cyclic patch " << name << " ; assuming it originates from " << oldName << endl; } else { i = name.rfind("_half1"); if (i != string::npos) { oldName = name.substr(0, i); nbrNames.insert(oldName, name); Info<< "Detected converted cyclic patch " << name << " ; assuming it originates from " << oldName << endl; } } } else { label nFaces = readLabel(patchDict["nFaces"]); label startFace = readLabel(patchDict["startFace"]); Info<< "Detected old style " << word(patchDict["type"]) << " patch " << name << " with" << nl << " nFaces : " << nFaces << nl << " startFace : " << startFace << endl; word thisName = name + "_half0"; word nbrName = name + "_half1"; thisNames.insert(name, thisName); nbrNames.insert(name, nbrName); // Save current dictionary const dictionary patchDict(patches[patchI].dict()); // Change entry on this side patches.set(patchI, oldPatches.set(patchI, NULL)); oldToNew[patchI] = newPatchI++; dictionary& thisPatchDict = patches[patchI].dict(); thisPatchDict.add("neighbourPatch", nbrName); thisPatchDict.set("nFaces", nFaces/2); patches[patchI].keyword() = thisName; // Add entry on other side patches.set ( addedPatchI, new dictionaryEntry ( nbrName, dictionary::null, patchDict ) ); oldToNew[addedPatchI] = newPatchI++; dictionary& nbrPatchDict = patches[addedPatchI].dict(); nbrPatchDict.set("neighbourPatch", thisName); nbrPatchDict.set("nFaces", nFaces/2); nbrPatchDict.set("startFace", startFace+nFaces/2); patches[addedPatchI].keyword() = nbrName; Info<< "Replaced with patches" << nl << patches[patchI].keyword() << " with" << nl << " nFaces : " << readLabel(thisPatchDict.lookup("nFaces")) << nl << " startFace : " << readLabel(thisPatchDict.lookup("startFace")) << nl << patches[addedPatchI].keyword() << " with" << nl << " nFaces : " << readLabel(nbrPatchDict.lookup("nFaces")) << nl << " startFace : " << readLabel(nbrPatchDict.lookup("startFace")) << nl << endl; addedPatchI++; } } else { patches.set(patchI, oldPatches.set(patchI, NULL)); oldToNew[patchI] = newPatchI++; } } patches.reorder(oldToNew); if (returnReduce(nOldCyclics, sumOp