134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2552f7358SJed Brown #include <../src/sys/utils/hash.h> 3d53a3d6fSBarry Smith #include <petsc-private/isimpl.h> 40c312b8eSJed Brown #include <petscsf.h> 5c6ccd67eSMatthew G. Knepley #include <petscviewerhdf5.h> 6552f7358SJed Brown 7552f7358SJed Brown /* Logging support */ 81337e6e5SMatthew G. Knepley PetscLogEvent DMPLEX_Interpolate, DMPLEX_Partition, DMPLEX_Distribute, DMPLEX_DistributeCones, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_DistributeField, DMPLEX_DistributeData, DMPLEX_Stratify, DMPLEX_Preallocate, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM; 9552f7358SJed Brown 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 115a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 122c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer); 13552f7358SJed Brown 14552f7358SJed Brown #undef __FUNCT__ 15552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 16552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 17552f7358SJed Brown { 18552f7358SJed Brown DM dm; 1955f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 20552f7358SJed Brown PetscErrorCode ierr; 21552f7358SJed Brown 22552f7358SJed Brown PetscFunctionBegin; 23552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 2482f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 25552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 2633c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 2755f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 2855f2e967SMatthew G. Knepley if (isvtk || ishdf5) {ierr = DMPlexInsertBoundaryValues(dm, v);CHKERRQ(ierr);} 29552f7358SJed Brown if (isvtk) { 30552f7358SJed Brown PetscViewerVTKFieldType ft = PETSC_VTK_POINT_FIELD; 31552f7358SJed Brown PetscSection section; 32552f7358SJed Brown PetscInt dim, pStart, pEnd, cStart, fStart, vStart, cdof = 0, fdof = 0, vdof = 0; 33552f7358SJed Brown 34552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 35552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 360298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 0, &cStart, NULL);CHKERRQ(ierr); 370298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 1, &fStart, NULL);CHKERRQ(ierr); 380298fd71SBarry Smith ierr = DMPlexGetDepthStratum(dm, 0, &vStart, NULL);CHKERRQ(ierr); 39552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 40552f7358SJed Brown /* Assumes that numer of dofs per point of each stratum is constant, natural for VTK */ 41552f7358SJed Brown if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 42552f7358SJed Brown if ((fStart >= pStart) && (fStart < pEnd)) {ierr = PetscSectionGetDof(section, fStart, &fdof);CHKERRQ(ierr);} 43552f7358SJed Brown if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 44552f7358SJed Brown if (cdof && fdof && vdof) { /* Actually Q2 or some such, but visualize as Q1 */ 45552f7358SJed Brown ft = (cdof == dim) ? PETSC_VTK_POINT_VECTOR_FIELD : PETSC_VTK_POINT_FIELD; 46552f7358SJed Brown } else if (cdof && vdof) { 47ce94432eSBarry Smith SETERRQ(PetscObjectComm((PetscObject)viewer),PETSC_ERR_SUP,"No support for viewing mixed space with dofs at both vertices and cells"); 48552f7358SJed Brown } else if (cdof) { 49552f7358SJed Brown /* TODO: This assumption should be removed when there is a way of identifying whether a space is conceptually a 50552f7358SJed Brown * vector or just happens to have the same number of dofs as the dimension. */ 51552f7358SJed Brown if (cdof == dim) { 52552f7358SJed Brown ft = PETSC_VTK_CELL_VECTOR_FIELD; 53552f7358SJed Brown } else { 54552f7358SJed Brown ft = PETSC_VTK_CELL_FIELD; 55552f7358SJed Brown } 56552f7358SJed Brown } else if (vdof) { 57552f7358SJed Brown if (vdof == dim) { 58552f7358SJed Brown ft = PETSC_VTK_POINT_VECTOR_FIELD; 59552f7358SJed Brown } else { 60552f7358SJed Brown ft = PETSC_VTK_POINT_FIELD; 61552f7358SJed Brown } 6282f516ccSBarry Smith } else SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 63552f7358SJed Brown 64552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 65552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 66552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 67c551360fSMatthew G. Knepley } else if (ishdf5) { 68c551360fSMatthew G. Knepley DM dmBC; 69c551360fSMatthew G. Knepley Vec gv; 70c551360fSMatthew G. Knepley const char *name; 71552f7358SJed Brown 72c551360fSMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 73c551360fSMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 74c551360fSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 75c551360fSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 76c551360fSMatthew G. Knepley ierr = DMLocalToGlobalBegin(dmBC, v, INSERT_VALUES, gv);CHKERRQ(ierr); 77c551360fSMatthew G. Knepley ierr = DMLocalToGlobalEnd(dmBC, v, INSERT_VALUES, gv);CHKERRQ(ierr); 78c551360fSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) gv, VECSEQ, &isseq);CHKERRQ(ierr); 79c551360fSMatthew G. Knepley if (isseq) {ierr = VecView_Seq(gv, viewer);CHKERRQ(ierr);} 80c551360fSMatthew G. Knepley else {ierr = VecView_MPI(gv, viewer);CHKERRQ(ierr);} 81c551360fSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 82552f7358SJed Brown } else { 8355f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 8455f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 85552f7358SJed Brown } 86552f7358SJed Brown PetscFunctionReturn(0); 87552f7358SJed Brown } 88552f7358SJed Brown 89552f7358SJed Brown #undef __FUNCT__ 90552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 91552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 92552f7358SJed Brown { 93552f7358SJed Brown DM dm; 9455f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 95552f7358SJed Brown PetscErrorCode ierr; 96552f7358SJed Brown 97552f7358SJed Brown PetscFunctionBegin; 98552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 9982f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 100552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 10133c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 10255f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 10333c3e6b4SMatthew G. Knepley if (isvtk || ishdf5) { 104552f7358SJed Brown Vec locv; 105552f7358SJed Brown const char *name; 106552f7358SJed Brown 107552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 108552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 109552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 110552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 111552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 112878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 11337bea2b3SMatthew G. Knepley if (ishdf5) { 11437bea2b3SMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/fields");CHKERRQ(ierr); 11537bea2b3SMatthew G. Knepley /* TODO ierr = PetscViewerHDF5SetTimestep(viewer, istep);CHKERRQ(ierr); */ 11637bea2b3SMatthew G. Knepley } 117878b459fSMatthew G. Knepley #endif 118552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 119878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 12037bea2b3SMatthew G. Knepley if (ishdf5) {ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr);} 121878b459fSMatthew G. Knepley #endif 122552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 123552f7358SJed Brown } else { 12455f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 12555f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 126552f7358SJed Brown } 127552f7358SJed Brown PetscFunctionReturn(0); 128552f7358SJed Brown } 129552f7358SJed Brown 130552f7358SJed Brown #undef __FUNCT__ 1312c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1322c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1332c40f234SMatthew G. Knepley { 1342c40f234SMatthew G. Knepley DM dm; 1352c40f234SMatthew G. Knepley PetscBool ishdf5; 1362c40f234SMatthew G. Knepley PetscErrorCode ierr; 1372c40f234SMatthew G. Knepley 1382c40f234SMatthew G. Knepley PetscFunctionBegin; 1392c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1402c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1412c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1422c40f234SMatthew G. Knepley if (ishdf5) { 1432c40f234SMatthew G. Knepley DM dmBC; 1442c40f234SMatthew G. Knepley Vec gv; 1452c40f234SMatthew G. Knepley const char *name; 1462c40f234SMatthew G. Knepley 1472c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1482c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1492c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1502c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1512c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1522c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1532c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1542c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1552c40f234SMatthew G. Knepley } else { 1562c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley } 1582c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1592c40f234SMatthew G. Knepley } 1602c40f234SMatthew G. Knepley 1612c40f234SMatthew G. Knepley #undef __FUNCT__ 1622c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1632c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1642c40f234SMatthew G. Knepley { 1652c40f234SMatthew G. Knepley DM dm; 1662c40f234SMatthew G. Knepley PetscBool ishdf5; 1672c40f234SMatthew G. Knepley PetscErrorCode ierr; 1682c40f234SMatthew G. Knepley 1692c40f234SMatthew G. Knepley PetscFunctionBegin; 1702c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1712c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1722c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1732c40f234SMatthew G. Knepley if (ishdf5) { 1742c40f234SMatthew G. Knepley Vec locv; 1752c40f234SMatthew G. Knepley const char *name; 1762c40f234SMatthew G. Knepley 1772c40f234SMatthew G. Knepley ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 1782c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1792c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 180878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 1812c40f234SMatthew G. Knepley if (ishdf5) { 1822c40f234SMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/fields");CHKERRQ(ierr); 1832c40f234SMatthew G. Knepley /* TODO ierr = PetscViewerHDF5SetTimestep(viewer, istep);CHKERRQ(ierr); */ 1842c40f234SMatthew G. Knepley } 185878b459fSMatthew G. Knepley #endif 1862c40f234SMatthew G. Knepley ierr = VecLoad_Plex_Local(locv, viewer);CHKERRQ(ierr); 187878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 1882c40f234SMatthew G. Knepley if (ishdf5) {ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr);} 189878b459fSMatthew G. Knepley #endif 1902c40f234SMatthew G. Knepley ierr = DMLocalToGlobalBegin(dm, locv, INSERT_VALUES, v);CHKERRQ(ierr); 1912c40f234SMatthew G. Knepley ierr = DMLocalToGlobalEnd(dm, locv, INSERT_VALUES, v);CHKERRQ(ierr); 1922c40f234SMatthew G. Knepley ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 1932c40f234SMatthew G. Knepley } else { 1942c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1952c40f234SMatthew G. Knepley } 1962c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1972c40f234SMatthew G. Knepley } 1982c40f234SMatthew G. Knepley 1992c40f234SMatthew G. Knepley #undef __FUNCT__ 200552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 201552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 202552f7358SJed Brown { 203552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 204552f7358SJed Brown DM cdm; 205552f7358SJed Brown DMLabel markers; 206552f7358SJed Brown PetscSection coordSection; 207552f7358SJed Brown Vec coordinates; 208552f7358SJed Brown PetscViewerFormat format; 209552f7358SJed Brown PetscErrorCode ierr; 210552f7358SJed Brown 211552f7358SJed Brown PetscFunctionBegin; 212552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 213552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 214552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 215552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 216552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 217552f7358SJed Brown const char *name; 218552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 219552f7358SJed Brown PetscInt pStart, pEnd, p; 220552f7358SJed Brown PetscMPIInt rank, size; 221552f7358SJed Brown 22282f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 22382f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 224552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 225552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 226552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 227552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 228552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 229552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 230552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 231552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 232552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 233552f7358SJed Brown PetscInt dof, off, s; 234552f7358SJed Brown 235552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 236552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 237552f7358SJed Brown for (s = off; s < off+dof; ++s) { 238552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 239552f7358SJed Brown } 240552f7358SJed Brown } 241552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 242552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 243552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 244552f7358SJed Brown PetscInt dof, off, c; 245552f7358SJed Brown 246552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 247552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 248552f7358SJed Brown for (c = off; c < off+dof; ++c) { 249552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 250552f7358SJed Brown } 251552f7358SJed Brown } 252552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2530298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 254552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 255552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 256552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 257552f7358SJed Brown if (size > 1) { 258552f7358SJed Brown PetscSF sf; 259552f7358SJed Brown 260552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 261552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 262552f7358SJed Brown } 263552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 264552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 265552f7358SJed Brown const char *name; 266552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 267552f7358SJed Brown const int numColors = 3; 268552f7358SJed Brown PetscReal scale = 2.0; 269552f7358SJed Brown PetscScalar *coords; 270552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 271552f7358SJed Brown PetscMPIInt rank, size; 272552f7358SJed Brown 273552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 27482f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 27582f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 276552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 277552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 278770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 279770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 280552f7358SJed Brown \\usepackage{tikz}\n\ 281552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 282552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 283552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 284552f7358SJed Brown \\begin{document}\n\ 285552f7358SJed Brown \\section{%s}\n\ 286770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 287770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 288770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 289770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 290770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 291770b213bSMatthew G Knepley } else if (p > 0) { 292770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 293770b213bSMatthew G Knepley } 294770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 295770b213bSMatthew G Knepley } 296770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 297770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 298552f7358SJed Brown /* Plot vertices */ 299552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 300552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 301552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 302552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 303552f7358SJed Brown PetscInt off, dof, d; 304552f7358SJed Brown 305552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 306552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 307552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 308552f7358SJed Brown for (d = 0; d < dof; ++d) { 309552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3106712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 311552f7358SJed Brown } 312552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 313552f7358SJed Brown } 314552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 315552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 316552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 317552f7358SJed Brown /* Plot edges */ 318552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 319552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 320552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 321552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 322552f7358SJed Brown const PetscInt *cone; 323552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 324552f7358SJed Brown 325552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 32682f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 327552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 328552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 329552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 330552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 331552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 332552f7358SJed Brown for (d = 0; d < dof; ++d) { 333552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3346712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 335552f7358SJed Brown } 336552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 337552f7358SJed Brown } 338552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 339552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 340552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 341552f7358SJed Brown /* Plot cells */ 342552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 343552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3440298fd71SBarry Smith PetscInt *closure = NULL; 345552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 346552f7358SJed Brown 347552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 348552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 349552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 350552f7358SJed Brown const PetscInt point = closure[p]; 351552f7358SJed Brown 352552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 353552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 354552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 355552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 356552f7358SJed Brown } 357552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 358552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 359552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 360552f7358SJed Brown } 361552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 362552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 363770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 364552f7358SJed Brown } else { 36582f516ccSBarry Smith MPI_Comm comm; 366834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 367834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 368552f7358SJed Brown PetscInt pStart, pEnd, p; 369a57dd577SMatthew G Knepley PetscInt numLabels, l; 3701143a3c0SMatthew G. Knepley const char *name; 371552f7358SJed Brown PetscMPIInt size; 372552f7358SJed Brown 37382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 374552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 375552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3765f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3771143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3781143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 379552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 380552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 381834065abSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], &pMax[depth-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 382dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 383552f7358SJed Brown if (depth == 1) { 384552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 385552f7358SJed Brown pEnd = pEnd - pStart; 386552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 387552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 388552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 389552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 390552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 391552f7358SJed Brown pEnd = pEnd - pStart; 392552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 393552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 394552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 395552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 396552f7358SJed Brown } else { 397552f7358SJed Brown for (d = 0; d <= dim; d++) { 398552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 399834065abSMatthew G. Knepley pEnd -= pStart; 400834065abSMatthew G. Knepley pMax[d] -= pStart; 401552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 402834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 403552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 404834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 405834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 406834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 407834065abSMatthew G. Knepley } 408552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 409552f7358SJed Brown } 410552f7358SJed Brown } 411834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 412a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 413a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 414a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 415a57dd577SMatthew G Knepley DMLabel label; 416a57dd577SMatthew G Knepley const char *name; 417a57dd577SMatthew G Knepley IS valueIS; 418a57dd577SMatthew G Knepley const PetscInt *values; 419a57dd577SMatthew G Knepley PetscInt numValues, v; 420a57dd577SMatthew G Knepley 421a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 422a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 423a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 424a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 425a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 426a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 427a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 428a57dd577SMatthew G Knepley PetscInt size; 429a57dd577SMatthew G Knepley 430a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 431a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 432a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 433a57dd577SMatthew G Knepley } 434a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 435a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4364d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 437a57dd577SMatthew G Knepley } 438552f7358SJed Brown } 439552f7358SJed Brown PetscFunctionReturn(0); 440552f7358SJed Brown } 441552f7358SJed Brown 442c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 443c6ccd67eSMatthew G. Knepley #undef __FUNCT__ 444c6ccd67eSMatthew G. Knepley #define __FUNCT__ "DMPlexView_HDF5" 445c6ccd67eSMatthew G. Knepley /* We only write cells and vertices. Does this screw up parallel reading? */ 446c6ccd67eSMatthew G. Knepley PetscErrorCode DMPlexView_HDF5(DM dm, PetscViewer viewer) 447c6ccd67eSMatthew G. Knepley { 448c6ccd67eSMatthew G. Knepley DM cdm; 449c6ccd67eSMatthew G. Knepley Vec coordinates, newcoords; 450c6ccd67eSMatthew G. Knepley Vec coneVec, cellVec; 451c6ccd67eSMatthew G. Knepley IS globalVertexNumbers; 452c6ccd67eSMatthew G. Knepley const PetscInt *gvertex; 453c6ccd67eSMatthew G. Knepley PetscScalar *sizes, *vertices; 454c6ccd67eSMatthew G. Knepley PetscReal lengthScale; 455c6ccd67eSMatthew G. Knepley const char *label = NULL; 456c6ccd67eSMatthew G. Knepley PetscInt labelId = 0, dim; 457*07d7597bSMatthew G. Knepley char group[MAXPATHLEN]; 458*07d7597bSMatthew G. Knepley PetscInt vStart, vEnd, v, cellHeight, cStart, cEnd, cMax, cell, conesSize = 0, numCornersLocal = 0, numCorners, numLabels, l; 459*07d7597bSMatthew G. Knepley hid_t fileId, groupId; 460*07d7597bSMatthew G. Knepley herr_t status; 461c6ccd67eSMatthew G. Knepley PetscErrorCode ierr; 462c6ccd67eSMatthew G. Knepley 463c6ccd67eSMatthew G. Knepley PetscFunctionBegin; 464c6ccd67eSMatthew G. Knepley /* Write coordinates */ 465c6ccd67eSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 466c6ccd67eSMatthew G. Knepley ierr = DMPlexGetScale(dm, PETSC_UNIT_LENGTH, &lengthScale);CHKERRQ(ierr); 467c6ccd67eSMatthew G. Knepley ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 46837bea2b3SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 469c6ccd67eSMatthew G. Knepley ierr = VecDuplicate(coordinates, &newcoords);CHKERRQ(ierr); 470c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) newcoords, "vertices");CHKERRQ(ierr); 471c6ccd67eSMatthew G. Knepley ierr = VecCopy(coordinates, newcoords);CHKERRQ(ierr); 472c6ccd67eSMatthew G. Knepley ierr = VecScale(newcoords, lengthScale);CHKERRQ(ierr); 47337bea2b3SMatthew G. Knepley /* Use the local version to bypass the default group setting */ 474c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/geometry");CHKERRQ(ierr); 475c6ccd67eSMatthew G. Knepley ierr = VecView(newcoords, viewer);CHKERRQ(ierr); 476c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 477c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&newcoords);CHKERRQ(ierr); 478c6ccd67eSMatthew G. Knepley /* Write toplogy */ 479c6ccd67eSMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 480c6ccd67eSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 481c6ccd67eSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 482c6ccd67eSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, PETSC_NULL, PETSC_NULL, PETSC_NULL);CHKERRQ(ierr); 483c6ccd67eSMatthew G. Knepley if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 484c6ccd67eSMatthew G. Knepley 485c6ccd67eSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &coneVec);CHKERRQ(ierr); 486c6ccd67eSMatthew G. Knepley ierr = VecSetSizes(coneVec, cEnd-cStart, PETSC_DETERMINE);CHKERRQ(ierr); 487c6ccd67eSMatthew G. Knepley ierr = VecSetBlockSize(coneVec, 1);CHKERRQ(ierr); 488c6ccd67eSMatthew G. Knepley ierr = VecSetFromOptions(coneVec);CHKERRQ(ierr); 489c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) coneVec, "coneSize");CHKERRQ(ierr); 490c6ccd67eSMatthew G. Knepley ierr = VecGetArray(coneVec, &sizes);CHKERRQ(ierr); 491c6ccd67eSMatthew G. Knepley for (cell = cStart; cell < cEnd; ++cell) { 492c6ccd67eSMatthew G. Knepley PetscInt *closure = NULL; 493c6ccd67eSMatthew G. Knepley PetscInt closureSize, v, Nc = 0; 494c6ccd67eSMatthew G. Knepley 495c6ccd67eSMatthew G. Knepley if (label) { 496c6ccd67eSMatthew G. Knepley PetscInt value; 497c6ccd67eSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, label, cell, &value);CHKERRQ(ierr); 498c6ccd67eSMatthew G. Knepley if (value == labelId) continue; 499c6ccd67eSMatthew G. Knepley } 500c6ccd67eSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 501c6ccd67eSMatthew G. Knepley for (v = 0; v < closureSize*2; v += 2) { 502c6ccd67eSMatthew G. Knepley if ((closure[v] >= vStart) && (closure[v] < vEnd)) ++Nc; 503c6ccd67eSMatthew G. Knepley } 504c6ccd67eSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 505c6ccd67eSMatthew G. Knepley conesSize += Nc; 506c6ccd67eSMatthew G. Knepley if (!numCornersLocal) numCornersLocal = Nc; 507c6ccd67eSMatthew G. Knepley else if (numCornersLocal != Nc) numCornersLocal = 1; 508c6ccd67eSMatthew G. Knepley } 509c6ccd67eSMatthew G. Knepley ierr = VecRestoreArray(coneVec, &sizes);CHKERRQ(ierr); 510c6ccd67eSMatthew G. Knepley ierr = MPI_Allreduce(&numCornersLocal, &numCorners, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject) dm));CHKERRQ(ierr); 511c6ccd67eSMatthew G. Knepley if (numCornersLocal && numCornersLocal != numCorners) numCorners = 1; 512c6ccd67eSMatthew G. Knepley 513c6ccd67eSMatthew G. Knepley ierr = DMPlexGetVertexNumbering(dm, &globalVertexNumbers);CHKERRQ(ierr); 514c6ccd67eSMatthew G. Knepley ierr = ISGetIndices(globalVertexNumbers, &gvertex);CHKERRQ(ierr); 515c6ccd67eSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cellVec);CHKERRQ(ierr); 516c6ccd67eSMatthew G. Knepley ierr = VecSetSizes(cellVec, conesSize, PETSC_DETERMINE);CHKERRQ(ierr); 517c6ccd67eSMatthew G. Knepley ierr = VecSetBlockSize(cellVec, numCorners);CHKERRQ(ierr); 518c6ccd67eSMatthew G. Knepley ierr = VecSetFromOptions(cellVec);CHKERRQ(ierr); 519c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) cellVec, "cells");CHKERRQ(ierr); 520c6ccd67eSMatthew G. Knepley ierr = VecGetArray(cellVec, &vertices);CHKERRQ(ierr); 521c6ccd67eSMatthew G. Knepley for (cell = cStart, v = 0; cell < cEnd; ++cell) { 522c6ccd67eSMatthew G. Knepley PetscInt *closure = NULL; 523c6ccd67eSMatthew G. Knepley PetscInt closureSize, Nc = 0, p; 524c6ccd67eSMatthew G. Knepley 525c6ccd67eSMatthew G. Knepley if (label) { 526c6ccd67eSMatthew G. Knepley PetscInt value; 527c6ccd67eSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, label, cell, &value);CHKERRQ(ierr); 528c6ccd67eSMatthew G. Knepley if (value == labelId) continue; 529c6ccd67eSMatthew G. Knepley } 530c6ccd67eSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 531c6ccd67eSMatthew G. Knepley for (p = 0; p < closureSize*2; p += 2) { 532c6ccd67eSMatthew G. Knepley if ((closure[p] >= vStart) && (closure[p] < vEnd)) { 533c6ccd67eSMatthew G. Knepley closure[Nc++] = closure[p]; 534c6ccd67eSMatthew G. Knepley } 535c6ccd67eSMatthew G. Knepley } 536c6ccd67eSMatthew G. Knepley ierr = DMPlexInvertCell(dim, Nc, closure);CHKERRQ(ierr); 537c6ccd67eSMatthew G. Knepley for (p = 0; p < Nc; ++p) { 538c6ccd67eSMatthew G. Knepley const PetscInt gv = gvertex[closure[p] - vStart]; 539c6ccd67eSMatthew G. Knepley vertices[v++] = gv < 0 ? -(gv+1) : gv; 540c6ccd67eSMatthew G. Knepley } 541c6ccd67eSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 542c6ccd67eSMatthew G. Knepley } 543c6ccd67eSMatthew G. Knepley if (v != conesSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of cell vertices %d != %d", v, conesSize); 544c6ccd67eSMatthew G. Knepley ierr = VecRestoreArray(cellVec, &vertices);CHKERRQ(ierr); 545c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/topology");CHKERRQ(ierr); 546c6ccd67eSMatthew G. Knepley ierr = VecView(cellVec, viewer);CHKERRQ(ierr); 547c6ccd67eSMatthew G. Knepley if (numCorners == 1) { 548c6ccd67eSMatthew G. Knepley ierr = VecView(coneVec, viewer);CHKERRQ(ierr); 549c6ccd67eSMatthew G. Knepley } else { 550c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5WriteAttribute(viewer, "/topology/cells", "cell_corners", PETSC_INT, (void *) &numCorners);CHKERRQ(ierr); 551c6ccd67eSMatthew G. Knepley } 552c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 553c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&cellVec);CHKERRQ(ierr); 554c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&coneVec);CHKERRQ(ierr); 555c6ccd67eSMatthew G. Knepley ierr = ISRestoreIndices(globalVertexNumbers, &gvertex);CHKERRQ(ierr); 556c6ccd67eSMatthew G. Knepley 557c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5WriteAttribute(viewer, "/topology/cells", "cell_dim", PETSC_INT, (void *) &dim);CHKERRQ(ierr); 558*07d7597bSMatthew G. Knepley /* Write Labels*/ 559*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/labels");CHKERRQ(ierr); 560*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5OpenGroup(viewer, &fileId, &groupId);CHKERRQ(ierr); 561*07d7597bSMatthew G. Knepley if (groupId != fileId) {status = H5Gclose(groupId);CHKERRQ(status);} 562*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 563*07d7597bSMatthew G. Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 564*07d7597bSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 565*07d7597bSMatthew G. Knepley DMLabel label; 566*07d7597bSMatthew G. Knepley const char *name; 567*07d7597bSMatthew G. Knepley IS valueIS; 568*07d7597bSMatthew G. Knepley const PetscInt *values; 569*07d7597bSMatthew G. Knepley PetscInt numValues, v; 570*07d7597bSMatthew G. Knepley PetscBool isDepth; 571*07d7597bSMatthew G. Knepley 572*07d7597bSMatthew G. Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 573*07d7597bSMatthew G. Knepley ierr = PetscStrncmp(name, "depth", 10, &isDepth);CHKERRQ(ierr); 574*07d7597bSMatthew G. Knepley if (isDepth) continue; 575*07d7597bSMatthew G. Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 576*07d7597bSMatthew G. Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 577*07d7597bSMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 578*07d7597bSMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 579*07d7597bSMatthew G. Knepley ierr = PetscSNPrintf(group, MAXPATHLEN, "/labels/%s", name);CHKERRQ(ierr); 580*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, group);CHKERRQ(ierr); 581*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5OpenGroup(viewer, &fileId, &groupId);CHKERRQ(ierr); 582*07d7597bSMatthew G. Knepley if (groupId != fileId) {status = H5Gclose(groupId);CHKERRQ(status);} 583*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 584*07d7597bSMatthew G. Knepley /* TODO: Need to actually loop over the union of label values, ISAllGather() */ 585*07d7597bSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 586*07d7597bSMatthew G. Knepley IS stratumIS; 587*07d7597bSMatthew G. Knepley 588*07d7597bSMatthew G. Knepley ierr = PetscSNPrintf(group, MAXPATHLEN, "/labels/%s/%d", name, values[v]);CHKERRQ(ierr); 589*07d7597bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, values[v], &stratumIS);CHKERRQ(ierr); 590*07d7597bSMatthew G. Knepley /* TODO: Need to globalize point names and remove unowned points */ 591*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, group);CHKERRQ(ierr); 592*07d7597bSMatthew G. Knepley ierr = ISView(stratumIS, viewer);CHKERRQ(ierr); 593*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 594*07d7597bSMatthew G. Knepley ierr = ISDestroy(&stratumIS);CHKERRQ(ierr); 595*07d7597bSMatthew G. Knepley } 596*07d7597bSMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 597*07d7597bSMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 598*07d7597bSMatthew G. Knepley } 599c6ccd67eSMatthew G. Knepley PetscFunctionReturn(0); 600c6ccd67eSMatthew G. Knepley } 601c6ccd67eSMatthew G. Knepley #endif 602c6ccd67eSMatthew G. Knepley 603552f7358SJed Brown #undef __FUNCT__ 604552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 605552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 606552f7358SJed Brown { 607c6ccd67eSMatthew G. Knepley PetscBool iascii, ishdf5; 608552f7358SJed Brown PetscErrorCode ierr; 609552f7358SJed Brown 610552f7358SJed Brown PetscFunctionBegin; 611552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 612552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 613552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 614c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 615552f7358SJed Brown if (iascii) { 616552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 617c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 618c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 619c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 620c6ccd67eSMatthew G. Knepley #else 621c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 622552f7358SJed Brown #endif 62311aeaf0aSBarry Smith } 624552f7358SJed Brown PetscFunctionReturn(0); 625552f7358SJed Brown } 626552f7358SJed Brown 6272c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 628*07d7597bSMatthew G. Knepley typedef struct { 629*07d7597bSMatthew G. Knepley DM dm; 630*07d7597bSMatthew G. Knepley PetscViewer viewer; 631*07d7597bSMatthew G. Knepley DMLabel label; 632*07d7597bSMatthew G. Knepley } LabelCtx; 633*07d7597bSMatthew G. Knepley 634*07d7597bSMatthew G. Knepley static herr_t ReadLabelStratumHDF5_Static(hid_t g_id, const char *name, const H5L_info_t *info, void *op_data) 635*07d7597bSMatthew G. Knepley { 636*07d7597bSMatthew G. Knepley PetscViewer viewer = ((LabelCtx *) op_data)->viewer; 637*07d7597bSMatthew G. Knepley DMLabel label = ((LabelCtx *) op_data)->label; 638*07d7597bSMatthew G. Knepley IS stratumIS; 639*07d7597bSMatthew G. Knepley const PetscInt *ind; 640*07d7597bSMatthew G. Knepley PetscInt value, N, i; 641*07d7597bSMatthew G. Knepley const char *lname; 642*07d7597bSMatthew G. Knepley char group[MAXPATHLEN]; 643*07d7597bSMatthew G. Knepley PetscErrorCode ierr; 644*07d7597bSMatthew G. Knepley 645*07d7597bSMatthew G. Knepley ierr = PetscOptionsStringToInt(name, &value); 646*07d7597bSMatthew G. Knepley ierr = ISCreate(PetscObjectComm((PetscObject) viewer), &stratumIS); 647*07d7597bSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) stratumIS, "indices"); 648*07d7597bSMatthew G. Knepley ierr = DMLabelGetName(label, &lname); 649*07d7597bSMatthew G. Knepley ierr = PetscSNPrintf(group, MAXPATHLEN, "/labels/%s/%s", lname, name);CHKERRQ(ierr); 650*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, group);CHKERRQ(ierr); 651*07d7597bSMatthew G. Knepley ierr = ISLoad(stratumIS, viewer); 652*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 653*07d7597bSMatthew G. Knepley ierr = ISGetSize(stratumIS, &N); 654*07d7597bSMatthew G. Knepley ierr = ISGetIndices(stratumIS, &ind); 655*07d7597bSMatthew G. Knepley for (i = 0; i < N; ++i) {ierr = DMLabelSetValue(label, ind[i], value);} 656*07d7597bSMatthew G. Knepley ierr = ISRestoreIndices(stratumIS, &ind); 657*07d7597bSMatthew G. Knepley ierr = ISDestroy(&stratumIS); 658*07d7597bSMatthew G. Knepley return 0; 659*07d7597bSMatthew G. Knepley } 660*07d7597bSMatthew G. Knepley 661*07d7597bSMatthew G. Knepley static herr_t ReadLabelHDF5_Static(hid_t g_id, const char *name, const H5L_info_t *info, void *op_data) 662*07d7597bSMatthew G. Knepley { 663*07d7597bSMatthew G. Knepley DM dm = ((LabelCtx *) op_data)->dm; 664*07d7597bSMatthew G. Knepley hsize_t idx; 665*07d7597bSMatthew G. Knepley herr_t status; 666*07d7597bSMatthew G. Knepley PetscErrorCode ierr; 667*07d7597bSMatthew G. Knepley 668*07d7597bSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, name); 669*07d7597bSMatthew G. Knepley ierr = DMPlexGetLabel(dm, name, &((LabelCtx *) op_data)->label); 670*07d7597bSMatthew G. Knepley status = H5Literate_by_name(g_id, name, H5_INDEX_NAME, H5_ITER_NATIVE, &idx, ReadLabelStratumHDF5_Static, op_data, 0); 671*07d7597bSMatthew G. Knepley return status; 672*07d7597bSMatthew G. Knepley } 673*07d7597bSMatthew G. Knepley 6742c40f234SMatthew G. Knepley #undef __FUNCT__ 6752c40f234SMatthew G. Knepley #define __FUNCT__ "DMPlexLoad_HDF5" 6762c40f234SMatthew G. Knepley /* The first version will read everything onto proc 0, letting the user distribute 6772c40f234SMatthew G. Knepley The next will create a naive partition, and then rebalance after reading 6782c40f234SMatthew G. Knepley */ 6792c40f234SMatthew G. Knepley PetscErrorCode DMPlexLoad_HDF5(DM dm, PetscViewer viewer) 6802c40f234SMatthew G. Knepley { 681*07d7597bSMatthew G. Knepley LabelCtx ctx; 6822c40f234SMatthew G. Knepley PetscSection coordSection; 6832c40f234SMatthew G. Knepley Vec coordinates; 6842c40f234SMatthew G. Knepley Vec cellVec; 6852c40f234SMatthew G. Knepley PetscScalar *cells; 6862c40f234SMatthew G. Knepley PetscReal lengthScale; 6872c40f234SMatthew G. Knepley PetscInt *cone; 6882c40f234SMatthew G. Knepley PetscInt dim, spatialDim, numVertices, v, numCorners, numCells, cell, c; 689*07d7597bSMatthew G. Knepley hid_t fileId, groupId; 690*07d7597bSMatthew G. Knepley hsize_t idx; 691*07d7597bSMatthew G. Knepley herr_t status; 6922c40f234SMatthew G. Knepley PetscErrorCode ierr; 6932c40f234SMatthew G. Knepley 6942c40f234SMatthew G. Knepley PetscFunctionBegin; 6952c40f234SMatthew G. Knepley /* Read geometry */ 6962c40f234SMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/geometry");CHKERRQ(ierr); 6972c40f234SMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &coordinates);CHKERRQ(ierr); 6982c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) coordinates, "vertices");CHKERRQ(ierr); 6992c40f234SMatthew G. Knepley ierr = VecLoad(coordinates, viewer);CHKERRQ(ierr); 7002c40f234SMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 7012c40f234SMatthew G. Knepley ierr = DMPlexGetScale(dm, PETSC_UNIT_LENGTH, &lengthScale);CHKERRQ(ierr); 7022c40f234SMatthew G. Knepley ierr = VecScale(coordinates, 1.0/lengthScale);CHKERRQ(ierr); 7032c40f234SMatthew G. Knepley ierr = VecGetSize(coordinates, &numVertices);CHKERRQ(ierr); 7042c40f234SMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &spatialDim);CHKERRQ(ierr); 7052c40f234SMatthew G. Knepley numVertices /= spatialDim; 7062c40f234SMatthew G. Knepley /* Read toplogy */ 7072c40f234SMatthew G. Knepley ierr = PetscViewerHDF5ReadAttribute(viewer, "/topology/cells", "cell_dim", PETSC_INT, (void *) &dim);CHKERRQ(ierr); 7082c40f234SMatthew G. Knepley ierr = DMPlexSetDimension(dm, dim);CHKERRQ(ierr); 7092c40f234SMatthew G. Knepley /* TODO Check for coneSize vector rather than this attribute */ 7102c40f234SMatthew G. Knepley ierr = PetscViewerHDF5ReadAttribute(viewer, "/topology/cells", "cell_corners", PETSC_INT, (void *) &numCorners);CHKERRQ(ierr); 7112c40f234SMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/topology");CHKERRQ(ierr); 7122c40f234SMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cellVec);CHKERRQ(ierr); 7132c40f234SMatthew G. Knepley ierr = VecSetBlockSize(cellVec, numCorners);CHKERRQ(ierr); 7142c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) cellVec, "cells");CHKERRQ(ierr); 7152c40f234SMatthew G. Knepley ierr = VecLoad(cellVec, viewer);CHKERRQ(ierr); 7162c40f234SMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 7172c40f234SMatthew G. Knepley ierr = VecGetSize(cellVec, &numCells);CHKERRQ(ierr); 7182c40f234SMatthew G. Knepley numCells /= numCorners; 7192c40f234SMatthew G. Knepley /* Create Plex */ 7202c40f234SMatthew G. Knepley ierr = DMPlexSetChart(dm, 0, numCells+numVertices);CHKERRQ(ierr); 7212c40f234SMatthew G. Knepley for (cell = 0; cell < numCells; ++cell) {ierr = DMPlexSetConeSize(dm, cell, numCorners);CHKERRQ(ierr);} 7222c40f234SMatthew G. Knepley ierr = DMSetUp(dm);CHKERRQ(ierr); 7232c40f234SMatthew G. Knepley ierr = PetscMalloc1(numCorners,&cone);CHKERRQ(ierr); 7242c40f234SMatthew G. Knepley ierr = VecGetArray(cellVec, &cells);CHKERRQ(ierr); 7252c40f234SMatthew G. Knepley for (cell = 0; cell < numCells; ++cell) { 7262c40f234SMatthew G. Knepley for (c = 0; c < numCorners; ++c) {cone[c] = numCells + cells[cell*numCorners+c];} 7272c40f234SMatthew G. Knepley ierr = DMPlexSetCone(dm, cell, cone);CHKERRQ(ierr); 7282c40f234SMatthew G. Knepley } 7292c40f234SMatthew G. Knepley ierr = VecRestoreArray(cellVec, &cells);CHKERRQ(ierr); 7302c40f234SMatthew G. Knepley ierr = PetscFree(cone);CHKERRQ(ierr); 7312c40f234SMatthew G. Knepley ierr = VecDestroy(&cellVec);CHKERRQ(ierr); 7322c40f234SMatthew G. Knepley ierr = DMPlexSymmetrize(dm);CHKERRQ(ierr); 7332c40f234SMatthew G. Knepley ierr = DMPlexStratify(dm);CHKERRQ(ierr); 7342c40f234SMatthew G. Knepley /* Create coordinates */ 7352c40f234SMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 7362c40f234SMatthew G. Knepley ierr = PetscSectionSetNumFields(coordSection, 1);CHKERRQ(ierr); 7372c40f234SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(coordSection, 0, spatialDim);CHKERRQ(ierr); 7382c40f234SMatthew G. Knepley ierr = PetscSectionSetChart(coordSection, numCells, numCells+numVertices);CHKERRQ(ierr); 7392c40f234SMatthew G. Knepley for (v = numCells; v < numCells+numVertices; ++v) { 7402c40f234SMatthew G. Knepley ierr = PetscSectionSetDof(coordSection, v, spatialDim);CHKERRQ(ierr); 7412c40f234SMatthew G. Knepley ierr = PetscSectionSetFieldDof(coordSection, v, 0, spatialDim);CHKERRQ(ierr); 7422c40f234SMatthew G. Knepley } 7432c40f234SMatthew G. Knepley ierr = PetscSectionSetUp(coordSection);CHKERRQ(ierr); 7442c40f234SMatthew G. Knepley ierr = DMSetCoordinates(dm, coordinates);CHKERRQ(ierr); 7452c40f234SMatthew G. Knepley ierr = VecDestroy(&coordinates);CHKERRQ(ierr); 746*07d7597bSMatthew G. Knepley /* Read Labels*/ 747*07d7597bSMatthew G. Knepley ctx.dm = dm; 748*07d7597bSMatthew G. Knepley ctx.viewer = viewer; 749*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/labels");CHKERRQ(ierr); 750*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5OpenGroup(viewer, &fileId, &groupId);CHKERRQ(ierr); 751*07d7597bSMatthew G. Knepley status = H5Literate(groupId, H5_INDEX_NAME, H5_ITER_NATIVE, &idx, ReadLabelHDF5_Static, &ctx);CHKERRQ(status); 752*07d7597bSMatthew G. Knepley status = H5Gclose(groupId);CHKERRQ(status); 753*07d7597bSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 7542c40f234SMatthew G. Knepley PetscFunctionReturn(0); 7552c40f234SMatthew G. Knepley } 7562c40f234SMatthew G. Knepley #endif 7572c40f234SMatthew G. Knepley 7582c40f234SMatthew G. Knepley #undef __FUNCT__ 7592c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 7602c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 7612c40f234SMatthew G. Knepley { 7622c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 7632c40f234SMatthew G. Knepley PetscErrorCode ierr; 7642c40f234SMatthew G. Knepley 7652c40f234SMatthew G. Knepley PetscFunctionBegin; 7662c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7672c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 7682c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 7692c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 7702c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 7712c40f234SMatthew G. Knepley else if (ishdf5) { 7722c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 773878b459fSMatthew G. Knepley DM odm; 7742c40f234SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), &odm);CHKERRQ(ierr); 7752c40f234SMatthew G. Knepley ierr = DMSetType(odm, DMPLEX);CHKERRQ(ierr); 7762c40f234SMatthew G. Knepley ierr = DMPlexLoad_HDF5(odm, viewer);CHKERRQ(ierr); 7772c40f234SMatthew G. Knepley ierr = DMPlexInterpolate(odm, &dm);CHKERRQ(ierr); 7782c40f234SMatthew G. Knepley ierr = DMPlexCopyCoordinates(odm, dm);CHKERRQ(ierr); 779*07d7597bSMatthew G. Knepley ierr = DMPlexCopyLabels(odm, dm);CHKERRQ(ierr); 7802c40f234SMatthew G. Knepley ierr = DMDestroy(&odm);CHKERRQ(ierr); 7812c40f234SMatthew G. Knepley #else 7822c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 7832c40f234SMatthew G. Knepley #endif 7842c40f234SMatthew G. Knepley } 7852c40f234SMatthew G. Knepley PetscFunctionReturn(0); 7862c40f234SMatthew G. Knepley } 7872c40f234SMatthew G. Knepley 788552f7358SJed Brown #undef __FUNCT__ 7896c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 7906c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 7916c73c22cSMatthew G. Knepley { 7926c73c22cSMatthew G. Knepley DMBoundary b, next; 7936c73c22cSMatthew G. Knepley PetscErrorCode ierr; 7946c73c22cSMatthew G. Knepley 7956c73c22cSMatthew G. Knepley PetscFunctionBeginUser; 7966c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 7976c73c22cSMatthew G. Knepley b = *boundary; 7986c73c22cSMatthew G. Knepley *boundary = NULL; 7996c73c22cSMatthew G. Knepley for (; b; b = next) { 8006c73c22cSMatthew G. Knepley next = b->next; 8016c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 8026c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 8036c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 8046c73c22cSMatthew G. Knepley } 8056c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 8066c73c22cSMatthew G. Knepley } 8076c73c22cSMatthew G. Knepley 8086c73c22cSMatthew G. Knepley #undef __FUNCT__ 809552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 810552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 811552f7358SJed Brown { 812552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 813552f7358SJed Brown DMLabel next = mesh->labels; 814552f7358SJed Brown PetscErrorCode ierr; 815552f7358SJed Brown 816552f7358SJed Brown PetscFunctionBegin; 8170d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 818552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 819552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 820552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 821552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 822552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 823552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 824552f7358SJed Brown while (next) { 825552f7358SJed Brown DMLabel tmp = next->next; 826552f7358SJed Brown 827552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 828552f7358SJed Brown next = tmp; 829552f7358SJed Brown } 8303913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 831a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 832552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 833552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 8346c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 835552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 836552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 837552f7358SJed Brown PetscFunctionReturn(0); 838552f7358SJed Brown } 839552f7358SJed Brown 840552f7358SJed Brown #undef __FUNCT__ 841552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 842b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 843552f7358SJed Brown { 844552f7358SJed Brown PetscSection section, sectionGlobal; 845552f7358SJed Brown PetscInt bs = -1; 846552f7358SJed Brown PetscInt localSize; 84789545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 848552f7358SJed Brown PetscErrorCode ierr; 849b412c318SBarry Smith MatType mtype; 850552f7358SJed Brown 851552f7358SJed Brown PetscFunctionBegin; 852607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 853b412c318SBarry Smith mtype = dm->mattype; 854552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 855552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 856552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 857552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 85882f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 859552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 860552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 861552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 862552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 863552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 864552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 865552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 866552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 867552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 868552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 869552f7358SJed Brown if (!isShell) { 870552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 8712a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 872552f7358SJed Brown 873552f7358SJed Brown if (bs < 0) { 874552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 875fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 876552f7358SJed Brown 877552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 878552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 879552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 880fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 881fad22124SMatthew G Knepley if (dof-cdof) { 8822a28c762SMatthew G Knepley if (bs < 0) { 883fad22124SMatthew G Knepley bs = dof-cdof; 884fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 8852a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 8862a28c762SMatthew G Knepley bs = 1; 887552f7358SJed Brown break; 888552f7358SJed Brown } 889552f7358SJed Brown } 8902a28c762SMatthew G Knepley } 8912a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 8922a28c762SMatthew G Knepley bsLocal = bs; 89382f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 8942a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 89582f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 8962a28c762SMatthew G Knepley if (bsMin != bsMax) { 8972a28c762SMatthew G Knepley bs = 1; 8982a28c762SMatthew G Knepley } else { 8992a28c762SMatthew G Knepley bs = bsMax; 9002a28c762SMatthew G Knepley } 901552f7358SJed Brown } else { 902552f7358SJed Brown bs = 1; 903552f7358SJed Brown } 904552f7358SJed Brown } 9051795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 906552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 907552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 908552f7358SJed Brown } 909552f7358SJed Brown PetscFunctionReturn(0); 910552f7358SJed Brown } 911552f7358SJed Brown 912552f7358SJed Brown #undef __FUNCT__ 913552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 914552f7358SJed Brown /*@ 915552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 916552f7358SJed Brown 917552f7358SJed Brown Not collective 918552f7358SJed Brown 919552f7358SJed Brown Input Parameter: 920552f7358SJed Brown . mesh - The DMPlex 921552f7358SJed Brown 922552f7358SJed Brown Output Parameter: 923552f7358SJed Brown . dim - The topological mesh dimension 924552f7358SJed Brown 925552f7358SJed Brown Level: beginner 926552f7358SJed Brown 927552f7358SJed Brown .seealso: DMPlexCreate() 928552f7358SJed Brown @*/ 929552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 930552f7358SJed Brown { 931552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 932552f7358SJed Brown 933552f7358SJed Brown PetscFunctionBegin; 934552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 935552f7358SJed Brown PetscValidPointer(dim, 2); 936552f7358SJed Brown *dim = mesh->dim; 937552f7358SJed Brown PetscFunctionReturn(0); 938552f7358SJed Brown } 939552f7358SJed Brown 940552f7358SJed Brown #undef __FUNCT__ 941552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 942552f7358SJed Brown /*@ 943552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 944552f7358SJed Brown 945552f7358SJed Brown Collective on mesh 946552f7358SJed Brown 947552f7358SJed Brown Input Parameters: 948552f7358SJed Brown + mesh - The DMPlex 949552f7358SJed Brown - dim - The topological mesh dimension 950552f7358SJed Brown 951552f7358SJed Brown Level: beginner 952552f7358SJed Brown 953552f7358SJed Brown .seealso: DMPlexCreate() 954552f7358SJed Brown @*/ 955552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 956552f7358SJed Brown { 957552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 958552f7358SJed Brown 959552f7358SJed Brown PetscFunctionBegin; 960552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 961552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 962552f7358SJed Brown mesh->dim = dim; 963552f7358SJed Brown PetscFunctionReturn(0); 964552f7358SJed Brown } 965552f7358SJed Brown 966552f7358SJed Brown #undef __FUNCT__ 967552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 968552f7358SJed Brown /*@ 969552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 970552f7358SJed Brown 971552f7358SJed Brown Not collective 972552f7358SJed Brown 973552f7358SJed Brown Input Parameter: 974552f7358SJed Brown . mesh - The DMPlex 975552f7358SJed Brown 976552f7358SJed Brown Output Parameters: 977552f7358SJed Brown + pStart - The first mesh point 978552f7358SJed Brown - pEnd - The upper bound for mesh points 979552f7358SJed Brown 980552f7358SJed Brown Level: beginner 981552f7358SJed Brown 982552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 983552f7358SJed Brown @*/ 984552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 985552f7358SJed Brown { 986552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 987552f7358SJed Brown PetscErrorCode ierr; 988552f7358SJed Brown 989552f7358SJed Brown PetscFunctionBegin; 990552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 991552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 992552f7358SJed Brown PetscFunctionReturn(0); 993552f7358SJed Brown } 994552f7358SJed Brown 995552f7358SJed Brown #undef __FUNCT__ 996552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 997552f7358SJed Brown /*@ 998552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 999552f7358SJed Brown 1000552f7358SJed Brown Not collective 1001552f7358SJed Brown 1002552f7358SJed Brown Input Parameters: 1003552f7358SJed Brown + mesh - The DMPlex 1004552f7358SJed Brown . pStart - The first mesh point 1005552f7358SJed Brown - pEnd - The upper bound for mesh points 1006552f7358SJed Brown 1007552f7358SJed Brown Output Parameters: 1008552f7358SJed Brown 1009552f7358SJed Brown Level: beginner 1010552f7358SJed Brown 1011552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 1012552f7358SJed Brown @*/ 1013552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 1014552f7358SJed Brown { 1015552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1016552f7358SJed Brown PetscErrorCode ierr; 1017552f7358SJed Brown 1018552f7358SJed Brown PetscFunctionBegin; 1019552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1020552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 1021552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 1022552f7358SJed Brown PetscFunctionReturn(0); 1023552f7358SJed Brown } 1024552f7358SJed Brown 1025552f7358SJed Brown #undef __FUNCT__ 1026552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 1027552f7358SJed Brown /*@ 1028552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 1029552f7358SJed Brown 1030552f7358SJed Brown Not collective 1031552f7358SJed Brown 1032552f7358SJed Brown Input Parameters: 1033552f7358SJed Brown + mesh - The DMPlex 1034552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1035552f7358SJed Brown 1036552f7358SJed Brown Output Parameter: 1037552f7358SJed Brown . size - The cone size for point p 1038552f7358SJed Brown 1039552f7358SJed Brown Level: beginner 1040552f7358SJed Brown 1041552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1042552f7358SJed Brown @*/ 1043552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 1044552f7358SJed Brown { 1045552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1046552f7358SJed Brown PetscErrorCode ierr; 1047552f7358SJed Brown 1048552f7358SJed Brown PetscFunctionBegin; 1049552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1050552f7358SJed Brown PetscValidPointer(size, 3); 1051552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 1052552f7358SJed Brown PetscFunctionReturn(0); 1053552f7358SJed Brown } 1054552f7358SJed Brown 1055552f7358SJed Brown #undef __FUNCT__ 1056552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 1057552f7358SJed Brown /*@ 1058552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 1059552f7358SJed Brown 1060552f7358SJed Brown Not collective 1061552f7358SJed Brown 1062552f7358SJed Brown Input Parameters: 1063552f7358SJed Brown + mesh - The DMPlex 1064552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1065552f7358SJed Brown - size - The cone size for point p 1066552f7358SJed Brown 1067552f7358SJed Brown Output Parameter: 1068552f7358SJed Brown 1069552f7358SJed Brown Note: 1070552f7358SJed Brown This should be called after DMPlexSetChart(). 1071552f7358SJed Brown 1072552f7358SJed Brown Level: beginner 1073552f7358SJed Brown 1074552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 1075552f7358SJed Brown @*/ 1076552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 1077552f7358SJed Brown { 1078552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1079552f7358SJed Brown PetscErrorCode ierr; 1080552f7358SJed Brown 1081552f7358SJed Brown PetscFunctionBegin; 1082552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1083552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 10840d644c17SKarl Rupp 1085552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 1086552f7358SJed Brown PetscFunctionReturn(0); 1087552f7358SJed Brown } 1088552f7358SJed Brown 1089552f7358SJed Brown #undef __FUNCT__ 1090552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 1091552f7358SJed Brown /*@C 1092552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 1093552f7358SJed Brown 1094552f7358SJed Brown Not collective 1095552f7358SJed Brown 1096552f7358SJed Brown Input Parameters: 1097552f7358SJed Brown + mesh - The DMPlex 1098552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1099552f7358SJed Brown 1100552f7358SJed Brown Output Parameter: 1101552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 1102552f7358SJed Brown 1103552f7358SJed Brown Level: beginner 1104552f7358SJed Brown 11053813dfbdSMatthew G Knepley Fortran Notes: 11063813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11073813dfbdSMatthew G Knepley include petsc.h90 in your code. 11083813dfbdSMatthew G Knepley 11093813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 1110552f7358SJed Brown 1111552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 1112552f7358SJed Brown @*/ 1113552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 1114552f7358SJed Brown { 1115552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1116552f7358SJed Brown PetscInt off; 1117552f7358SJed Brown PetscErrorCode ierr; 1118552f7358SJed Brown 1119552f7358SJed Brown PetscFunctionBegin; 1120552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1121552f7358SJed Brown PetscValidPointer(cone, 3); 1122552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1123552f7358SJed Brown *cone = &mesh->cones[off]; 1124552f7358SJed Brown PetscFunctionReturn(0); 1125552f7358SJed Brown } 1126552f7358SJed Brown 1127552f7358SJed Brown #undef __FUNCT__ 1128552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 1129552f7358SJed Brown /*@ 1130552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 1131552f7358SJed Brown 1132552f7358SJed Brown Not collective 1133552f7358SJed Brown 1134552f7358SJed Brown Input Parameters: 1135552f7358SJed Brown + mesh - The DMPlex 1136552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1137552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 1138552f7358SJed Brown 1139552f7358SJed Brown Output Parameter: 1140552f7358SJed Brown 1141552f7358SJed Brown Note: 1142552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 1143552f7358SJed Brown 1144552f7358SJed Brown Level: beginner 1145552f7358SJed Brown 1146552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 1147552f7358SJed Brown @*/ 1148552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 1149552f7358SJed Brown { 1150552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1151552f7358SJed Brown PetscInt pStart, pEnd; 1152552f7358SJed Brown PetscInt dof, off, c; 1153552f7358SJed Brown PetscErrorCode ierr; 1154552f7358SJed Brown 1155552f7358SJed Brown PetscFunctionBegin; 1156552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1157552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 1158552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1159552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 1160552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 116182f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 1162552f7358SJed Brown for (c = 0; c < dof; ++c) { 116382f516ccSBarry Smith if ((cone[c] < pStart) || (cone[c] >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone point %D is not in the valid range [%D, %D)", cone[c], pStart, pEnd); 1164552f7358SJed Brown mesh->cones[off+c] = cone[c]; 1165552f7358SJed Brown } 1166552f7358SJed Brown PetscFunctionReturn(0); 1167552f7358SJed Brown } 1168552f7358SJed Brown 1169552f7358SJed Brown #undef __FUNCT__ 1170552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 1171552f7358SJed Brown /*@C 1172552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 1173552f7358SJed Brown 1174552f7358SJed Brown Not collective 1175552f7358SJed Brown 1176552f7358SJed Brown Input Parameters: 1177552f7358SJed Brown + mesh - The DMPlex 1178552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1179552f7358SJed Brown 1180552f7358SJed Brown Output Parameter: 1181552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 1182552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 1183552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 1184552f7358SJed Brown the index of the cone point on which to start. 1185552f7358SJed Brown 1186552f7358SJed Brown Level: beginner 1187552f7358SJed Brown 11883813dfbdSMatthew G Knepley Fortran Notes: 11893813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11903813dfbdSMatthew G Knepley include petsc.h90 in your code. 11913813dfbdSMatthew G Knepley 11923813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 1193552f7358SJed Brown 1194552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 1195552f7358SJed Brown @*/ 1196552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 1197552f7358SJed Brown { 1198552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1199552f7358SJed Brown PetscInt off; 1200552f7358SJed Brown PetscErrorCode ierr; 1201552f7358SJed Brown 1202552f7358SJed Brown PetscFunctionBegin; 1203552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1204552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 1205552f7358SJed Brown { 1206552f7358SJed Brown PetscInt dof; 1207552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1208552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1209552f7358SJed Brown } 1210552f7358SJed Brown #endif 1211552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 12120d644c17SKarl Rupp 1213552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 1214552f7358SJed Brown PetscFunctionReturn(0); 1215552f7358SJed Brown } 1216552f7358SJed Brown 1217552f7358SJed Brown #undef __FUNCT__ 1218552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 1219552f7358SJed Brown /*@ 1220552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 1221552f7358SJed Brown 1222552f7358SJed Brown Not collective 1223552f7358SJed Brown 1224552f7358SJed Brown Input Parameters: 1225552f7358SJed Brown + mesh - The DMPlex 1226552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1227552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 1228552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 1229552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 1230552f7358SJed Brown the index of the cone point on which to start. 1231552f7358SJed Brown 1232552f7358SJed Brown Output Parameter: 1233552f7358SJed Brown 1234552f7358SJed Brown Note: 1235552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 1236552f7358SJed Brown 1237552f7358SJed Brown Level: beginner 1238552f7358SJed Brown 1239552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 1240552f7358SJed Brown @*/ 1241552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 1242552f7358SJed Brown { 1243552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1244552f7358SJed Brown PetscInt pStart, pEnd; 1245552f7358SJed Brown PetscInt dof, off, c; 1246552f7358SJed Brown PetscErrorCode ierr; 1247552f7358SJed Brown 1248552f7358SJed Brown PetscFunctionBegin; 1249552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1250552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 1251552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1252552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1253552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 125482f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 1255552f7358SJed Brown for (c = 0; c < dof; ++c) { 1256552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 1257552f7358SJed Brown 1258552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 125982f516ccSBarry Smith if (o && ((o < -(cdof+1)) || (o >= cdof))) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone orientation %D is not in the valid range [%D. %D)", o, -(cdof+1), cdof); 1260552f7358SJed Brown mesh->coneOrientations[off+c] = o; 1261552f7358SJed Brown } 1262552f7358SJed Brown PetscFunctionReturn(0); 1263552f7358SJed Brown } 1264552f7358SJed Brown 1265552f7358SJed Brown #undef __FUNCT__ 1266552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 1267552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 1268552f7358SJed Brown { 1269552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1270552f7358SJed Brown PetscInt pStart, pEnd; 1271552f7358SJed Brown PetscInt dof, off; 1272552f7358SJed Brown PetscErrorCode ierr; 1273552f7358SJed Brown 1274552f7358SJed Brown PetscFunctionBegin; 1275552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1276552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 127782f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 127882f516ccSBarry Smith if ((conePoint < pStart) || (conePoint >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone point %D is not in the valid range [%D, %D)", conePoint, pStart, pEnd); 127977c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 128077c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 128177c88f5bSMatthew G Knepley if ((conePos < 0) || (conePos >= dof)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone position %D of point %D is not in the valid range [0, %D)", conePos, p, dof); 1282552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 1283552f7358SJed Brown PetscFunctionReturn(0); 1284552f7358SJed Brown } 1285552f7358SJed Brown 1286552f7358SJed Brown #undef __FUNCT__ 128777c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 128877c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 128977c88f5bSMatthew G Knepley { 129077c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 129177c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 129277c88f5bSMatthew G Knepley PetscInt dof, off; 129377c88f5bSMatthew G Knepley PetscErrorCode ierr; 129477c88f5bSMatthew G Knepley 129577c88f5bSMatthew G Knepley PetscFunctionBegin; 129677c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 129777c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 129877c88f5bSMatthew G Knepley if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 129977c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 130077c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 130177c88f5bSMatthew G Knepley if ((conePos < 0) || (conePos >= dof)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone position %D of point %D is not in the valid range [0, %D)", conePos, p, dof); 130277c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 130377c88f5bSMatthew G Knepley PetscFunctionReturn(0); 130477c88f5bSMatthew G Knepley } 130577c88f5bSMatthew G Knepley 130677c88f5bSMatthew G Knepley #undef __FUNCT__ 1307552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1308552f7358SJed Brown /*@ 1309552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1310552f7358SJed Brown 1311552f7358SJed Brown Not collective 1312552f7358SJed Brown 1313552f7358SJed Brown Input Parameters: 1314552f7358SJed Brown + mesh - The DMPlex 1315552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1316552f7358SJed Brown 1317552f7358SJed Brown Output Parameter: 1318552f7358SJed Brown . size - The support size for point p 1319552f7358SJed Brown 1320552f7358SJed Brown Level: beginner 1321552f7358SJed Brown 1322552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1323552f7358SJed Brown @*/ 1324552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1325552f7358SJed Brown { 1326552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1327552f7358SJed Brown PetscErrorCode ierr; 1328552f7358SJed Brown 1329552f7358SJed Brown PetscFunctionBegin; 1330552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1331552f7358SJed Brown PetscValidPointer(size, 3); 1332552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1333552f7358SJed Brown PetscFunctionReturn(0); 1334552f7358SJed Brown } 1335552f7358SJed Brown 1336552f7358SJed Brown #undef __FUNCT__ 1337552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1338552f7358SJed Brown /*@ 1339552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1340552f7358SJed Brown 1341552f7358SJed Brown Not collective 1342552f7358SJed Brown 1343552f7358SJed Brown Input Parameters: 1344552f7358SJed Brown + mesh - The DMPlex 1345552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1346552f7358SJed Brown - size - The support size for point p 1347552f7358SJed Brown 1348552f7358SJed Brown Output Parameter: 1349552f7358SJed Brown 1350552f7358SJed Brown Note: 1351552f7358SJed Brown This should be called after DMPlexSetChart(). 1352552f7358SJed Brown 1353552f7358SJed Brown Level: beginner 1354552f7358SJed Brown 1355552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1356552f7358SJed Brown @*/ 1357552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1358552f7358SJed Brown { 1359552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1360552f7358SJed Brown PetscErrorCode ierr; 1361552f7358SJed Brown 1362552f7358SJed Brown PetscFunctionBegin; 1363552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1364552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 13650d644c17SKarl Rupp 1366552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1367552f7358SJed Brown PetscFunctionReturn(0); 1368552f7358SJed Brown } 1369552f7358SJed Brown 1370552f7358SJed Brown #undef __FUNCT__ 1371552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1372552f7358SJed Brown /*@C 1373552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1374552f7358SJed Brown 1375552f7358SJed Brown Not collective 1376552f7358SJed Brown 1377552f7358SJed Brown Input Parameters: 1378552f7358SJed Brown + mesh - The DMPlex 1379552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1380552f7358SJed Brown 1381552f7358SJed Brown Output Parameter: 1382552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1383552f7358SJed Brown 1384552f7358SJed Brown Level: beginner 1385552f7358SJed Brown 13863813dfbdSMatthew G Knepley Fortran Notes: 13873813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13883813dfbdSMatthew G Knepley include petsc.h90 in your code. 13893813dfbdSMatthew G Knepley 13903813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 13913813dfbdSMatthew G Knepley 1392552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1393552f7358SJed Brown @*/ 1394552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1395552f7358SJed Brown { 1396552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1397552f7358SJed Brown PetscInt off; 1398552f7358SJed Brown PetscErrorCode ierr; 1399552f7358SJed Brown 1400552f7358SJed Brown PetscFunctionBegin; 1401552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1402552f7358SJed Brown PetscValidPointer(support, 3); 1403552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1404552f7358SJed Brown *support = &mesh->supports[off]; 1405552f7358SJed Brown PetscFunctionReturn(0); 1406552f7358SJed Brown } 1407552f7358SJed Brown 1408552f7358SJed Brown #undef __FUNCT__ 1409552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1410552f7358SJed Brown /*@ 1411552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1412552f7358SJed Brown 1413552f7358SJed Brown Not collective 1414552f7358SJed Brown 1415552f7358SJed Brown Input Parameters: 1416552f7358SJed Brown + mesh - The DMPlex 1417552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1418552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1419552f7358SJed Brown 1420552f7358SJed Brown Output Parameter: 1421552f7358SJed Brown 1422552f7358SJed Brown Note: 1423552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1424552f7358SJed Brown 1425552f7358SJed Brown Level: beginner 1426552f7358SJed Brown 1427552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1428552f7358SJed Brown @*/ 1429552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1430552f7358SJed Brown { 1431552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1432552f7358SJed Brown PetscInt pStart, pEnd; 1433552f7358SJed Brown PetscInt dof, off, c; 1434552f7358SJed Brown PetscErrorCode ierr; 1435552f7358SJed Brown 1436552f7358SJed Brown PetscFunctionBegin; 1437552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1438552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1439552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1440552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1441552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 144282f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 1443552f7358SJed Brown for (c = 0; c < dof; ++c) { 144482f516ccSBarry Smith if ((support[c] < pStart) || (support[c] >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support point %D is not in the valid range [%D, %D)", support[c], pStart, pEnd); 1445552f7358SJed Brown mesh->supports[off+c] = support[c]; 1446552f7358SJed Brown } 1447552f7358SJed Brown PetscFunctionReturn(0); 1448552f7358SJed Brown } 1449552f7358SJed Brown 1450552f7358SJed Brown #undef __FUNCT__ 1451552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1452552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1453552f7358SJed Brown { 1454552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1455552f7358SJed Brown PetscInt pStart, pEnd; 1456552f7358SJed Brown PetscInt dof, off; 1457552f7358SJed Brown PetscErrorCode ierr; 1458552f7358SJed Brown 1459552f7358SJed Brown PetscFunctionBegin; 1460552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1461552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1462552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1463552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 146482f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 146582f516ccSBarry Smith if ((supportPoint < pStart) || (supportPoint >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support point %D is not in the valid range [%D, %D)", supportPoint, pStart, pEnd); 146682f516ccSBarry Smith if (supportPos >= dof) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support position %D of point %D is not in the valid range [0, %D)", supportPos, p, dof); 1467552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1468552f7358SJed Brown PetscFunctionReturn(0); 1469552f7358SJed Brown } 1470552f7358SJed Brown 1471552f7358SJed Brown #undef __FUNCT__ 1472552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1473552f7358SJed Brown /*@C 1474552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1475552f7358SJed Brown 1476552f7358SJed Brown Not collective 1477552f7358SJed Brown 1478552f7358SJed Brown Input Parameters: 1479552f7358SJed Brown + mesh - The DMPlex 1480552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1481552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 14820298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1483552f7358SJed Brown 1484552f7358SJed Brown Output Parameters: 1485552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1486552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1487552f7358SJed Brown 1488552f7358SJed Brown Note: 14890298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1490552f7358SJed Brown 14913813dfbdSMatthew G Knepley Fortran Notes: 14923813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14933813dfbdSMatthew G Knepley include petsc.h90 in your code. 14943813dfbdSMatthew G Knepley 14953813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14963813dfbdSMatthew G Knepley 1497552f7358SJed Brown Level: beginner 1498552f7358SJed Brown 1499552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1500552f7358SJed Brown @*/ 1501552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1502552f7358SJed Brown { 1503552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1504552f7358SJed Brown PetscInt *closure, *fifo; 15050298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1506552f7358SJed Brown PetscInt tmpSize, t; 1507552f7358SJed Brown PetscInt depth = 0, maxSize; 1508552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1509552f7358SJed Brown PetscErrorCode ierr; 1510552f7358SJed Brown 1511552f7358SJed Brown PetscFunctionBegin; 1512552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1513552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1514552f7358SJed Brown /* This is only 1-level */ 1515552f7358SJed Brown if (useCone) { 1516552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1517552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1518552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1519552f7358SJed Brown } else { 1520552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1521552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1522552f7358SJed Brown } 1523bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1524bfbcdd7aSMatthew G. Knepley if (*points) { 1525bfbcdd7aSMatthew G. Knepley closure = *points; 1526bfbcdd7aSMatthew G. Knepley } else { 1527bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1528bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1529bfbcdd7aSMatthew G. Knepley } 1530bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1531bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1532bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1533bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1534bfbcdd7aSMatthew G. Knepley } 1535bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1536bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1537bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1538bfbcdd7aSMatthew G. Knepley } 1539bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1540bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1541bfbcdd7aSMatthew G. Knepley if (*points) { 1542bfbcdd7aSMatthew G. Knepley closure = *points; 1543bfbcdd7aSMatthew G. Knepley } else { 1544bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1545bfbcdd7aSMatthew G. Knepley } 1546bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1547552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1548552f7358SJed Brown const PetscInt cp = tmp[t]; 1549552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1550552f7358SJed Brown 1551552f7358SJed Brown closure[closureSize] = cp; 1552552f7358SJed Brown closure[closureSize+1] = co; 1553552f7358SJed Brown fifo[fifoSize] = cp; 1554552f7358SJed Brown fifo[fifoSize+1] = co; 1555552f7358SJed Brown } 1556bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1557552f7358SJed Brown while (fifoSize - fifoStart) { 1558552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1559552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1560552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1561552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1562552f7358SJed Brown 1563552f7358SJed Brown if (useCone) { 1564552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1565552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1566552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1567552f7358SJed Brown } else { 1568552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1569552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 15700298fd71SBarry Smith tmpO = NULL; 1571552f7358SJed Brown } 1572552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1573552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1574552f7358SJed Brown const PetscInt cp = tmp[i]; 15752e1b13c2SMatthew G. Knepley /* Must propogate orientation: When we reverse orientation, we both reverse the direction of iteration and start at the other end of the chain. */ 15762e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 15772e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 15782e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1579552f7358SJed Brown PetscInt c; 1580552f7358SJed Brown 15812e1b13c2SMatthew G. Knepley if (rev) { 15822e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 15832e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 15842e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 15852e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 15862e1b13c2SMatthew G. Knepley } 1587552f7358SJed Brown /* Check for duplicate */ 1588552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1589552f7358SJed Brown if (closure[c] == cp) break; 1590552f7358SJed Brown } 1591552f7358SJed Brown if (c == closureSize) { 1592552f7358SJed Brown closure[closureSize] = cp; 1593552f7358SJed Brown closure[closureSize+1] = co; 1594552f7358SJed Brown fifo[fifoSize] = cp; 1595552f7358SJed Brown fifo[fifoSize+1] = co; 1596552f7358SJed Brown closureSize += 2; 1597552f7358SJed Brown fifoSize += 2; 1598552f7358SJed Brown } 1599552f7358SJed Brown } 1600552f7358SJed Brown fifoStart += 2; 1601552f7358SJed Brown } 1602552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1603552f7358SJed Brown if (points) *points = closure; 1604552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1605552f7358SJed Brown PetscFunctionReturn(0); 1606552f7358SJed Brown } 1607552f7358SJed Brown 1608552f7358SJed Brown #undef __FUNCT__ 16099bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 16109bf0dad6SMatthew G. Knepley /*@C 16119bf0dad6SMatthew G. Knepley DMPlexGetTransitiveClosure_Internal - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG with a specified initial orientation 16129bf0dad6SMatthew G. Knepley 16139bf0dad6SMatthew G. Knepley Not collective 16149bf0dad6SMatthew G. Knepley 16159bf0dad6SMatthew G. Knepley Input Parameters: 16169bf0dad6SMatthew G. Knepley + mesh - The DMPlex 16179bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 16189bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 16199bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 16209bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 16219bf0dad6SMatthew G. Knepley 16229bf0dad6SMatthew G. Knepley Output Parameters: 16239bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 16249bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 16259bf0dad6SMatthew G. Knepley 16269bf0dad6SMatthew G. Knepley Note: 16279bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 16289bf0dad6SMatthew G. Knepley 16299bf0dad6SMatthew G. Knepley Fortran Notes: 16309bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16319bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 16329bf0dad6SMatthew G. Knepley 16339bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16349bf0dad6SMatthew G. Knepley 16359bf0dad6SMatthew G. Knepley Level: beginner 16369bf0dad6SMatthew G. Knepley 16379bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 16389bf0dad6SMatthew G. Knepley @*/ 16399bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 16409bf0dad6SMatthew G. Knepley { 16419bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 16429bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 16439bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 16449bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 16459bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 16469bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 16479bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 16489bf0dad6SMatthew G. Knepley 16499bf0dad6SMatthew G. Knepley PetscFunctionBegin; 16509bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 16519bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 16529bf0dad6SMatthew G. Knepley /* This is only 1-level */ 16539bf0dad6SMatthew G. Knepley if (useCone) { 16549bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 16559bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 16569bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 16579bf0dad6SMatthew G. Knepley } else { 16589bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 16599bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 16609bf0dad6SMatthew G. Knepley } 16619bf0dad6SMatthew G. Knepley if (depth == 1) { 16629bf0dad6SMatthew G. Knepley if (*points) { 16639bf0dad6SMatthew G. Knepley closure = *points; 16649bf0dad6SMatthew G. Knepley } else { 16659bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 16669bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 16679bf0dad6SMatthew G. Knepley } 16689bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 16699bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 16709bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 16719bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 16729bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 16739bf0dad6SMatthew G. Knepley } 16749bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 16759bf0dad6SMatthew G. Knepley if (points) *points = closure; 16769bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 16779bf0dad6SMatthew G. Knepley } 16789bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 16799bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 16809bf0dad6SMatthew G. Knepley if (*points) { 16819bf0dad6SMatthew G. Knepley closure = *points; 16829bf0dad6SMatthew G. Knepley } else { 16839bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 16849bf0dad6SMatthew G. Knepley } 16859bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 16869bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 16879bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 16889bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 16899bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 16909bf0dad6SMatthew G. Knepley 16919bf0dad6SMatthew G. Knepley if (ornt < 0) { 16929bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 16939bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 16949bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 16959bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 16969bf0dad6SMatthew G. Knepley } 16979bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 16989bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 16999bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 17009bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 17019bf0dad6SMatthew G. Knepley } 17029bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 17039bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 17049bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 17059bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 17069bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 17079bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 17089bf0dad6SMatthew G. Knepley 17099bf0dad6SMatthew G. Knepley if (useCone) { 17109bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 17119bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 17129bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 17139bf0dad6SMatthew G. Knepley } else { 17149bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 17159bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 17169bf0dad6SMatthew G. Knepley tmpO = NULL; 17179bf0dad6SMatthew G. Knepley } 17189bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 17199bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 17209bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 17219bf0dad6SMatthew G. Knepley /* Must propogate orientation: When we reverse orientation, we both reverse the direction of iteration and start at the other end of the chain. */ 17229bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 17239bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 17249bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 17259bf0dad6SMatthew G. Knepley PetscInt c; 17269bf0dad6SMatthew G. Knepley 17279bf0dad6SMatthew G. Knepley if (rev) { 17289bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 17299bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 17309bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 17319bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 17329bf0dad6SMatthew G. Knepley } 17339bf0dad6SMatthew G. Knepley /* Check for duplicate */ 17349bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 17359bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 17369bf0dad6SMatthew G. Knepley } 17379bf0dad6SMatthew G. Knepley if (c == closureSize) { 17389bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 17399bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 17409bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 17419bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 17429bf0dad6SMatthew G. Knepley closureSize += 2; 17439bf0dad6SMatthew G. Knepley fifoSize += 2; 17449bf0dad6SMatthew G. Knepley } 17459bf0dad6SMatthew G. Knepley } 17469bf0dad6SMatthew G. Knepley fifoStart += 2; 17479bf0dad6SMatthew G. Knepley } 17489bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 17499bf0dad6SMatthew G. Knepley if (points) *points = closure; 17509bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 17519bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 17529bf0dad6SMatthew G. Knepley } 17539bf0dad6SMatthew G. Knepley 17549bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1755552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1756552f7358SJed Brown /*@C 1757552f7358SJed Brown DMPlexRestoreTransitiveClosure - Restore the array of points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1758552f7358SJed Brown 1759552f7358SJed Brown Not collective 1760552f7358SJed Brown 1761552f7358SJed Brown Input Parameters: 1762552f7358SJed Brown + mesh - The DMPlex 1763552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1764552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1765e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1766e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1767552f7358SJed Brown 1768552f7358SJed Brown Note: 17690298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1770552f7358SJed Brown 17713813dfbdSMatthew G Knepley Fortran Notes: 17723813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17733813dfbdSMatthew G Knepley include petsc.h90 in your code. 17743813dfbdSMatthew G Knepley 17753813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17763813dfbdSMatthew G Knepley 1777552f7358SJed Brown Level: beginner 1778552f7358SJed Brown 1779552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1780552f7358SJed Brown @*/ 1781552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1782552f7358SJed Brown { 1783552f7358SJed Brown PetscErrorCode ierr; 1784552f7358SJed Brown 1785552f7358SJed Brown PetscFunctionBegin; 1786552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1787e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1788e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1789552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 17904ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1791552f7358SJed Brown PetscFunctionReturn(0); 1792552f7358SJed Brown } 1793552f7358SJed Brown 1794552f7358SJed Brown #undef __FUNCT__ 1795552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1796552f7358SJed Brown /*@ 1797552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1798552f7358SJed Brown 1799552f7358SJed Brown Not collective 1800552f7358SJed Brown 1801552f7358SJed Brown Input Parameter: 1802552f7358SJed Brown . mesh - The DMPlex 1803552f7358SJed Brown 1804552f7358SJed Brown Output Parameters: 1805552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1806552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1807552f7358SJed Brown 1808552f7358SJed Brown Level: beginner 1809552f7358SJed Brown 1810552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1811552f7358SJed Brown @*/ 1812552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1813552f7358SJed Brown { 1814552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1815552f7358SJed Brown 1816552f7358SJed Brown PetscFunctionBegin; 1817552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1818552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1819552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1820552f7358SJed Brown PetscFunctionReturn(0); 1821552f7358SJed Brown } 1822552f7358SJed Brown 1823552f7358SJed Brown #undef __FUNCT__ 1824552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1825552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1826552f7358SJed Brown { 1827552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1828552f7358SJed Brown PetscInt size; 1829552f7358SJed Brown PetscErrorCode ierr; 1830552f7358SJed Brown 1831552f7358SJed Brown PetscFunctionBegin; 1832552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1833552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1834552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 18351795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 18361795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1837552f7358SJed Brown if (mesh->maxSupportSize) { 1838552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1839552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 18401795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1841552f7358SJed Brown } 1842552f7358SJed Brown PetscFunctionReturn(0); 1843552f7358SJed Brown } 1844552f7358SJed Brown 1845552f7358SJed Brown #undef __FUNCT__ 1846552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1847552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1848552f7358SJed Brown { 1849552f7358SJed Brown PetscErrorCode ierr; 1850552f7358SJed Brown 1851552f7358SJed Brown PetscFunctionBegin; 18524d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 18534d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1854552f7358SJed Brown PetscFunctionReturn(0); 1855552f7358SJed Brown } 1856552f7358SJed Brown 1857552f7358SJed Brown #undef __FUNCT__ 1858552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1859552f7358SJed Brown /*@ 1860552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1861552f7358SJed Brown 1862552f7358SJed Brown Not collective 1863552f7358SJed Brown 1864552f7358SJed Brown Input Parameter: 1865552f7358SJed Brown . mesh - The DMPlex 1866552f7358SJed Brown 1867552f7358SJed Brown Output Parameter: 1868552f7358SJed Brown 1869552f7358SJed Brown Note: 1870552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1871552f7358SJed Brown 1872552f7358SJed Brown Level: beginner 1873552f7358SJed Brown 1874552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1875552f7358SJed Brown @*/ 1876552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1877552f7358SJed Brown { 1878552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1879552f7358SJed Brown PetscInt *offsets; 1880552f7358SJed Brown PetscInt supportSize; 1881552f7358SJed Brown PetscInt pStart, pEnd, p; 1882552f7358SJed Brown PetscErrorCode ierr; 1883552f7358SJed Brown 1884552f7358SJed Brown PetscFunctionBegin; 1885552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 188682f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1887552f7358SJed Brown /* Calculate support sizes */ 1888552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1889552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1890552f7358SJed Brown PetscInt dof, off, c; 1891552f7358SJed Brown 1892552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1893552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1894552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1895552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1896552f7358SJed Brown } 1897552f7358SJed Brown } 1898552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1899552f7358SJed Brown PetscInt dof; 1900552f7358SJed Brown 1901552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 19020d644c17SKarl Rupp 1903552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1904552f7358SJed Brown } 1905552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1906552f7358SJed Brown /* Calculate supports */ 1907552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 19081795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 19091795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1910552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1911552f7358SJed Brown PetscInt dof, off, c; 1912552f7358SJed Brown 1913552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1914552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1915552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1916552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1917552f7358SJed Brown PetscInt offS; 1918552f7358SJed Brown 1919552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 19200d644c17SKarl Rupp 1921552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1922552f7358SJed Brown ++offsets[q]; 1923552f7358SJed Brown } 1924552f7358SJed Brown } 1925552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1926552f7358SJed Brown PetscFunctionReturn(0); 1927552f7358SJed Brown } 1928552f7358SJed Brown 1929552f7358SJed Brown #undef __FUNCT__ 1930552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1931552f7358SJed Brown /*@ 1932552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1933552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1934552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1935552f7358SJed Brown the DAG. 1936552f7358SJed Brown 1937552f7358SJed Brown Not collective 1938552f7358SJed Brown 1939552f7358SJed Brown Input Parameter: 1940552f7358SJed Brown . mesh - The DMPlex 1941552f7358SJed Brown 1942552f7358SJed Brown Output Parameter: 1943552f7358SJed Brown 1944552f7358SJed Brown Notes: 1945552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1946552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1947552f7358SJed Brown 1948552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1949552f7358SJed Brown 1950552f7358SJed Brown Level: beginner 1951552f7358SJed Brown 1952552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1953552f7358SJed Brown @*/ 1954552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1955552f7358SJed Brown { 1956aa50250dSMatthew G. Knepley DMLabel label; 1957552f7358SJed Brown PetscInt pStart, pEnd, p; 1958552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1959552f7358SJed Brown PetscErrorCode ierr; 1960552f7358SJed Brown 1961552f7358SJed Brown PetscFunctionBegin; 1962552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1963552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1964552f7358SJed Brown /* Calculate depth */ 1965aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1966aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1967aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1968552f7358SJed Brown /* Initialize roots and count leaves */ 1969552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1970552f7358SJed Brown PetscInt coneSize, supportSize; 1971552f7358SJed Brown 1972552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1973552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1974552f7358SJed Brown if (!coneSize && supportSize) { 1975552f7358SJed Brown ++numRoots; 1976aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1977552f7358SJed Brown } else if (!supportSize && coneSize) { 1978552f7358SJed Brown ++numLeaves; 1979552f7358SJed Brown } else if (!supportSize && !coneSize) { 1980552f7358SJed Brown /* Isolated points */ 1981aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1982552f7358SJed Brown } 1983552f7358SJed Brown } 1984552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1985552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1986552f7358SJed Brown PetscInt coneSize, supportSize; 1987552f7358SJed Brown 1988552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1989552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1990552f7358SJed Brown if (!supportSize && coneSize) { 1991aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1992552f7358SJed Brown } 1993552f7358SJed Brown } 1994552f7358SJed Brown } else { 199574ef644bSMatthew G. Knepley IS pointIS; 199674ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1997552f7358SJed Brown 199874ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 199974ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 200074ef644bSMatthew G. Knepley while (numPoints) { 200174ef644bSMatthew G. Knepley const PetscInt *points; 200274ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 200374ef644bSMatthew G. Knepley 200474ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 200574ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 200674ef644bSMatthew G. Knepley const PetscInt point = points[p]; 200774ef644bSMatthew G. Knepley const PetscInt *support; 200874ef644bSMatthew G. Knepley PetscInt supportSize, s; 200974ef644bSMatthew G. Knepley 201074ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 201174ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 201274ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 201374ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 2014552f7358SJed Brown } 2015552f7358SJed Brown } 20165edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 201774ef644bSMatthew G. Knepley ++level; 201874ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 201974ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 202074ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 202174ef644bSMatthew G. Knepley else {numPoints = 0;} 202274ef644bSMatthew G. Knepley } 202374ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 202474ef644bSMatthew G. Knepley } 2025552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 2026552f7358SJed Brown PetscFunctionReturn(0); 2027552f7358SJed Brown } 2028552f7358SJed Brown 2029552f7358SJed Brown #undef __FUNCT__ 2030552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 2031552f7358SJed Brown /*@C 2032552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 2033552f7358SJed Brown 2034552f7358SJed Brown Not Collective 2035552f7358SJed Brown 2036552f7358SJed Brown Input Parameters: 2037552f7358SJed Brown + dm - The DMPlex object 2038552f7358SJed Brown . numPoints - The number of input points for the join 2039552f7358SJed Brown - points - The input points 2040552f7358SJed Brown 2041552f7358SJed Brown Output Parameters: 2042552f7358SJed Brown + numCoveredPoints - The number of points in the join 2043552f7358SJed Brown - coveredPoints - The points in the join 2044552f7358SJed Brown 2045552f7358SJed Brown Level: intermediate 2046552f7358SJed Brown 2047552f7358SJed Brown Note: Currently, this is restricted to a single level join 2048552f7358SJed Brown 20493813dfbdSMatthew G Knepley Fortran Notes: 20503813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20513813dfbdSMatthew G Knepley include petsc.h90 in your code. 20523813dfbdSMatthew G Knepley 20533813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20543813dfbdSMatthew G Knepley 2055552f7358SJed Brown .keywords: mesh 2056552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 2057552f7358SJed Brown @*/ 2058552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2059552f7358SJed Brown { 2060552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2061552f7358SJed Brown PetscInt *join[2]; 2062552f7358SJed Brown PetscInt joinSize, i = 0; 2063552f7358SJed Brown PetscInt dof, off, p, c, m; 2064552f7358SJed Brown PetscErrorCode ierr; 2065552f7358SJed Brown 2066552f7358SJed Brown PetscFunctionBegin; 2067552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2068552f7358SJed Brown PetscValidPointer(points, 2); 2069552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2070552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2071552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 2072552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 2073552f7358SJed Brown /* Copy in support of first point */ 2074552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 2075552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 2076552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 2077552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 2078552f7358SJed Brown } 2079552f7358SJed Brown /* Check each successive support */ 2080552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2081552f7358SJed Brown PetscInt newJoinSize = 0; 2082552f7358SJed Brown 2083552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 2084552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 2085552f7358SJed Brown for (c = 0; c < dof; ++c) { 2086552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 2087552f7358SJed Brown 2088552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 2089552f7358SJed Brown if (point == join[i][m]) { 2090552f7358SJed Brown join[1-i][newJoinSize++] = point; 2091552f7358SJed Brown break; 2092552f7358SJed Brown } 2093552f7358SJed Brown } 2094552f7358SJed Brown } 2095552f7358SJed Brown joinSize = newJoinSize; 2096552f7358SJed Brown i = 1-i; 2097552f7358SJed Brown } 2098552f7358SJed Brown *numCoveredPoints = joinSize; 2099552f7358SJed Brown *coveredPoints = join[i]; 2100552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 2101552f7358SJed Brown PetscFunctionReturn(0); 2102552f7358SJed Brown } 2103552f7358SJed Brown 2104552f7358SJed Brown #undef __FUNCT__ 2105552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 2106552f7358SJed Brown /*@C 2107552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 2108552f7358SJed Brown 2109552f7358SJed Brown Not Collective 2110552f7358SJed Brown 2111552f7358SJed Brown Input Parameters: 2112552f7358SJed Brown + dm - The DMPlex object 2113552f7358SJed Brown . numPoints - The number of input points for the join 2114552f7358SJed Brown - points - The input points 2115552f7358SJed Brown 2116552f7358SJed Brown Output Parameters: 2117552f7358SJed Brown + numCoveredPoints - The number of points in the join 2118552f7358SJed Brown - coveredPoints - The points in the join 2119552f7358SJed Brown 21203813dfbdSMatthew G Knepley Fortran Notes: 21213813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21223813dfbdSMatthew G Knepley include petsc.h90 in your code. 21233813dfbdSMatthew G Knepley 21243813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21253813dfbdSMatthew G Knepley 2126552f7358SJed Brown Level: intermediate 2127552f7358SJed Brown 2128552f7358SJed Brown .keywords: mesh 2129552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 2130552f7358SJed Brown @*/ 2131552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2132552f7358SJed Brown { 2133552f7358SJed Brown PetscErrorCode ierr; 2134552f7358SJed Brown 2135552f7358SJed Brown PetscFunctionBegin; 2136552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2137d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2138d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2139d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 2140552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2141d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2142552f7358SJed Brown PetscFunctionReturn(0); 2143552f7358SJed Brown } 2144552f7358SJed Brown 2145552f7358SJed Brown #undef __FUNCT__ 2146552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 2147552f7358SJed Brown /*@C 2148552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 2149552f7358SJed Brown 2150552f7358SJed Brown Not Collective 2151552f7358SJed Brown 2152552f7358SJed Brown Input Parameters: 2153552f7358SJed Brown + dm - The DMPlex object 2154552f7358SJed Brown . numPoints - The number of input points for the join 2155552f7358SJed Brown - points - The input points 2156552f7358SJed Brown 2157552f7358SJed Brown Output Parameters: 2158552f7358SJed Brown + numCoveredPoints - The number of points in the join 2159552f7358SJed Brown - coveredPoints - The points in the join 2160552f7358SJed Brown 21613813dfbdSMatthew G Knepley Fortran Notes: 21623813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21633813dfbdSMatthew G Knepley include petsc.h90 in your code. 21643813dfbdSMatthew G Knepley 21653813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21663813dfbdSMatthew G Knepley 2167552f7358SJed Brown Level: intermediate 2168552f7358SJed Brown 2169552f7358SJed Brown .keywords: mesh 2170552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 2171552f7358SJed Brown @*/ 2172552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2173552f7358SJed Brown { 2174552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2175552f7358SJed Brown PetscInt *offsets, **closures; 2176552f7358SJed Brown PetscInt *join[2]; 2177552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 2178552f7358SJed Brown PetscInt p, d, c, m; 2179552f7358SJed Brown PetscErrorCode ierr; 2180552f7358SJed Brown 2181552f7358SJed Brown PetscFunctionBegin; 2182552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2183552f7358SJed Brown PetscValidPointer(points, 2); 2184552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2185552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2186552f7358SJed Brown 2187552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 21881795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 2189552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2190e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 2191552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 2192552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 2193552f7358SJed Brown 2194552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2195552f7358SJed Brown PetscInt closureSize; 2196552f7358SJed Brown 2197552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 21980d644c17SKarl Rupp 2199552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 2200552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2201552f7358SJed Brown PetscInt pStart, pEnd, i; 2202552f7358SJed Brown 2203552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 2204552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 2205552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2206552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 2207552f7358SJed Brown break; 2208552f7358SJed Brown } 2209552f7358SJed Brown } 2210552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 2211552f7358SJed Brown } 221282f516ccSBarry Smith if (offsets[p*(depth+2)+depth+1] != closureSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Total size of closure %D should be %D", offsets[p*(depth+2)+depth+1], closureSize); 2213552f7358SJed Brown } 2214552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2215552f7358SJed Brown PetscInt dof; 2216552f7358SJed Brown 2217552f7358SJed Brown /* Copy in support of first point */ 2218552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 2219552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 2220552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 2221552f7358SJed Brown } 2222552f7358SJed Brown /* Check each successive cone */ 2223552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 2224552f7358SJed Brown PetscInt newJoinSize = 0; 2225552f7358SJed Brown 2226552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 2227552f7358SJed Brown for (c = 0; c < dof; ++c) { 2228552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 2229552f7358SJed Brown 2230552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 2231552f7358SJed Brown if (point == join[i][m]) { 2232552f7358SJed Brown join[1-i][newJoinSize++] = point; 2233552f7358SJed Brown break; 2234552f7358SJed Brown } 2235552f7358SJed Brown } 2236552f7358SJed Brown } 2237552f7358SJed Brown joinSize = newJoinSize; 2238552f7358SJed Brown i = 1-i; 2239552f7358SJed Brown } 2240552f7358SJed Brown if (joinSize) break; 2241552f7358SJed Brown } 2242552f7358SJed Brown *numCoveredPoints = joinSize; 2243552f7358SJed Brown *coveredPoints = join[i]; 2244552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 22450298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 2246552f7358SJed Brown } 2247552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2248552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2249552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 2250552f7358SJed Brown PetscFunctionReturn(0); 2251552f7358SJed Brown } 2252552f7358SJed Brown 2253552f7358SJed Brown #undef __FUNCT__ 2254552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 2255552f7358SJed Brown /*@C 2256552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 2257552f7358SJed Brown 2258552f7358SJed Brown Not Collective 2259552f7358SJed Brown 2260552f7358SJed Brown Input Parameters: 2261552f7358SJed Brown + dm - The DMPlex object 2262552f7358SJed Brown . numPoints - The number of input points for the meet 2263552f7358SJed Brown - points - The input points 2264552f7358SJed Brown 2265552f7358SJed Brown Output Parameters: 2266552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2267552f7358SJed Brown - coveredPoints - The points in the meet 2268552f7358SJed Brown 2269552f7358SJed Brown Level: intermediate 2270552f7358SJed Brown 2271552f7358SJed Brown Note: Currently, this is restricted to a single level meet 2272552f7358SJed Brown 22733813dfbdSMatthew G Knepley Fortran Notes: 22743813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 22753813dfbdSMatthew G Knepley include petsc.h90 in your code. 22763813dfbdSMatthew G Knepley 22773813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 22783813dfbdSMatthew G Knepley 2279552f7358SJed Brown .keywords: mesh 2280552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 2281552f7358SJed Brown @*/ 2282552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 2283552f7358SJed Brown { 2284552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2285552f7358SJed Brown PetscInt *meet[2]; 2286552f7358SJed Brown PetscInt meetSize, i = 0; 2287552f7358SJed Brown PetscInt dof, off, p, c, m; 2288552f7358SJed Brown PetscErrorCode ierr; 2289552f7358SJed Brown 2290552f7358SJed Brown PetscFunctionBegin; 2291552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2292552f7358SJed Brown PetscValidPointer(points, 2); 2293552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2294552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2295552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2296552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2297552f7358SJed Brown /* Copy in cone of first point */ 2298552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2299552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2300552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2301552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2302552f7358SJed Brown } 2303552f7358SJed Brown /* Check each successive cone */ 2304552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2305552f7358SJed Brown PetscInt newMeetSize = 0; 2306552f7358SJed Brown 2307552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2308552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2309552f7358SJed Brown for (c = 0; c < dof; ++c) { 2310552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2311552f7358SJed Brown 2312552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2313552f7358SJed Brown if (point == meet[i][m]) { 2314552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2315552f7358SJed Brown break; 2316552f7358SJed Brown } 2317552f7358SJed Brown } 2318552f7358SJed Brown } 2319552f7358SJed Brown meetSize = newMeetSize; 2320552f7358SJed Brown i = 1-i; 2321552f7358SJed Brown } 2322552f7358SJed Brown *numCoveringPoints = meetSize; 2323552f7358SJed Brown *coveringPoints = meet[i]; 2324552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2325552f7358SJed Brown PetscFunctionReturn(0); 2326552f7358SJed Brown } 2327552f7358SJed Brown 2328552f7358SJed Brown #undef __FUNCT__ 2329552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2330552f7358SJed Brown /*@C 2331552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2332552f7358SJed Brown 2333552f7358SJed Brown Not Collective 2334552f7358SJed Brown 2335552f7358SJed Brown Input Parameters: 2336552f7358SJed Brown + dm - The DMPlex object 2337552f7358SJed Brown . numPoints - The number of input points for the meet 2338552f7358SJed Brown - points - The input points 2339552f7358SJed Brown 2340552f7358SJed Brown Output Parameters: 2341552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2342552f7358SJed Brown - coveredPoints - The points in the meet 2343552f7358SJed Brown 2344552f7358SJed Brown Level: intermediate 2345552f7358SJed Brown 23463813dfbdSMatthew G Knepley Fortran Notes: 23473813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 23483813dfbdSMatthew G Knepley include petsc.h90 in your code. 23493813dfbdSMatthew G Knepley 23503813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 23513813dfbdSMatthew G Knepley 2352552f7358SJed Brown .keywords: mesh 2353552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2354552f7358SJed Brown @*/ 2355552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2356552f7358SJed Brown { 2357552f7358SJed Brown PetscErrorCode ierr; 2358552f7358SJed Brown 2359552f7358SJed Brown PetscFunctionBegin; 2360552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2361d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2362d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2363d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2364552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2365d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2366552f7358SJed Brown PetscFunctionReturn(0); 2367552f7358SJed Brown } 2368552f7358SJed Brown 2369552f7358SJed Brown #undef __FUNCT__ 2370552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2371552f7358SJed Brown /*@C 2372552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2373552f7358SJed Brown 2374552f7358SJed Brown Not Collective 2375552f7358SJed Brown 2376552f7358SJed Brown Input Parameters: 2377552f7358SJed Brown + dm - The DMPlex object 2378552f7358SJed Brown . numPoints - The number of input points for the meet 2379552f7358SJed Brown - points - The input points 2380552f7358SJed Brown 2381552f7358SJed Brown Output Parameters: 2382552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2383552f7358SJed Brown - coveredPoints - The points in the meet 2384552f7358SJed Brown 2385552f7358SJed Brown Level: intermediate 2386552f7358SJed Brown 23873813dfbdSMatthew G Knepley Fortran Notes: 23883813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 23893813dfbdSMatthew G Knepley include petsc.h90 in your code. 23903813dfbdSMatthew G Knepley 23913813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 23923813dfbdSMatthew G Knepley 2393552f7358SJed Brown .keywords: mesh 2394552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2395552f7358SJed Brown @*/ 2396552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2397552f7358SJed Brown { 2398552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2399552f7358SJed Brown PetscInt *offsets, **closures; 2400552f7358SJed Brown PetscInt *meet[2]; 2401552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2402552f7358SJed Brown PetscInt p, h, c, m; 2403552f7358SJed Brown PetscErrorCode ierr; 2404552f7358SJed Brown 2405552f7358SJed Brown PetscFunctionBegin; 2406552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2407552f7358SJed Brown PetscValidPointer(points, 2); 2408552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2409552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2410552f7358SJed Brown 2411552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2412785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2413552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2414e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2415552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2416552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2417552f7358SJed Brown 2418552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2419552f7358SJed Brown PetscInt closureSize; 2420552f7358SJed Brown 2421552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 24220d644c17SKarl Rupp 2423552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2424552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2425552f7358SJed Brown PetscInt pStart, pEnd, i; 2426552f7358SJed Brown 2427552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2428552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2429552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2430552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2431552f7358SJed Brown break; 2432552f7358SJed Brown } 2433552f7358SJed Brown } 2434552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2435552f7358SJed Brown } 243682f516ccSBarry Smith if (offsets[p*(height+2)+height+1] != closureSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Total size of closure %D should be %D", offsets[p*(height+2)+height+1], closureSize); 2437552f7358SJed Brown } 2438552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2439552f7358SJed Brown PetscInt dof; 2440552f7358SJed Brown 2441552f7358SJed Brown /* Copy in cone of first point */ 2442552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2443552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2444552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2445552f7358SJed Brown } 2446552f7358SJed Brown /* Check each successive cone */ 2447552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2448552f7358SJed Brown PetscInt newMeetSize = 0; 2449552f7358SJed Brown 2450552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2451552f7358SJed Brown for (c = 0; c < dof; ++c) { 2452552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2453552f7358SJed Brown 2454552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2455552f7358SJed Brown if (point == meet[i][m]) { 2456552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2457552f7358SJed Brown break; 2458552f7358SJed Brown } 2459552f7358SJed Brown } 2460552f7358SJed Brown } 2461552f7358SJed Brown meetSize = newMeetSize; 2462552f7358SJed Brown i = 1-i; 2463552f7358SJed Brown } 2464552f7358SJed Brown if (meetSize) break; 2465552f7358SJed Brown } 2466552f7358SJed Brown *numCoveredPoints = meetSize; 2467552f7358SJed Brown *coveredPoints = meet[i]; 2468552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 24690298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2470552f7358SJed Brown } 2471552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2472552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2473552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2474552f7358SJed Brown PetscFunctionReturn(0); 2475552f7358SJed Brown } 2476552f7358SJed Brown 2477552f7358SJed Brown #undef __FUNCT__ 24784e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 24794e3744c5SMatthew G. Knepley /*@C 24804e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 24814e3744c5SMatthew G. Knepley 24824e3744c5SMatthew G. Knepley Not Collective 24834e3744c5SMatthew G. Knepley 24844e3744c5SMatthew G. Knepley Input Parameters: 24854e3744c5SMatthew G. Knepley + dmA - A DMPlex object 24864e3744c5SMatthew G. Knepley - dmB - A DMPlex object 24874e3744c5SMatthew G. Knepley 24884e3744c5SMatthew G. Knepley Output Parameters: 24894e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 24904e3744c5SMatthew G. Knepley 24914e3744c5SMatthew G. Knepley Level: intermediate 24924e3744c5SMatthew G. Knepley 24934e3744c5SMatthew G. Knepley Notes: 24944e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 24954e3744c5SMatthew G. Knepley 24964e3744c5SMatthew G. Knepley .keywords: mesh 24974e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 24984e3744c5SMatthew G. Knepley @*/ 24994e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 25004e3744c5SMatthew G. Knepley { 25014e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 25024e3744c5SMatthew G. Knepley PetscErrorCode ierr; 25034e3744c5SMatthew G. Knepley 25044e3744c5SMatthew G. Knepley PetscFunctionBegin; 25054e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 25064e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 25074e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 25084e3744c5SMatthew G. Knepley 25094e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 25104e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 25114e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 25124e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 25134e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 25144e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 25154e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 25164e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 25174e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 25184e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 25194e3744c5SMatthew G. Knepley 25204e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 25214e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 25224e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 25234e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 25244e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 25254e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 25264e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 25274e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 25284e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 25294e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 25304e3744c5SMatthew G. Knepley } 25314e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 25324e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 25334e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 25344e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 25354e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 25364e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 25374e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 25384e3744c5SMatthew G. Knepley } 25394e3744c5SMatthew G. Knepley } 25404e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 25414e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 25424e3744c5SMatthew G. Knepley } 25434e3744c5SMatthew G. Knepley 25444e3744c5SMatthew G. Knepley #undef __FUNCT__ 254518ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 254618ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2547a6dfd86eSKarl Rupp { 254882f516ccSBarry Smith MPI_Comm comm; 2549552f7358SJed Brown PetscErrorCode ierr; 2550552f7358SJed Brown 2551552f7358SJed Brown PetscFunctionBegin; 255282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2553552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2554552f7358SJed Brown switch (cellDim) { 2555552f7358SJed Brown case 0: 2556552f7358SJed Brown *numFaceVertices = 0; 2557552f7358SJed Brown break; 2558552f7358SJed Brown case 1: 2559552f7358SJed Brown *numFaceVertices = 1; 2560552f7358SJed Brown break; 2561552f7358SJed Brown case 2: 2562552f7358SJed Brown switch (numCorners) { 256319436ca2SJed Brown case 3: /* triangle */ 256419436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2565552f7358SJed Brown break; 256619436ca2SJed Brown case 4: /* quadrilateral */ 256719436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2568552f7358SJed Brown break; 256919436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 257019436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2571552f7358SJed Brown break; 257219436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 257319436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2574552f7358SJed Brown break; 2575552f7358SJed Brown default: 2576552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2577552f7358SJed Brown } 2578552f7358SJed Brown break; 2579552f7358SJed Brown case 3: 2580552f7358SJed Brown switch (numCorners) { 258119436ca2SJed Brown case 4: /* tetradehdron */ 258219436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2583552f7358SJed Brown break; 258419436ca2SJed Brown case 6: /* tet cohesive cells */ 258519436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2586552f7358SJed Brown break; 258719436ca2SJed Brown case 8: /* hexahedron */ 258819436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2589552f7358SJed Brown break; 259019436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 259119436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2592552f7358SJed Brown break; 259319436ca2SJed Brown case 10: /* quadratic tetrahedron */ 259419436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2595552f7358SJed Brown break; 259619436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 259719436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2598552f7358SJed Brown break; 259919436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 260019436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2601552f7358SJed Brown break; 260219436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 260319436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2604552f7358SJed Brown break; 2605552f7358SJed Brown default: 2606552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2607552f7358SJed Brown } 2608552f7358SJed Brown break; 2609552f7358SJed Brown default: 2610552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2611552f7358SJed Brown } 2612552f7358SJed Brown PetscFunctionReturn(0); 2613552f7358SJed Brown } 2614552f7358SJed Brown 2615552f7358SJed Brown #undef __FUNCT__ 2616d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2617d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2618d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2619d27a0f52SMatthew G. Knepley { 2620a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2621a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2622a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2623d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2624d27a0f52SMatthew G. Knepley 2625d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2626d27a0f52SMatthew G. Knepley /* Truth Table 2627d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2628d27a0f52SMatthew G. Knepley F 0 flips no F F F 2629d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2630d27a0f52SMatthew G. Knepley F 2 flips no T F T 2631d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2632d27a0f52SMatthew G. Knepley T 1 flip no 2633d27a0f52SMatthew G. Knepley T 2 flips yes 2634d27a0f52SMatthew G. Knepley */ 2635a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2636d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2637a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2638d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2639a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2640a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2641a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2642a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2643a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2644a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2645785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2646a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2647a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2648defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2649a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2650a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2651a1b4d4a2SMatthew G. Knepley 2652a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2653a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2654a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2655a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2656a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2657a1b4d4a2SMatthew G. Knepley } 2658a1b4d4a2SMatthew G. Knepley } 2659a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2660a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2661d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2662a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2663d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2664d27a0f52SMatthew G. Knepley 2665a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2666a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2667a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2668d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2669d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2670a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 267186cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2672a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 267386cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2674d27a0f52SMatthew G. Knepley 2675d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2676d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2677d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2678d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2679d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2680d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2681a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2682a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2683a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2684a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2685a1b4d4a2SMatthew G. Knepley } 2686a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2687a1b4d4a2SMatthew G. Knepley if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart); 2688a1b4d4a2SMatthew G. Knepley } 2689a1b4d4a2SMatthew G. Knepley if (posA < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[0]); 2690a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2691a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2692a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2693a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2694a1b4d4a2SMatthew G. Knepley } 2695a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2696a1b4d4a2SMatthew G. Knepley if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart); 2697a1b4d4a2SMatthew G. Knepley } 2698a1b4d4a2SMatthew G. Knepley if (posB < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[1]); 2699d27a0f52SMatthew G. Knepley 2700d27a0f52SMatthew G. Knepley if (dim == 1) { 2701d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2702d27a0f52SMatthew G. Knepley } else { 2703d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2704d27a0f52SMatthew G. Knepley } 2705d27a0f52SMatthew G. Knepley 2706d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2707d27a0f52SMatthew G. Knepley if (seenA && seenB) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen cells %d and %d do not match: Fault mesh is non-orientable", support[0], support[1]); 2708d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2709a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2710d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2711a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2712d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 271386cff514SMatthew G. Knepley } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable"); 2714a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2715a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2716d27a0f52SMatthew G. Knepley } 2717fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2718fedde076SMatthew G. Knepley { 2719fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2720fedde076SMatthew G. Knepley PetscSF sf; 2721fedde076SMatthew G. Knepley const PetscInt *lpoints; 2722fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 272313048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2724fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2725a1b4d4a2SMatthew G. Knepley 2726fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2727fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2728fedde076SMatthew G. Knepley if (numLeaves >= 0) { 272962ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 273062ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 273162ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 273213048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 273362ad4a6aSMatthew G. Knepley 2734fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2735fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2736fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2737fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2738fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2739fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2740fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2741fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2742fedde076SMatthew G. Knepley PetscInt supportSize; 2743fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2744fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2745fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2746fedde076SMatthew G. Knepley } 2747fedde076SMatthew G. Knepley } 2748fedde076SMatthew G. Knepley } 274913048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2750fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2751fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2752fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2753fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2754fedde076SMatthew G. Knepley 2755fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 275662ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2757fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2758fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 27595b7033fcSMatthew G. Knepley if (dim == 1) { 27605b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 27615b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 27625b7033fcSMatthew G. Knepley } else { 2763fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2764fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2765fedde076SMatthew G. Knepley } 27665b7033fcSMatthew G. Knepley } 2767fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2768fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2769fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2770fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2771fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2772fedde076SMatthew G. Knepley 277313048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 277413048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 277513048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2776fedde076SMatthew G. Knepley } 277713048561SMatthew G. Knepley /* Collect the graph on 0 */ 277813048561SMatthew G. Knepley { 277913048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 278013048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 278113048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 278213048561SMatthew G. Knepley PetscInt *adj = NULL; 278313048561SMatthew G. Knepley PetscBool *val = NULL; 278413048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 278513048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 278613048561SMatthew G. Knepley PetscInt debug = 0; 278713048561SMatthew G. Knepley 278813048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 278913048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 279013048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 279113048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 279213048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 279313048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 279413048561SMatthew G. Knepley } 279513048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 279613048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 279713048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 279813048561SMatthew G. Knepley if (debug) { 279913048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 280013048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 280113048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 280213048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 280313048561SMatthew G. Knepley } 280413048561SMatthew G. Knepley } 280513048561SMatthew G. Knepley } 280613048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 280713048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 280813048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 280913048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 281013048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 281113048561SMatthew G. Knepley pTop = pBottom = 0; 281213048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 281313048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 281413048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 281513048561SMatthew G. Knepley procFIFO[pBottom++] = p; 281613048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 281713048561SMatthew G. Knepley /* Consider each proc in FIFO */ 281813048561SMatthew G. Knepley while (pTop < pBottom) { 281913048561SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch; 282013048561SMatthew G. Knepley 282113048561SMatthew G. Knepley proc = procFIFO[pTop++]; 282213048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 282313048561SMatthew G. Knepley /* Loop over neighboring procs */ 282413048561SMatthew G. Knepley for (n = 0; n < recvcounts[proc]; ++n) { 282513048561SMatthew G. Knepley nproc = adj[displs[proc]+n]; 282613048561SMatthew G. Knepley mismatch = val[displs[proc]+n] ? 0 : 1; 282713048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 282813048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 282913048561SMatthew G. Knepley 283013048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 283113048561SMatthew G. Knepley if (seen) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen procs %d and %d do not match: Fault mesh is non-orientable", proc, nproc); 283213048561SMatthew G. Knepley if (!flippedB) { 283313048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 283413048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 283513048561SMatthew G. Knepley } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable"); 283613048561SMatthew G. Knepley if (!seen) { 283713048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 283813048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 283913048561SMatthew G. Knepley } 284013048561SMatthew G. Knepley } 284113048561SMatthew G. Knepley } 284213048561SMatthew G. Knepley } 284313048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 284413048561SMatthew G. Knepley 284513048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 284613048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 284713048561SMatthew G. Knepley { 284813048561SMatthew G. Knepley PetscBool *flips; 284913048561SMatthew G. Knepley 285013048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 285113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 285213048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 285313048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 285413048561SMatthew G. Knepley } 285513048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 285613048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 285713048561SMatthew G. Knepley } 285813048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 285913048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 286013048561SMatthew G. Knepley } 286113048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2862fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 286313048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2864fedde076SMatthew G. Knepley } 2865fedde076SMatthew G. Knepley } 2866fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2867d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2868d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2869d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2870a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2871f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2872f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2873d27a0f52SMatthew G. Knepley 2874a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2875a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2876a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2877a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2878a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2879a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2880a1b4d4a2SMatthew G. Knepley 2881a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2882a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2883a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2884d27a0f52SMatthew G. Knepley } 2885a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2886a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2887f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2888f4e909fcSMatthew G. Knepley faceSize = coneSize; 2889f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2890f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2891f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2892f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2893f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2894f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2895f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2896f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2897f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2898f4e909fcSMatthew G. Knepley } 2899f4e909fcSMatthew G. Knepley } 2900d27a0f52SMatthew G. Knepley } 2901d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2902d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2903d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2904a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2905a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2906a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2907d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2908d27a0f52SMatthew G. Knepley } 2909d27a0f52SMatthew G. Knepley 2910d27a0f52SMatthew G. Knepley #undef __FUNCT__ 29119db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 29129db3b87dSMatthew G. Knepley /*@C 29139db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 29149db3b87dSMatthew G. Knepley 29159db3b87dSMatthew G. Knepley Input Parameters: 29169db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 29179db3b87dSMatthew G. Knepley - cone - The incoming cone 29189db3b87dSMatthew G. Knepley 29199db3b87dSMatthew G. Knepley Output Parameter: 29209db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 29219db3b87dSMatthew G. Knepley 29229db3b87dSMatthew G. Knepley Level: developer 29239db3b87dSMatthew G. Knepley 29249db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 29259db3b87dSMatthew G. Knepley @*/ 29269db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 29272e1b13c2SMatthew G. Knepley { 29289db3b87dSMatthew G. Knepley int tmpc; 29292e1b13c2SMatthew G. Knepley 29302e1b13c2SMatthew G. Knepley PetscFunctionBegin; 29319db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 29329db3b87dSMatthew G. Knepley switch (numCorners) { 29339db3b87dSMatthew G. Knepley case 4: 29341885f254SMatthew G. Knepley tmpc = cone[0]; 29351885f254SMatthew G. Knepley cone[0] = cone[1]; 29361885f254SMatthew G. Knepley cone[1] = tmpc; 29379db3b87dSMatthew G. Knepley break; 29389db3b87dSMatthew G. Knepley case 8: 29399db3b87dSMatthew G. Knepley tmpc = cone[1]; 29409db3b87dSMatthew G. Knepley cone[1] = cone[3]; 29419db3b87dSMatthew G. Knepley cone[3] = tmpc; 29429db3b87dSMatthew G. Knepley break; 29439db3b87dSMatthew G. Knepley default: break; 29449db3b87dSMatthew G. Knepley } 29459db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 29469db3b87dSMatthew G. Knepley } 29479db3b87dSMatthew G. Knepley 29489db3b87dSMatthew G. Knepley #undef __FUNCT__ 29499db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 29509db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 29519db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 29529db3b87dSMatthew G. Knepley { 29539db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 29549db3b87dSMatthew G. Knepley PetscErrorCode ierr; 29559db3b87dSMatthew G. Knepley 29569db3b87dSMatthew G. Knepley PetscFunctionBegin; 29579db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 29589db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 29592e1b13c2SMatthew G. Knepley } 29602e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 29612e1b13c2SMatthew G. Knepley } 29622e1b13c2SMatthew G. Knepley 2963519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2964552f7358SJed Brown #include <triangle.h> 2965552f7358SJed Brown 2966552f7358SJed Brown #undef __FUNCT__ 2967552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 29680adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 29690adebc6cSBarry Smith { 2970552f7358SJed Brown PetscFunctionBegin; 2971552f7358SJed Brown inputCtx->numberofpoints = 0; 2972552f7358SJed Brown inputCtx->numberofpointattributes = 0; 29730298fd71SBarry Smith inputCtx->pointlist = NULL; 29740298fd71SBarry Smith inputCtx->pointattributelist = NULL; 29750298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2976552f7358SJed Brown inputCtx->numberofsegments = 0; 29770298fd71SBarry Smith inputCtx->segmentlist = NULL; 29780298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2979552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 29800298fd71SBarry Smith inputCtx->trianglelist = NULL; 2981552f7358SJed Brown inputCtx->numberofholes = 0; 29820298fd71SBarry Smith inputCtx->holelist = NULL; 2983552f7358SJed Brown inputCtx->numberofregions = 0; 29840298fd71SBarry Smith inputCtx->regionlist = NULL; 2985552f7358SJed Brown PetscFunctionReturn(0); 2986552f7358SJed Brown } 2987552f7358SJed Brown 2988552f7358SJed Brown #undef __FUNCT__ 2989552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 29900adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 29910adebc6cSBarry Smith { 2992552f7358SJed Brown PetscFunctionBegin; 2993552f7358SJed Brown outputCtx->numberofpoints = 0; 29940298fd71SBarry Smith outputCtx->pointlist = NULL; 29950298fd71SBarry Smith outputCtx->pointattributelist = NULL; 29960298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2997552f7358SJed Brown outputCtx->numberoftriangles = 0; 29980298fd71SBarry Smith outputCtx->trianglelist = NULL; 29990298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 30000298fd71SBarry Smith outputCtx->neighborlist = NULL; 30010298fd71SBarry Smith outputCtx->segmentlist = NULL; 30020298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 3003552f7358SJed Brown outputCtx->numberofedges = 0; 30040298fd71SBarry Smith outputCtx->edgelist = NULL; 30050298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 3006552f7358SJed Brown PetscFunctionReturn(0); 3007552f7358SJed Brown } 3008552f7358SJed Brown 3009552f7358SJed Brown #undef __FUNCT__ 3010552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 30110adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 30120adebc6cSBarry Smith { 3013552f7358SJed Brown PetscFunctionBegin; 301423b0c128SMatthew G. Knepley free(outputCtx->pointlist); 3015552f7358SJed Brown free(outputCtx->pointmarkerlist); 301623b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 301723b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 3018552f7358SJed Brown free(outputCtx->edgelist); 3019552f7358SJed Brown free(outputCtx->edgemarkerlist); 3020552f7358SJed Brown free(outputCtx->trianglelist); 3021552f7358SJed Brown free(outputCtx->neighborlist); 3022552f7358SJed Brown PetscFunctionReturn(0); 3023552f7358SJed Brown } 3024552f7358SJed Brown 3025552f7358SJed Brown #undef __FUNCT__ 3026552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 3027552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 3028552f7358SJed Brown { 302982f516ccSBarry Smith MPI_Comm comm; 3030552f7358SJed Brown PetscInt dim = 2; 3031552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 3032552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 3033552f7358SJed Brown struct triangulateio in; 3034552f7358SJed Brown struct triangulateio out; 3035552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 3036552f7358SJed Brown PetscMPIInt rank; 3037552f7358SJed Brown PetscErrorCode ierr; 3038552f7358SJed Brown 3039552f7358SJed Brown PetscFunctionBegin; 304082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3041552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3042552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3043552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3044552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 30450d644c17SKarl Rupp 3046552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3047552f7358SJed Brown if (in.numberofpoints > 0) { 3048552f7358SJed Brown PetscSection coordSection; 3049552f7358SJed Brown Vec coordinates; 3050552f7358SJed Brown PetscScalar *array; 3051552f7358SJed Brown 3052785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3053785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3054552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 305569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3056552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3057552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3058552f7358SJed Brown const PetscInt idx = v - vStart; 3059552f7358SJed Brown PetscInt off, d; 3060552f7358SJed Brown 3061552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3062552f7358SJed Brown for (d = 0; d < dim; ++d) { 3063552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3064552f7358SJed Brown } 3065552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3066552f7358SJed Brown } 3067552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3068552f7358SJed Brown } 3069552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 3070552f7358SJed Brown in.numberofsegments = eEnd - eStart; 3071552f7358SJed Brown if (in.numberofsegments > 0) { 3072785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 3073785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 3074552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 3075552f7358SJed Brown const PetscInt idx = e - eStart; 3076552f7358SJed Brown const PetscInt *cone; 3077552f7358SJed Brown 3078552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 30790d644c17SKarl Rupp 3080552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 3081552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 30820d644c17SKarl Rupp 3083552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 3084552f7358SJed Brown } 3085552f7358SJed Brown } 3086552f7358SJed Brown #if 0 /* Do not currently support holes */ 3087552f7358SJed Brown PetscReal *holeCoords; 3088552f7358SJed Brown PetscInt h, d; 3089552f7358SJed Brown 3090552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3091552f7358SJed Brown if (in.numberofholes > 0) { 3092785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3093552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3094552f7358SJed Brown for (d = 0; d < dim; ++d) { 3095552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3096552f7358SJed Brown } 3097552f7358SJed Brown } 3098552f7358SJed Brown } 3099552f7358SJed Brown #endif 3100552f7358SJed Brown if (!rank) { 3101552f7358SJed Brown char args[32]; 3102552f7358SJed Brown 3103552f7358SJed Brown /* Take away 'Q' for verbose output */ 3104552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3105552f7358SJed Brown if (createConvexHull) { 3106552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 3107552f7358SJed Brown } 3108552f7358SJed Brown if (constrained) { 3109552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 3110552f7358SJed Brown } 31110298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3112552f7358SJed Brown } 3113552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3114552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3115552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3116552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3117552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 3118552f7358SJed Brown 3119552f7358SJed Brown { 3120552f7358SJed Brown const PetscInt numCorners = 3; 3121552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3122552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3123552f7358SJed Brown const int *cells = out.trianglelist; 3124552f7358SJed Brown const double *meshCoords = out.pointlist; 3125552f7358SJed Brown 31260fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3127552f7358SJed Brown /* Set labels */ 3128552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3129552f7358SJed Brown if (out.pointmarkerlist[v]) { 3130552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3131552f7358SJed Brown } 3132552f7358SJed Brown } 3133552f7358SJed Brown if (interpolate) { 3134552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3135552f7358SJed Brown if (out.edgemarkerlist[e]) { 3136552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3137552f7358SJed Brown const PetscInt *edges; 3138552f7358SJed Brown PetscInt numEdges; 3139552f7358SJed Brown 3140552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3141552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3142552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3143552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3144552f7358SJed Brown } 3145552f7358SJed Brown } 3146552f7358SJed Brown } 3147552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3148552f7358SJed Brown } 3149552f7358SJed Brown #if 0 /* Do not currently support holes */ 3150552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3151552f7358SJed Brown #endif 3152552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3153552f7358SJed Brown PetscFunctionReturn(0); 3154552f7358SJed Brown } 3155552f7358SJed Brown 3156552f7358SJed Brown #undef __FUNCT__ 3157552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 3158552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 3159552f7358SJed Brown { 316082f516ccSBarry Smith MPI_Comm comm; 3161552f7358SJed Brown PetscInt dim = 2; 3162552f7358SJed Brown struct triangulateio in; 3163552f7358SJed Brown struct triangulateio out; 3164552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3165552f7358SJed Brown PetscMPIInt rank; 3166552f7358SJed Brown PetscErrorCode ierr; 3167552f7358SJed Brown 3168552f7358SJed Brown PetscFunctionBegin; 316982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3170552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3171552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3172552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3173552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3174552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3175552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31760d644c17SKarl Rupp 3177552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3178552f7358SJed Brown if (in.numberofpoints > 0) { 3179552f7358SJed Brown PetscSection coordSection; 3180552f7358SJed Brown Vec coordinates; 3181552f7358SJed Brown PetscScalar *array; 3182552f7358SJed Brown 3183785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3184785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3185552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 318669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3187552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3188552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3189552f7358SJed Brown const PetscInt idx = v - vStart; 3190552f7358SJed Brown PetscInt off, d; 3191552f7358SJed Brown 3192552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3193552f7358SJed Brown for (d = 0; d < dim; ++d) { 3194552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3195552f7358SJed Brown } 3196552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3197552f7358SJed Brown } 3198552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3199552f7358SJed Brown } 3200552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 32010d644c17SKarl Rupp 3202552f7358SJed Brown in.numberofcorners = 3; 3203552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 32040d644c17SKarl Rupp 3205552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 3206552f7358SJed Brown if (in.numberoftriangles > 0) { 3207785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 3208552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3209552f7358SJed Brown const PetscInt idx = c - cStart; 32100298fd71SBarry Smith PetscInt *closure = NULL; 3211552f7358SJed Brown PetscInt closureSize; 3212552f7358SJed Brown 3213552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3214552f7358SJed Brown if ((closureSize != 4) && (closureSize != 7)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a triangle, %D vertices in closure", closureSize); 3215552f7358SJed Brown for (v = 0; v < 3; ++v) { 3216552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 3217552f7358SJed Brown } 3218552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3219552f7358SJed Brown } 3220552f7358SJed Brown } 3221552f7358SJed Brown /* TODO: Segment markers are missing on input */ 3222552f7358SJed Brown #if 0 /* Do not currently support holes */ 3223552f7358SJed Brown PetscReal *holeCoords; 3224552f7358SJed Brown PetscInt h, d; 3225552f7358SJed Brown 3226552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3227552f7358SJed Brown if (in.numberofholes > 0) { 3228785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3229552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3230552f7358SJed Brown for (d = 0; d < dim; ++d) { 3231552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3232552f7358SJed Brown } 3233552f7358SJed Brown } 3234552f7358SJed Brown } 3235552f7358SJed Brown #endif 3236552f7358SJed Brown if (!rank) { 3237552f7358SJed Brown char args[32]; 3238552f7358SJed Brown 3239552f7358SJed Brown /* Take away 'Q' for verbose output */ 3240552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 32410298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3242552f7358SJed Brown } 3243552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3244552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3245552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3246552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3247552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3248552f7358SJed Brown 3249552f7358SJed Brown { 3250552f7358SJed Brown const PetscInt numCorners = 3; 3251552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3252552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3253552f7358SJed Brown const int *cells = out.trianglelist; 3254552f7358SJed Brown const double *meshCoords = out.pointlist; 3255552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3256552f7358SJed Brown 32570fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3258552f7358SJed Brown /* Set labels */ 3259552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3260552f7358SJed Brown if (out.pointmarkerlist[v]) { 3261552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3262552f7358SJed Brown } 3263552f7358SJed Brown } 3264552f7358SJed Brown if (interpolate) { 3265552f7358SJed Brown PetscInt e; 3266552f7358SJed Brown 3267552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3268552f7358SJed Brown if (out.edgemarkerlist[e]) { 3269552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3270552f7358SJed Brown const PetscInt *edges; 3271552f7358SJed Brown PetscInt numEdges; 3272552f7358SJed Brown 3273552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3274552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3275552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3276552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3277552f7358SJed Brown } 3278552f7358SJed Brown } 3279552f7358SJed Brown } 3280552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3281552f7358SJed Brown } 3282552f7358SJed Brown #if 0 /* Do not currently support holes */ 3283552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3284552f7358SJed Brown #endif 3285552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3286552f7358SJed Brown PetscFunctionReturn(0); 3287552f7358SJed Brown } 3288552f7358SJed Brown #endif 3289552f7358SJed Brown 3290519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3291552f7358SJed Brown #include <tetgen.h> 3292552f7358SJed Brown #undef __FUNCT__ 3293552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3294552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3295552f7358SJed Brown { 329682f516ccSBarry Smith MPI_Comm comm; 3297552f7358SJed Brown const PetscInt dim = 3; 3298552f7358SJed Brown ::tetgenio in; 3299552f7358SJed Brown ::tetgenio out; 3300552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3301552f7358SJed Brown PetscMPIInt rank; 3302552f7358SJed Brown PetscErrorCode ierr; 3303552f7358SJed Brown 3304552f7358SJed Brown PetscFunctionBegin; 330582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3306552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3307552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3308552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3309552f7358SJed Brown if (in.numberofpoints > 0) { 3310552f7358SJed Brown PetscSection coordSection; 3311552f7358SJed Brown Vec coordinates; 3312552f7358SJed Brown PetscScalar *array; 3313552f7358SJed Brown 3314552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3315552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 33160d644c17SKarl Rupp 3317552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 331869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3319552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3320552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3321552f7358SJed Brown const PetscInt idx = v - vStart; 3322552f7358SJed Brown PetscInt off, d; 3323552f7358SJed Brown 3324552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 33250d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3326552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3327552f7358SJed Brown } 3328552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3329552f7358SJed Brown } 3330552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33310d644c17SKarl Rupp 3332552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3333552f7358SJed Brown if (in.numberoffacets > 0) { 3334552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3335552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3336552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3337552f7358SJed Brown const PetscInt idx = f - fStart; 33380298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3339552f7358SJed Brown 3340552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3341552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3342552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3343552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3344552f7358SJed Brown 3345552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3346552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3347552f7358SJed Brown const PetscInt point = points[p]; 33480d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3349552f7358SJed Brown } 3350552f7358SJed Brown 3351552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3352552f7358SJed Brown poly->numberofvertices = numVertices; 3353552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3354552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3355552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3356552f7358SJed Brown poly->vertexlist[v] = vIdx; 3357552f7358SJed Brown } 3358552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3359552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3360552f7358SJed Brown } 3361552f7358SJed Brown } 3362552f7358SJed Brown if (!rank) { 3363552f7358SJed Brown char args[32]; 3364552f7358SJed Brown 3365552f7358SJed Brown /* Take away 'Q' for verbose output */ 3366552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3367552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3368552f7358SJed Brown } 3369552f7358SJed Brown { 3370552f7358SJed Brown const PetscInt numCorners = 4; 3371552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3372552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3373552f7358SJed Brown const double *meshCoords = out.pointlist; 33741d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3375552f7358SJed Brown 33769db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33770fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3378552f7358SJed Brown /* Set labels */ 3379552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3380552f7358SJed Brown if (out.pointmarkerlist[v]) { 3381552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3382552f7358SJed Brown } 3383552f7358SJed Brown } 3384552f7358SJed Brown if (interpolate) { 3385552f7358SJed Brown PetscInt e; 3386552f7358SJed Brown 3387552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3388552f7358SJed Brown if (out.edgemarkerlist[e]) { 3389552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3390552f7358SJed Brown const PetscInt *edges; 3391552f7358SJed Brown PetscInt numEdges; 3392552f7358SJed Brown 3393552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3394552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3395552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3396552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3397552f7358SJed Brown } 3398552f7358SJed Brown } 3399552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3400552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3401552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3402552f7358SJed Brown const PetscInt *faces; 3403552f7358SJed Brown PetscInt numFaces; 3404552f7358SJed Brown 3405552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3406552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3407552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3408552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3409552f7358SJed Brown } 3410552f7358SJed Brown } 3411552f7358SJed Brown } 3412552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3413552f7358SJed Brown } 3414552f7358SJed Brown PetscFunctionReturn(0); 3415552f7358SJed Brown } 3416552f7358SJed Brown 3417552f7358SJed Brown #undef __FUNCT__ 3418552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3419552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3420552f7358SJed Brown { 342182f516ccSBarry Smith MPI_Comm comm; 3422552f7358SJed Brown const PetscInt dim = 3; 3423552f7358SJed Brown ::tetgenio in; 3424552f7358SJed Brown ::tetgenio out; 3425552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3426552f7358SJed Brown PetscMPIInt rank; 3427552f7358SJed Brown PetscErrorCode ierr; 3428552f7358SJed Brown 3429552f7358SJed Brown PetscFunctionBegin; 343082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3431552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3432552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3433552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3434552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 34350d644c17SKarl Rupp 3436552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3437552f7358SJed Brown if (in.numberofpoints > 0) { 3438552f7358SJed Brown PetscSection coordSection; 3439552f7358SJed Brown Vec coordinates; 3440552f7358SJed Brown PetscScalar *array; 3441552f7358SJed Brown 3442552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3443552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 34440d644c17SKarl Rupp 3445552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 344669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3447552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3448552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3449552f7358SJed Brown const PetscInt idx = v - vStart; 3450552f7358SJed Brown PetscInt off, d; 3451552f7358SJed Brown 3452552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 34530d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3454552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3455552f7358SJed Brown } 3456552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3457552f7358SJed Brown } 3458552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34590d644c17SKarl Rupp 3460552f7358SJed Brown in.numberofcorners = 4; 3461552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3462552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3463552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3464552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3465552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3466552f7358SJed Brown const PetscInt idx = c - cStart; 34670298fd71SBarry Smith PetscInt *closure = NULL; 3468552f7358SJed Brown PetscInt closureSize; 3469552f7358SJed Brown 3470552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3471552f7358SJed Brown if ((closureSize != 5) && (closureSize != 15)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a tetrahedron, %D vertices in closure", closureSize); 3472552f7358SJed Brown for (v = 0; v < 4; ++v) { 3473552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3474552f7358SJed Brown } 3475552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3476552f7358SJed Brown } 3477552f7358SJed Brown } 347819436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3479552f7358SJed Brown if (!rank) { 3480552f7358SJed Brown char args[32]; 3481552f7358SJed Brown 3482552f7358SJed Brown /* Take away 'Q' for verbose output */ 348319436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3484552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3485552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3486552f7358SJed Brown } 3487552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3488552f7358SJed Brown 3489552f7358SJed Brown { 3490552f7358SJed Brown const PetscInt numCorners = 4; 3491552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3492552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3493552f7358SJed Brown const double *meshCoords = out.pointlist; 34941d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 34951d4b4d7bSJed Brown 3496552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3497552f7358SJed Brown 34989db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 34990fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3500552f7358SJed Brown /* Set labels */ 3501552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3502552f7358SJed Brown if (out.pointmarkerlist[v]) { 3503552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3504552f7358SJed Brown } 3505552f7358SJed Brown } 3506552f7358SJed Brown if (interpolate) { 3507552f7358SJed Brown PetscInt e, f; 3508552f7358SJed Brown 3509552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3510552f7358SJed Brown if (out.edgemarkerlist[e]) { 3511552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3512552f7358SJed Brown const PetscInt *edges; 3513552f7358SJed Brown PetscInt numEdges; 3514552f7358SJed Brown 3515552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3516552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3517552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3518552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3519552f7358SJed Brown } 3520552f7358SJed Brown } 3521552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3522552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3523552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3524552f7358SJed Brown const PetscInt *faces; 3525552f7358SJed Brown PetscInt numFaces; 3526552f7358SJed Brown 3527552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3528552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3529552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3530552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3531552f7358SJed Brown } 3532552f7358SJed Brown } 3533552f7358SJed Brown } 3534552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3535552f7358SJed Brown } 3536552f7358SJed Brown PetscFunctionReturn(0); 3537552f7358SJed Brown } 3538552f7358SJed Brown #endif 3539552f7358SJed Brown 3540519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3541aaa7dc30SBarry Smith #include <ctetgen.h> 3542552f7358SJed Brown 3543552f7358SJed Brown #undef __FUNCT__ 3544552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3545552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3546552f7358SJed Brown { 354782f516ccSBarry Smith MPI_Comm comm; 3548552f7358SJed Brown const PetscInt dim = 3; 3549552f7358SJed Brown PLC *in, *out; 3550552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3551552f7358SJed Brown PetscMPIInt rank; 3552552f7358SJed Brown PetscErrorCode ierr; 3553552f7358SJed Brown 3554552f7358SJed Brown PetscFunctionBegin; 355582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 35560298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3557552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3558552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3559552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3560552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 35610d644c17SKarl Rupp 3562552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3563552f7358SJed Brown if (in->numberofpoints > 0) { 3564552f7358SJed Brown PetscSection coordSection; 3565552f7358SJed Brown Vec coordinates; 3566552f7358SJed Brown PetscScalar *array; 3567552f7358SJed Brown 3568785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3569785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3570552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 357169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3572552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3573552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3574552f7358SJed Brown const PetscInt idx = v - vStart; 3575552f7358SJed Brown PetscInt off, d, m; 3576552f7358SJed Brown 3577552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3578552f7358SJed Brown for (d = 0; d < dim; ++d) { 3579552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3580552f7358SJed Brown } 3581552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 35820d644c17SKarl Rupp 3583552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3584552f7358SJed Brown } 3585552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3586552f7358SJed Brown } 3587552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 35880d644c17SKarl Rupp 3589552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3590552f7358SJed Brown if (in->numberoffacets > 0) { 3591785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3592785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3593552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3594552f7358SJed Brown const PetscInt idx = f - fStart; 35950298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3596552f7358SJed Brown polygon *poly; 3597552f7358SJed Brown 3598552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 35990d644c17SKarl Rupp 3600785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 36010d644c17SKarl Rupp 3602552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 36030298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3604552f7358SJed Brown 3605552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3606552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3607552f7358SJed Brown const PetscInt point = points[p]; 36080d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3609552f7358SJed Brown } 3610552f7358SJed Brown 3611552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3612552f7358SJed Brown poly->numberofvertices = numVertices; 3613785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3614552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3615552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3616552f7358SJed Brown poly->vertexlist[v] = vIdx; 3617552f7358SJed Brown } 3618552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3619552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3620552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3621552f7358SJed Brown } 3622552f7358SJed Brown } 3623552f7358SJed Brown if (!rank) { 3624552f7358SJed Brown TetGenOpts t; 3625552f7358SJed Brown 3626552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3627552f7358SJed Brown t.in = boundary; /* Should go away */ 3628552f7358SJed Brown t.plc = 1; 3629552f7358SJed Brown t.quality = 1; 3630552f7358SJed Brown t.edgesout = 1; 3631552f7358SJed Brown t.zeroindex = 1; 3632552f7358SJed Brown t.quiet = 1; 3633552f7358SJed Brown t.verbose = verbose; 3634552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3635552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3636552f7358SJed Brown } 3637552f7358SJed Brown { 3638552f7358SJed Brown const PetscInt numCorners = 4; 3639552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3640552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3641552f7358SJed Brown const double *meshCoords = out->pointlist; 36421d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3643552f7358SJed Brown 36449db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 36450fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3646552f7358SJed Brown /* Set labels */ 3647552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3648552f7358SJed Brown if (out->pointmarkerlist[v]) { 3649552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3650552f7358SJed Brown } 3651552f7358SJed Brown } 3652552f7358SJed Brown if (interpolate) { 3653552f7358SJed Brown PetscInt e; 3654552f7358SJed Brown 3655552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3656552f7358SJed Brown if (out->edgemarkerlist[e]) { 3657552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3658552f7358SJed Brown const PetscInt *edges; 3659552f7358SJed Brown PetscInt numEdges; 3660552f7358SJed Brown 3661552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3662552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3663552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3664552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3665552f7358SJed Brown } 3666552f7358SJed Brown } 3667552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3668552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3669552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3670552f7358SJed Brown const PetscInt *faces; 3671552f7358SJed Brown PetscInt numFaces; 3672552f7358SJed Brown 3673552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3674552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3675552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3676552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3677552f7358SJed Brown } 3678552f7358SJed Brown } 3679552f7358SJed Brown } 3680552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3681552f7358SJed Brown } 3682552f7358SJed Brown 3683552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3684552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3685552f7358SJed Brown PetscFunctionReturn(0); 3686552f7358SJed Brown } 3687552f7358SJed Brown 3688552f7358SJed Brown #undef __FUNCT__ 3689552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3690552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3691552f7358SJed Brown { 369282f516ccSBarry Smith MPI_Comm comm; 3693552f7358SJed Brown const PetscInt dim = 3; 3694552f7358SJed Brown PLC *in, *out; 3695552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3696552f7358SJed Brown PetscMPIInt rank; 3697552f7358SJed Brown PetscErrorCode ierr; 3698552f7358SJed Brown 3699552f7358SJed Brown PetscFunctionBegin; 370082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 37010298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3702552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3703552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3704552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3705552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3706552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3707552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 37080d644c17SKarl Rupp 3709552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3710552f7358SJed Brown if (in->numberofpoints > 0) { 3711552f7358SJed Brown PetscSection coordSection; 3712552f7358SJed Brown Vec coordinates; 3713552f7358SJed Brown PetscScalar *array; 3714552f7358SJed Brown 3715785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3716785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3717552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 371869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3719552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3720552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3721552f7358SJed Brown const PetscInt idx = v - vStart; 3722552f7358SJed Brown PetscInt off, d, m; 3723552f7358SJed Brown 3724552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3725552f7358SJed Brown for (d = 0; d < dim; ++d) { 3726552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3727552f7358SJed Brown } 3728552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 37290d644c17SKarl Rupp 3730552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3731552f7358SJed Brown } 3732552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3733552f7358SJed Brown } 3734552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 37350d644c17SKarl Rupp 3736552f7358SJed Brown in->numberofcorners = 4; 3737552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3738552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3739552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3740785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3741552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3742552f7358SJed Brown const PetscInt idx = c - cStart; 37430298fd71SBarry Smith PetscInt *closure = NULL; 3744552f7358SJed Brown PetscInt closureSize; 3745552f7358SJed Brown 3746552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3747552f7358SJed Brown if ((closureSize != 5) && (closureSize != 15)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a tetrahedron, %D vertices in closure", closureSize); 3748552f7358SJed Brown for (v = 0; v < 4; ++v) { 3749552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3750552f7358SJed Brown } 3751552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3752552f7358SJed Brown } 3753552f7358SJed Brown } 3754552f7358SJed Brown if (!rank) { 3755552f7358SJed Brown TetGenOpts t; 3756552f7358SJed Brown 3757552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 37580d644c17SKarl Rupp 3759552f7358SJed Brown t.in = dm; /* Should go away */ 3760552f7358SJed Brown t.refine = 1; 3761552f7358SJed Brown t.varvolume = 1; 3762552f7358SJed Brown t.quality = 1; 3763552f7358SJed Brown t.edgesout = 1; 3764552f7358SJed Brown t.zeroindex = 1; 3765552f7358SJed Brown t.quiet = 1; 3766552f7358SJed Brown t.verbose = verbose; /* Change this */ 37670d644c17SKarl Rupp 3768552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3769552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3770552f7358SJed Brown } 3771552f7358SJed Brown { 3772552f7358SJed Brown const PetscInt numCorners = 4; 3773552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3774552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3775552f7358SJed Brown const double *meshCoords = out->pointlist; 37761d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3777552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3778552f7358SJed Brown 37799db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 37800fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3781552f7358SJed Brown /* Set labels */ 3782552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3783552f7358SJed Brown if (out->pointmarkerlist[v]) { 3784552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3785552f7358SJed Brown } 3786552f7358SJed Brown } 3787552f7358SJed Brown if (interpolate) { 3788552f7358SJed Brown PetscInt e, f; 3789552f7358SJed Brown 3790552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3791552f7358SJed Brown if (out->edgemarkerlist[e]) { 3792552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3793552f7358SJed Brown const PetscInt *edges; 3794552f7358SJed Brown PetscInt numEdges; 3795552f7358SJed Brown 3796552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3797552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3798552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3799552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3800552f7358SJed Brown } 3801552f7358SJed Brown } 3802552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3803552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3804552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3805552f7358SJed Brown const PetscInt *faces; 3806552f7358SJed Brown PetscInt numFaces; 3807552f7358SJed Brown 3808552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3809552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3810552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3811552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3812552f7358SJed Brown } 3813552f7358SJed Brown } 3814552f7358SJed Brown } 3815552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3816552f7358SJed Brown } 3817552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3818552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3819552f7358SJed Brown PetscFunctionReturn(0); 3820552f7358SJed Brown } 3821552f7358SJed Brown #endif 3822552f7358SJed Brown 3823552f7358SJed Brown #undef __FUNCT__ 3824552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3825552f7358SJed Brown /*@C 3826552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3827552f7358SJed Brown 3828552f7358SJed Brown Not Collective 3829552f7358SJed Brown 3830552f7358SJed Brown Input Parameters: 3831552f7358SJed Brown + boundary - The DMPlex boundary object 3832552f7358SJed Brown . name - The mesh generation package name 3833552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3834552f7358SJed Brown 3835552f7358SJed Brown Output Parameter: 3836552f7358SJed Brown . mesh - The DMPlex object 3837552f7358SJed Brown 3838552f7358SJed Brown Level: intermediate 3839552f7358SJed Brown 3840552f7358SJed Brown .keywords: mesh, elements 3841552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3842552f7358SJed Brown @*/ 3843552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3844552f7358SJed Brown { 3845552f7358SJed Brown PetscInt dim; 3846552f7358SJed Brown char genname[1024]; 3847552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3848552f7358SJed Brown PetscErrorCode ierr; 3849552f7358SJed Brown 3850552f7358SJed Brown PetscFunctionBegin; 3851552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3852552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3853552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 3854552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 38550d644c17SKarl Rupp if (flg) name = genname; 3856552f7358SJed Brown if (name) { 3857552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3858552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3859552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3860552f7358SJed Brown } 3861552f7358SJed Brown switch (dim) { 3862552f7358SJed Brown case 1: 3863552f7358SJed Brown if (!name || isTriangle) { 3864519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3865552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3866552f7358SJed Brown #else 386782f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3868552f7358SJed Brown #endif 386982f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3870552f7358SJed Brown break; 3871552f7358SJed Brown case 2: 3872552f7358SJed Brown if (!name || isCTetgen) { 3873519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3874552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3875552f7358SJed Brown #else 387682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3877552f7358SJed Brown #endif 3878552f7358SJed Brown } else if (isTetgen) { 3879519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3880552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3881552f7358SJed Brown #else 388282f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3883552f7358SJed Brown #endif 388482f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3885552f7358SJed Brown break; 3886552f7358SJed Brown default: 388782f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3888552f7358SJed Brown } 3889552f7358SJed Brown PetscFunctionReturn(0); 3890552f7358SJed Brown } 3891552f7358SJed Brown 3892552f7358SJed Brown #undef __FUNCT__ 3893552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3894552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3895552f7358SJed Brown { 3896552f7358SJed Brown PetscReal refinementLimit; 3897552f7358SJed Brown PetscInt dim, cStart, cEnd; 38980298fd71SBarry Smith char genname[1024], *name = NULL; 3899552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3900552f7358SJed Brown PetscErrorCode ierr; 3901552f7358SJed Brown 3902552f7358SJed Brown PetscFunctionBegin; 3903552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3904552f7358SJed Brown if (isUniform) { 3905552f7358SJed Brown CellRefiner cellRefiner; 3906552f7358SJed Brown 3907509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3908509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 3909552f7358SJed Brown PetscFunctionReturn(0); 3910552f7358SJed Brown } 3911552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3912552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3913552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3914552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3915552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 39160d644c17SKarl Rupp if (flg) name = genname; 3917552f7358SJed Brown if (name) { 3918552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3919552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3920552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3921552f7358SJed Brown } 3922552f7358SJed Brown switch (dim) { 3923552f7358SJed Brown case 2: 3924552f7358SJed Brown if (!name || isTriangle) { 3925519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3926552f7358SJed Brown double *maxVolumes; 3927552f7358SJed Brown PetscInt c; 3928552f7358SJed Brown 3929785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 39300d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3931552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 39326b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3933552f7358SJed Brown #else 393482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3935552f7358SJed Brown #endif 393682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3937552f7358SJed Brown break; 3938552f7358SJed Brown case 3: 3939552f7358SJed Brown if (!name || isCTetgen) { 3940519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3941552f7358SJed Brown PetscReal *maxVolumes; 3942552f7358SJed Brown PetscInt c; 3943552f7358SJed Brown 3944785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 39450d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3946552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3947552f7358SJed Brown #else 394882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3949552f7358SJed Brown #endif 3950552f7358SJed Brown } else if (isTetgen) { 3951519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3952552f7358SJed Brown double *maxVolumes; 3953552f7358SJed Brown PetscInt c; 3954552f7358SJed Brown 3955785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 39560d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3957552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3958552f7358SJed Brown #else 395982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3960552f7358SJed Brown #endif 396182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3962552f7358SJed Brown break; 3963552f7358SJed Brown default: 396482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3965552f7358SJed Brown } 3966552f7358SJed Brown PetscFunctionReturn(0); 3967552f7358SJed Brown } 3968552f7358SJed Brown 3969552f7358SJed Brown #undef __FUNCT__ 39700a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 39710a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 39720a6ba040SMatthew G. Knepley { 39730a6ba040SMatthew G. Knepley DM cdm = dm; 39740a6ba040SMatthew G. Knepley PetscInt r; 39750a6ba040SMatthew G. Knepley PetscBool isUniform; 39760a6ba040SMatthew G. Knepley PetscErrorCode ierr; 39770a6ba040SMatthew G. Knepley 39780a6ba040SMatthew G. Knepley PetscFunctionBegin; 39790a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 39800a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 39810a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 39820a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 39830a6ba040SMatthew G. Knepley 39840a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 39850a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 39860a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 39870a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 39880a6ba040SMatthew G. Knepley } 39890a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 39900a6ba040SMatthew G. Knepley } 39910a6ba040SMatthew G. Knepley 39920a6ba040SMatthew G. Knepley #undef __FUNCT__ 39930a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 39940a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 39950a6ba040SMatthew G. Knepley { 39960a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3997549a8adaSMatthew G. Knepley PetscErrorCode ierr; 39980a6ba040SMatthew G. Knepley 39990a6ba040SMatthew G. Knepley PetscFunctionBegin; 4000549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 40010a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 40020a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 40030a6ba040SMatthew G. Knepley } 40040a6ba040SMatthew G. Knepley 40050a6ba040SMatthew G. Knepley #undef __FUNCT__ 4006aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 4007552f7358SJed Brown /*@ 4008aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 4009552f7358SJed Brown 4010552f7358SJed Brown Not Collective 4011552f7358SJed Brown 4012aa50250dSMatthew G. Knepley Input Parameter: 4013552f7358SJed Brown . dm - The DMPlex object 4014552f7358SJed Brown 4015aa50250dSMatthew G. Knepley Output Parameter: 4016aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 4017552f7358SJed Brown 4018552f7358SJed Brown Level: developer 4019552f7358SJed Brown 4020aa50250dSMatthew G. Knepley .keywords: mesh, points 4021aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4022aa50250dSMatthew G. Knepley @*/ 4023aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 4024aa50250dSMatthew G. Knepley { 4025aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 4026aa50250dSMatthew G. Knepley PetscErrorCode ierr; 4027aa50250dSMatthew G. Knepley 4028aa50250dSMatthew G. Knepley PetscFunctionBegin; 4029aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4030aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 403163d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 4032aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 4033aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 4034aa50250dSMatthew G. Knepley } 4035aa50250dSMatthew G. Knepley 4036aa50250dSMatthew G. Knepley #undef __FUNCT__ 4037aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 4038aa50250dSMatthew G. Knepley /*@ 4039aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 4040aa50250dSMatthew G. Knepley 4041aa50250dSMatthew G. Knepley Not Collective 4042aa50250dSMatthew G. Knepley 4043aa50250dSMatthew G. Knepley Input Parameter: 4044aa50250dSMatthew G. Knepley . dm - The DMPlex object 4045aa50250dSMatthew G. Knepley 4046aa50250dSMatthew G. Knepley Output Parameter: 4047aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 4048aa50250dSMatthew G. Knepley 4049aa50250dSMatthew G. Knepley Level: developer 4050552f7358SJed Brown 4051552f7358SJed Brown .keywords: mesh, points 4052aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4053552f7358SJed Brown @*/ 4054552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 4055552f7358SJed Brown { 4056aa50250dSMatthew G. Knepley DMLabel label; 4057aa50250dSMatthew G. Knepley PetscInt d = 0; 4058552f7358SJed Brown PetscErrorCode ierr; 4059552f7358SJed Brown 4060552f7358SJed Brown PetscFunctionBegin; 4061552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4062552f7358SJed Brown PetscValidPointer(depth, 2); 4063aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4064aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 4065552f7358SJed Brown *depth = d-1; 4066552f7358SJed Brown PetscFunctionReturn(0); 4067552f7358SJed Brown } 4068552f7358SJed Brown 4069552f7358SJed Brown #undef __FUNCT__ 4070552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 4071552f7358SJed Brown /*@ 4072552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 4073552f7358SJed Brown 4074552f7358SJed Brown Not Collective 4075552f7358SJed Brown 4076552f7358SJed Brown Input Parameters: 4077552f7358SJed Brown + dm - The DMPlex object 4078552f7358SJed Brown - stratumValue - The requested depth 4079552f7358SJed Brown 4080552f7358SJed Brown Output Parameters: 4081552f7358SJed Brown + start - The first point at this depth 4082552f7358SJed Brown - end - One beyond the last point at this depth 4083552f7358SJed Brown 4084552f7358SJed Brown Level: developer 4085552f7358SJed Brown 4086552f7358SJed Brown .keywords: mesh, points 4087552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 4088552f7358SJed Brown @*/ 40890adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 40900adebc6cSBarry Smith { 4091aa50250dSMatthew G. Knepley DMLabel label; 409263d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 4093552f7358SJed Brown PetscErrorCode ierr; 4094552f7358SJed Brown 4095552f7358SJed Brown PetscFunctionBegin; 4096552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 409763d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 409863d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4099552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 41000d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 410163d1a920SMatthew G. Knepley if (stratumValue < 0) { 410263d1a920SMatthew G. Knepley if (start) *start = pStart; 410363d1a920SMatthew G. Knepley if (end) *end = pEnd; 410463d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4105552f7358SJed Brown } 4106aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 410763d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 410863d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 4109552f7358SJed Brown PetscFunctionReturn(0); 4110552f7358SJed Brown } 4111552f7358SJed Brown 4112552f7358SJed Brown #undef __FUNCT__ 4113552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 4114552f7358SJed Brown /*@ 4115552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 4116552f7358SJed Brown 4117552f7358SJed Brown Not Collective 4118552f7358SJed Brown 4119552f7358SJed Brown Input Parameters: 4120552f7358SJed Brown + dm - The DMPlex object 4121552f7358SJed Brown - stratumValue - The requested height 4122552f7358SJed Brown 4123552f7358SJed Brown Output Parameters: 4124552f7358SJed Brown + start - The first point at this height 4125552f7358SJed Brown - end - One beyond the last point at this height 4126552f7358SJed Brown 4127552f7358SJed Brown Level: developer 4128552f7358SJed Brown 4129552f7358SJed Brown .keywords: mesh, points 4130552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 4131552f7358SJed Brown @*/ 41320adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 41330adebc6cSBarry Smith { 4134aa50250dSMatthew G. Knepley DMLabel label; 413563d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4136552f7358SJed Brown PetscErrorCode ierr; 4137552f7358SJed Brown 4138552f7358SJed Brown PetscFunctionBegin; 4139552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 414063d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 414163d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4142552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 41430d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 414463d1a920SMatthew G. Knepley if (stratumValue < 0) { 414563d1a920SMatthew G. Knepley if (start) *start = pStart; 414663d1a920SMatthew G. Knepley if (end) *end = pEnd; 414763d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4148552f7358SJed Brown } 4149aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4150aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 415163d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 415263d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4153552f7358SJed Brown PetscFunctionReturn(0); 4154552f7358SJed Brown } 4155552f7358SJed Brown 4156552f7358SJed Brown #undef __FUNCT__ 4157552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4158552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4159a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4160a6dfd86eSKarl Rupp { 4161552f7358SJed Brown PetscInt *numDofTot; 4162916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4163916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4164552f7358SJed Brown PetscErrorCode ierr; 4165552f7358SJed Brown 4166552f7358SJed Brown PetscFunctionBegin; 4167785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4168552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4169552f7358SJed Brown numDofTot[d] = 0; 41700d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4171552f7358SJed Brown } 417282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4173552f7358SJed Brown if (numFields > 0) { 4174552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4175552f7358SJed Brown if (numComp) { 4176552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4177552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4178552f7358SJed Brown } 4179552f7358SJed Brown } 4180552f7358SJed Brown } 4181552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4182552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4183916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4184916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4185916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4186916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4187552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4188552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4189552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4190552f7358SJed Brown } 4191552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4192552f7358SJed Brown } 4193552f7358SJed Brown } 4194552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4195552f7358SJed Brown PetscFunctionReturn(0); 4196552f7358SJed Brown } 4197552f7358SJed Brown 4198552f7358SJed Brown #undef __FUNCT__ 4199552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4200552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4201552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4202552f7358SJed Brown */ 4203a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4204a6dfd86eSKarl Rupp { 4205552f7358SJed Brown PetscInt numFields; 4206552f7358SJed Brown PetscInt bc; 4207552f7358SJed Brown PetscErrorCode ierr; 4208552f7358SJed Brown 4209552f7358SJed Brown PetscFunctionBegin; 4210552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4211552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4212552f7358SJed Brown PetscInt field = 0; 4213552f7358SJed Brown const PetscInt *idx; 4214552f7358SJed Brown PetscInt n, i; 4215552f7358SJed Brown 42160d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4217552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4218552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4219552f7358SJed Brown for (i = 0; i < n; ++i) { 4220552f7358SJed Brown const PetscInt p = idx[i]; 4221552f7358SJed Brown PetscInt numConst = constDof; 4222552f7358SJed Brown 4223552f7358SJed Brown /* Constrain every dof on the point */ 4224552f7358SJed Brown if (numConst < 0) { 4225552f7358SJed Brown if (numFields) { 4226552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4227552f7358SJed Brown } else { 4228552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4229552f7358SJed Brown } 4230552f7358SJed Brown } 4231552f7358SJed Brown if (numFields) { 4232552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4233552f7358SJed Brown } 4234552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4235552f7358SJed Brown } 4236552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4237552f7358SJed Brown } 4238552f7358SJed Brown PetscFunctionReturn(0); 4239552f7358SJed Brown } 4240552f7358SJed Brown 4241552f7358SJed Brown #undef __FUNCT__ 4242552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4243552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 42440adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 42450adebc6cSBarry Smith { 4246552f7358SJed Brown PetscInt *maxConstraints; 4247552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4248552f7358SJed Brown PetscErrorCode ierr; 4249552f7358SJed Brown 4250552f7358SJed Brown PetscFunctionBegin; 4251552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4252552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4253785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 42540d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4255552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4256552f7358SJed Brown PetscInt cdof; 4257552f7358SJed Brown 4258552f7358SJed Brown if (numFields) { 4259552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4260552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4261552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4262552f7358SJed Brown } 4263552f7358SJed Brown } else { 4264552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4265552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4266552f7358SJed Brown } 4267552f7358SJed Brown } 4268552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4269552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4270552f7358SJed Brown } 4271552f7358SJed Brown if (maxConstraints[numFields]) { 4272552f7358SJed Brown PetscInt *indices; 4273552f7358SJed Brown 4274785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4275552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4276552f7358SJed Brown PetscInt cdof, d; 4277552f7358SJed Brown 4278552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4279552f7358SJed Brown if (cdof) { 4280552f7358SJed Brown if (cdof > maxConstraints[numFields]) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_LIB, "Likely memory corruption, point %D cDof %D > maxConstraints %D", p, cdof, maxConstraints[numFields]); 4281552f7358SJed Brown if (numFields) { 4282552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4283552f7358SJed Brown 4284552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4285552f7358SJed Brown PetscInt cfdof, fdof; 4286552f7358SJed Brown 4287552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4288552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4289552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 42900d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4291552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 42920d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4293552f7358SJed Brown numConst += cfdof; 4294552f7358SJed Brown foff += fdof; 4295552f7358SJed Brown } 4296552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4297552f7358SJed Brown } else { 42980d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4299552f7358SJed Brown } 4300552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4301552f7358SJed Brown } 4302552f7358SJed Brown } 4303552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4304552f7358SJed Brown } 4305552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4306552f7358SJed Brown PetscFunctionReturn(0); 4307552f7358SJed Brown } 4308552f7358SJed Brown 4309552f7358SJed Brown #undef __FUNCT__ 4310552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4311552f7358SJed Brown /* Set the constrained field indices on each point */ 43120adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 43130adebc6cSBarry Smith { 4314552f7358SJed Brown const PetscInt *points, *indices; 4315552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4316552f7358SJed Brown PetscErrorCode ierr; 4317552f7358SJed Brown 4318552f7358SJed Brown PetscFunctionBegin; 4319552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4320552f7358SJed Brown if ((field < 0) || (field >= numFields)) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Section field %d should be in [%d, %d)", field, 0, numFields); 4321552f7358SJed Brown 4322552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4323552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4324552f7358SJed Brown if (!constraintIndices) { 4325552f7358SJed Brown PetscInt *idx, i; 4326552f7358SJed Brown 4327552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4328785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 43290d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4330552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4331552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4332552f7358SJed Brown } 4333552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4334552f7358SJed Brown } else { 4335552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4336552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4337552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4338552f7358SJed Brown PetscInt fcdof; 4339552f7358SJed Brown 4340552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 434182f516ccSBarry Smith if (fcdof != numConstraints) SETERRQ4(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Section point %d field %d has %d constraints, but yo ugave %d indices", p, field, fcdof, numConstraints); 4342552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4343552f7358SJed Brown } 4344552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4345552f7358SJed Brown } 4346552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4347552f7358SJed Brown PetscFunctionReturn(0); 4348552f7358SJed Brown } 4349552f7358SJed Brown 4350552f7358SJed Brown #undef __FUNCT__ 4351552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4352552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 43530adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 43540adebc6cSBarry Smith { 4355552f7358SJed Brown PetscInt *indices; 4356552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4357552f7358SJed Brown PetscErrorCode ierr; 4358552f7358SJed Brown 4359552f7358SJed Brown PetscFunctionBegin; 4360552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4361785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4362552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 436382f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4364552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4365552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4366552f7358SJed Brown PetscInt cdof, d; 4367552f7358SJed Brown 4368552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4369552f7358SJed Brown if (cdof) { 4370552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4371552f7358SJed Brown 4372552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4373552f7358SJed Brown const PetscInt *fcind; 4374552f7358SJed Brown PetscInt fdof, fcdof; 4375552f7358SJed Brown 4376552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4377552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4378552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4379552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 43800d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4381552f7358SJed Brown foff += fdof; 4382552f7358SJed Brown numConst += fcdof; 4383552f7358SJed Brown } 438482f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4385552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4386552f7358SJed Brown } 4387552f7358SJed Brown } 4388552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4389552f7358SJed Brown PetscFunctionReturn(0); 4390552f7358SJed Brown } 4391552f7358SJed Brown 4392552f7358SJed Brown #undef __FUNCT__ 4393552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4394552f7358SJed Brown /*@C 4395552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4396552f7358SJed Brown 4397552f7358SJed Brown Not Collective 4398552f7358SJed Brown 4399552f7358SJed Brown Input Parameters: 4400552f7358SJed Brown + dm - The DMPlex object 4401552f7358SJed Brown . dim - The spatial dimension of the problem 4402552f7358SJed Brown . numFields - The number of fields in the problem 4403552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4404552f7358SJed Brown . numDof - An array of size numFields*(dim+1) which holds the number of dof for each field on a mesh piece of dimension d 4405552f7358SJed Brown . numBC - The number of boundary conditions 4406552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4407552f7358SJed Brown - bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4408552f7358SJed Brown 4409552f7358SJed Brown Output Parameter: 4410552f7358SJed Brown . section - The PetscSection object 4411552f7358SJed Brown 4412552f7358SJed Brown Notes: numDof[f*(dim+1)+d] gives the number of dof for field f on sieve points of dimension d. For instance, numDof[1] is the 4413552f7358SJed Brown nubmer of dof for field 0 on each edge. 4414552f7358SJed Brown 4415552f7358SJed Brown Level: developer 4416552f7358SJed Brown 44173813dfbdSMatthew G Knepley Fortran Notes: 44183813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 44193813dfbdSMatthew G Knepley 4420552f7358SJed Brown .keywords: mesh, elements 4421552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate() 4422552f7358SJed Brown @*/ 4423a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSection(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscSection *section) 4424a6dfd86eSKarl Rupp { 4425552f7358SJed Brown PetscErrorCode ierr; 4426552f7358SJed Brown 4427552f7358SJed Brown PetscFunctionBegin; 4428552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4429552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4430552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4431552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4432ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4433552f7358SJed Brown PetscFunctionReturn(0); 4434552f7358SJed Brown } 4435552f7358SJed Brown 4436552f7358SJed Brown #undef __FUNCT__ 4437552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 44380adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 44390adebc6cSBarry Smith { 4440552f7358SJed Brown PetscSection section; 4441552f7358SJed Brown PetscErrorCode ierr; 4442552f7358SJed Brown 4443552f7358SJed Brown PetscFunctionBegin; 444438221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 444582f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4446552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 44471d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4448552f7358SJed Brown PetscFunctionReturn(0); 4449552f7358SJed Brown } 4450552f7358SJed Brown 4451552f7358SJed Brown #undef __FUNCT__ 4452552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 44530adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 44540adebc6cSBarry Smith { 4455552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4456552f7358SJed Brown 4457552f7358SJed Brown PetscFunctionBegin; 4458552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4459552f7358SJed Brown if (section) *section = mesh->coneSection; 4460552f7358SJed Brown PetscFunctionReturn(0); 4461552f7358SJed Brown } 4462552f7358SJed Brown 4463552f7358SJed Brown #undef __FUNCT__ 44648cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 44658cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 44668cb4d582SMatthew G. Knepley { 44678cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 44688cb4d582SMatthew G. Knepley 44698cb4d582SMatthew G. Knepley PetscFunctionBegin; 44708cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 44718cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 44728cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 44738cb4d582SMatthew G. Knepley } 44748cb4d582SMatthew G. Knepley 44758cb4d582SMatthew G. Knepley #undef __FUNCT__ 4476552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4477a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4478a6dfd86eSKarl Rupp { 4479552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4480552f7358SJed Brown 4481552f7358SJed Brown PetscFunctionBegin; 4482552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4483552f7358SJed Brown if (cones) *cones = mesh->cones; 4484552f7358SJed Brown PetscFunctionReturn(0); 4485552f7358SJed Brown } 4486552f7358SJed Brown 4487552f7358SJed Brown #undef __FUNCT__ 4488552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4489a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4490a6dfd86eSKarl Rupp { 4491552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4492552f7358SJed Brown 4493552f7358SJed Brown PetscFunctionBegin; 4494552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4495552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4496552f7358SJed Brown PetscFunctionReturn(0); 4497552f7358SJed Brown } 4498552f7358SJed Brown 4499552f7358SJed Brown /******************************** FEM Support **********************************/ 4500552f7358SJed Brown 4501552f7358SJed Brown #undef __FUNCT__ 45021a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 45031a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4504a6dfd86eSKarl Rupp { 4505552f7358SJed Brown PetscScalar *array, *vArray; 4506d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 45071a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4508552f7358SJed Brown PetscErrorCode ierr; 4509552f7358SJed Brown 45101b406b76SMatthew G. Knepley PetscFunctionBeginHot; 45112a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 45125a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 45135a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 45145a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 45153f7cbbe7SMatthew G. Knepley if (!values || !*values) { 45169df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 45179df71ca4SMatthew G. Knepley PetscInt dof; 4518d9917b9dSMatthew G. Knepley 45199df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 45209df71ca4SMatthew G. Knepley size += dof; 45219df71ca4SMatthew G. Knepley } 45229df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 45239df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 45242a3aaacfSMatthew G. Knepley PetscInt dof; 45255a1bb5cfSMatthew G. Knepley 45265a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 45272a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 45285a1bb5cfSMatthew G. Knepley size += dof; 45295a1bb5cfSMatthew G. Knepley } 45303f7cbbe7SMatthew G. Knepley if (!values) { 45313f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 45323f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 45333f7cbbe7SMatthew G. Knepley } 45345a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4535982e9ed1SMatthew G. Knepley } else { 4536982e9ed1SMatthew G. Knepley array = *values; 4537982e9ed1SMatthew G. Knepley } 45389df71ca4SMatthew G. Knepley size = 0; 45395a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 45409df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 45419df71ca4SMatthew G. Knepley PetscInt dof, off, d; 45429df71ca4SMatthew G. Knepley PetscScalar *varr; 4543d9917b9dSMatthew G. Knepley 45449df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 45459df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 45469df71ca4SMatthew G. Knepley varr = &vArray[off]; 45471a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 45481a271a75SMatthew G. Knepley array[offset] = varr[d]; 45499df71ca4SMatthew G. Knepley } 45509df71ca4SMatthew G. Knepley size += dof; 45519df71ca4SMatthew G. Knepley } 45529df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 45539df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 45549df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 45555a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 45565a1bb5cfSMatthew G. Knepley PetscScalar *varr; 45575a1bb5cfSMatthew G. Knepley 455852ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 45595a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 45605a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 45615a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 45625a1bb5cfSMatthew G. Knepley if (o >= 0) { 45631a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 45641a271a75SMatthew G. Knepley array[offset] = varr[d]; 45655a1bb5cfSMatthew G. Knepley } 45665a1bb5cfSMatthew G. Knepley } else { 45671a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 45681a271a75SMatthew G. Knepley array[offset] = varr[d]; 45695a1bb5cfSMatthew G. Knepley } 45705a1bb5cfSMatthew G. Knepley } 45719df71ca4SMatthew G. Knepley size += dof; 45725a1bb5cfSMatthew G. Knepley } 45735a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 45749df71ca4SMatthew G. Knepley if (!*values) { 45755a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 45765a1bb5cfSMatthew G. Knepley *values = array; 45779df71ca4SMatthew G. Knepley } else { 45789df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 45798c312ff3SMatthew G. Knepley *csize = size; 45809df71ca4SMatthew G. Knepley } 45815a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 45825a1bb5cfSMatthew G. Knepley } 4583d9917b9dSMatthew G. Knepley 4584d9917b9dSMatthew G. Knepley #undef __FUNCT__ 45851a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 45861a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 45871a271a75SMatthew G. Knepley { 45881a271a75SMatthew G. Knepley PetscInt offset = 0, p; 45891a271a75SMatthew G. Knepley PetscErrorCode ierr; 45901a271a75SMatthew G. Knepley 45911a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4592fe02ba77SJed Brown *size = 0; 45931a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 45941a271a75SMatthew G. Knepley const PetscInt point = points[p]; 45951a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 45961a271a75SMatthew G. Knepley PetscInt dof, off, d; 45971a271a75SMatthew G. Knepley const PetscScalar *varr; 45981a271a75SMatthew G. Knepley 45991a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 46001a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 46011a271a75SMatthew G. Knepley varr = &vArray[off]; 46021a271a75SMatthew G. Knepley if (o >= 0) { 46031a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 46041a271a75SMatthew G. Knepley } else { 46051a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 46061a271a75SMatthew G. Knepley } 46071a271a75SMatthew G. Knepley } 46081a271a75SMatthew G. Knepley *size = offset; 46091a271a75SMatthew G. Knepley PetscFunctionReturn(0); 46101a271a75SMatthew G. Knepley } 46111a271a75SMatthew G. Knepley 46121a271a75SMatthew G. Knepley #undef __FUNCT__ 46131a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 46141a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Fields_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], PetscInt numFields, const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 46151a271a75SMatthew G. Knepley { 46161a271a75SMatthew G. Knepley PetscInt offset = 0, f; 46171a271a75SMatthew G. Knepley PetscErrorCode ierr; 46181a271a75SMatthew G. Knepley 46191a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4620fe02ba77SJed Brown *size = 0; 46211a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 46221a271a75SMatthew G. Knepley PetscInt fcomp, p; 46231a271a75SMatthew G. Knepley 46241a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 46251a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 46261a271a75SMatthew G. Knepley const PetscInt point = points[p]; 46271a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 46281a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 46291a271a75SMatthew G. Knepley const PetscScalar *varr; 46301a271a75SMatthew G. Knepley 46311a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 46321a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 46331a271a75SMatthew G. Knepley varr = &vArray[foff]; 46341a271a75SMatthew G. Knepley if (o >= 0) { 46351a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 46361a271a75SMatthew G. Knepley } else { 46371a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 46381a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 46391a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 46401a271a75SMatthew G. Knepley } 46411a271a75SMatthew G. Knepley } 46421a271a75SMatthew G. Knepley } 46431a271a75SMatthew G. Knepley } 46441a271a75SMatthew G. Knepley } 46451a271a75SMatthew G. Knepley *size = offset; 46461a271a75SMatthew G. Knepley PetscFunctionReturn(0); 46471a271a75SMatthew G. Knepley } 46481a271a75SMatthew G. Knepley 46491a271a75SMatthew G. Knepley #undef __FUNCT__ 4650552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4651552f7358SJed Brown /*@C 4652552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4653552f7358SJed Brown 4654552f7358SJed Brown Not collective 4655552f7358SJed Brown 4656552f7358SJed Brown Input Parameters: 4657552f7358SJed Brown + dm - The DM 4658552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4659552f7358SJed Brown . v - The local vector 4660552f7358SJed Brown - point - The sieve point in the DM 4661552f7358SJed Brown 4662552f7358SJed Brown Output Parameters: 4663552f7358SJed Brown + csize - The number of values in the closure, or NULL 4664552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4665552f7358SJed Brown 4666552f7358SJed Brown Fortran Notes: 4667552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4668552f7358SJed Brown include petsc.h90 in your code. 4669552f7358SJed Brown 4670552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4671552f7358SJed Brown 4672552f7358SJed Brown Level: intermediate 4673552f7358SJed Brown 4674552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4675552f7358SJed Brown @*/ 4676552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4677552f7358SJed Brown { 4678552f7358SJed Brown PetscSection clSection; 4679d9917b9dSMatthew G. Knepley IS clPoints; 4680552f7358SJed Brown PetscScalar *array, *vArray; 4681552f7358SJed Brown PetscInt *points = NULL; 4682d9917b9dSMatthew G. Knepley const PetscInt *clp; 46831a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4684552f7358SJed Brown PetscErrorCode ierr; 4685552f7358SJed Brown 4686d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4687552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4688552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 46891a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 46901a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4691552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4692552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4693552f7358SJed Brown if (depth == 1 && numFields < 2) { 46941a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4695552f7358SJed Brown PetscFunctionReturn(0); 4696552f7358SJed Brown } 46971a271a75SMatthew G. Knepley /* Get points */ 4698d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4699d9917b9dSMatthew G. Knepley if (!clPoints) { 47001a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4701552f7358SJed Brown 47021a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4703552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4704552f7358SJed Brown /* Compress out points not in the section */ 4705552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4706552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4707552f7358SJed Brown points[q*2] = points[p]; 4708552f7358SJed Brown points[q*2+1] = points[p+1]; 4709552f7358SJed Brown ++q; 4710552f7358SJed Brown } 4711552f7358SJed Brown } 4712552f7358SJed Brown numPoints = q; 4713d9917b9dSMatthew G. Knepley } else { 4714d9917b9dSMatthew G. Knepley PetscInt dof, off; 4715552f7358SJed Brown 4716d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4717d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4718d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 47191a271a75SMatthew G. Knepley numPoints = dof/2; 4720d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4721552f7358SJed Brown } 47221a271a75SMatthew G. Knepley /* Get array */ 4723552f7358SJed Brown if (!values || !*values) { 47241a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4725552f7358SJed Brown 47261a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4727552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 47281a271a75SMatthew G. Knepley asize += dof; 4729552f7358SJed Brown } 4730bd6c0d32SMatthew G. Knepley if (!values) { 4731d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 47321a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 47331a271a75SMatthew G. Knepley if (csize) *csize = asize; 4734bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4735bd6c0d32SMatthew G. Knepley } 47361a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4737d0f6b257SMatthew G. Knepley } else { 4738d0f6b257SMatthew G. Knepley array = *values; 4739d0f6b257SMatthew G. Knepley } 4740552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 47411a271a75SMatthew G. Knepley /* Get values */ 4742ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 47431a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 47441a271a75SMatthew G. Knepley /* Cleanup points */ 47451a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 47461a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 47471a271a75SMatthew G. Knepley /* Cleanup array */ 4748552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4749d0f6b257SMatthew G. Knepley if (!*values) { 4750552f7358SJed Brown if (csize) *csize = size; 4751552f7358SJed Brown *values = array; 4752d0f6b257SMatthew G. Knepley } else { 4753d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4754d0f6b257SMatthew G. Knepley *csize = size; 4755d0f6b257SMatthew G. Knepley } 4756552f7358SJed Brown PetscFunctionReturn(0); 4757552f7358SJed Brown } 4758552f7358SJed Brown 4759552f7358SJed Brown #undef __FUNCT__ 4760552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4761552f7358SJed Brown /*@C 4762552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4763552f7358SJed Brown 4764552f7358SJed Brown Not collective 4765552f7358SJed Brown 4766552f7358SJed Brown Input Parameters: 4767552f7358SJed Brown + dm - The DM 47680298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4769552f7358SJed Brown . v - The local vector 4770552f7358SJed Brown . point - The sieve point in the DM 47710298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4772552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4773552f7358SJed Brown 47743813dfbdSMatthew G Knepley Fortran Notes: 47753813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 47763813dfbdSMatthew G Knepley include petsc.h90 in your code. 47773813dfbdSMatthew G Knepley 47783813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 47793813dfbdSMatthew G Knepley 4780552f7358SJed Brown Level: intermediate 4781552f7358SJed Brown 4782552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4783552f7358SJed Brown @*/ 47847c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4785a6dfd86eSKarl Rupp { 4786552f7358SJed Brown PetscInt size = 0; 4787552f7358SJed Brown PetscErrorCode ierr; 4788552f7358SJed Brown 4789552f7358SJed Brown PetscFunctionBegin; 4790552f7358SJed Brown /* Should work without recalculating size */ 4791552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4792552f7358SJed Brown PetscFunctionReturn(0); 4793552f7358SJed Brown } 4794552f7358SJed Brown 4795552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4796552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4797552f7358SJed Brown 4798552f7358SJed Brown #undef __FUNCT__ 4799552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 48001a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePoint_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[]) 4801552f7358SJed Brown { 4802552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4803552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4804552f7358SJed Brown PetscScalar *a; 4805552f7358SJed Brown PetscInt off, cind = 0, k; 4806552f7358SJed Brown PetscErrorCode ierr; 4807552f7358SJed Brown 4808552f7358SJed Brown PetscFunctionBegin; 4809552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4810552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4811552f7358SJed Brown a = &array[off]; 4812552f7358SJed Brown if (!cdof || setBC) { 4813552f7358SJed Brown if (orientation >= 0) { 4814552f7358SJed Brown for (k = 0; k < dof; ++k) { 4815552f7358SJed Brown fuse(&a[k], values[k]); 4816552f7358SJed Brown } 4817552f7358SJed Brown } else { 4818552f7358SJed Brown for (k = 0; k < dof; ++k) { 4819552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4820552f7358SJed Brown } 4821552f7358SJed Brown } 4822552f7358SJed Brown } else { 4823552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4824552f7358SJed Brown if (orientation >= 0) { 4825552f7358SJed Brown for (k = 0; k < dof; ++k) { 4826552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4827552f7358SJed Brown fuse(&a[k], values[k]); 4828552f7358SJed Brown } 4829552f7358SJed Brown } else { 4830552f7358SJed Brown for (k = 0; k < dof; ++k) { 4831552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4832552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4833552f7358SJed Brown } 4834552f7358SJed Brown } 4835552f7358SJed Brown } 4836552f7358SJed Brown PetscFunctionReturn(0); 4837552f7358SJed Brown } 4838552f7358SJed Brown 4839552f7358SJed Brown #undef __FUNCT__ 4840a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 48411a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointBC_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[]) 4842a5e93ea8SMatthew G. Knepley { 4843a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4844a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4845a5e93ea8SMatthew G. Knepley PetscScalar *a; 4846a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4847a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4848a5e93ea8SMatthew G. Knepley 4849a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4850a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4851a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4852a5e93ea8SMatthew G. Knepley a = &array[off]; 4853a5e93ea8SMatthew G. Knepley if (cdof) { 4854a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4855a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4856a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4857a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4858a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4859a5e93ea8SMatthew G. Knepley ++cind; 4860a5e93ea8SMatthew G. Knepley } 4861a5e93ea8SMatthew G. Knepley } 4862a5e93ea8SMatthew G. Knepley } else { 4863a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4864a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4865a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4866a5e93ea8SMatthew G. Knepley ++cind; 4867a5e93ea8SMatthew G. Knepley } 4868a5e93ea8SMatthew G. Knepley } 4869a5e93ea8SMatthew G. Knepley } 4870a5e93ea8SMatthew G. Knepley } 4871a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4872a5e93ea8SMatthew G. Knepley } 4873a5e93ea8SMatthew G. Knepley 4874a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4875552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 48761a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointFields_private(PetscSection section, PetscInt point, PetscInt o, PetscInt f, PetscInt fcomp, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, const PetscScalar values[], PetscInt *offset, PetscScalar array[]) 4877a6dfd86eSKarl Rupp { 4878552f7358SJed Brown PetscScalar *a; 48791a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 48801a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 48811a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4882552f7358SJed Brown PetscErrorCode ierr; 4883552f7358SJed Brown 4884552f7358SJed Brown PetscFunctionBegin; 4885552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4886552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 48871a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 48881a271a75SMatthew G. Knepley a = &array[foff]; 4889552f7358SJed Brown if (!fcdof || setBC) { 48901a271a75SMatthew G. Knepley if (o >= 0) { 48911a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4892552f7358SJed Brown } else { 4893552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4894552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 48951a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4896552f7358SJed Brown } 4897552f7358SJed Brown } 4898552f7358SJed Brown } 4899552f7358SJed Brown } else { 4900552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 49011a271a75SMatthew G. Knepley if (o >= 0) { 4902552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4903552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 49041a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4905552f7358SJed Brown } 4906552f7358SJed Brown } else { 4907552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4908552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4909552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 49101a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4911552f7358SJed Brown } 4912552f7358SJed Brown } 4913552f7358SJed Brown } 4914552f7358SJed Brown } 49151a271a75SMatthew G. Knepley *offset += fdof; 4916552f7358SJed Brown PetscFunctionReturn(0); 4917552f7358SJed Brown } 4918552f7358SJed Brown 4919552f7358SJed Brown #undef __FUNCT__ 4920a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 49211a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointFieldsBC_private(PetscSection section, PetscInt point, PetscInt o, PetscInt f, PetscInt fcomp, void (*fuse)(PetscScalar*, PetscScalar), const PetscScalar values[], PetscInt *offset, PetscScalar array[]) 4922a5e93ea8SMatthew G. Knepley { 4923a5e93ea8SMatthew G. Knepley PetscScalar *a; 49241a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 49251a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 49261a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4927a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4928a5e93ea8SMatthew G. Knepley 4929a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4930a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4931a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 49321a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 49331a271a75SMatthew G. Knepley a = &array[foff]; 4934a5e93ea8SMatthew G. Knepley if (fcdof) { 4935a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 49361a271a75SMatthew G. Knepley if (o >= 0) { 4937a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4938a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 49391a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4940a5e93ea8SMatthew G. Knepley ++cind; 4941a5e93ea8SMatthew G. Knepley } 4942a5e93ea8SMatthew G. Knepley } 4943a5e93ea8SMatthew G. Knepley } else { 4944a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4945a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4946a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 49471a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4948a5e93ea8SMatthew G. Knepley ++cind; 4949a5e93ea8SMatthew G. Knepley } 4950a5e93ea8SMatthew G. Knepley } 4951a5e93ea8SMatthew G. Knepley } 4952a5e93ea8SMatthew G. Knepley } 4953a5e93ea8SMatthew G. Knepley } 49541a271a75SMatthew G. Knepley *offset += fdof; 4955a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4956a5e93ea8SMatthew G. Knepley } 4957a5e93ea8SMatthew G. Knepley 4958a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 49591b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 49601a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4961a6dfd86eSKarl Rupp { 4962552f7358SJed Brown PetscScalar *array; 49631b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 49641b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4965552f7358SJed Brown PetscErrorCode ierr; 4966552f7358SJed Brown 49671b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4968b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4969b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4970b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4971b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4972b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4973b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4974b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4975b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4976b6ebb6e6SMatthew G. Knepley 4977b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4978b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4979b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4980b6ebb6e6SMatthew G. Knepley { 4981b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4982b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4983b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4984b6ebb6e6SMatthew G. Knepley 4985b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4986b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4987b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4988b6ebb6e6SMatthew G. Knepley if (!cdof) { 4989b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4990b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4991b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4992b6ebb6e6SMatthew G. Knepley } 4993b6ebb6e6SMatthew G. Knepley } else { 4994b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4995b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4996b6ebb6e6SMatthew G. Knepley } 4997b6ebb6e6SMatthew G. Knepley } 4998b6ebb6e6SMatthew G. Knepley } else { 4999b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 5000b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5001b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5002b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5003b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5004b6ebb6e6SMatthew G. Knepley } 5005b6ebb6e6SMatthew G. Knepley } else { 5006b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5007b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5008b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5009b6ebb6e6SMatthew G. Knepley } 5010b6ebb6e6SMatthew G. Knepley } 5011b6ebb6e6SMatthew G. Knepley } 5012b6ebb6e6SMatthew G. Knepley } 5013b6ebb6e6SMatthew G. Knepley } 5014b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5015b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 5016b6ebb6e6SMatthew G. Knepley } 50171b406b76SMatthew G. Knepley 50181b406b76SMatthew G. Knepley #undef __FUNCT__ 50191b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 50201b406b76SMatthew G. Knepley /*@C 50211b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 50221b406b76SMatthew G. Knepley 50231b406b76SMatthew G. Knepley Not collective 50241b406b76SMatthew G. Knepley 50251b406b76SMatthew G. Knepley Input Parameters: 50261b406b76SMatthew G. Knepley + dm - The DM 50271b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 50281b406b76SMatthew G. Knepley . v - The local vector 50291b406b76SMatthew G. Knepley . point - The sieve point in the DM 50301b406b76SMatthew G. Knepley . values - The array of values 50311b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 50321b406b76SMatthew G. Knepley 50331b406b76SMatthew G. Knepley Fortran Notes: 50341b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 50351b406b76SMatthew G. Knepley 50361b406b76SMatthew G. Knepley Level: intermediate 50371b406b76SMatthew G. Knepley 50381b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 50391b406b76SMatthew G. Knepley @*/ 50401b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 50411b406b76SMatthew G. Knepley { 50421b406b76SMatthew G. Knepley PetscSection clSection; 50431b406b76SMatthew G. Knepley IS clPoints; 50441b406b76SMatthew G. Knepley PetscScalar *array; 50451b406b76SMatthew G. Knepley PetscInt *points = NULL; 50461b406b76SMatthew G. Knepley const PetscInt *clp; 50471a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 50481b406b76SMatthew G. Knepley PetscErrorCode ierr; 50491b406b76SMatthew G. Knepley 50501a271a75SMatthew G. Knepley PetscFunctionBeginHot; 50511b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 50521b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 50531a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 50541a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 50551b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 50561b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 50571b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 50581a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 50591b406b76SMatthew G. Knepley PetscFunctionReturn(0); 50601b406b76SMatthew G. Knepley } 50611a271a75SMatthew G. Knepley /* Get points */ 50621b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 50631b406b76SMatthew G. Knepley if (!clPoints) { 50641a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 50651a271a75SMatthew G. Knepley 50661a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5067552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5068552f7358SJed Brown /* Compress out points not in the section */ 5069552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5070552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5071552f7358SJed Brown points[q*2] = points[p]; 5072552f7358SJed Brown points[q*2+1] = points[p+1]; 5073552f7358SJed Brown ++q; 5074552f7358SJed Brown } 5075552f7358SJed Brown } 5076552f7358SJed Brown numPoints = q; 50771b406b76SMatthew G. Knepley } else { 50781b406b76SMatthew G. Knepley PetscInt dof, off; 5079552f7358SJed Brown 50801b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 50811b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 50821b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 50831a271a75SMatthew G. Knepley numPoints = dof/2; 50841b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 5085552f7358SJed Brown } 50861a271a75SMatthew G. Knepley /* Get array */ 5087552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 50881a271a75SMatthew G. Knepley /* Get values */ 5089ef90cfe2SMatthew G. Knepley if (numFields > 0) { 50901a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5091552f7358SJed Brown for (f = 0; f < numFields; ++f) { 50921a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5093552f7358SJed Brown switch (mode) { 5094552f7358SJed Brown case INSERT_VALUES: 5095552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50961a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50971a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50981a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5099552f7358SJed Brown } break; 5100552f7358SJed Brown case INSERT_ALL_VALUES: 5101552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 51021a271a75SMatthew G. Knepley const PetscInt point = points[p]; 51031a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 51041a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5105552f7358SJed Brown } break; 5106a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5107a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 51081a271a75SMatthew G. Knepley const PetscInt point = points[p]; 51091a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 51101a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5111a5e93ea8SMatthew G. Knepley } break; 5112552f7358SJed Brown case ADD_VALUES: 5113552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 51141a271a75SMatthew G. Knepley const PetscInt point = points[p]; 51151a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 51161a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5117552f7358SJed Brown } break; 5118552f7358SJed Brown case ADD_ALL_VALUES: 5119552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 51201a271a75SMatthew G. Knepley const PetscInt point = points[p]; 51211a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 51221a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5123552f7358SJed Brown } break; 5124552f7358SJed Brown default: 512582f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5126552f7358SJed Brown } 51271a271a75SMatthew G. Knepley } 5128552f7358SJed Brown } else { 51291a271a75SMatthew G. Knepley PetscInt dof, off; 51301a271a75SMatthew G. Knepley 5131552f7358SJed Brown switch (mode) { 5132552f7358SJed Brown case INSERT_VALUES: 5133552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5134552f7358SJed Brown PetscInt o = points[p+1]; 5135552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5136552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5137552f7358SJed Brown } break; 5138552f7358SJed Brown case INSERT_ALL_VALUES: 5139552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5140552f7358SJed Brown PetscInt o = points[p+1]; 5141552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5142552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5143552f7358SJed Brown } break; 5144a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5145a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5146a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5147a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5148a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5149a5e93ea8SMatthew G. Knepley } break; 5150552f7358SJed Brown case ADD_VALUES: 5151552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5152552f7358SJed Brown PetscInt o = points[p+1]; 5153552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5154552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5155552f7358SJed Brown } break; 5156552f7358SJed Brown case ADD_ALL_VALUES: 5157552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5158552f7358SJed Brown PetscInt o = points[p+1]; 5159552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5160552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5161552f7358SJed Brown } break; 5162552f7358SJed Brown default: 516382f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5164552f7358SJed Brown } 5165552f7358SJed Brown } 51661a271a75SMatthew G. Knepley /* Cleanup points */ 51671a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 51681a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 51691a271a75SMatthew G. Knepley /* Cleanup array */ 5170552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5171552f7358SJed Brown PetscFunctionReturn(0); 5172552f7358SJed Brown } 5173552f7358SJed Brown 5174552f7358SJed Brown #undef __FUNCT__ 5175552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5176b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5177552f7358SJed Brown { 5178552f7358SJed Brown PetscMPIInt rank; 5179552f7358SJed Brown PetscInt i, j; 5180552f7358SJed Brown PetscErrorCode ierr; 5181552f7358SJed Brown 5182552f7358SJed Brown PetscFunctionBegin; 518382f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 518477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5185b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5186b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5187b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5188b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 518977a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5190b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5191519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51927eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5193552f7358SJed Brown #else 5194b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5195552f7358SJed Brown #endif 5196552f7358SJed Brown } 519777a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5198552f7358SJed Brown } 5199552f7358SJed Brown PetscFunctionReturn(0); 5200552f7358SJed Brown } 5201552f7358SJed Brown 5202552f7358SJed Brown #undef __FUNCT__ 5203552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5204552f7358SJed Brown /* . off - The global offset of this point */ 5205e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5206a6dfd86eSKarl Rupp { 5207e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5208552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5209552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5210552f7358SJed Brown PetscInt cind = 0, k; 5211552f7358SJed Brown PetscErrorCode ierr; 5212552f7358SJed Brown 5213552f7358SJed Brown PetscFunctionBegin; 5214552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5215552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5216552f7358SJed Brown if (!cdof || setBC) { 5217552f7358SJed Brown if (orientation >= 0) { 5218e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5219552f7358SJed Brown } else { 5220e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5221552f7358SJed Brown } 5222552f7358SJed Brown } else { 5223552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5224552f7358SJed Brown if (orientation >= 0) { 5225552f7358SJed Brown for (k = 0; k < dof; ++k) { 5226552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5227552f7358SJed Brown /* Insert check for returning constrained indices */ 5228e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5229552f7358SJed Brown ++cind; 5230552f7358SJed Brown } else { 5231e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5232552f7358SJed Brown } 5233552f7358SJed Brown } 5234552f7358SJed Brown } else { 5235552f7358SJed Brown for (k = 0; k < dof; ++k) { 5236552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5237552f7358SJed Brown /* Insert check for returning constrained indices */ 5238e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5239552f7358SJed Brown ++cind; 5240552f7358SJed Brown } else { 5241e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5242552f7358SJed Brown } 5243552f7358SJed Brown } 5244552f7358SJed Brown } 5245552f7358SJed Brown } 5246e6ccafaeSMatthew G Knepley *loff += dof; 5247552f7358SJed Brown PetscFunctionReturn(0); 5248552f7358SJed Brown } 5249552f7358SJed Brown 5250552f7358SJed Brown #undef __FUNCT__ 5251552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5252552f7358SJed Brown /* . off - The global offset of this point */ 5253a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5254a6dfd86eSKarl Rupp { 5255552f7358SJed Brown PetscInt numFields, foff, f; 5256552f7358SJed Brown PetscErrorCode ierr; 5257552f7358SJed Brown 5258552f7358SJed Brown PetscFunctionBegin; 5259552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5260552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5261552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5262552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5263552f7358SJed Brown PetscInt cind = 0, k, c; 5264552f7358SJed Brown 5265552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5266552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5267552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5268552f7358SJed Brown if (!cfdof || setBC) { 5269552f7358SJed Brown if (orientation >= 0) { 52700d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5271552f7358SJed Brown } else { 5272552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5273552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5274552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5275552f7358SJed Brown } 5276552f7358SJed Brown } 5277552f7358SJed Brown } 5278552f7358SJed Brown } else { 5279552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5280552f7358SJed Brown if (orientation >= 0) { 5281552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5282552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5283552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5284552f7358SJed Brown ++cind; 5285552f7358SJed Brown } else { 5286552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5287552f7358SJed Brown } 5288552f7358SJed Brown } 5289552f7358SJed Brown } else { 5290552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5291552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5292552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5293552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5294552f7358SJed Brown ++cind; 5295552f7358SJed Brown } else { 5296552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5297552f7358SJed Brown } 5298552f7358SJed Brown } 5299552f7358SJed Brown } 5300552f7358SJed Brown } 5301552f7358SJed Brown } 5302552f7358SJed Brown foff += fdof - cfdof; 5303552f7358SJed Brown foffs[f] += fdof; 5304552f7358SJed Brown } 5305552f7358SJed Brown PetscFunctionReturn(0); 5306552f7358SJed Brown } 5307552f7358SJed Brown 5308552f7358SJed Brown #undef __FUNCT__ 5309552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 53107f5d1fdeSMatthew G. Knepley /*@C 53117f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 53127f5d1fdeSMatthew G. Knepley 53137f5d1fdeSMatthew G. Knepley Not collective 53147f5d1fdeSMatthew G. Knepley 53157f5d1fdeSMatthew G. Knepley Input Parameters: 53167f5d1fdeSMatthew G. Knepley + dm - The DM 5317ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5318ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 53197f5d1fdeSMatthew G. Knepley . A - The matrix 53207f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 53217f5d1fdeSMatthew G. Knepley . values - The array of values 53227f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 53237f5d1fdeSMatthew G. Knepley 53247f5d1fdeSMatthew G. Knepley Fortran Notes: 53257f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 53267f5d1fdeSMatthew G. Knepley 53277f5d1fdeSMatthew G. Knepley Level: intermediate 53287f5d1fdeSMatthew G. Knepley 53297f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 53307f5d1fdeSMatthew G. Knepley @*/ 53317c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5332552f7358SJed Brown { 5333552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 53341b406b76SMatthew G. Knepley PetscSection clSection; 53351b406b76SMatthew G. Knepley IS clPoints; 53360298fd71SBarry Smith PetscInt *points = NULL; 53371b406b76SMatthew G. Knepley const PetscInt *clp; 5338552f7358SJed Brown PetscInt *indices; 5339552f7358SJed Brown PetscInt offsets[32]; 5340552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5341552f7358SJed Brown PetscErrorCode ierr; 5342552f7358SJed Brown 5343552f7358SJed Brown PetscFunctionBegin; 5344552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5345ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 53463dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5347ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 53483dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 53493dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5350552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 535182f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5352552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 53531b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 53541b406b76SMatthew G. Knepley if (!clPoints) { 5355552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5356552f7358SJed Brown /* Compress out points not in the section */ 5357552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5358552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5359552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5360552f7358SJed Brown points[q*2] = points[p]; 5361552f7358SJed Brown points[q*2+1] = points[p+1]; 5362552f7358SJed Brown ++q; 5363552f7358SJed Brown } 5364552f7358SJed Brown } 5365552f7358SJed Brown numPoints = q; 53661b406b76SMatthew G. Knepley } else { 53671b406b76SMatthew G. Knepley PetscInt dof, off; 53681b406b76SMatthew G. Knepley 53691b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 53701b406b76SMatthew G. Knepley numPoints = dof/2; 53711b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 53721b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 53731b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 53741b406b76SMatthew G. Knepley } 5375552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5376552f7358SJed Brown PetscInt fdof; 5377552f7358SJed Brown 5378552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5379552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5380552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5381552f7358SJed Brown offsets[f+1] += fdof; 5382552f7358SJed Brown } 5383552f7358SJed Brown numIndices += dof; 5384552f7358SJed Brown } 53850d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 53860d644c17SKarl Rupp 538782f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5388552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5389552f7358SJed Brown if (numFields) { 5390552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5391552f7358SJed Brown PetscInt o = points[p+1]; 5392552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5393552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5394552f7358SJed Brown } 5395552f7358SJed Brown } else { 5396e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5397552f7358SJed Brown PetscInt o = points[p+1]; 5398552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5399e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5400552f7358SJed Brown } 5401552f7358SJed Brown } 5402b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5403552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5404552f7358SJed Brown if (ierr) { 5405552f7358SJed Brown PetscMPIInt rank; 5406552f7358SJed Brown PetscErrorCode ierr2; 5407552f7358SJed Brown 540882f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 540977a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5410b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 54116a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5412552f7358SJed Brown CHKERRQ(ierr); 5413552f7358SJed Brown } 54141b406b76SMatthew G. Knepley if (!clPoints) { 5415552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 54161b406b76SMatthew G. Knepley } else { 54171b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 54181b406b76SMatthew G. Knepley } 5419552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5420552f7358SJed Brown PetscFunctionReturn(0); 5421552f7358SJed Brown } 5422552f7358SJed Brown 5423552f7358SJed Brown #undef __FUNCT__ 5424de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5425de41b84cSMatthew G. Knepley PetscErrorCode DMPlexMatSetClosureRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5426de41b84cSMatthew G. Knepley { 5427de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5428de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5429de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5430de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5431de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5432de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 54334ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5434de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5435de41b84cSMatthew G. Knepley 5436de41b84cSMatthew G. Knepley PetscFunctionBegin; 5437de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5438de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5439de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5440de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5441de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5442de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5443de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5444de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5445de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5446de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5447de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5448de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5449de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5450de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5451de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5452de41b84cSMatthew G. Knepley /* Column indices */ 5453de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 54544ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5455de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5456de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5457de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5458de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5459de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5460de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5461de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5462de41b84cSMatthew G. Knepley ++q; 5463de41b84cSMatthew G. Knepley } 5464de41b84cSMatthew G. Knepley } 5465de41b84cSMatthew G. Knepley numCPoints = q; 5466de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5467de41b84cSMatthew G. Knepley PetscInt fdof; 5468de41b84cSMatthew G. Knepley 5469de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 54704ca5e9f5SMatthew G. Knepley if (!dof) continue; 5471de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5472de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5473de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5474de41b84cSMatthew G. Knepley } 5475de41b84cSMatthew G. Knepley numCIndices += dof; 5476de41b84cSMatthew G. Knepley } 5477de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5478de41b84cSMatthew G. Knepley /* Row indices */ 5479de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5480de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 54811ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5482de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5483de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5484de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5485de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5486de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5487de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5488de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 54894ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 54904ca5e9f5SMatthew G. Knepley if (!dof) continue; 54914ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 54924ca5e9f5SMatthew G. Knepley if (s < q) continue; 5493de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5494de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5495de41b84cSMatthew G. Knepley ++q; 5496de41b84cSMatthew G. Knepley } 5497de41b84cSMatthew G. Knepley } 5498de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5499de41b84cSMatthew G. Knepley } 5500de41b84cSMatthew G. Knepley numFPoints = q; 5501de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5502de41b84cSMatthew G. Knepley PetscInt fdof; 5503de41b84cSMatthew G. Knepley 5504de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 55054ca5e9f5SMatthew G. Knepley if (!dof) continue; 5506de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5507de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5508de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5509de41b84cSMatthew G. Knepley } 5510de41b84cSMatthew G. Knepley numFIndices += dof; 5511de41b84cSMatthew G. Knepley } 5512de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5513de41b84cSMatthew G. Knepley 5514de41b84cSMatthew G. Knepley if (numFields && foffsets[numFields] != numFIndices) SETERRQ2(PetscObjectComm((PetscObject)dmf), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", foffsets[numFields], numFIndices); 5515de41b84cSMatthew G. Knepley if (numFields && coffsets[numFields] != numCIndices) SETERRQ2(PetscObjectComm((PetscObject)dmc), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", coffsets[numFields], numCIndices); 5516de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5517de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5518de41b84cSMatthew G. Knepley if (numFields) { 5519de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5520de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5521de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5522de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5523de41b84cSMatthew G. Knepley } 5524de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5525de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5526de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5527de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5528de41b84cSMatthew G. Knepley } 5529de41b84cSMatthew G. Knepley } else { 5530de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5531de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5532de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5533de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5534de41b84cSMatthew G. Knepley } 5535de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5536de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5537de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5538de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5539de41b84cSMatthew G. Knepley } 5540de41b84cSMatthew G. Knepley } 5541de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5542de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5543de41b84cSMatthew G. Knepley if (ierr) { 5544de41b84cSMatthew G. Knepley PetscMPIInt rank; 5545de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5546de41b84cSMatthew G. Knepley 5547de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5548de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5549de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5550de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5551de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5552de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5553de41b84cSMatthew G. Knepley } 5554549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5555de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5556de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5557de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5558de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5559de41b84cSMatthew G. Knepley } 5560de41b84cSMatthew G. Knepley 5561de41b84cSMatthew G. Knepley #undef __FUNCT__ 5562770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5563f96281f8SMatthew G. Knepley /*@ 5564f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5565f96281f8SMatthew G. Knepley 5566f96281f8SMatthew G. Knepley Input Parameter: 5567f96281f8SMatthew G. Knepley . dm - The DMPlex object 5568f96281f8SMatthew G. Knepley 5569f96281f8SMatthew G. Knepley Output Parameters: 5570f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5571f96281f8SMatthew G. Knepley . cMax - The first hybrid face 5572f96281f8SMatthew G. Knepley . cMax - The first hybrid edge 5573f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex 5574f96281f8SMatthew G. Knepley 5575f96281f8SMatthew G. Knepley Level: developer 5576f96281f8SMatthew G. Knepley 5577f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh() 5578f96281f8SMatthew G. Knepley @*/ 5579770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5580552f7358SJed Brown { 5581552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5582770b213bSMatthew G Knepley PetscInt dim; 5583770b213bSMatthew G Knepley PetscErrorCode ierr; 5584552f7358SJed Brown 5585552f7358SJed Brown PetscFunctionBegin; 5586552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5587770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5588770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5589770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5590770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5591770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5592552f7358SJed Brown PetscFunctionReturn(0); 5593552f7358SJed Brown } 5594552f7358SJed Brown 5595552f7358SJed Brown #undef __FUNCT__ 5596770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5597770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5598552f7358SJed Brown { 5599552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5600770b213bSMatthew G Knepley PetscInt dim; 5601770b213bSMatthew G Knepley PetscErrorCode ierr; 5602552f7358SJed Brown 5603552f7358SJed Brown PetscFunctionBegin; 5604552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5605770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5606770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5607770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5608770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5609770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5610552f7358SJed Brown PetscFunctionReturn(0); 5611552f7358SJed Brown } 5612552f7358SJed Brown 5613552f7358SJed Brown #undef __FUNCT__ 5614552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5615552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5616552f7358SJed Brown { 5617552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5618552f7358SJed Brown 5619552f7358SJed Brown PetscFunctionBegin; 5620552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5621552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5622552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5623552f7358SJed Brown PetscFunctionReturn(0); 5624552f7358SJed Brown } 5625552f7358SJed Brown 5626552f7358SJed Brown #undef __FUNCT__ 5627552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5628552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5629552f7358SJed Brown { 5630552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5631552f7358SJed Brown 5632552f7358SJed Brown PetscFunctionBegin; 5633552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5634552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5635552f7358SJed Brown PetscFunctionReturn(0); 5636552f7358SJed Brown } 5637552f7358SJed Brown 5638552f7358SJed Brown #undef __FUNCT__ 5639552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5640552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5641552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering) 5642552f7358SJed Brown { 5643552f7358SJed Brown PetscSection section, globalSection; 5644552f7358SJed Brown PetscInt *numbers, p; 5645552f7358SJed Brown PetscErrorCode ierr; 5646552f7358SJed Brown 5647552f7358SJed Brown PetscFunctionBegin; 564882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5649552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5650552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5651552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5652552f7358SJed Brown } 5653552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5654552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5655785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5656552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5657552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5658552f7358SJed Brown } 565982f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5660552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5661552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5662552f7358SJed Brown PetscFunctionReturn(0); 5663552f7358SJed Brown } 5664552f7358SJed Brown 5665552f7358SJed Brown #undef __FUNCT__ 5666552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5667552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5668552f7358SJed Brown { 5669552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5670552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5671552f7358SJed Brown PetscErrorCode ierr; 5672552f7358SJed Brown 5673552f7358SJed Brown PetscFunctionBegin; 5674552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5675552f7358SJed Brown if (!mesh->globalCellNumbers) { 5676552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5677552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 56780298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 56790d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5680552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5681552f7358SJed Brown } 5682552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5683552f7358SJed Brown PetscFunctionReturn(0); 5684552f7358SJed Brown } 5685552f7358SJed Brown 5686552f7358SJed Brown #undef __FUNCT__ 5687552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5688552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5689552f7358SJed Brown { 5690552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5691552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5692552f7358SJed Brown PetscErrorCode ierr; 5693552f7358SJed Brown 5694552f7358SJed Brown PetscFunctionBegin; 5695552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5696552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5697552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 56980298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 56990d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5700552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5701552f7358SJed Brown } 5702552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5703552f7358SJed Brown PetscFunctionReturn(0); 5704552f7358SJed Brown } 5705552f7358SJed Brown 5706552f7358SJed Brown 5707552f7358SJed Brown #undef __FUNCT__ 5708552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5709552f7358SJed Brown /*@C 5710552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5711552f7358SJed Brown the local section and an SF describing the section point overlap. 5712552f7358SJed Brown 5713552f7358SJed Brown Input Parameters: 5714552f7358SJed Brown + s - The PetscSection for the local field layout 5715552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5716552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5717552f7358SJed Brown . label - The label specifying the points 5718552f7358SJed Brown - labelValue - The label stratum specifying the points 5719552f7358SJed Brown 5720552f7358SJed Brown Output Parameter: 5721552f7358SJed Brown . gsection - The PetscSection for the global field layout 5722552f7358SJed Brown 5723552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5724552f7358SJed Brown 5725552f7358SJed Brown Level: developer 5726552f7358SJed Brown 5727552f7358SJed Brown .seealso: PetscSectionCreate() 5728552f7358SJed Brown @*/ 5729552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5730552f7358SJed Brown { 57317ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5732552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5733552f7358SJed Brown PetscErrorCode ierr; 5734552f7358SJed Brown 5735552f7358SJed Brown PetscFunctionBegin; 5736552f7358SJed Brown ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr); 5737552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5738552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 57397ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 57407ec39499SMatthew G. Knepley if (nroots >= 0) { 57417ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 57421795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 57437ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 57441795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 57457ec39499SMatthew G. Knepley } else { 57467ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 57477ec39499SMatthew G. Knepley } 57487ec39499SMatthew G. Knepley } 5749552f7358SJed Brown /* Mark ghost points with negative dof */ 5750552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5751552f7358SJed Brown PetscInt value; 5752552f7358SJed Brown 5753552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5754552f7358SJed Brown if (value != labelValue) continue; 5755552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5756552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5757552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5758552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 57597ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5760552f7358SJed Brown } 5761552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5762552f7358SJed Brown if (nroots >= 0) { 57637ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 57647ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5765552f7358SJed Brown if (nroots > pEnd-pStart) { 57667ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5767552f7358SJed Brown } 5768552f7358SJed Brown } 5769552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5770552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5771552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5772552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5773552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5774552f7358SJed Brown } 5775552f7358SJed Brown ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr); 5776552f7358SJed Brown globalOff -= off; 5777552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5778552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 57797ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5780552f7358SJed Brown } 5781552f7358SJed Brown /* Put in negative offsets for ghost points */ 5782552f7358SJed Brown if (nroots >= 0) { 57837ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 57847ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5785552f7358SJed Brown if (nroots > pEnd-pStart) { 57867ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5787552f7358SJed Brown } 5788552f7358SJed Brown } 57897ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5790552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5791552f7358SJed Brown PetscFunctionReturn(0); 5792552f7358SJed Brown } 5793ca8062c8SMatthew G. Knepley 5794ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5795ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5796ca8062c8SMatthew G. Knepley /*@ 5797ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5798ca8062c8SMatthew G. Knepley 5799ca8062c8SMatthew G. Knepley Input Parameters: 5800ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5801ca8062c8SMatthew G. Knepley 5802ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5803ca8062c8SMatthew G. Knepley 5804ca8062c8SMatthew G. Knepley Level: developer 5805ca8062c8SMatthew G. Knepley 58069bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5807ca8062c8SMatthew G. Knepley @*/ 5808ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5809ca8062c8SMatthew G. Knepley { 5810ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5811ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5812ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5813ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5814ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5815ca8062c8SMatthew G. Knepley 5816ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5817ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5818ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5819ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5820ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5821ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5822ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5823ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5824ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5825ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 582642e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 582742e66dfaSMatthew G. Knepley PetscInt d; 582842e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 582942e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 583042e66dfaSMatthew G. Knepley } 5831ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5832ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5833ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5834ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5835ca8062c8SMatthew G. Knepley } 583642e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5837ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5838ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5839ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5840ca8062c8SMatthew G. Knepley } 5841ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5842ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5843ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5844ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5845ca8062c8SMatthew G. Knepley } 5846ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 584742e66dfaSMatthew G. Knepley if (dup) { 584842e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 584942e66dfaSMatthew G. Knepley } else { 5850ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5851ca8062c8SMatthew G. Knepley } 5852ca8062c8SMatthew G. Knepley } 585342e66dfaSMatthew G. Knepley } 5854ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5855ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5856ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5857ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5858ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5859ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5860ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5861ca8062c8SMatthew G. Knepley } 5862ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5863ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5864ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5865ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5866ca8062c8SMatthew G. Knepley } 5867ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5868ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5869ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5870ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5871ca8062c8SMatthew G. Knepley } 5872ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5873ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5874ca8062c8SMatthew G. Knepley } 5875ca8062c8SMatthew G. Knepley } 5876ca8062c8SMatthew G. Knepley } 5877ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5878ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5879ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5880ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5881ca8062c8SMatthew G. Knepley } 5882ca8062c8SMatthew G. Knepley 5883ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5884ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5885ca8062c8SMatthew G. Knepley /*@ 5886ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5887ca8062c8SMatthew G. Knepley 5888ca8062c8SMatthew G. Knepley Input Parameters: 5889ca8062c8SMatthew G. Knepley + dm - The DMPlex object 589058723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 589158723a97SMatthew G. Knepley - cellHeight - Normally 0 5892ca8062c8SMatthew G. Knepley 5893ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5894ca8062c8SMatthew G. Knepley 5895ca8062c8SMatthew G. Knepley Level: developer 5896ca8062c8SMatthew G. Knepley 58979bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 5898ca8062c8SMatthew G. Knepley @*/ 589958723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 5900ca8062c8SMatthew G. Knepley { 590142363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 5902ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5903ca8062c8SMatthew G. Knepley 5904ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5905ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5906ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5907ca8062c8SMatthew G. Knepley switch (dim) { 590842363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 590942363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 591042363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 5911ca8062c8SMatthew G. Knepley default: 5912ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 5913ca8062c8SMatthew G. Knepley } 591458723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 591558723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 5916ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 5917ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 5918ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 591958723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 592058723a97SMatthew G. Knepley 592158723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 592258723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 592358723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 592458723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 592558723a97SMatthew G. Knepley } 592658723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 5927ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 5928ca8062c8SMatthew G. Knepley } 592942363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 593042363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 593142363296SMatthew G. Knepley 593242363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 593342363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 593442363296SMatthew G. Knepley const PetscInt p = closure[cl]; 593542363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 593642363296SMatthew G. Knepley } 593742363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 593842363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 593942363296SMatthew G. Knepley } 5940ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5941ca8062c8SMatthew G. Knepley } 59429bf0dad6SMatthew G. Knepley 59439bf0dad6SMatthew G. Knepley #undef __FUNCT__ 59449bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 59459bf0dad6SMatthew G. Knepley /*@ 59469bf0dad6SMatthew G. Knepley DMPlexCheckFaces - Check that the faces of each cell give a vertex order this is consistent with what we expect from the cell type 59479bf0dad6SMatthew G. Knepley 59489bf0dad6SMatthew G. Knepley Input Parameters: 59499bf0dad6SMatthew G. Knepley + dm - The DMPlex object 59509bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 59519bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 59529bf0dad6SMatthew G. Knepley 59539bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 59549bf0dad6SMatthew G. Knepley 59559bf0dad6SMatthew G. Knepley Level: developer 59569bf0dad6SMatthew G. Knepley 59579bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 59589bf0dad6SMatthew G. Knepley @*/ 59599bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 59609bf0dad6SMatthew G. Knepley { 59613554e41dSMatthew G. Knepley PetscInt pMax[4]; 59623554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 59639bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 59649bf0dad6SMatthew G. Knepley 59659bf0dad6SMatthew G. Knepley PetscFunctionBegin; 59669bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 59679bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 59689bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 596925abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 59703554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 59713554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 59723554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 59739bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 59749bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 59759bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 59769bf0dad6SMatthew G. Knepley 597725abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 59789bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 59799bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 59809bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 59819bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 59829bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 59839bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 59849bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 59859bf0dad6SMatthew G. Knepley } 59863554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 59879bf0dad6SMatthew G. Knepley if (coneSize != numFaces) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d faces but should have %d", c, coneSize, numFaces); 59889bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 59899bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 59909bf0dad6SMatthew G. Knepley 59919bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 59929bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 59939bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 59949bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 59959bf0dad6SMatthew G. Knepley } 5996e003ed69SMatthew G. Knepley if (fnumCorners != faceSize) SETERRQ5(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d has %d vertices but should have %d", cone[f], f, c, fnumCorners, faceSize); 59979bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 5998e003ed69SMatthew G. Knepley if (fclosure[v] != faces[f*faceSize+v]) SETERRQ6(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d vertex %d, %d != %d", cone[f], f, c, v, fclosure[v], faces[f*faceSize+v]); 59999bf0dad6SMatthew G. Knepley } 60009bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 60019bf0dad6SMatthew G. Knepley } 60029bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 60039bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 60049bf0dad6SMatthew G. Knepley } 60053554e41dSMatthew G. Knepley } 6006552f7358SJed Brown PetscFunctionReturn(0); 6007552f7358SJed Brown } 60083913d7c8SMatthew G. Knepley 60093913d7c8SMatthew G. Knepley #undef __FUNCT__ 6010bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6011bceba477SMatthew G. Knepley /* Pointwise interpolation 6012bceba477SMatthew G. Knepley Just code FEM for now 6013bceba477SMatthew G. Knepley u^f = I u^c 60144ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 60154ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 60164ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6017bceba477SMatthew G. Knepley */ 6018bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6019bceba477SMatthew G. Knepley { 6020bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6021bceba477SMatthew G. Knepley PetscInt m, n; 6022a063dac3SMatthew G. Knepley void *ctx; 6023bceba477SMatthew G. Knepley PetscErrorCode ierr; 6024bceba477SMatthew G. Knepley 6025bceba477SMatthew G. Knepley PetscFunctionBegin; 6026bceba477SMatthew G. Knepley /* 6027bceba477SMatthew G. Knepley Loop over coarse cells 6028bceba477SMatthew G. Knepley Loop over coarse basis functions 6029bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6030bceba477SMatthew G. Knepley Loop over fine dual basis functions 6031bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6032bceba477SMatthew G. Knepley Sum 6033bceba477SMatthew G. Knepley Update local element matrix 6034bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6035bceba477SMatthew G. Knepley 6036bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6037bceba477SMatthew G. Knepley */ 6038bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6039bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6040bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6041bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6042bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6043bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6044bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6045bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6046bceba477SMatthew G. Knepley ierr = MatSetUp(*interpolation);CHKERRQ(ierr); 6047bceba477SMatthew G. Knepley ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr); 6048bceba477SMatthew G. Knepley ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr); 6049a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6050a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 60515d1c2e58SMatthew G. Knepley /* Use naive scaling */ 60525d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6053a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6054a063dac3SMatthew G. Knepley } 6055bceba477SMatthew G. Knepley 6056a063dac3SMatthew G. Knepley #undef __FUNCT__ 6057a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6058a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6059a063dac3SMatthew G. Knepley { 606090748bafSMatthew G. Knepley Vec cv, fv; 606190748bafSMatthew G. Knepley IS cis, fis, fpointIS; 606290748bafSMatthew G. Knepley PetscSection sc, gsc, gsf; 606390748bafSMatthew G. Knepley const PetscInt *fpoints; 606490748bafSMatthew G. Knepley PetscInt *cindices, *findices; 606590748bafSMatthew G. Knepley PetscInt cpStart, cpEnd, m, off, cp; 606690748bafSMatthew G. Knepley PetscErrorCode ierr; 606790748bafSMatthew G. Knepley 6068a063dac3SMatthew G. Knepley PetscFunctionBegin; 606990748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 607090748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmFine, &fv);CHKERRQ(ierr); 607190748bafSMatthew G. Knepley ierr = DMGetDefaultSection(dmCoarse, &sc);CHKERRQ(ierr); 607290748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 607390748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 607490748bafSMatthew G. Knepley ierr = DMPlexCreateCoarsePointIS(dmCoarse, &fpointIS);CHKERRQ(ierr); 607590748bafSMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &m);CHKERRQ(ierr); 607690748bafSMatthew G. Knepley ierr = PetscMalloc2(m,&cindices,m,&findices);CHKERRQ(ierr); 607790748bafSMatthew G. Knepley ierr = PetscSectionGetChart(gsc, &cpStart, &cpEnd);CHKERRQ(ierr); 607890748bafSMatthew G. Knepley ierr = ISGetIndices(fpointIS, &fpoints);CHKERRQ(ierr); 607990748bafSMatthew G. Knepley for (cp = cpStart, off = 0; cp < cpEnd; ++cp) { 608090748bafSMatthew G. Knepley const PetscInt *cdofsC = NULL; 608190748bafSMatthew G. Knepley PetscInt fp = fpoints[cp-cpStart], dofC, cdofC, dofF, offC, offF, d, e; 608290748bafSMatthew G. Knepley 608390748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsc, cp, &dofC);CHKERRQ(ierr); 608490748bafSMatthew G. Knepley if (dofC <= 0) continue; 608590748bafSMatthew G. Knepley ierr = PetscSectionGetConstraintDof(sc, cp, &cdofC);CHKERRQ(ierr); 608690748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsf, fp, &dofF);CHKERRQ(ierr); 608790748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsc, cp, &offC);CHKERRQ(ierr); 608890748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsf, fp, &offF);CHKERRQ(ierr); 608990748bafSMatthew G. Knepley if (cdofC) {ierr = PetscSectionGetConstraintIndices(sc, cp, &cdofsC);CHKERRQ(ierr);} 609090748bafSMatthew G. Knepley if (dofC != dofF) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %d (%d) has %d coarse dofs != %d fine dofs", cp, fp, dofC, dofF); 609190748bafSMatthew G. Knepley if (offC < 0 || offF < 0) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Coarse point %d has invalid offset %d (%d)", cp, offC, offF); 609290748bafSMatthew G. Knepley for (d = 0, e = 0; d < dofC; ++d) { 609390748bafSMatthew G. Knepley if (cdofsC && cdofsC[e] == d) {++e; continue;} 609490748bafSMatthew G. Knepley cindices[off+d-e] = offC+d; findices[off+d-e] = offF+d; 609590748bafSMatthew G. Knepley } 609690748bafSMatthew G. Knepley if (e != cdofC) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %d (%d) has invalid number of constraints %d != %d", cp, fp, e, cdofC); 609790748bafSMatthew G. Knepley off += dofC-cdofC; 609890748bafSMatthew G. Knepley } 609990748bafSMatthew G. Knepley ierr = ISRestoreIndices(fpointIS, &fpoints);CHKERRQ(ierr); 610090748bafSMatthew G. Knepley if (off != m) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of coarse dofs %d != %d", off, m); 610190748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, cindices, PETSC_OWN_POINTER, &cis);CHKERRQ(ierr); 610290748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, findices, PETSC_OWN_POINTER, &fis);CHKERRQ(ierr); 610390748bafSMatthew G. Knepley ierr = VecScatterCreate(cv, cis, fv, fis, ctx);CHKERRQ(ierr); 610490748bafSMatthew G. Knepley ierr = ISDestroy(&cis);CHKERRQ(ierr); 610590748bafSMatthew G. Knepley ierr = ISDestroy(&fis);CHKERRQ(ierr); 610690748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmFine, &fv);CHKERRQ(ierr); 610790748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 610890748bafSMatthew G. Knepley ierr = ISDestroy(&fpointIS);CHKERRQ(ierr); 6109bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6110bceba477SMatthew G. Knepley } 6111bceba477SMatthew G. Knepley 6112bceba477SMatthew G. Knepley #undef __FUNCT__ 6113fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6114fd59a867SMatthew G. Knepley /* Pointwise interpolation 6115fd59a867SMatthew G. Knepley Just code FEM for now 6116fd59a867SMatthew G. Knepley u^f = I u^c 6117fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6118fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6119fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6120fd59a867SMatthew G. Knepley */ 6121fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6122fd59a867SMatthew G. Knepley { 6123fd59a867SMatthew G. Knepley PetscSection section; 6124fd59a867SMatthew G. Knepley IS *bcPoints; 6125286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6126286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6127fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6128fd59a867SMatthew G. Knepley 6129fd59a867SMatthew G. Knepley PetscFunctionBegin; 6130fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6131286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6132fd59a867SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6133fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6134fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6135fd59a867SMatthew G. Knepley PetscBool isEssential; 6136fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6137fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6138fd59a867SMatthew G. Knepley } 6139fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6140fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6141fd59a867SMatthew G. Knepley const char *bdLabel; 6142fd59a867SMatthew G. Knepley DMLabel label; 6143fd59a867SMatthew G. Knepley const PetscInt *values; 6144fd59a867SMatthew G. Knepley PetscInt field, numValues; 6145fd59a867SMatthew G. Knepley PetscBool isEssential, has; 6146fd59a867SMatthew G. Knepley 6147fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6148fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6149fd59a867SMatthew G. Knepley ierr = DMPlexHasLabel(dm, bdLabel, &has);CHKERRQ(ierr); 6150fd59a867SMatthew G. Knepley if (!has) { 6151fd59a867SMatthew G. Knepley ierr = DMPlexCreateLabel(dm, bdLabel);CHKERRQ(ierr); 6152fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 6153fd59a867SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 6154fd59a867SMatthew G. Knepley } 6155fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 6156fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 6157fd59a867SMatthew G. Knepley if (isEssential) { 6158fd59a867SMatthew G. Knepley bcFields[bc] = field; 6159fd59a867SMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &bcPoints[bc++]);CHKERRQ(ierr); 6160fd59a867SMatthew G. Knepley } 6161fd59a867SMatthew G. Knepley } 6162fd59a867SMatthew G. Knepley /* Handle discretization */ 6163fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6164286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6165fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6166fd59a867SMatthew G. Knepley PetscFE fe; 6167286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6168fd59a867SMatthew G. Knepley PetscInt d; 6169fd59a867SMatthew G. Knepley 617018abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6171fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6172286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6173286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6174fd59a867SMatthew G. Knepley } 6175286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6176286d8613SMatthew G. Knepley PetscInt d; 6177286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6178286d8613SMatthew G. Knepley if ((numDof[f*(dim+1)+d] > 0) && (depth < dim)) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Mesh must be interpolated when unknowns are specified on edges or faces."); 6179286d8613SMatthew G. Knepley } 6180286d8613SMatthew G. Knepley } 6181286d8613SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, §ion);CHKERRQ(ierr); 6182fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6183fd59a867SMatthew G. Knepley PetscFE fe; 6184fd59a867SMatthew G. Knepley const char *name; 618518abd763SMatthew G. Knepley 618618abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6187fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6188fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6189fd59a867SMatthew G. Knepley } 6190fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6191fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6192fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6193fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6194286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6195bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6196bceba477SMatthew G. Knepley } 6197bceba477SMatthew G. Knepley 6198bceba477SMatthew G. Knepley #undef __FUNCT__ 61993913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 62003913d7c8SMatthew G. Knepley /*@ 62013913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 62023913d7c8SMatthew G. Knepley 62033913d7c8SMatthew G. Knepley Input Parameter: 62043913d7c8SMatthew G. Knepley . dm - The DMPlex object 62053913d7c8SMatthew G. Knepley 62063913d7c8SMatthew G. Knepley Output Parameter: 62073913d7c8SMatthew G. Knepley . cdm - The coarse DM 62083913d7c8SMatthew G. Knepley 62093913d7c8SMatthew G. Knepley Level: intermediate 62103913d7c8SMatthew G. Knepley 62113913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 62123913d7c8SMatthew G. Knepley @*/ 62133913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 62143913d7c8SMatthew G. Knepley { 62153913d7c8SMatthew G. Knepley PetscFunctionBegin; 62163913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 62173913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 62183913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 62193913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 62203913d7c8SMatthew G. Knepley } 62213913d7c8SMatthew G. Knepley 62223913d7c8SMatthew G. Knepley #undef __FUNCT__ 62233913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 62243913d7c8SMatthew G. Knepley /*@ 62253913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 62263913d7c8SMatthew G. Knepley 62273913d7c8SMatthew G. Knepley Input Parameters: 62283913d7c8SMatthew G. Knepley + dm - The DMPlex object 62293913d7c8SMatthew G. Knepley - cdm - The coarse DM 62303913d7c8SMatthew G. Knepley 62313913d7c8SMatthew G. Knepley Level: intermediate 62323913d7c8SMatthew G. Knepley 62333913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 62343913d7c8SMatthew G. Knepley @*/ 62353913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 62363913d7c8SMatthew G. Knepley { 62373913d7c8SMatthew G. Knepley DM_Plex *mesh; 62383913d7c8SMatthew G. Knepley PetscErrorCode ierr; 62393913d7c8SMatthew G. Knepley 62403913d7c8SMatthew G. Knepley PetscFunctionBegin; 62413913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 62423913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 62433913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 62443913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 62453913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 62463913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 62473913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 62483913d7c8SMatthew G. Knepley } 6249