/*---------------------------------------------------------------------------*\ ========= | \\ / 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 . \*---------------------------------------------------------------------------*/ #include "polyMesh.H" #include "primitiveMesh.H" #include "Time.H" #include "DynamicList.H" #include "globalMeshData.H" // * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * // Foam::labelListList Foam::polyMesh::cellShapePointCells ( const cellShapeList& c ) const { List> pc(points().size()); // For each cell forAll(c, i) { // For each vertex const labelList& labels = c[i]; forAll(labels, j) { // Set working point label label curPoint = labels[j]; DynamicList& curPointCells = pc[curPoint]; // Enter the cell label in the point's cell list curPointCells.append(i); } } labelListList pointCellAddr(pc.size()); forAll(pc, pointi) { pointCellAddr[pointi].transfer(pc[pointi]); } return pointCellAddr; } Foam::labelList Foam::polyMesh::facePatchFaceCells ( const faceList& patchFaces, const labelListList& pointCells, const faceListList& cellsFaceShapes, const label patchID ) const { bool found; labelList FaceCells(patchFaces.size()); forAll(patchFaces, fI) { found = false; const face& curFace = patchFaces[fI]; const labelList& facePoints = patchFaces[fI]; forAll(facePoints, pointi) { const labelList& facePointCells = pointCells[facePoints[pointi]]; forAll(facePointCells, celli) { faceList cellFaces = cellsFaceShapes[facePointCells[celli]]; forAll(cellFaces, cellFace) { if (face::sameVertices(cellFaces[cellFace], curFace)) { // Found the cell corresponding to this face FaceCells[fI] = facePointCells[celli]; found = true; } if (found) break; } if (found) break; } if (found) break; } if (!found) { FatalErrorInFunction << "face " << fI << " in patch " << patchID << " does not have neighbour cell" << " face: " << patchFaces[fI] << abort(FatalError); } } return FaceCells; } void Foam::polyMesh::setTopology ( const cellShapeList& cellsAsShapes, const faceListList& boundaryFaces, const wordList& boundaryPatchNames, labelList& patchSizes, labelList& patchStarts, label& defaultPatchStart, label& nFaces, cellList& cells ) { // Calculate the faces of all cells // Initialise maximum possible number of mesh faces to 0 label maxFaces = 0; // Set up a list of face shapes for each cell faceListList cellsFaceShapes(cellsAsShapes.size()); cells.setSize(cellsAsShapes.size()); forAll(cellsFaceShapes, celli) { cellsFaceShapes[celli] = cellsAsShapes[celli].faces(); cells[celli].setSize(cellsFaceShapes[celli].size()); // Initialise cells to -1 to flag undefined faces static_cast(cells[celli]) = -1; // Count maximum possible number of mesh faces maxFaces += cellsFaceShapes[celli].size(); } // Set size of faces array to maximum possible number of mesh faces faces_.setSize(maxFaces); // Initialise number of faces to 0 nFaces = 0; // Set reference to point-cell addressing labelListList PointCells = cellShapePointCells(cellsAsShapes); bool found = false; forAll(cells, celli) { // Note: // Insertion cannot be done in one go as the faces need to be // added into the list in the increasing order of neighbour // cells. Therefore, all neighbours will be detected first // and then added in the correct order. const faceList& curFaces = cellsFaceShapes[celli]; // Record the neighbour cell labelList neiCells(curFaces.size(), -1); // Record the face of neighbour cell labelList faceOfNeiCell(curFaces.size(), -1); label nNeighbours = 0; // For all faces ... forAll(curFaces, facei) { // Skip faces that have already been matched if (cells[celli][facei] >= 0) continue; found = false; const face& curFace = curFaces[facei]; // Get the list of labels const labelList& curPoints = curFace; // For all points forAll(curPoints, pointi) { // dGget the list of cells sharing this point const labelList& curNeighbours = PointCells[curPoints[pointi]]; // For all neighbours forAll(curNeighbours, neiI) { label curNei = curNeighbours[neiI]; // Reject neighbours with the lower label if (curNei > celli) { // Get the list of search faces const faceList& searchFaces = cellsFaceShapes[curNei]; forAll(searchFaces, neiFacei) { if (searchFaces[neiFacei] == curFace) { // Match!! found = true; // Record the neighbour cell and face neiCells[facei] = curNei; faceOfNeiCell[facei] = neiFacei; nNeighbours++; break; } } if (found) break; } if (found) break; } if (found) break; } // End of current points } // End of current faces // Add the faces in the increasing order of neighbours for (label neiSearch = 0; neiSearch < nNeighbours; neiSearch++) { // Find the lowest neighbour which is still valid label nextNei = -1; label minNei = cells.size(); forAll(neiCells, ncI) { if (neiCells[ncI] > -1 && neiCells[ncI] < minNei) { nextNei = ncI; minNei = neiCells[ncI]; } } if (nextNei > -1) { // Add the face to the list of faces faces_[nFaces] = curFaces[nextNei]; // Set cell-face and cell-neighbour-face to current face label cells[celli][nextNei] = nFaces; cells[neiCells[nextNei]][faceOfNeiCell[nextNei]] = nFaces; // Stop the neighbour from being used again neiCells[nextNei] = -1; // Increment number of faces counter nFaces++; } else { FatalErrorInFunction << "Error in internal face insertion" << abort(FatalError); } } } // Do boundary faces patchSizes.setSize(boundaryFaces.size(), -1); patchStarts.setSize(boundaryFaces.size(), -1); forAll(boundaryFaces, patchi) { const faceList& patchFaces = boundaryFaces[patchi]; labelList curPatchFaceCells = facePatchFaceCells ( patchFaces, PointCells, cellsFaceShapes, patchi ); // Grab the start label label curPatchStart = nFaces; forAll(patchFaces, facei) { const face& curFace = patchFaces[facei]; const label cellInside = curPatchFaceCells[facei]; // Get faces of the cell inside const faceList& facesOfCellInside = cellsFaceShapes[cellInside]; bool found = false; forAll(facesOfCellInside, cellFacei) { if (face::sameVertices(facesOfCellInside[cellFacei], curFace)) { if (cells[cellInside][cellFacei] >= 0) { FatalErrorInFunction << "Trying to specify a boundary face " << curFace << " on the face on cell " << cellInside << " which is either an internal face or already " << "belongs to some other patch. This is face " << facei << " of patch " << patchi << " named " << boundaryPatchNames[patchi] << "." << abort(FatalError); } found = true; // Set the patch face to corresponding cell-face faces_[nFaces] = facesOfCellInside[cellFacei]; cells[cellInside][cellFacei] = nFaces; break; } } if (!found) { FatalErrorInFunction << "face " << facei << " of patch " << patchi << " does not seem to belong to cell " << cellInside << " which, according to the addressing, " << "should be next to it." << abort(FatalError); } // Increment the counter of faces nFaces++; } patchSizes[patchi] = nFaces - curPatchStart; patchStarts[patchi] = curPatchStart; } // Grab "non-existing" faces and put them into a default patch defaultPatchStart = nFaces; forAll(cells, celli) { labelList& curCellFaces = cells[celli]; forAll(curCellFaces, facei) { if (curCellFaces[facei] == -1) // "non-existent" face { curCellFaces[facei] = nFaces; faces_[nFaces] = cellsFaceShapes[celli][facei]; nFaces++; } } } // Reset the size of the face list faces_.setSize(nFaces); } Foam::polyMesh::polyMesh ( const IOobject& io, pointField&& points, const cellShapeList& cellsAsShapes, const faceListList& boundaryFaces, const wordList& boundaryPatchNames, const wordList& boundaryPatchTypes, const word& defaultBoundaryPatchName, const word& defaultBoundaryPatchType, const wordList& boundaryPatchPhysicalTypes, const bool syncPar ) : objectRegistry(io, regionDir(io)), primitiveMesh(), points_ ( IOobject ( "points", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), move(points) ), faces_ ( IOobject ( "faces", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), label(0) ), owner_ ( IOobject ( "owner", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), label(0) ), neighbour_ ( IOobject ( "neighbour", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), label(0) ), clearedPrimitives_(false), boundary_ ( IOobject ( "boundary", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), *this, boundaryFaces.size() + 1 // Add room for a default patch ), bounds_(points_, syncPar), comm_(UPstream::worldComm), geometricD_(Zero), solutionD_(Zero), tetBasePtIsPtr_(nullptr), pointZones_ ( IOobject ( "pointZones", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::NO_WRITE ), *this ), faceZones_ ( IOobject ( "faceZones", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::NO_WRITE ), *this ), cellZones_ ( IOobject ( "cellZones", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::NO_WRITE ), *this ), globalMeshDataPtr_(nullptr), curMotionTimeIndex_(-1), oldPointsPtr_(nullptr), oldCellCentresPtr_(nullptr), storeOldCellCentres_(false), moving_(false), topoChanged_(false) { DebugInFunction << "Constructing polyMesh from shapes" << endl; // Remove all of the old mesh files if they exist removeFiles(instance()); // Calculate faces and cells labelList patchSizes; labelList patchStarts; label defaultPatchStart; label nFaces; cellList cells; setTopology ( cellsAsShapes, boundaryFaces, boundaryPatchNames, patchSizes, patchStarts, defaultPatchStart, nFaces, cells ); // Warning: Patches can only be added once the face list is // completed, as they hold a subList of the face list forAll(boundaryFaces, patchi) { // Add the patch to the list boundary_.set ( patchi, polyPatch::New ( boundaryPatchTypes[patchi], boundaryPatchNames[patchi], patchSizes[patchi], patchStarts[patchi], patchi, boundary_ ) ); if ( boundaryPatchPhysicalTypes.size() && boundaryPatchPhysicalTypes[patchi].size() ) { boundary_[patchi].physicalType() = boundaryPatchPhysicalTypes[patchi]; } } label nAllPatches = boundaryFaces.size(); label nDefaultFaces = nFaces - defaultPatchStart; if (syncPar) { reduce(nDefaultFaces, sumOp()); } if (nDefaultFaces > 0) { if (debug) { WarningInFunction << "Found " << nDefaultFaces << " undefined faces in mesh; adding to default patch." << endl; } // Check if there already exists a defaultFaces patch as last patch // and reuse it. label patchi = findIndex(boundaryPatchNames, defaultBoundaryPatchName); if (patchi != -1) { if (patchi != boundaryFaces.size()-1 || boundary_[patchi].size()) { FatalErrorInFunction << "Default patch " << boundary_[patchi].name() << " already has faces in it or is not" << " last in list of patches." << exit(FatalError); } WarningInFunction << "Reusing existing patch " << patchi << " for undefined faces." << endl; boundary_.set ( patchi, polyPatch::New ( boundaryPatchTypes[patchi], boundaryPatchNames[patchi], nFaces - defaultPatchStart, defaultPatchStart, patchi, boundary_ ) ); } else { boundary_.set ( nAllPatches, polyPatch::New ( defaultBoundaryPatchType, defaultBoundaryPatchName, nFaces - defaultPatchStart, defaultPatchStart, boundary_.size() - 1, boundary_ ) ); nAllPatches++; } } // Reset the size of the boundary boundary_.setSize(nAllPatches); // Set the primitive mesh initMesh(cells); if (syncPar) { // Calculate topology for the patches (processor-processor comms etc.) boundary_.topoChange(); // Calculate the geometry for the patches (transformation tensors etc.) boundary_.calcGeometry(); } } Foam::polyMesh::polyMesh ( const IOobject& io, pointField&& points, const cellShapeList& cellsAsShapes, const faceListList& boundaryFaces, const wordList& boundaryPatchNames, const PtrList& boundaryDicts, const word& defaultBoundaryPatchName, const word& defaultBoundaryPatchType, const bool syncPar ) : objectRegistry(io, regionDir(io)), primitiveMesh(), points_ ( IOobject ( "points", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), move(points) ), faces_ ( IOobject ( "faces", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), label(0) ), owner_ ( IOobject ( "owner", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), label(0) ), neighbour_ ( IOobject ( "neighbour", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), label(0) ), clearedPrimitives_(false), boundary_ ( IOobject ( "boundary", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::AUTO_WRITE ), *this, boundaryFaces.size() + 1 // Add room for a default patch ), bounds_(points_, syncPar), comm_(UPstream::worldComm), geometricD_(Zero), solutionD_(Zero), tetBasePtIsPtr_(nullptr), pointZones_ ( IOobject ( "pointZones", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::NO_WRITE ), *this ), faceZones_ ( IOobject ( "faceZones", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::NO_WRITE ), *this ), cellZones_ ( IOobject ( "cellZones", instance(), meshSubDir, *this, IOobject::NO_READ, IOobject::NO_WRITE ), *this ), globalMeshDataPtr_(nullptr), curMotionTimeIndex_(-1), oldPointsPtr_(nullptr), oldCellCentresPtr_(nullptr), storeOldCellCentres_(false), moving_(false) { DebugInFunction << "Constructing polyMesh from shapes" << endl; // Remove all of the old mesh files if they exist removeFiles(instance()); // Calculate faces and cells labelList patchSizes; labelList patchStarts; label defaultPatchStart; label nFaces; cellList cells; setTopology ( cellsAsShapes, boundaryFaces, boundaryPatchNames, patchSizes, patchStarts, defaultPatchStart, nFaces, cells ); // Warning: Patches can only be added once the face list is // completed, as they hold a subList of the face list forAll(boundaryDicts, patchi) { dictionary patchDict(boundaryDicts[patchi]); patchDict.set("nFaces", patchSizes[patchi]); patchDict.set("startFace", patchStarts[patchi]); // Add the patch to the list boundary_.set ( patchi, polyPatch::New ( boundaryPatchNames[patchi], patchDict, patchi, boundary_ ) ); } label nAllPatches = boundaryFaces.size(); label nDefaultFaces = nFaces - defaultPatchStart; if (syncPar) { reduce(nDefaultFaces, sumOp()); } if (nDefaultFaces > 0) { if (debug) { WarningInFunction << "Found " << nDefaultFaces << " undefined faces in mesh; adding to default patch." << endl; } // Check if there already exists a defaultFaces patch as last patch // and reuse it. label patchi = findIndex(boundaryPatchNames, defaultBoundaryPatchName); if (patchi != -1) { if (patchi != boundaryFaces.size()-1 || boundary_[patchi].size()) { FatalErrorInFunction << "Default patch " << boundary_[patchi].name() << " already has faces in it or is not" << " last in list of patches." << exit(FatalError); } WarningInFunction << "Reusing existing patch " << patchi << " for undefined faces." << endl; boundary_.set ( patchi, polyPatch::New ( boundary_[patchi].type(), boundary_[patchi].name(), nFaces - defaultPatchStart, defaultPatchStart, patchi, boundary_ ) ); } else { boundary_.set ( nAllPatches, polyPatch::New ( defaultBoundaryPatchType, defaultBoundaryPatchName, nFaces - defaultPatchStart, defaultPatchStart, boundary_.size() - 1, boundary_ ) ); nAllPatches++; } } // Reset the size of the boundary boundary_.setSize(nAllPatches); // Set the primitive mesh initMesh(cells); if (syncPar) { // Calculate topology for the patches (processor-processor comms etc.) boundary_.topoChange(); // Calculate the geometry for the patches (transformation tensors etc.) boundary_.calcGeometry(); } } // ************************************************************************* //