Download data/src/meshCheck/checkTopology.C from introvoyz042/OpenFOAM-dev: direct link, hf CLI and curl.
- Browser
- Download file 19.1 kB
-
https://huggingface.co/datasets/introvoyz042/OpenFOAM-dev/resolve/main/data/src/meshCheck/checkTopology.C
- Command line
-
hf download hf://datasets/introvoyz042/OpenFOAM-dev/data/src/meshCheck/checkTopology.C
-
curl -L -o checkTopology.C https://huggingface.co/datasets/introvoyz042/OpenFOAM-dev/resolve/main/data/src/meshCheck/checkTopology.C
19.1 kB
| /*---------------------------------------------------------------------------*\ | |
| ========= | | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox | |
| \\ / O peration | Website: https://openfoam.org | |
| \\ / A nd | Copyright (C) 2011-2026 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 <http://www.gnu.org/licenses/>. | |
| \*---------------------------------------------------------------------------*/ | |
| // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // | |
| Foam::label Foam::meshCheck::checkTopology | |
| ( | |
| const polyMesh& mesh, | |
| const bool allTopology, | |
| const autoPtr<surfaceWriter>& surfWriter, | |
| const autoPtr<Foam::setWriter>& setWriter | |
| ) | |
| { | |
| label noFailedChecks = 0; | |
| Info<< "Checking topology..." << endl; | |
| // Check if the boundary definition is unique | |
| mesh.boundary().checkDefinition(true); | |
| // Check that empty patches cover all sides of the mesh | |
| { | |
| label nEmpty = 0; | |
| forAll(mesh.boundary(), patchi) | |
| { | |
| if (isA<emptyPolyPatch>(mesh.boundary()[patchi])) | |
| { | |
| nEmpty += mesh.boundary()[patchi].size(); | |
| } | |
| } | |
| reduce(nEmpty, sumOp()); | |
| label nTotCells = returnReduce(mesh.cells().size(), sumOp()); | |
| // These are actually warnings, not errors. | |
| if (nTotCells && (nEmpty % nTotCells)) | |
| { | |
| Info<< " ***Total number of faces on empty patches" | |
| << " is not divisible by the number of cells in the mesh." | |
| << " Hence this mesh is not 1D or 2D." | |
| << endl; | |
| } | |
| } | |
| // Check if the boundary processor patches are correct | |
| mesh.boundary().checkParallelSync(true); | |
| // Check names of zones are equal | |
| mesh.cellZones().checkDefinition(true); | |
| if (mesh.cellZones().checkParallelSync(true)) | |
| { | |
| noFailedChecks++; | |
| } | |
| mesh.faceZones().checkDefinition(true); | |
| if (mesh.faceZones().checkParallelSync(true)) | |
| { | |
| noFailedChecks++; | |
| } | |
| mesh.pointZones().checkDefinition(true); | |
| if (mesh.pointZones().checkParallelSync(true)) | |
| { | |
| noFailedChecks++; | |
| } | |
| { | |
| cellSet cells(mesh, "illegalCells", mesh.nCells()/100); | |
| forAll(mesh.cells(), celli) | |
| { | |
| const cell& cFaces = mesh.cells()[celli]; | |
| if (cFaces.size() <= 3) | |
| { | |
| cells.insert(celli); | |
| } | |
| forAll(cFaces, i) | |
| { | |
| if (cFaces[i] < 0 || cFaces[i] >= mesh.nFaces()) | |
| { | |
| cells.insert(celli); | |
| break; | |
| } | |
| } | |
| } | |
| label nCells = returnReduce(cells.size(), sumOp()); | |
| if (nCells > 0) | |
| { | |
| Info<< " Illegal cells (less than 4 faces or out of range faces)" | |
| << " found, number of cells: " << nCells << endl; | |
| noFailedChecks++; | |
| if (setWriter.valid()) | |
| { | |
| Info<< " <<Writing " << nCells | |
| << " illegal cells to set " << cells.name() << endl; | |
| cells.instance() = mesh.pointsInstance(); | |
| cells.write(); | |
| } | |
| if (surfWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(surfWriter(), cells); | |
| } | |
| } | |
| else | |
| { | |
| Info<< " Cell to face addressing OK." << endl; | |
| } | |
| } | |
| { | |
| pointSet points(mesh, "unusedPoints", mesh.nPoints()/100); | |
| if (meshCheck::checkPoints(mesh, true, &points)) | |
| { | |
| noFailedChecks++; | |
| if (setWriter.valid()) | |
| { | |
| label nPoints = returnReduce(points.size(), sumOp()); | |
| Info<< " <<Writing " << nPoints | |
| << " unused points to set " << points.name() << endl; | |
| points.instance() = mesh.pointsInstance(); | |
| points.write(); | |
| if (setWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(setWriter, points); | |
| } | |
| } | |
| } | |
| } | |
| { | |
| faceSet faces(mesh, "upperTriangularFace", mesh.nFaces()/100); | |
| if (meshCheck::checkUpperTriangular(mesh, true, &faces)) | |
| { | |
| noFailedChecks++; | |
| } | |
| label nFaces = returnReduce(faces.size(), sumOp()); | |
| if (nFaces > 0) | |
| { | |
| if (setWriter.valid()) | |
| { | |
| Info<< " <<Writing " << nFaces | |
| << " unordered faces to set " << faces.name() << endl; | |
| faces.instance() = mesh.pointsInstance(); | |
| faces.write(); | |
| } | |
| if (surfWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(surfWriter(), faces); | |
| } | |
| } | |
| } | |
| { | |
| faceSet faces(mesh, "outOfRangeFaces", mesh.nFaces()/100); | |
| if (meshCheck::checkFaceVertices(mesh, true, &faces)) | |
| { | |
| noFailedChecks++; | |
| if (setWriter.valid()) | |
| { | |
| label nFaces = returnReduce(faces.size(), sumOp()); | |
| Info<< " <<Writing " << nFaces | |
| << " faces with out-of-range or duplicate vertices to set " | |
| << faces.name() << endl; | |
| faces.instance() = mesh.pointsInstance(); | |
| faces.write(); | |
| } | |
| if (surfWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(surfWriter(), faces); | |
| } | |
| } | |
| } | |
| if (allTopology) | |
| { | |
| cellSet cells(mesh, "zipUpCells", mesh.nCells()/100); | |
| if (meshCheck::checkCellsZipUp(mesh, true, &cells)) | |
| { | |
| noFailedChecks++; | |
| if (setWriter.valid()) | |
| { | |
| label nCells = returnReduce(cells.size(), sumOp()); | |
| Info<< " <<Writing " << nCells | |
| << " cells with over used edges to set " << cells.name() | |
| << endl; | |
| cells.instance() = mesh.pointsInstance(); | |
| cells.write(); | |
| } | |
| if (surfWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(surfWriter(), cells); | |
| } | |
| } | |
| } | |
| if (allTopology) | |
| { | |
| faceSet faces(mesh, "edgeFaces", mesh.nFaces()/100); | |
| if (meshCheck::checkFaceFaces(mesh, true, &faces)) | |
| { | |
| noFailedChecks++; | |
| } | |
| label nFaces = returnReduce(faces.size(), sumOp()); | |
| if (nFaces > 0) | |
| { | |
| if (setWriter.valid()) | |
| { | |
| Info<< " <<Writing " << nFaces | |
| << " faces with non-standard edge connectivity to set " | |
| << faces.name() << endl; | |
| faces.instance() = mesh.pointsInstance(); | |
| faces.write(); | |
| } | |
| if (surfWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(surfWriter(), faces); | |
| } | |
| } | |
| } | |
| if (allTopology) | |
| { | |
| labelList nInternalFaces(mesh.nCells(), 0); | |
| for (label facei = 0; facei < mesh.nInternalFaces(); facei++) | |
| { | |
| nInternalFaces[mesh.faceOwner()[facei]]++; | |
| nInternalFaces[mesh.faceNeighbour()[facei]]++; | |
| } | |
| const polyBoundaryMesh& patches = mesh.boundary(); | |
| forAll(patches, patchi) | |
| { | |
| if (patches[patchi].coupled()) | |
| { | |
| const labelUList& owners = patches[patchi].faceCells(); | |
| forAll(owners, i) | |
| { | |
| nInternalFaces[owners[i]]++; | |
| } | |
| } | |
| } | |
| cellSet oneCells(mesh, "oneInternalFaceCells", mesh.nCells()/100); | |
| cellSet twoCells(mesh, "twoInternalFacesCells", mesh.nCells()/100); | |
| forAll(nInternalFaces, celli) | |
| { | |
| if (nInternalFaces[celli] <= 1) | |
| { | |
| oneCells.insert(celli); | |
| } | |
| else if (nInternalFaces[celli] == 2) | |
| { | |
| twoCells.insert(celli); | |
| } | |
| } | |
| label nOneCells = returnReduce(oneCells.size(), sumOp()); | |
| if (nOneCells > 0) | |
| { | |
| if (setWriter.valid()) | |
| { | |
| Info<< " <<Writing " << nOneCells | |
| << " cells with zero or one non-boundary face to set " | |
| << oneCells.name() | |
| << endl; | |
| oneCells.instance() = mesh.pointsInstance(); | |
| oneCells.write(); | |
| } | |
| if (surfWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(surfWriter(), oneCells); | |
| } | |
| } | |
| label nTwoCells = returnReduce(twoCells.size(), sumOp()); | |
| if (nTwoCells > 0) | |
| { | |
| if (setWriter.valid()) | |
| { | |
| Info<< " <<Writing " << nTwoCells | |
| << " cells with two non-boundary faces to set " | |
| << twoCells.name() | |
| << endl; | |
| twoCells.instance() = mesh.pointsInstance(); | |
| twoCells.write(); | |
| } | |
| if (surfWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(surfWriter(), twoCells); | |
| } | |
| } | |
| } | |
| { | |
| regionSplit rs(mesh); | |
| if (rs.nRegions() <= 1) | |
| { | |
| Info<< " Number of regions: " << rs.nRegions() << " (OK)." | |
| << endl; | |
| } | |
| else | |
| { | |
| Info<< " *Number of regions: " << rs.nRegions() << endl; | |
| Info<< " The mesh has multiple regions which are not connected " | |
| "by any face." << endl; | |
| if (allTopology && setWriter.valid()) | |
| { | |
| Info<< " <<Writing region information to " | |
| << mesh.time().name()/"cellToRegion" | |
| << endl; | |
| labelIOList ctr | |
| ( | |
| IOobject | |
| ( | |
| "cellToRegion", | |
| mesh.time().name(), | |
| mesh, | |
| IOobject::NO_READ, | |
| IOobject::NO_WRITE | |
| ), | |
| rs | |
| ); | |
| ctr.write(); | |
| } | |
| // Write region sets for allTopology | |
| if (allTopology && setWriter.valid()) | |
| { | |
| // Points in multiple regions | |
| pointSet points | |
| ( | |
| mesh, | |
| "multiRegionPoints", | |
| mesh.nPoints()/1000 | |
| ); | |
| // Is region disconnected | |
| boolList regionDisconnected(rs.nRegions(), true); | |
| // -1 : not assigned | |
| // -2 : multiple regions | |
| // >= 0 : single region | |
| labelList pointToRegion(mesh.nPoints(), -1); | |
| for | |
| ( | |
| label faceI = mesh.nInternalFaces(); | |
| faceI < mesh.nFaces(); | |
| faceI++ | |
| ) | |
| { | |
| label regionI = rs[mesh.faceOwner()[faceI]]; | |
| const face& f = mesh.faces()[faceI]; | |
| forAll(f, fp) | |
| { | |
| label& pRegion = pointToRegion[f[fp]]; | |
| if (pRegion == -1) | |
| { | |
| pRegion = regionI; | |
| } | |
| else if (pRegion == -2) | |
| { | |
| // Already marked | |
| regionDisconnected[regionI] = false; | |
| } | |
| else if (pRegion != regionI) | |
| { | |
| // Multiple regions | |
| regionDisconnected[regionI] = false; | |
| regionDisconnected[pRegion] = false; | |
| pRegion = -2; | |
| points.insert(f[fp]); | |
| } | |
| } | |
| } | |
| Pstream::listCombineGather | |
| ( | |
| regionDisconnected, | |
| andEqOp() | |
| ); | |
| Pstream::listCombineScatter(regionDisconnected); | |
| // write cellSet for each region | |
| PtrList<cellSet> cellRegions(rs.nRegions()); | |
| for (label i = 0; i < rs.nRegions(); i++) | |
| { | |
| cellRegions.set | |
| ( | |
| i, | |
| new cellSet | |
| ( | |
| mesh, | |
| "region" + Foam::name(i), | |
| mesh.nCells()/100 | |
| ) | |
| ); | |
| } | |
| forAll(rs, i) | |
| { | |
| cellRegions[rs[i]].insert(i); | |
| } | |
| for (label i = 0; i < rs.nRegions(); i++) | |
| { | |
| Info<< " <<Writing region " << i; | |
| if (regionDisconnected[i]) | |
| { | |
| Info<< " (fully disconnected)"; | |
| } | |
| else | |
| { | |
| Info<< " (point connected)"; | |
| } | |
| Info<< " with " | |
| << returnReduce(cellRegions[i].size(), sumOp()) | |
| << " cells to cellSet " << cellRegions[i].name() | |
| << endl; | |
| cellRegions[i].instance() = mesh.pointsInstance(); | |
| cellRegions[i].write(); | |
| } | |
| label nPoints = returnReduce(points.size(), sumOp()); | |
| if (nPoints) | |
| { | |
| Info<< " <<Writing " << nPoints | |
| << " points that are in multiple regions to set " | |
| << points.name() << endl; | |
| points.instance() = mesh.pointsInstance(); | |
| points.write(); | |
| if (setWriter.valid()) | |
| { | |
| meshCheck::mergeAndWrite(setWriter, points); | |
| } | |
| } | |
| } | |
| } | |
| } | |
| { | |
| if (!Pstream::parRun()) | |
| { | |
| Info<< "\nChecking patch topology for multiply connected" | |
| << " surfaces..." << endl; | |
| } | |
| else | |
| { | |
| Info<< "\nChecking basic patch addressing..." << endl; | |
| } | |
| const polyBoundaryMesh& patches = mesh.boundary(); | |
| // Non-manifold points | |
| pointSet points | |
| ( | |
| mesh, | |
| "nonManifoldPoints", | |
| mesh.nPoints()/1000 | |
| ); | |
| Pout.setf(ios_base::left); | |
| Info<< " " | |
| << setw(20) << "Patch" | |
| << setw(9) << "Faces" | |
| << setw(9) << "Points"; | |
| if (!Pstream::parRun()) | |
| { | |
| Info<< setw(34) << "Surface topology"; | |
| } | |
| Info<< endl; | |
| forAll(patches, patchi) | |
| { | |
| const polyPatch& pp = patches[patchi]; | |
| if (!isA<processorPolyPatch>(pp)) | |
| { | |
| Info<< " " | |
| << setw(20) << pp.name() | |
| << setw(9) << returnReduce(pp.size(), sumOp()) | |
| << setw(9) << returnReduce(pp.nPoints(), sumOp()); | |
| if (!Pstream::parRun()) | |
| { | |
| primitivePatch::surfaceTopo pTyp = pp.surfaceType(); | |
| if (pp.empty()) | |
| { | |
| Info<< setw(34) << "ok (empty)"; | |
| } | |
| else if (pTyp == primitivePatch::MANIFOLD) | |
| { | |
| if (pp.checkPointManifold(true, &points)) | |
| { | |
| Info<< setw(34) | |
| << "multiply connected (shared point)"; | |
| } | |
| else | |
| { | |
| Info<< setw(34) << "ok (closed singly connected)"; | |
| } | |
| // Add points on non-manifold edges to make set complete | |
| pp.checkTopology(false, &points); | |
| } | |
| else | |
| { | |
| pp.checkTopology(false, &points); | |
| if (pTyp == primitivePatch::OPEN) | |
| { | |
| Info<< setw(34) | |
| << "ok (non-closed singly connected)"; | |
| } | |
| else | |
| { | |
| Info<< setw(34) | |
| << "multiply connected (shared edge)"; | |
| } | |
| } | |
| } | |
| Info<< endl; | |
| } | |
| } | |
| if (points.size() && setWriter.valid()) | |
| { | |
| Info<< " <<Writing " << returnReduce(points.size(), sumOp()) | |
| << " conflicting points to set " | |
| << points.name() << endl; | |
| points.instance() = mesh.pointsInstance(); | |
| points.write(); | |
| } | |
| // Info.setf(ios_base::right); | |
| } | |
| // Force creation of all addressing if requested. | |
| // Errors will be reported as required | |
| if (allTopology) | |
| { | |
| mesh.cells(); | |
| mesh.faces(); | |
| mesh.edges(); | |
| mesh.points(); | |
| mesh.faceOwner(); | |
| mesh.faceNeighbour(); | |
| mesh.cellCells(); | |
| mesh.edgeCells(); | |
| mesh.pointCells(); | |
| mesh.edgeFaces(); | |
| mesh.pointFaces(); | |
| mesh.cellEdges(); | |
| mesh.faceEdges(); | |
| mesh.pointEdges(); | |
| } | |
| return noFailedChecks; | |
| } | |
| // ************************************************************************* // | |