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> 5552f7358SJed Brown 6552f7358SJed Brown /* Logging support */ 71337e6e5SMatthew 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; 8552f7358SJed Brown 95a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 112c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer); 12552f7358SJed Brown 137e42fee7SMatthew G. Knepley #undef __FUNCT__ 147afe7537SMatthew G. Knepley #define __FUNCT__ "DMPlexGetFieldType_Internal" 157afe7537SMatthew G. Knepley PetscErrorCode DMPlexGetFieldType_Internal(DM dm, PetscSection section, PetscInt field, PetscInt *sStart, PetscInt *sEnd, PetscViewerVTKFieldType *ft) 167e42fee7SMatthew G. Knepley { 177e42fee7SMatthew G. Knepley PetscInt dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, vdof = 0, cdof = 0; 187e42fee7SMatthew G. Knepley PetscErrorCode ierr; 197e42fee7SMatthew G. Knepley 207e42fee7SMatthew G. Knepley PetscFunctionBegin; 217e42fee7SMatthew G. Knepley *ft = PETSC_VTK_POINT_FIELD; 227e42fee7SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 237e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 247e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 257e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 267e42fee7SMatthew G. Knepley if (field >= 0) { 277e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 287e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 297e42fee7SMatthew G. Knepley } else { 307e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 317e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 327e42fee7SMatthew G. Knepley } 337e42fee7SMatthew G. Knepley if (vdof) { 347e42fee7SMatthew G. Knepley *sStart = vStart; 357e42fee7SMatthew G. Knepley *sEnd = vEnd; 367e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 377e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 387e42fee7SMatthew G. Knepley } else if (cdof) { 397e42fee7SMatthew G. Knepley *sStart = cStart; 407e42fee7SMatthew G. Knepley *sEnd = cEnd; 417e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 427e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 437e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 447e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 457e42fee7SMatthew G. Knepley } 467e42fee7SMatthew G. Knepley 47552f7358SJed Brown #undef __FUNCT__ 48552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 49552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 50552f7358SJed Brown { 51552f7358SJed Brown DM dm; 52b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 53552f7358SJed Brown PetscErrorCode ierr; 54552f7358SJed Brown 55552f7358SJed Brown PetscFunctionBegin; 56552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 5782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 58552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 59b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 60b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 61ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 62ef31f671SMatthew G. Knepley PetscInt numFields; 63ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 64ef31f671SMatthew G. Knepley 65ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 66ef31f671SMatthew G. Knepley if (numFields) { 67ef31f671SMatthew G. Knepley PetscObject fe; 68ef31f671SMatthew G. Knepley 69ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 70ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 71ef31f671SMatthew G. Knepley } 72ef31f671SMatthew G. Knepley if (fem) { 73ef31f671SMatthew G. Knepley ierr = DMPlexInsertBoundaryValuesFEM(dm, v);CHKERRQ(ierr); 74ef31f671SMatthew G. Knepley } else { 75fcdd1374SMatthew G. Knepley PetscObject faceGeometry; 76fcdd1374SMatthew G. Knepley 77ef31f671SMatthew G. Knepley /* TODO Fix the time, and add FVM objects */ 78fcdd1374SMatthew G. Knepley ierr = PetscObjectQuery((PetscObject) dm, "FaceGeometry", &faceGeometry);CHKERRQ(ierr); 79fcdd1374SMatthew G. Knepley if (faceGeometry) {ierr = DMPlexInsertBoundaryValuesFVM(dm, 0.0, v);CHKERRQ(ierr);} 80ef31f671SMatthew G. Knepley } 81ef31f671SMatthew G. Knepley } 82552f7358SJed Brown if (isvtk) { 83552f7358SJed Brown PetscSection section; 84b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 85b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 86552f7358SJed Brown 87552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 887afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 89552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 90552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 91552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 92b136c2c9SMatthew G. Knepley } else if (ishdf5) { 93b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 94b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 95b136c2c9SMatthew G. Knepley #else 96b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 97b136c2c9SMatthew G. Knepley #endif 98552f7358SJed Brown } else { 9955f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 10055f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 101552f7358SJed Brown } 102552f7358SJed Brown PetscFunctionReturn(0); 103552f7358SJed Brown } 104552f7358SJed Brown 105552f7358SJed Brown #undef __FUNCT__ 106552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 107552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 108552f7358SJed Brown { 109552f7358SJed Brown DM dm; 11055f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 111552f7358SJed Brown PetscErrorCode ierr; 112552f7358SJed Brown 113552f7358SJed Brown PetscFunctionBegin; 114552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 11582f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 116552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 11733c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11855f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 119552f7358SJed Brown if (isvtk) { 120552f7358SJed Brown Vec locv; 121552f7358SJed Brown const char *name; 122552f7358SJed Brown 123552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 124552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 125552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 126552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 127552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 128552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 129552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 130b136c2c9SMatthew G. Knepley } else if (ishdf5) { 131b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 132b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 133b136c2c9SMatthew G. Knepley #else 134b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 135b136c2c9SMatthew G. Knepley #endif 136552f7358SJed Brown } else { 13755f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13855f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 139552f7358SJed Brown } 140552f7358SJed Brown PetscFunctionReturn(0); 141552f7358SJed Brown } 142552f7358SJed Brown 143552f7358SJed Brown #undef __FUNCT__ 1442c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1452c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1462c40f234SMatthew G. Knepley { 1472c40f234SMatthew G. Knepley DM dm; 1482c40f234SMatthew G. Knepley PetscBool ishdf5; 1492c40f234SMatthew G. Knepley PetscErrorCode ierr; 1502c40f234SMatthew G. Knepley 1512c40f234SMatthew G. Knepley PetscFunctionBegin; 1522c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1532c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1542c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1552c40f234SMatthew G. Knepley if (ishdf5) { 1562c40f234SMatthew G. Knepley DM dmBC; 1572c40f234SMatthew G. Knepley Vec gv; 1582c40f234SMatthew G. Knepley const char *name; 1592c40f234SMatthew G. Knepley 1602c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1612c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1622c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1632c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1642c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1652c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1662c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1672c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1682c40f234SMatthew G. Knepley } else { 1692c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1702c40f234SMatthew G. Knepley } 1712c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1722c40f234SMatthew G. Knepley } 1732c40f234SMatthew G. Knepley 1742c40f234SMatthew G. Knepley #undef __FUNCT__ 1752c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1762c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1772c40f234SMatthew G. Knepley { 1782c40f234SMatthew G. Knepley DM dm; 1792c40f234SMatthew G. Knepley PetscBool ishdf5; 1802c40f234SMatthew G. Knepley PetscErrorCode ierr; 1812c40f234SMatthew G. Knepley 1822c40f234SMatthew G. Knepley PetscFunctionBegin; 1832c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1842c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1852c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1862c40f234SMatthew G. Knepley if (ishdf5) { 187878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 188b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 189b136c2c9SMatthew G. Knepley #else 190b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 191878b459fSMatthew G. Knepley #endif 1922c40f234SMatthew G. Knepley } else { 1932c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 194552f7358SJed Brown } 195552f7358SJed Brown PetscFunctionReturn(0); 196552f7358SJed Brown } 197552f7358SJed Brown 198552f7358SJed Brown #undef __FUNCT__ 199552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 200552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 201552f7358SJed Brown { 202552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 203552f7358SJed Brown DM cdm; 204552f7358SJed Brown DMLabel markers; 205552f7358SJed Brown PetscSection coordSection; 206552f7358SJed Brown Vec coordinates; 207552f7358SJed Brown PetscViewerFormat format; 208552f7358SJed Brown PetscErrorCode ierr; 209552f7358SJed Brown 210552f7358SJed Brown PetscFunctionBegin; 211552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 212552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 213552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 214552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 215552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 216552f7358SJed Brown const char *name; 217552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 218552f7358SJed Brown PetscInt pStart, pEnd, p; 219552f7358SJed Brown PetscMPIInt rank, size; 220552f7358SJed Brown 22182f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 22282f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 223552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 224552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 225552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 226552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 227552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 228552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 229552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 230552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 231552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 232552f7358SJed Brown PetscInt dof, off, s; 233552f7358SJed Brown 234552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 235552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 236552f7358SJed Brown for (s = off; s < off+dof; ++s) { 237552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 238552f7358SJed Brown } 239552f7358SJed Brown } 240552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 241552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 242552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 243552f7358SJed Brown PetscInt dof, off, c; 244552f7358SJed Brown 245552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 246552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 247552f7358SJed Brown for (c = off; c < off+dof; ++c) { 248552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 249552f7358SJed Brown } 250552f7358SJed Brown } 251552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2520298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 253552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 254552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 255552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 256552f7358SJed Brown if (size > 1) { 257552f7358SJed Brown PetscSF sf; 258552f7358SJed Brown 259552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 260552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 261552f7358SJed Brown } 262552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 263552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 264552f7358SJed Brown const char *name; 265552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 266552f7358SJed Brown const int numColors = 3; 267552f7358SJed Brown PetscReal scale = 2.0; 268552f7358SJed Brown PetscScalar *coords; 269552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 270552f7358SJed Brown PetscMPIInt rank, size; 271552f7358SJed Brown 272552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 27382f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 27482f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 275552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 276552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 277770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 278770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 279552f7358SJed Brown \\usepackage{tikz}\n\ 280552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 281552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 282552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 283552f7358SJed Brown \\begin{document}\n\ 284552f7358SJed Brown \\section{%s}\n\ 285770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 286770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 287770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 288770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 289770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 290770b213bSMatthew G Knepley } else if (p > 0) { 291770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 292770b213bSMatthew G Knepley } 293770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 294770b213bSMatthew G Knepley } 295770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 296770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 297552f7358SJed Brown /* Plot vertices */ 298552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 299552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 300552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 301552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 302552f7358SJed Brown PetscInt off, dof, d; 303552f7358SJed Brown 304552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 305552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 306552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 307552f7358SJed Brown for (d = 0; d < dof; ++d) { 308552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3096712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 310552f7358SJed Brown } 311552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 312552f7358SJed Brown } 313552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 314552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 315552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 316552f7358SJed Brown /* Plot edges */ 317552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 318552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 319552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 320552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 321552f7358SJed Brown const PetscInt *cone; 322552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 323552f7358SJed Brown 324552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 32582f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 326552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 327552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 328552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 329552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 330552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 331552f7358SJed Brown for (d = 0; d < dof; ++d) { 332552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3336712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 334552f7358SJed Brown } 335552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 336552f7358SJed Brown } 337552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 338552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 339552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 340552f7358SJed Brown /* Plot cells */ 341552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 342552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3430298fd71SBarry Smith PetscInt *closure = NULL; 344552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 345552f7358SJed Brown 346552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 347552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 348552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 349552f7358SJed Brown const PetscInt point = closure[p]; 350552f7358SJed Brown 351552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 352552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 353552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 354552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 355552f7358SJed Brown } 356552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 357552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 358552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 359552f7358SJed Brown } 360552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 361552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 362770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 363552f7358SJed Brown } else { 36482f516ccSBarry Smith MPI_Comm comm; 365834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 366834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 367552f7358SJed Brown PetscInt pStart, pEnd, p; 368a57dd577SMatthew G Knepley PetscInt numLabels, l; 3691143a3c0SMatthew G. Knepley const char *name; 370552f7358SJed Brown PetscMPIInt size; 371552f7358SJed Brown 37282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 373552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 374552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3755f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3761143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3771143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 378552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 379552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 380834065abSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], &pMax[depth-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 381dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 382552f7358SJed Brown if (depth == 1) { 383552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 384552f7358SJed Brown pEnd = pEnd - pStart; 385552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 386552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 387552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 388552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 389552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 390552f7358SJed Brown pEnd = pEnd - pStart; 391552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 392552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 393552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 394552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 395552f7358SJed Brown } else { 396552f7358SJed Brown for (d = 0; d <= dim; d++) { 397552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 398834065abSMatthew G. Knepley pEnd -= pStart; 399834065abSMatthew G. Knepley pMax[d] -= pStart; 400552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 401834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 402552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 403834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 404834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 405834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 406834065abSMatthew G. Knepley } 407552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 408552f7358SJed Brown } 409552f7358SJed Brown } 410834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 411a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 412a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 413a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 414a57dd577SMatthew G Knepley DMLabel label; 415a57dd577SMatthew G Knepley const char *name; 416a57dd577SMatthew G Knepley IS valueIS; 417a57dd577SMatthew G Knepley const PetscInt *values; 418a57dd577SMatthew G Knepley PetscInt numValues, v; 419a57dd577SMatthew G Knepley 420a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 421a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 422a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 423a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 424a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 425a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 426a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 427a57dd577SMatthew G Knepley PetscInt size; 428a57dd577SMatthew G Knepley 429a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 430a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 431a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 432a57dd577SMatthew G Knepley } 433a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 434a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4354d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 436a57dd577SMatthew G Knepley } 437552f7358SJed Brown } 438552f7358SJed Brown PetscFunctionReturn(0); 439552f7358SJed Brown } 440552f7358SJed Brown 441552f7358SJed Brown #undef __FUNCT__ 442552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 443552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 444552f7358SJed Brown { 445c6ccd67eSMatthew G. Knepley PetscBool iascii, ishdf5; 446552f7358SJed Brown PetscErrorCode ierr; 447552f7358SJed Brown 448552f7358SJed Brown PetscFunctionBegin; 449552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 450552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 451552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 452c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 453552f7358SJed Brown if (iascii) { 454552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 455c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 456c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4577afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 458c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4597afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 460c6ccd67eSMatthew G. Knepley #else 461c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 462552f7358SJed Brown #endif 46311aeaf0aSBarry Smith } 464552f7358SJed Brown PetscFunctionReturn(0); 465552f7358SJed Brown } 466552f7358SJed Brown 4672c40f234SMatthew G. Knepley #undef __FUNCT__ 4682c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4692c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4702c40f234SMatthew G. Knepley { 4712c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4722c40f234SMatthew G. Knepley PetscErrorCode ierr; 4732c40f234SMatthew G. Knepley 4742c40f234SMatthew G. Knepley PetscFunctionBegin; 4752c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4762c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4772c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4782c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4792c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4802c40f234SMatthew G. Knepley else if (ishdf5) { 4812c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 482*10b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4832c40f234SMatthew G. Knepley #else 4842c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 485552f7358SJed Brown #endif 486552f7358SJed Brown } 487552f7358SJed Brown PetscFunctionReturn(0); 488552f7358SJed Brown } 489552f7358SJed Brown 490552f7358SJed Brown #undef __FUNCT__ 4916c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4926c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4936c73c22cSMatthew G. Knepley { 4946c73c22cSMatthew G. Knepley DMBoundary b, next; 4956c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4966c73c22cSMatthew G. Knepley 4976c73c22cSMatthew G. Knepley PetscFunctionBeginUser; 4986c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4996c73c22cSMatthew G. Knepley b = *boundary; 5006c73c22cSMatthew G. Knepley *boundary = NULL; 5016c73c22cSMatthew G. Knepley for (; b; b = next) { 5026c73c22cSMatthew G. Knepley next = b->next; 5036c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 5046c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 5056c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 5066c73c22cSMatthew G. Knepley } 5076c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5086c73c22cSMatthew G. Knepley } 5096c73c22cSMatthew G. Knepley 5106c73c22cSMatthew G. Knepley #undef __FUNCT__ 511552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 512552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 513552f7358SJed Brown { 514552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 515552f7358SJed Brown DMLabel next = mesh->labels; 516552f7358SJed Brown PetscErrorCode ierr; 517552f7358SJed Brown 518552f7358SJed Brown PetscFunctionBegin; 5190d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 520552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 521552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 522552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 523552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 524552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 525552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 526552f7358SJed Brown while (next) { 527552f7358SJed Brown DMLabel tmp = next->next; 528552f7358SJed Brown 529552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 530552f7358SJed Brown next = tmp; 531552f7358SJed Brown } 5323913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 533a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 534552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 535552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5366c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 537552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 538552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 539552f7358SJed Brown PetscFunctionReturn(0); 540552f7358SJed Brown } 541552f7358SJed Brown 542552f7358SJed Brown #undef __FUNCT__ 543552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 544b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 545552f7358SJed Brown { 546552f7358SJed Brown PetscSection section, sectionGlobal; 547552f7358SJed Brown PetscInt bs = -1; 548552f7358SJed Brown PetscInt localSize; 54989545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 550552f7358SJed Brown PetscErrorCode ierr; 551b412c318SBarry Smith MatType mtype; 552552f7358SJed Brown 553552f7358SJed Brown PetscFunctionBegin; 554607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 555b412c318SBarry Smith mtype = dm->mattype; 556552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 557552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 558552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 559552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 56082f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 561552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 562552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 563552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 564552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 565552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 566552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 567552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 568552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 569552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 570552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 571552f7358SJed Brown if (!isShell) { 572552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5732a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 574552f7358SJed Brown 575552f7358SJed Brown if (bs < 0) { 576552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 577fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 578552f7358SJed Brown 579552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 580552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 581552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 582fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 583fad22124SMatthew G Knepley if (dof-cdof) { 5842a28c762SMatthew G Knepley if (bs < 0) { 585fad22124SMatthew G Knepley bs = dof-cdof; 586fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5872a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5882a28c762SMatthew G Knepley bs = 1; 589552f7358SJed Brown break; 590552f7358SJed Brown } 591552f7358SJed Brown } 5922a28c762SMatthew G Knepley } 5932a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5942a28c762SMatthew G Knepley bsLocal = bs; 59582f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5962a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 59782f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5982a28c762SMatthew G Knepley if (bsMin != bsMax) { 5992a28c762SMatthew G Knepley bs = 1; 6002a28c762SMatthew G Knepley } else { 6012a28c762SMatthew G Knepley bs = bsMax; 6022a28c762SMatthew G Knepley } 603552f7358SJed Brown } else { 604552f7358SJed Brown bs = 1; 605552f7358SJed Brown } 606552f7358SJed Brown } 6071795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 608552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 609552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 610552f7358SJed Brown } 611552f7358SJed Brown PetscFunctionReturn(0); 612552f7358SJed Brown } 613552f7358SJed Brown 614552f7358SJed Brown #undef __FUNCT__ 615552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 616552f7358SJed Brown /*@ 617552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 618552f7358SJed Brown 619552f7358SJed Brown Not collective 620552f7358SJed Brown 621552f7358SJed Brown Input Parameter: 622552f7358SJed Brown . mesh - The DMPlex 623552f7358SJed Brown 624552f7358SJed Brown Output Parameter: 625552f7358SJed Brown . dim - The topological mesh dimension 626552f7358SJed Brown 627552f7358SJed Brown Level: beginner 628552f7358SJed Brown 629552f7358SJed Brown .seealso: DMPlexCreate() 630552f7358SJed Brown @*/ 631552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 632552f7358SJed Brown { 633552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 634552f7358SJed Brown 635552f7358SJed Brown PetscFunctionBegin; 636552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 637552f7358SJed Brown PetscValidPointer(dim, 2); 638552f7358SJed Brown *dim = mesh->dim; 639552f7358SJed Brown PetscFunctionReturn(0); 640552f7358SJed Brown } 641552f7358SJed Brown 642552f7358SJed Brown #undef __FUNCT__ 643552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 644552f7358SJed Brown /*@ 645552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 646552f7358SJed Brown 647552f7358SJed Brown Collective on mesh 648552f7358SJed Brown 649552f7358SJed Brown Input Parameters: 650552f7358SJed Brown + mesh - The DMPlex 651552f7358SJed Brown - dim - The topological mesh dimension 652552f7358SJed Brown 653552f7358SJed Brown Level: beginner 654552f7358SJed Brown 655552f7358SJed Brown .seealso: DMPlexCreate() 656552f7358SJed Brown @*/ 657552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 658552f7358SJed Brown { 659552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 660552f7358SJed Brown 661552f7358SJed Brown PetscFunctionBegin; 662552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 663552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 664552f7358SJed Brown mesh->dim = dim; 665552f7358SJed Brown PetscFunctionReturn(0); 666552f7358SJed Brown } 667552f7358SJed Brown 668552f7358SJed Brown #undef __FUNCT__ 669552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 670552f7358SJed Brown /*@ 671552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 672552f7358SJed Brown 673552f7358SJed Brown Not collective 674552f7358SJed Brown 675552f7358SJed Brown Input Parameter: 676552f7358SJed Brown . mesh - The DMPlex 677552f7358SJed Brown 678552f7358SJed Brown Output Parameters: 679552f7358SJed Brown + pStart - The first mesh point 680552f7358SJed Brown - pEnd - The upper bound for mesh points 681552f7358SJed Brown 682552f7358SJed Brown Level: beginner 683552f7358SJed Brown 684552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 685552f7358SJed Brown @*/ 686552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 687552f7358SJed Brown { 688552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 689552f7358SJed Brown PetscErrorCode ierr; 690552f7358SJed Brown 691552f7358SJed Brown PetscFunctionBegin; 692552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 693552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 694552f7358SJed Brown PetscFunctionReturn(0); 695552f7358SJed Brown } 696552f7358SJed Brown 697552f7358SJed Brown #undef __FUNCT__ 698552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 699552f7358SJed Brown /*@ 700552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 701552f7358SJed Brown 702552f7358SJed Brown Not collective 703552f7358SJed Brown 704552f7358SJed Brown Input Parameters: 705552f7358SJed Brown + mesh - The DMPlex 706552f7358SJed Brown . pStart - The first mesh point 707552f7358SJed Brown - pEnd - The upper bound for mesh points 708552f7358SJed Brown 709552f7358SJed Brown Output Parameters: 710552f7358SJed Brown 711552f7358SJed Brown Level: beginner 712552f7358SJed Brown 713552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 714552f7358SJed Brown @*/ 715552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 716552f7358SJed Brown { 717552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 718552f7358SJed Brown PetscErrorCode ierr; 719552f7358SJed Brown 720552f7358SJed Brown PetscFunctionBegin; 721552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 722552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 723552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 724552f7358SJed Brown PetscFunctionReturn(0); 725552f7358SJed Brown } 726552f7358SJed Brown 727552f7358SJed Brown #undef __FUNCT__ 728552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 729552f7358SJed Brown /*@ 730552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 731552f7358SJed Brown 732552f7358SJed Brown Not collective 733552f7358SJed Brown 734552f7358SJed Brown Input Parameters: 735552f7358SJed Brown + mesh - The DMPlex 736552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 737552f7358SJed Brown 738552f7358SJed Brown Output Parameter: 739552f7358SJed Brown . size - The cone size for point p 740552f7358SJed Brown 741552f7358SJed Brown Level: beginner 742552f7358SJed Brown 743552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 744552f7358SJed Brown @*/ 745552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 746552f7358SJed Brown { 747552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 748552f7358SJed Brown PetscErrorCode ierr; 749552f7358SJed Brown 750552f7358SJed Brown PetscFunctionBegin; 751552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 752552f7358SJed Brown PetscValidPointer(size, 3); 753552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 754552f7358SJed Brown PetscFunctionReturn(0); 755552f7358SJed Brown } 756552f7358SJed Brown 757552f7358SJed Brown #undef __FUNCT__ 758552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 759552f7358SJed Brown /*@ 760552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 761552f7358SJed Brown 762552f7358SJed Brown Not collective 763552f7358SJed Brown 764552f7358SJed Brown Input Parameters: 765552f7358SJed Brown + mesh - The DMPlex 766552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 767552f7358SJed Brown - size - The cone size for point p 768552f7358SJed Brown 769552f7358SJed Brown Output Parameter: 770552f7358SJed Brown 771552f7358SJed Brown Note: 772552f7358SJed Brown This should be called after DMPlexSetChart(). 773552f7358SJed Brown 774552f7358SJed Brown Level: beginner 775552f7358SJed Brown 776552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 777552f7358SJed Brown @*/ 778552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 779552f7358SJed Brown { 780552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 781552f7358SJed Brown PetscErrorCode ierr; 782552f7358SJed Brown 783552f7358SJed Brown PetscFunctionBegin; 784552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 785552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7860d644c17SKarl Rupp 787552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 788552f7358SJed Brown PetscFunctionReturn(0); 789552f7358SJed Brown } 790552f7358SJed Brown 791552f7358SJed Brown #undef __FUNCT__ 792552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 793552f7358SJed Brown /*@C 794552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 795552f7358SJed Brown 796552f7358SJed Brown Not collective 797552f7358SJed Brown 798552f7358SJed Brown Input Parameters: 799552f7358SJed Brown + mesh - The DMPlex 800552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 801552f7358SJed Brown 802552f7358SJed Brown Output Parameter: 803552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 804552f7358SJed Brown 805552f7358SJed Brown Level: beginner 806552f7358SJed Brown 8073813dfbdSMatthew G Knepley Fortran Notes: 8083813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8093813dfbdSMatthew G Knepley include petsc.h90 in your code. 8103813dfbdSMatthew G Knepley 8113813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 812552f7358SJed Brown 813552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 814552f7358SJed Brown @*/ 815552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 816552f7358SJed Brown { 817552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 818552f7358SJed Brown PetscInt off; 819552f7358SJed Brown PetscErrorCode ierr; 820552f7358SJed Brown 821552f7358SJed Brown PetscFunctionBegin; 822552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 823552f7358SJed Brown PetscValidPointer(cone, 3); 824552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 825552f7358SJed Brown *cone = &mesh->cones[off]; 826552f7358SJed Brown PetscFunctionReturn(0); 827552f7358SJed Brown } 828552f7358SJed Brown 829552f7358SJed Brown #undef __FUNCT__ 830552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 831552f7358SJed Brown /*@ 832552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 833552f7358SJed Brown 834552f7358SJed Brown Not collective 835552f7358SJed Brown 836552f7358SJed Brown Input Parameters: 837552f7358SJed Brown + mesh - The DMPlex 838552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 839552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 840552f7358SJed Brown 841552f7358SJed Brown Output Parameter: 842552f7358SJed Brown 843552f7358SJed Brown Note: 844552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 845552f7358SJed Brown 846552f7358SJed Brown Level: beginner 847552f7358SJed Brown 848552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 849552f7358SJed Brown @*/ 850552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 851552f7358SJed Brown { 852552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 853552f7358SJed Brown PetscInt pStart, pEnd; 854552f7358SJed Brown PetscInt dof, off, c; 855552f7358SJed Brown PetscErrorCode ierr; 856552f7358SJed Brown 857552f7358SJed Brown PetscFunctionBegin; 858552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 859552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 860552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 861552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 862552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 86382f516ccSBarry 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); 864552f7358SJed Brown for (c = 0; c < dof; ++c) { 86582f516ccSBarry 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); 866552f7358SJed Brown mesh->cones[off+c] = cone[c]; 867552f7358SJed Brown } 868552f7358SJed Brown PetscFunctionReturn(0); 869552f7358SJed Brown } 870552f7358SJed Brown 871552f7358SJed Brown #undef __FUNCT__ 872552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 873552f7358SJed Brown /*@C 874552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 875552f7358SJed Brown 876552f7358SJed Brown Not collective 877552f7358SJed Brown 878552f7358SJed Brown Input Parameters: 879552f7358SJed Brown + mesh - The DMPlex 880552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 881552f7358SJed Brown 882552f7358SJed Brown Output Parameter: 883552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 884552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 885552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 886552f7358SJed Brown the index of the cone point on which to start. 887552f7358SJed Brown 888552f7358SJed Brown Level: beginner 889552f7358SJed Brown 8903813dfbdSMatthew G Knepley Fortran Notes: 8913813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8923813dfbdSMatthew G Knepley include petsc.h90 in your code. 8933813dfbdSMatthew G Knepley 8943813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 895552f7358SJed Brown 896552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 897552f7358SJed Brown @*/ 898552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 899552f7358SJed Brown { 900552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 901552f7358SJed Brown PetscInt off; 902552f7358SJed Brown PetscErrorCode ierr; 903552f7358SJed Brown 904552f7358SJed Brown PetscFunctionBegin; 905552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 906552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 907552f7358SJed Brown { 908552f7358SJed Brown PetscInt dof; 909552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 910552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 911552f7358SJed Brown } 912552f7358SJed Brown #endif 913552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 9140d644c17SKarl Rupp 915552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 916552f7358SJed Brown PetscFunctionReturn(0); 917552f7358SJed Brown } 918552f7358SJed Brown 919552f7358SJed Brown #undef __FUNCT__ 920552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 921552f7358SJed Brown /*@ 922552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 923552f7358SJed Brown 924552f7358SJed Brown Not collective 925552f7358SJed Brown 926552f7358SJed Brown Input Parameters: 927552f7358SJed Brown + mesh - The DMPlex 928552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 929552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 930552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 931552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 932552f7358SJed Brown the index of the cone point on which to start. 933552f7358SJed Brown 934552f7358SJed Brown Output Parameter: 935552f7358SJed Brown 936552f7358SJed Brown Note: 937552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 938552f7358SJed Brown 939552f7358SJed Brown Level: beginner 940552f7358SJed Brown 941552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 942552f7358SJed Brown @*/ 943552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 944552f7358SJed Brown { 945552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 946552f7358SJed Brown PetscInt pStart, pEnd; 947552f7358SJed Brown PetscInt dof, off, c; 948552f7358SJed Brown PetscErrorCode ierr; 949552f7358SJed Brown 950552f7358SJed Brown PetscFunctionBegin; 951552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 952552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 953552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 954552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 955552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 95682f516ccSBarry 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); 957552f7358SJed Brown for (c = 0; c < dof; ++c) { 958552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 959552f7358SJed Brown 960552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 96182f516ccSBarry 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); 962552f7358SJed Brown mesh->coneOrientations[off+c] = o; 963552f7358SJed Brown } 964552f7358SJed Brown PetscFunctionReturn(0); 965552f7358SJed Brown } 966552f7358SJed Brown 967552f7358SJed Brown #undef __FUNCT__ 968552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 969552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 970552f7358SJed Brown { 971552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 972552f7358SJed Brown PetscInt pStart, pEnd; 973552f7358SJed Brown PetscInt dof, off; 974552f7358SJed Brown PetscErrorCode ierr; 975552f7358SJed Brown 976552f7358SJed Brown PetscFunctionBegin; 977552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 978552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 97982f516ccSBarry 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); 98082f516ccSBarry 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); 98177c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 98277c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98377c88f5bSMatthew 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); 984552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 985552f7358SJed Brown PetscFunctionReturn(0); 986552f7358SJed Brown } 987552f7358SJed Brown 988552f7358SJed Brown #undef __FUNCT__ 98977c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 99077c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 99177c88f5bSMatthew G Knepley { 99277c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 99377c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 99477c88f5bSMatthew G Knepley PetscInt dof, off; 99577c88f5bSMatthew G Knepley PetscErrorCode ierr; 99677c88f5bSMatthew G Knepley 99777c88f5bSMatthew G Knepley PetscFunctionBegin; 99877c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 99977c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 100077c88f5bSMatthew 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); 100177c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 100277c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 100377c88f5bSMatthew 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); 100477c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 100577c88f5bSMatthew G Knepley PetscFunctionReturn(0); 100677c88f5bSMatthew G Knepley } 100777c88f5bSMatthew G Knepley 100877c88f5bSMatthew G Knepley #undef __FUNCT__ 1009552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1010552f7358SJed Brown /*@ 1011552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1012552f7358SJed Brown 1013552f7358SJed Brown Not collective 1014552f7358SJed Brown 1015552f7358SJed Brown Input Parameters: 1016552f7358SJed Brown + mesh - The DMPlex 1017552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1018552f7358SJed Brown 1019552f7358SJed Brown Output Parameter: 1020552f7358SJed Brown . size - The support size for point p 1021552f7358SJed Brown 1022552f7358SJed Brown Level: beginner 1023552f7358SJed Brown 1024552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1025552f7358SJed Brown @*/ 1026552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1027552f7358SJed Brown { 1028552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1029552f7358SJed Brown PetscErrorCode ierr; 1030552f7358SJed Brown 1031552f7358SJed Brown PetscFunctionBegin; 1032552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1033552f7358SJed Brown PetscValidPointer(size, 3); 1034552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1035552f7358SJed Brown PetscFunctionReturn(0); 1036552f7358SJed Brown } 1037552f7358SJed Brown 1038552f7358SJed Brown #undef __FUNCT__ 1039552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1040552f7358SJed Brown /*@ 1041552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1042552f7358SJed Brown 1043552f7358SJed Brown Not collective 1044552f7358SJed Brown 1045552f7358SJed Brown Input Parameters: 1046552f7358SJed Brown + mesh - The DMPlex 1047552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1048552f7358SJed Brown - size - The support size for point p 1049552f7358SJed Brown 1050552f7358SJed Brown Output Parameter: 1051552f7358SJed Brown 1052552f7358SJed Brown Note: 1053552f7358SJed Brown This should be called after DMPlexSetChart(). 1054552f7358SJed Brown 1055552f7358SJed Brown Level: beginner 1056552f7358SJed Brown 1057552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1058552f7358SJed Brown @*/ 1059552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1060552f7358SJed Brown { 1061552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1062552f7358SJed Brown PetscErrorCode ierr; 1063552f7358SJed Brown 1064552f7358SJed Brown PetscFunctionBegin; 1065552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1066552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10670d644c17SKarl Rupp 1068552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1069552f7358SJed Brown PetscFunctionReturn(0); 1070552f7358SJed Brown } 1071552f7358SJed Brown 1072552f7358SJed Brown #undef __FUNCT__ 1073552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1074552f7358SJed Brown /*@C 1075552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1076552f7358SJed Brown 1077552f7358SJed Brown Not collective 1078552f7358SJed Brown 1079552f7358SJed Brown Input Parameters: 1080552f7358SJed Brown + mesh - The DMPlex 1081552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1082552f7358SJed Brown 1083552f7358SJed Brown Output Parameter: 1084552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1085552f7358SJed Brown 1086552f7358SJed Brown Level: beginner 1087552f7358SJed Brown 10883813dfbdSMatthew G Knepley Fortran Notes: 10893813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10903813dfbdSMatthew G Knepley include petsc.h90 in your code. 10913813dfbdSMatthew G Knepley 10923813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10933813dfbdSMatthew G Knepley 1094552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1095552f7358SJed Brown @*/ 1096552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1097552f7358SJed Brown { 1098552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1099552f7358SJed Brown PetscInt off; 1100552f7358SJed Brown PetscErrorCode ierr; 1101552f7358SJed Brown 1102552f7358SJed Brown PetscFunctionBegin; 1103552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1104552f7358SJed Brown PetscValidPointer(support, 3); 1105552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1106552f7358SJed Brown *support = &mesh->supports[off]; 1107552f7358SJed Brown PetscFunctionReturn(0); 1108552f7358SJed Brown } 1109552f7358SJed Brown 1110552f7358SJed Brown #undef __FUNCT__ 1111552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1112552f7358SJed Brown /*@ 1113552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1114552f7358SJed Brown 1115552f7358SJed Brown Not collective 1116552f7358SJed Brown 1117552f7358SJed Brown Input Parameters: 1118552f7358SJed Brown + mesh - The DMPlex 1119552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1120552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1121552f7358SJed Brown 1122552f7358SJed Brown Output Parameter: 1123552f7358SJed Brown 1124552f7358SJed Brown Note: 1125552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1126552f7358SJed Brown 1127552f7358SJed Brown Level: beginner 1128552f7358SJed Brown 1129552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1130552f7358SJed Brown @*/ 1131552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1132552f7358SJed Brown { 1133552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1134552f7358SJed Brown PetscInt pStart, pEnd; 1135552f7358SJed Brown PetscInt dof, off, c; 1136552f7358SJed Brown PetscErrorCode ierr; 1137552f7358SJed Brown 1138552f7358SJed Brown PetscFunctionBegin; 1139552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1140552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1141552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1142552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1143552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 114482f516ccSBarry 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); 1145552f7358SJed Brown for (c = 0; c < dof; ++c) { 114682f516ccSBarry 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); 1147552f7358SJed Brown mesh->supports[off+c] = support[c]; 1148552f7358SJed Brown } 1149552f7358SJed Brown PetscFunctionReturn(0); 1150552f7358SJed Brown } 1151552f7358SJed Brown 1152552f7358SJed Brown #undef __FUNCT__ 1153552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1154552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1155552f7358SJed Brown { 1156552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1157552f7358SJed Brown PetscInt pStart, pEnd; 1158552f7358SJed Brown PetscInt dof, off; 1159552f7358SJed Brown PetscErrorCode ierr; 1160552f7358SJed Brown 1161552f7358SJed Brown PetscFunctionBegin; 1162552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1163552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1164552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1165552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 116682f516ccSBarry 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); 116782f516ccSBarry 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); 116882f516ccSBarry 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); 1169552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1170552f7358SJed Brown PetscFunctionReturn(0); 1171552f7358SJed Brown } 1172552f7358SJed Brown 1173552f7358SJed Brown #undef __FUNCT__ 1174552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1175552f7358SJed Brown /*@C 1176552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1177552f7358SJed Brown 1178552f7358SJed Brown Not collective 1179552f7358SJed Brown 1180552f7358SJed Brown Input Parameters: 1181552f7358SJed Brown + mesh - The DMPlex 1182552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1183552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11840298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1185552f7358SJed Brown 1186552f7358SJed Brown Output Parameters: 1187552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1188552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1189552f7358SJed Brown 1190552f7358SJed Brown Note: 11910298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1192552f7358SJed Brown 11933813dfbdSMatthew G Knepley Fortran Notes: 11943813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11953813dfbdSMatthew G Knepley include petsc.h90 in your code. 11963813dfbdSMatthew G Knepley 11973813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11983813dfbdSMatthew G Knepley 1199552f7358SJed Brown Level: beginner 1200552f7358SJed Brown 1201552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1202552f7358SJed Brown @*/ 1203552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1204552f7358SJed Brown { 1205552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1206552f7358SJed Brown PetscInt *closure, *fifo; 12070298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1208552f7358SJed Brown PetscInt tmpSize, t; 1209552f7358SJed Brown PetscInt depth = 0, maxSize; 1210552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1211552f7358SJed Brown PetscErrorCode ierr; 1212552f7358SJed Brown 1213552f7358SJed Brown PetscFunctionBegin; 1214552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1215552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1216552f7358SJed Brown /* This is only 1-level */ 1217552f7358SJed Brown if (useCone) { 1218552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1219552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1220552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1221552f7358SJed Brown } else { 1222552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1223552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1224552f7358SJed Brown } 1225bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1226bfbcdd7aSMatthew G. Knepley if (*points) { 1227bfbcdd7aSMatthew G. Knepley closure = *points; 1228bfbcdd7aSMatthew G. Knepley } else { 1229bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1230bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1231bfbcdd7aSMatthew G. Knepley } 1232bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1233bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1234bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1235bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1236bfbcdd7aSMatthew G. Knepley } 1237bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1238bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1239bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1240bfbcdd7aSMatthew G. Knepley } 1241bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1242bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1243bfbcdd7aSMatthew G. Knepley if (*points) { 1244bfbcdd7aSMatthew G. Knepley closure = *points; 1245bfbcdd7aSMatthew G. Knepley } else { 1246bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1247bfbcdd7aSMatthew G. Knepley } 1248bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1249552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1250552f7358SJed Brown const PetscInt cp = tmp[t]; 1251552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1252552f7358SJed Brown 1253552f7358SJed Brown closure[closureSize] = cp; 1254552f7358SJed Brown closure[closureSize+1] = co; 1255552f7358SJed Brown fifo[fifoSize] = cp; 1256552f7358SJed Brown fifo[fifoSize+1] = co; 1257552f7358SJed Brown } 1258bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1259552f7358SJed Brown while (fifoSize - fifoStart) { 1260552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1261552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1262552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1263552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1264552f7358SJed Brown 1265552f7358SJed Brown if (useCone) { 1266552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1267552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1268552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1269552f7358SJed Brown } else { 1270552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1271552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12720298fd71SBarry Smith tmpO = NULL; 1273552f7358SJed Brown } 1274552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1275552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1276552f7358SJed Brown const PetscInt cp = tmp[i]; 12772e1b13c2SMatthew 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. */ 12782e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12792e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12802e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1281552f7358SJed Brown PetscInt c; 1282552f7358SJed Brown 12832e1b13c2SMatthew G. Knepley if (rev) { 12842e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12852e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12862e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12872e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12882e1b13c2SMatthew G. Knepley } 1289552f7358SJed Brown /* Check for duplicate */ 1290552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1291552f7358SJed Brown if (closure[c] == cp) break; 1292552f7358SJed Brown } 1293552f7358SJed Brown if (c == closureSize) { 1294552f7358SJed Brown closure[closureSize] = cp; 1295552f7358SJed Brown closure[closureSize+1] = co; 1296552f7358SJed Brown fifo[fifoSize] = cp; 1297552f7358SJed Brown fifo[fifoSize+1] = co; 1298552f7358SJed Brown closureSize += 2; 1299552f7358SJed Brown fifoSize += 2; 1300552f7358SJed Brown } 1301552f7358SJed Brown } 1302552f7358SJed Brown fifoStart += 2; 1303552f7358SJed Brown } 1304552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1305552f7358SJed Brown if (points) *points = closure; 1306552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1307552f7358SJed Brown PetscFunctionReturn(0); 1308552f7358SJed Brown } 1309552f7358SJed Brown 1310552f7358SJed Brown #undef __FUNCT__ 13119bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 13129bf0dad6SMatthew G. Knepley /*@C 13139bf0dad6SMatthew 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 13149bf0dad6SMatthew G. Knepley 13159bf0dad6SMatthew G. Knepley Not collective 13169bf0dad6SMatthew G. Knepley 13179bf0dad6SMatthew G. Knepley Input Parameters: 13189bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13199bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13209bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13219bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13229bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13239bf0dad6SMatthew G. Knepley 13249bf0dad6SMatthew G. Knepley Output Parameters: 13259bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13269bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13279bf0dad6SMatthew G. Knepley 13289bf0dad6SMatthew G. Knepley Note: 13299bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13309bf0dad6SMatthew G. Knepley 13319bf0dad6SMatthew G. Knepley Fortran Notes: 13329bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13339bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13349bf0dad6SMatthew G. Knepley 13359bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13369bf0dad6SMatthew G. Knepley 13379bf0dad6SMatthew G. Knepley Level: beginner 13389bf0dad6SMatthew G. Knepley 13399bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13409bf0dad6SMatthew G. Knepley @*/ 13419bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13429bf0dad6SMatthew G. Knepley { 13439bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13449bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13459bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13469bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13479bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13489bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13499bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13509bf0dad6SMatthew G. Knepley 13519bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13529bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13539bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13549bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13559bf0dad6SMatthew G. Knepley if (useCone) { 13569bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13579bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13589bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13599bf0dad6SMatthew G. Knepley } else { 13609bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13619bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13629bf0dad6SMatthew G. Knepley } 13639bf0dad6SMatthew G. Knepley if (depth == 1) { 13649bf0dad6SMatthew G. Knepley if (*points) { 13659bf0dad6SMatthew G. Knepley closure = *points; 13669bf0dad6SMatthew G. Knepley } else { 13679bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13689bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13699bf0dad6SMatthew G. Knepley } 13709bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13719bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13729bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13739bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13749bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13759bf0dad6SMatthew G. Knepley } 13769bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13779bf0dad6SMatthew G. Knepley if (points) *points = closure; 13789bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13799bf0dad6SMatthew G. Knepley } 13809bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 13819bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13829bf0dad6SMatthew G. Knepley if (*points) { 13839bf0dad6SMatthew G. Knepley closure = *points; 13849bf0dad6SMatthew G. Knepley } else { 13859bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13869bf0dad6SMatthew G. Knepley } 13879bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13889bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13899bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13909bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13919bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13929bf0dad6SMatthew G. Knepley 13939bf0dad6SMatthew G. Knepley if (ornt < 0) { 13949bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13959bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13969bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13979bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13989bf0dad6SMatthew G. Knepley } 13999bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14009bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14019bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14029bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14039bf0dad6SMatthew G. Knepley } 14049bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 14059bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 14069bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 14079bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 14089bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 14099bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 14109bf0dad6SMatthew G. Knepley 14119bf0dad6SMatthew G. Knepley if (useCone) { 14129bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 14139bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 14149bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 14159bf0dad6SMatthew G. Knepley } else { 14169bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14179bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14189bf0dad6SMatthew G. Knepley tmpO = NULL; 14199bf0dad6SMatthew G. Knepley } 14209bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14219bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14229bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14239bf0dad6SMatthew 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. */ 14249bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14259bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14269bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14279bf0dad6SMatthew G. Knepley PetscInt c; 14289bf0dad6SMatthew G. Knepley 14299bf0dad6SMatthew G. Knepley if (rev) { 14309bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14319bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14329bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14339bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14349bf0dad6SMatthew G. Knepley } 14359bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14369bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14379bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14389bf0dad6SMatthew G. Knepley } 14399bf0dad6SMatthew G. Knepley if (c == closureSize) { 14409bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14419bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14429bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14439bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14449bf0dad6SMatthew G. Knepley closureSize += 2; 14459bf0dad6SMatthew G. Knepley fifoSize += 2; 14469bf0dad6SMatthew G. Knepley } 14479bf0dad6SMatthew G. Knepley } 14489bf0dad6SMatthew G. Knepley fifoStart += 2; 14499bf0dad6SMatthew G. Knepley } 14509bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14519bf0dad6SMatthew G. Knepley if (points) *points = closure; 14529bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14539bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14549bf0dad6SMatthew G. Knepley } 14559bf0dad6SMatthew G. Knepley 14569bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1457552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1458552f7358SJed Brown /*@C 1459552f7358SJed 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 1460552f7358SJed Brown 1461552f7358SJed Brown Not collective 1462552f7358SJed Brown 1463552f7358SJed Brown Input Parameters: 1464552f7358SJed Brown + mesh - The DMPlex 1465552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1466552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1467e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1468e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1469552f7358SJed Brown 1470552f7358SJed Brown Note: 14710298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1472552f7358SJed Brown 14733813dfbdSMatthew G Knepley Fortran Notes: 14743813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14753813dfbdSMatthew G Knepley include petsc.h90 in your code. 14763813dfbdSMatthew G Knepley 14773813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14783813dfbdSMatthew G Knepley 1479552f7358SJed Brown Level: beginner 1480552f7358SJed Brown 1481552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1482552f7358SJed Brown @*/ 1483552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1484552f7358SJed Brown { 1485552f7358SJed Brown PetscErrorCode ierr; 1486552f7358SJed Brown 1487552f7358SJed Brown PetscFunctionBegin; 1488552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1489e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1490e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1491552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14924ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1493552f7358SJed Brown PetscFunctionReturn(0); 1494552f7358SJed Brown } 1495552f7358SJed Brown 1496552f7358SJed Brown #undef __FUNCT__ 1497552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1498552f7358SJed Brown /*@ 1499552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1500552f7358SJed Brown 1501552f7358SJed Brown Not collective 1502552f7358SJed Brown 1503552f7358SJed Brown Input Parameter: 1504552f7358SJed Brown . mesh - The DMPlex 1505552f7358SJed Brown 1506552f7358SJed Brown Output Parameters: 1507552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1508552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1509552f7358SJed Brown 1510552f7358SJed Brown Level: beginner 1511552f7358SJed Brown 1512552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1513552f7358SJed Brown @*/ 1514552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1515552f7358SJed Brown { 1516552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1517552f7358SJed Brown 1518552f7358SJed Brown PetscFunctionBegin; 1519552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1520552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1521552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1522552f7358SJed Brown PetscFunctionReturn(0); 1523552f7358SJed Brown } 1524552f7358SJed Brown 1525552f7358SJed Brown #undef __FUNCT__ 1526552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1527552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1528552f7358SJed Brown { 1529552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1530552f7358SJed Brown PetscInt size; 1531552f7358SJed Brown PetscErrorCode ierr; 1532552f7358SJed Brown 1533552f7358SJed Brown PetscFunctionBegin; 1534552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1535552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1536552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15371795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15381795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1539552f7358SJed Brown if (mesh->maxSupportSize) { 1540552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1541552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15421795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1543552f7358SJed Brown } 1544552f7358SJed Brown PetscFunctionReturn(0); 1545552f7358SJed Brown } 1546552f7358SJed Brown 1547552f7358SJed Brown #undef __FUNCT__ 1548552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1549552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1550552f7358SJed Brown { 1551552f7358SJed Brown PetscErrorCode ierr; 1552552f7358SJed Brown 1553552f7358SJed Brown PetscFunctionBegin; 15544d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15554d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1556552f7358SJed Brown PetscFunctionReturn(0); 1557552f7358SJed Brown } 1558552f7358SJed Brown 1559552f7358SJed Brown #undef __FUNCT__ 1560552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1561552f7358SJed Brown /*@ 1562552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1563552f7358SJed Brown 1564552f7358SJed Brown Not collective 1565552f7358SJed Brown 1566552f7358SJed Brown Input Parameter: 1567552f7358SJed Brown . mesh - The DMPlex 1568552f7358SJed Brown 1569552f7358SJed Brown Output Parameter: 1570552f7358SJed Brown 1571552f7358SJed Brown Note: 1572552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1573552f7358SJed Brown 1574552f7358SJed Brown Level: beginner 1575552f7358SJed Brown 1576552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1577552f7358SJed Brown @*/ 1578552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1579552f7358SJed Brown { 1580552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1581552f7358SJed Brown PetscInt *offsets; 1582552f7358SJed Brown PetscInt supportSize; 1583552f7358SJed Brown PetscInt pStart, pEnd, p; 1584552f7358SJed Brown PetscErrorCode ierr; 1585552f7358SJed Brown 1586552f7358SJed Brown PetscFunctionBegin; 1587552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 158882f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1589552f7358SJed Brown /* Calculate support sizes */ 1590552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1591552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1592552f7358SJed Brown PetscInt dof, off, c; 1593552f7358SJed Brown 1594552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1595552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1596552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1597552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1598552f7358SJed Brown } 1599552f7358SJed Brown } 1600552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1601552f7358SJed Brown PetscInt dof; 1602552f7358SJed Brown 1603552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 16040d644c17SKarl Rupp 1605552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1606552f7358SJed Brown } 1607552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1608552f7358SJed Brown /* Calculate supports */ 1609552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 16101795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 16111795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1612552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1613552f7358SJed Brown PetscInt dof, off, c; 1614552f7358SJed Brown 1615552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1616552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1617552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1618552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1619552f7358SJed Brown PetscInt offS; 1620552f7358SJed Brown 1621552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16220d644c17SKarl Rupp 1623552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1624552f7358SJed Brown ++offsets[q]; 1625552f7358SJed Brown } 1626552f7358SJed Brown } 1627552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1628552f7358SJed Brown PetscFunctionReturn(0); 1629552f7358SJed Brown } 1630552f7358SJed Brown 1631552f7358SJed Brown #undef __FUNCT__ 1632552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1633552f7358SJed Brown /*@ 1634552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1635552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1636552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1637552f7358SJed Brown the DAG. 1638552f7358SJed Brown 1639552f7358SJed Brown Not collective 1640552f7358SJed Brown 1641552f7358SJed Brown Input Parameter: 1642552f7358SJed Brown . mesh - The DMPlex 1643552f7358SJed Brown 1644552f7358SJed Brown Output Parameter: 1645552f7358SJed Brown 1646552f7358SJed Brown Notes: 1647552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1648552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1649552f7358SJed Brown 1650552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1651552f7358SJed Brown 1652552f7358SJed Brown Level: beginner 1653552f7358SJed Brown 1654552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1655552f7358SJed Brown @*/ 1656552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1657552f7358SJed Brown { 1658aa50250dSMatthew G. Knepley DMLabel label; 1659552f7358SJed Brown PetscInt pStart, pEnd, p; 1660552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1661552f7358SJed Brown PetscErrorCode ierr; 1662552f7358SJed Brown 1663552f7358SJed Brown PetscFunctionBegin; 1664552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1665552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1666552f7358SJed Brown /* Calculate depth */ 1667aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1668aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1669aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1670552f7358SJed Brown /* Initialize roots and count leaves */ 1671552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1672552f7358SJed Brown PetscInt coneSize, supportSize; 1673552f7358SJed Brown 1674552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1675552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1676552f7358SJed Brown if (!coneSize && supportSize) { 1677552f7358SJed Brown ++numRoots; 1678aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1679552f7358SJed Brown } else if (!supportSize && coneSize) { 1680552f7358SJed Brown ++numLeaves; 1681552f7358SJed Brown } else if (!supportSize && !coneSize) { 1682552f7358SJed Brown /* Isolated points */ 1683aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1684552f7358SJed Brown } 1685552f7358SJed Brown } 1686552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1687552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1688552f7358SJed Brown PetscInt coneSize, supportSize; 1689552f7358SJed Brown 1690552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1691552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1692552f7358SJed Brown if (!supportSize && coneSize) { 1693aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1694552f7358SJed Brown } 1695552f7358SJed Brown } 1696552f7358SJed Brown } else { 169774ef644bSMatthew G. Knepley IS pointIS; 169874ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1699552f7358SJed Brown 170074ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 170174ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170274ef644bSMatthew G. Knepley while (numPoints) { 170374ef644bSMatthew G. Knepley const PetscInt *points; 170474ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 170574ef644bSMatthew G. Knepley 170674ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 170774ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 170874ef644bSMatthew G. Knepley const PetscInt point = points[p]; 170974ef644bSMatthew G. Knepley const PetscInt *support; 171074ef644bSMatthew G. Knepley PetscInt supportSize, s; 171174ef644bSMatthew G. Knepley 171274ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 171374ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 171474ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 171574ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1716552f7358SJed Brown } 1717552f7358SJed Brown } 17185edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 171974ef644bSMatthew G. Knepley ++level; 172074ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 172174ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 172274ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 172374ef644bSMatthew G. Knepley else {numPoints = 0;} 172474ef644bSMatthew G. Knepley } 172574ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 172674ef644bSMatthew G. Knepley } 1727552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1728552f7358SJed Brown PetscFunctionReturn(0); 1729552f7358SJed Brown } 1730552f7358SJed Brown 1731552f7358SJed Brown #undef __FUNCT__ 1732552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1733552f7358SJed Brown /*@C 1734552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1735552f7358SJed Brown 1736552f7358SJed Brown Not Collective 1737552f7358SJed Brown 1738552f7358SJed Brown Input Parameters: 1739552f7358SJed Brown + dm - The DMPlex object 1740552f7358SJed Brown . numPoints - The number of input points for the join 1741552f7358SJed Brown - points - The input points 1742552f7358SJed Brown 1743552f7358SJed Brown Output Parameters: 1744552f7358SJed Brown + numCoveredPoints - The number of points in the join 1745552f7358SJed Brown - coveredPoints - The points in the join 1746552f7358SJed Brown 1747552f7358SJed Brown Level: intermediate 1748552f7358SJed Brown 1749552f7358SJed Brown Note: Currently, this is restricted to a single level join 1750552f7358SJed Brown 17513813dfbdSMatthew G Knepley Fortran Notes: 17523813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17533813dfbdSMatthew G Knepley include petsc.h90 in your code. 17543813dfbdSMatthew G Knepley 17553813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17563813dfbdSMatthew G Knepley 1757552f7358SJed Brown .keywords: mesh 1758552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1759552f7358SJed Brown @*/ 1760552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1761552f7358SJed Brown { 1762552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1763552f7358SJed Brown PetscInt *join[2]; 1764552f7358SJed Brown PetscInt joinSize, i = 0; 1765552f7358SJed Brown PetscInt dof, off, p, c, m; 1766552f7358SJed Brown PetscErrorCode ierr; 1767552f7358SJed Brown 1768552f7358SJed Brown PetscFunctionBegin; 1769552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1770552f7358SJed Brown PetscValidPointer(points, 2); 1771552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1772552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1773552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1774552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1775552f7358SJed Brown /* Copy in support of first point */ 1776552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1777552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1778552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1779552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1780552f7358SJed Brown } 1781552f7358SJed Brown /* Check each successive support */ 1782552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1783552f7358SJed Brown PetscInt newJoinSize = 0; 1784552f7358SJed Brown 1785552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1786552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1787552f7358SJed Brown for (c = 0; c < dof; ++c) { 1788552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1789552f7358SJed Brown 1790552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1791552f7358SJed Brown if (point == join[i][m]) { 1792552f7358SJed Brown join[1-i][newJoinSize++] = point; 1793552f7358SJed Brown break; 1794552f7358SJed Brown } 1795552f7358SJed Brown } 1796552f7358SJed Brown } 1797552f7358SJed Brown joinSize = newJoinSize; 1798552f7358SJed Brown i = 1-i; 1799552f7358SJed Brown } 1800552f7358SJed Brown *numCoveredPoints = joinSize; 1801552f7358SJed Brown *coveredPoints = join[i]; 1802552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1803552f7358SJed Brown PetscFunctionReturn(0); 1804552f7358SJed Brown } 1805552f7358SJed Brown 1806552f7358SJed Brown #undef __FUNCT__ 1807552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1808552f7358SJed Brown /*@C 1809552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1810552f7358SJed Brown 1811552f7358SJed Brown Not Collective 1812552f7358SJed Brown 1813552f7358SJed Brown Input Parameters: 1814552f7358SJed Brown + dm - The DMPlex object 1815552f7358SJed Brown . numPoints - The number of input points for the join 1816552f7358SJed Brown - points - The input points 1817552f7358SJed Brown 1818552f7358SJed Brown Output Parameters: 1819552f7358SJed Brown + numCoveredPoints - The number of points in the join 1820552f7358SJed Brown - coveredPoints - The points in the join 1821552f7358SJed Brown 18223813dfbdSMatthew G Knepley Fortran Notes: 18233813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18243813dfbdSMatthew G Knepley include petsc.h90 in your code. 18253813dfbdSMatthew G Knepley 18263813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18273813dfbdSMatthew G Knepley 1828552f7358SJed Brown Level: intermediate 1829552f7358SJed Brown 1830552f7358SJed Brown .keywords: mesh 1831552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1832552f7358SJed Brown @*/ 1833552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1834552f7358SJed Brown { 1835552f7358SJed Brown PetscErrorCode ierr; 1836552f7358SJed Brown 1837552f7358SJed Brown PetscFunctionBegin; 1838552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1839d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1840d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1841d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1842552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1843d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1844552f7358SJed Brown PetscFunctionReturn(0); 1845552f7358SJed Brown } 1846552f7358SJed Brown 1847552f7358SJed Brown #undef __FUNCT__ 1848552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1849552f7358SJed Brown /*@C 1850552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1851552f7358SJed Brown 1852552f7358SJed Brown Not Collective 1853552f7358SJed Brown 1854552f7358SJed Brown Input Parameters: 1855552f7358SJed Brown + dm - The DMPlex object 1856552f7358SJed Brown . numPoints - The number of input points for the join 1857552f7358SJed Brown - points - The input points 1858552f7358SJed Brown 1859552f7358SJed Brown Output Parameters: 1860552f7358SJed Brown + numCoveredPoints - The number of points in the join 1861552f7358SJed Brown - coveredPoints - The points in the join 1862552f7358SJed Brown 18633813dfbdSMatthew G Knepley Fortran Notes: 18643813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18653813dfbdSMatthew G Knepley include petsc.h90 in your code. 18663813dfbdSMatthew G Knepley 18673813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18683813dfbdSMatthew G Knepley 1869552f7358SJed Brown Level: intermediate 1870552f7358SJed Brown 1871552f7358SJed Brown .keywords: mesh 1872552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1873552f7358SJed Brown @*/ 1874552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1875552f7358SJed Brown { 1876552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1877552f7358SJed Brown PetscInt *offsets, **closures; 1878552f7358SJed Brown PetscInt *join[2]; 1879552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1880552f7358SJed Brown PetscInt p, d, c, m; 1881552f7358SJed Brown PetscErrorCode ierr; 1882552f7358SJed Brown 1883552f7358SJed Brown PetscFunctionBegin; 1884552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1885552f7358SJed Brown PetscValidPointer(points, 2); 1886552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1887552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1888552f7358SJed Brown 1889552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18901795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1891552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1892e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1893552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1894552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1895552f7358SJed Brown 1896552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1897552f7358SJed Brown PetscInt closureSize; 1898552f7358SJed Brown 1899552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 19000d644c17SKarl Rupp 1901552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1902552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1903552f7358SJed Brown PetscInt pStart, pEnd, i; 1904552f7358SJed Brown 1905552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1906552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1907552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1908552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1909552f7358SJed Brown break; 1910552f7358SJed Brown } 1911552f7358SJed Brown } 1912552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1913552f7358SJed Brown } 191482f516ccSBarry 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); 1915552f7358SJed Brown } 1916552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1917552f7358SJed Brown PetscInt dof; 1918552f7358SJed Brown 1919552f7358SJed Brown /* Copy in support of first point */ 1920552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1921552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1922552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1923552f7358SJed Brown } 1924552f7358SJed Brown /* Check each successive cone */ 1925552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1926552f7358SJed Brown PetscInt newJoinSize = 0; 1927552f7358SJed Brown 1928552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1929552f7358SJed Brown for (c = 0; c < dof; ++c) { 1930552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1931552f7358SJed Brown 1932552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1933552f7358SJed Brown if (point == join[i][m]) { 1934552f7358SJed Brown join[1-i][newJoinSize++] = point; 1935552f7358SJed Brown break; 1936552f7358SJed Brown } 1937552f7358SJed Brown } 1938552f7358SJed Brown } 1939552f7358SJed Brown joinSize = newJoinSize; 1940552f7358SJed Brown i = 1-i; 1941552f7358SJed Brown } 1942552f7358SJed Brown if (joinSize) break; 1943552f7358SJed Brown } 1944552f7358SJed Brown *numCoveredPoints = joinSize; 1945552f7358SJed Brown *coveredPoints = join[i]; 1946552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19470298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1948552f7358SJed Brown } 1949552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1950552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1951552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1952552f7358SJed Brown PetscFunctionReturn(0); 1953552f7358SJed Brown } 1954552f7358SJed Brown 1955552f7358SJed Brown #undef __FUNCT__ 1956552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1957552f7358SJed Brown /*@C 1958552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1959552f7358SJed Brown 1960552f7358SJed Brown Not Collective 1961552f7358SJed Brown 1962552f7358SJed Brown Input Parameters: 1963552f7358SJed Brown + dm - The DMPlex object 1964552f7358SJed Brown . numPoints - The number of input points for the meet 1965552f7358SJed Brown - points - The input points 1966552f7358SJed Brown 1967552f7358SJed Brown Output Parameters: 1968552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1969552f7358SJed Brown - coveredPoints - The points in the meet 1970552f7358SJed Brown 1971552f7358SJed Brown Level: intermediate 1972552f7358SJed Brown 1973552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1974552f7358SJed Brown 19753813dfbdSMatthew G Knepley Fortran Notes: 19763813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19773813dfbdSMatthew G Knepley include petsc.h90 in your code. 19783813dfbdSMatthew G Knepley 19793813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19803813dfbdSMatthew G Knepley 1981552f7358SJed Brown .keywords: mesh 1982552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1983552f7358SJed Brown @*/ 1984552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1985552f7358SJed Brown { 1986552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1987552f7358SJed Brown PetscInt *meet[2]; 1988552f7358SJed Brown PetscInt meetSize, i = 0; 1989552f7358SJed Brown PetscInt dof, off, p, c, m; 1990552f7358SJed Brown PetscErrorCode ierr; 1991552f7358SJed Brown 1992552f7358SJed Brown PetscFunctionBegin; 1993552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1994552f7358SJed Brown PetscValidPointer(points, 2); 1995552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1996552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1997552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1998552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1999552f7358SJed Brown /* Copy in cone of first point */ 2000552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2001552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2002552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2003552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2004552f7358SJed Brown } 2005552f7358SJed Brown /* Check each successive cone */ 2006552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2007552f7358SJed Brown PetscInt newMeetSize = 0; 2008552f7358SJed Brown 2009552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2010552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2011552f7358SJed Brown for (c = 0; c < dof; ++c) { 2012552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2013552f7358SJed Brown 2014552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2015552f7358SJed Brown if (point == meet[i][m]) { 2016552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2017552f7358SJed Brown break; 2018552f7358SJed Brown } 2019552f7358SJed Brown } 2020552f7358SJed Brown } 2021552f7358SJed Brown meetSize = newMeetSize; 2022552f7358SJed Brown i = 1-i; 2023552f7358SJed Brown } 2024552f7358SJed Brown *numCoveringPoints = meetSize; 2025552f7358SJed Brown *coveringPoints = meet[i]; 2026552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2027552f7358SJed Brown PetscFunctionReturn(0); 2028552f7358SJed Brown } 2029552f7358SJed Brown 2030552f7358SJed Brown #undef __FUNCT__ 2031552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2032552f7358SJed Brown /*@C 2033552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2034552f7358SJed Brown 2035552f7358SJed Brown Not Collective 2036552f7358SJed Brown 2037552f7358SJed Brown Input Parameters: 2038552f7358SJed Brown + dm - The DMPlex object 2039552f7358SJed Brown . numPoints - The number of input points for the meet 2040552f7358SJed Brown - points - The input points 2041552f7358SJed Brown 2042552f7358SJed Brown Output Parameters: 2043552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2044552f7358SJed Brown - coveredPoints - The points in the meet 2045552f7358SJed Brown 2046552f7358SJed Brown Level: intermediate 2047552f7358SJed Brown 20483813dfbdSMatthew G Knepley Fortran Notes: 20493813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20503813dfbdSMatthew G Knepley include petsc.h90 in your code. 20513813dfbdSMatthew G Knepley 20523813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20533813dfbdSMatthew G Knepley 2054552f7358SJed Brown .keywords: mesh 2055552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2056552f7358SJed Brown @*/ 2057552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2058552f7358SJed Brown { 2059552f7358SJed Brown PetscErrorCode ierr; 2060552f7358SJed Brown 2061552f7358SJed Brown PetscFunctionBegin; 2062552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2063d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2064d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2065d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2066552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2067d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2068552f7358SJed Brown PetscFunctionReturn(0); 2069552f7358SJed Brown } 2070552f7358SJed Brown 2071552f7358SJed Brown #undef __FUNCT__ 2072552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2073552f7358SJed Brown /*@C 2074552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2075552f7358SJed Brown 2076552f7358SJed Brown Not Collective 2077552f7358SJed Brown 2078552f7358SJed Brown Input Parameters: 2079552f7358SJed Brown + dm - The DMPlex object 2080552f7358SJed Brown . numPoints - The number of input points for the meet 2081552f7358SJed Brown - points - The input points 2082552f7358SJed Brown 2083552f7358SJed Brown Output Parameters: 2084552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2085552f7358SJed Brown - coveredPoints - The points in the meet 2086552f7358SJed Brown 2087552f7358SJed Brown Level: intermediate 2088552f7358SJed Brown 20893813dfbdSMatthew G Knepley Fortran Notes: 20903813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20913813dfbdSMatthew G Knepley include petsc.h90 in your code. 20923813dfbdSMatthew G Knepley 20933813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20943813dfbdSMatthew G Knepley 2095552f7358SJed Brown .keywords: mesh 2096552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2097552f7358SJed Brown @*/ 2098552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2099552f7358SJed Brown { 2100552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2101552f7358SJed Brown PetscInt *offsets, **closures; 2102552f7358SJed Brown PetscInt *meet[2]; 2103552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2104552f7358SJed Brown PetscInt p, h, c, m; 2105552f7358SJed Brown PetscErrorCode ierr; 2106552f7358SJed Brown 2107552f7358SJed Brown PetscFunctionBegin; 2108552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2109552f7358SJed Brown PetscValidPointer(points, 2); 2110552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2111552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2112552f7358SJed Brown 2113552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2114785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2115552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2116e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2117552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2118552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2119552f7358SJed Brown 2120552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2121552f7358SJed Brown PetscInt closureSize; 2122552f7358SJed Brown 2123552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21240d644c17SKarl Rupp 2125552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2126552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2127552f7358SJed Brown PetscInt pStart, pEnd, i; 2128552f7358SJed Brown 2129552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2130552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2131552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2132552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2133552f7358SJed Brown break; 2134552f7358SJed Brown } 2135552f7358SJed Brown } 2136552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2137552f7358SJed Brown } 213882f516ccSBarry 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); 2139552f7358SJed Brown } 2140552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2141552f7358SJed Brown PetscInt dof; 2142552f7358SJed Brown 2143552f7358SJed Brown /* Copy in cone of first point */ 2144552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2145552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2146552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2147552f7358SJed Brown } 2148552f7358SJed Brown /* Check each successive cone */ 2149552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2150552f7358SJed Brown PetscInt newMeetSize = 0; 2151552f7358SJed Brown 2152552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2153552f7358SJed Brown for (c = 0; c < dof; ++c) { 2154552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2155552f7358SJed Brown 2156552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2157552f7358SJed Brown if (point == meet[i][m]) { 2158552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2159552f7358SJed Brown break; 2160552f7358SJed Brown } 2161552f7358SJed Brown } 2162552f7358SJed Brown } 2163552f7358SJed Brown meetSize = newMeetSize; 2164552f7358SJed Brown i = 1-i; 2165552f7358SJed Brown } 2166552f7358SJed Brown if (meetSize) break; 2167552f7358SJed Brown } 2168552f7358SJed Brown *numCoveredPoints = meetSize; 2169552f7358SJed Brown *coveredPoints = meet[i]; 2170552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21710298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2172552f7358SJed Brown } 2173552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2174552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2175552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2176552f7358SJed Brown PetscFunctionReturn(0); 2177552f7358SJed Brown } 2178552f7358SJed Brown 2179552f7358SJed Brown #undef __FUNCT__ 21804e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21814e3744c5SMatthew G. Knepley /*@C 21824e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21834e3744c5SMatthew G. Knepley 21844e3744c5SMatthew G. Knepley Not Collective 21854e3744c5SMatthew G. Knepley 21864e3744c5SMatthew G. Knepley Input Parameters: 21874e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21884e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21894e3744c5SMatthew G. Knepley 21904e3744c5SMatthew G. Knepley Output Parameters: 21914e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21924e3744c5SMatthew G. Knepley 21934e3744c5SMatthew G. Knepley Level: intermediate 21944e3744c5SMatthew G. Knepley 21954e3744c5SMatthew G. Knepley Notes: 21964e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 21974e3744c5SMatthew G. Knepley 21984e3744c5SMatthew G. Knepley .keywords: mesh 21994e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 22004e3744c5SMatthew G. Knepley @*/ 22014e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 22024e3744c5SMatthew G. Knepley { 22034e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 22044e3744c5SMatthew G. Knepley PetscErrorCode ierr; 22054e3744c5SMatthew G. Knepley 22064e3744c5SMatthew G. Knepley PetscFunctionBegin; 22074e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 22084e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 22094e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 22104e3744c5SMatthew G. Knepley 22114e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 22124e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 22134e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 22144e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 22154e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 22164e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 22174e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 22184e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22194e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22204e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22214e3744c5SMatthew G. Knepley 22224e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22234e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22244e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22254e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22264e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22274e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22284e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22294e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22304e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22314e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22324e3744c5SMatthew G. Knepley } 22334e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22344e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22354e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22364e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22374e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22384e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22394e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22404e3744c5SMatthew G. Knepley } 22414e3744c5SMatthew G. Knepley } 22424e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22434e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22444e3744c5SMatthew G. Knepley } 22454e3744c5SMatthew G. Knepley 22464e3744c5SMatthew G. Knepley #undef __FUNCT__ 224718ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 224818ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2249a6dfd86eSKarl Rupp { 225082f516ccSBarry Smith MPI_Comm comm; 2251552f7358SJed Brown PetscErrorCode ierr; 2252552f7358SJed Brown 2253552f7358SJed Brown PetscFunctionBegin; 225482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2255552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2256552f7358SJed Brown switch (cellDim) { 2257552f7358SJed Brown case 0: 2258552f7358SJed Brown *numFaceVertices = 0; 2259552f7358SJed Brown break; 2260552f7358SJed Brown case 1: 2261552f7358SJed Brown *numFaceVertices = 1; 2262552f7358SJed Brown break; 2263552f7358SJed Brown case 2: 2264552f7358SJed Brown switch (numCorners) { 226519436ca2SJed Brown case 3: /* triangle */ 226619436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2267552f7358SJed Brown break; 226819436ca2SJed Brown case 4: /* quadrilateral */ 226919436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2270552f7358SJed Brown break; 227119436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 227219436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2273552f7358SJed Brown break; 227419436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 227519436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2276552f7358SJed Brown break; 2277552f7358SJed Brown default: 2278552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2279552f7358SJed Brown } 2280552f7358SJed Brown break; 2281552f7358SJed Brown case 3: 2282552f7358SJed Brown switch (numCorners) { 228319436ca2SJed Brown case 4: /* tetradehdron */ 228419436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2285552f7358SJed Brown break; 228619436ca2SJed Brown case 6: /* tet cohesive cells */ 228719436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2288552f7358SJed Brown break; 228919436ca2SJed Brown case 8: /* hexahedron */ 229019436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2291552f7358SJed Brown break; 229219436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 229319436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2294552f7358SJed Brown break; 229519436ca2SJed Brown case 10: /* quadratic tetrahedron */ 229619436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2297552f7358SJed Brown break; 229819436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 229919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2300552f7358SJed Brown break; 230119436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 230219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2303552f7358SJed Brown break; 230419436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 230519436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2306552f7358SJed Brown break; 2307552f7358SJed Brown default: 2308552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2309552f7358SJed Brown } 2310552f7358SJed Brown break; 2311552f7358SJed Brown default: 2312552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2313552f7358SJed Brown } 2314552f7358SJed Brown PetscFunctionReturn(0); 2315552f7358SJed Brown } 2316552f7358SJed Brown 2317552f7358SJed Brown #undef __FUNCT__ 2318d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2319d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2320d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2321d27a0f52SMatthew G. Knepley { 2322a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2323a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2324a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2325d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2326d27a0f52SMatthew G. Knepley 2327d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2328d27a0f52SMatthew G. Knepley /* Truth Table 2329d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2330d27a0f52SMatthew G. Knepley F 0 flips no F F F 2331d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2332d27a0f52SMatthew G. Knepley F 2 flips no T F T 2333d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2334d27a0f52SMatthew G. Knepley T 1 flip no 2335d27a0f52SMatthew G. Knepley T 2 flips yes 2336d27a0f52SMatthew G. Knepley */ 2337a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2338d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2339a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2340d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2341a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2342a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2343a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2344a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2345a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2346a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2347785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2348a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2349a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2350defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2351a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2352a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2353a1b4d4a2SMatthew G. Knepley 2354a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2355a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2356a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2357a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2358a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2359a1b4d4a2SMatthew G. Knepley } 2360a1b4d4a2SMatthew G. Knepley } 2361a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2362a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2363d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2364a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2365d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2366d27a0f52SMatthew G. Knepley 2367a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2368a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2369a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2370d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2371d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2372a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 237386cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2374a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 237586cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2376d27a0f52SMatthew G. Knepley 2377d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2378d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2379d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2380d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2381d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2382d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2383a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2384a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2385a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2386a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2387a1b4d4a2SMatthew G. Knepley } 2388a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2389a1b4d4a2SMatthew 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); 2390a1b4d4a2SMatthew G. Knepley } 2391a1b4d4a2SMatthew 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]); 2392a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2393a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2394a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2395a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2396a1b4d4a2SMatthew G. Knepley } 2397a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2398a1b4d4a2SMatthew 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); 2399a1b4d4a2SMatthew G. Knepley } 2400a1b4d4a2SMatthew 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]); 2401d27a0f52SMatthew G. Knepley 2402d27a0f52SMatthew G. Knepley if (dim == 1) { 2403d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2404d27a0f52SMatthew G. Knepley } else { 2405d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2406d27a0f52SMatthew G. Knepley } 2407d27a0f52SMatthew G. Knepley 2408d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2409d27a0f52SMatthew 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]); 2410d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2411a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2412d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2413a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2414d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 241586cff514SMatthew 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"); 2416a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2417a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2418d27a0f52SMatthew G. Knepley } 2419fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2420fedde076SMatthew G. Knepley { 2421fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2422fedde076SMatthew G. Knepley PetscSF sf; 2423fedde076SMatthew G. Knepley const PetscInt *lpoints; 2424fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 242513048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2426fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2427a1b4d4a2SMatthew G. Knepley 2428fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2429fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2430fedde076SMatthew G. Knepley if (numLeaves >= 0) { 243162ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 243262ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 243362ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 243413048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 243562ad4a6aSMatthew G. Knepley 2436fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2437fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2438fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2439fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2440fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2441fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2442fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2443fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2444fedde076SMatthew G. Knepley PetscInt supportSize; 2445fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2446fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2447fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2448fedde076SMatthew G. Knepley } 2449fedde076SMatthew G. Knepley } 2450fedde076SMatthew G. Knepley } 245113048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2452fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2453fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2454fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2455fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2456fedde076SMatthew G. Knepley 2457fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 245862ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2459fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2460fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24615b7033fcSMatthew G. Knepley if (dim == 1) { 24625b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24635b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24645b7033fcSMatthew G. Knepley } else { 2465fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2466fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2467fedde076SMatthew G. Knepley } 24685b7033fcSMatthew G. Knepley } 2469fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2470fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2471fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2472fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2473fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2474fedde076SMatthew G. Knepley 247513048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 247613048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 247713048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2478fedde076SMatthew G. Knepley } 247913048561SMatthew G. Knepley /* Collect the graph on 0 */ 248013048561SMatthew G. Knepley { 248113048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 248213048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 248313048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 248413048561SMatthew G. Knepley PetscInt *adj = NULL; 248513048561SMatthew G. Knepley PetscBool *val = NULL; 248613048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 248713048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 248813048561SMatthew G. Knepley PetscInt debug = 0; 248913048561SMatthew G. Knepley 249013048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 249113048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 249213048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 249313048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 249413048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 249513048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 249613048561SMatthew G. Knepley } 249713048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 249813048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 249913048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 250013048561SMatthew G. Knepley if (debug) { 250113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250213048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 250313048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 250413048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 250513048561SMatthew G. Knepley } 250613048561SMatthew G. Knepley } 250713048561SMatthew G. Knepley } 250813048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 250913048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 251013048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 251113048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 251213048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 251313048561SMatthew G. Knepley pTop = pBottom = 0; 251413048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 251513048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 251613048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 251713048561SMatthew G. Knepley procFIFO[pBottom++] = p; 251813048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 251913048561SMatthew G. Knepley /* Consider each proc in FIFO */ 252013048561SMatthew G. Knepley while (pTop < pBottom) { 252113048561SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch; 252213048561SMatthew G. Knepley 252313048561SMatthew G. Knepley proc = procFIFO[pTop++]; 252413048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 252513048561SMatthew G. Knepley /* Loop over neighboring procs */ 252613048561SMatthew G. Knepley for (n = 0; n < recvcounts[proc]; ++n) { 252713048561SMatthew G. Knepley nproc = adj[displs[proc]+n]; 252813048561SMatthew G. Knepley mismatch = val[displs[proc]+n] ? 0 : 1; 252913048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 253013048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 253113048561SMatthew G. Knepley 253213048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 253313048561SMatthew 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); 253413048561SMatthew G. Knepley if (!flippedB) { 253513048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 253613048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 253713048561SMatthew 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"); 253813048561SMatthew G. Knepley if (!seen) { 253913048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 254013048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 254113048561SMatthew G. Knepley } 254213048561SMatthew G. Knepley } 254313048561SMatthew G. Knepley } 254413048561SMatthew G. Knepley } 254513048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 254613048561SMatthew G. Knepley 254713048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 254813048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 254913048561SMatthew G. Knepley { 255013048561SMatthew G. Knepley PetscBool *flips; 255113048561SMatthew G. Knepley 255213048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 255313048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 255413048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 255513048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 255613048561SMatthew G. Knepley } 255713048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 255813048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 255913048561SMatthew G. Knepley } 256013048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 256113048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 256213048561SMatthew G. Knepley } 256313048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2564fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 256513048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2566fedde076SMatthew G. Knepley } 2567fedde076SMatthew G. Knepley } 2568fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2569d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2570d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2571d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2572a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2573f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2574f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2575d27a0f52SMatthew G. Knepley 2576a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2577a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2578a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2579a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2580a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2581a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2582a1b4d4a2SMatthew G. Knepley 2583a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2584a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2585a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2586d27a0f52SMatthew G. Knepley } 2587a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2588a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2589f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2590f4e909fcSMatthew G. Knepley faceSize = coneSize; 2591f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2592f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2593f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2594f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2595f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2596f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2597f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2598f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2599f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2600f4e909fcSMatthew G. Knepley } 2601f4e909fcSMatthew G. Knepley } 2602d27a0f52SMatthew G. Knepley } 2603d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2604d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2605d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2606a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2607a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2608a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2609d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2610d27a0f52SMatthew G. Knepley } 2611d27a0f52SMatthew G. Knepley 2612d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2613895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2614895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2615895b8c46SMatthew G. Knepley { 2616895b8c46SMatthew G. Knepley int tmpc; 2617895b8c46SMatthew G. Knepley 2618895b8c46SMatthew G. Knepley PetscFunctionBegin; 2619895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2620895b8c46SMatthew G. Knepley switch (numCorners) { 2621895b8c46SMatthew G. Knepley case 4: 2622895b8c46SMatthew G. Knepley tmpc = cone[0]; 2623895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2624895b8c46SMatthew G. Knepley cone[1] = tmpc; 2625895b8c46SMatthew G. Knepley break; 2626895b8c46SMatthew G. Knepley case 8: 2627895b8c46SMatthew G. Knepley tmpc = cone[1]; 2628895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2629895b8c46SMatthew G. Knepley cone[3] = tmpc; 2630895b8c46SMatthew G. Knepley break; 2631895b8c46SMatthew G. Knepley default: break; 2632895b8c46SMatthew G. Knepley } 2633895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2634895b8c46SMatthew G. Knepley } 2635895b8c46SMatthew G. Knepley 2636895b8c46SMatthew G. Knepley #undef __FUNCT__ 26379db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26389db3b87dSMatthew G. Knepley /*@C 26399db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26409db3b87dSMatthew G. Knepley 26419db3b87dSMatthew G. Knepley Input Parameters: 26429db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26439db3b87dSMatthew G. Knepley - cone - The incoming cone 26449db3b87dSMatthew G. Knepley 26459db3b87dSMatthew G. Knepley Output Parameter: 26469db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26479db3b87dSMatthew G. Knepley 26489db3b87dSMatthew G. Knepley Level: developer 26499db3b87dSMatthew G. Knepley 26509db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26519db3b87dSMatthew G. Knepley @*/ 26529db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26532e1b13c2SMatthew G. Knepley { 26549db3b87dSMatthew G. Knepley int tmpc; 26552e1b13c2SMatthew G. Knepley 26562e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26579db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26589db3b87dSMatthew G. Knepley switch (numCorners) { 26599db3b87dSMatthew G. Knepley case 4: 26601885f254SMatthew G. Knepley tmpc = cone[0]; 26611885f254SMatthew G. Knepley cone[0] = cone[1]; 26621885f254SMatthew G. Knepley cone[1] = tmpc; 26639db3b87dSMatthew G. Knepley break; 26649db3b87dSMatthew G. Knepley case 8: 26659db3b87dSMatthew G. Knepley tmpc = cone[1]; 26669db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26679db3b87dSMatthew G. Knepley cone[3] = tmpc; 26689db3b87dSMatthew G. Knepley break; 26699db3b87dSMatthew G. Knepley default: break; 26709db3b87dSMatthew G. Knepley } 26719db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 26729db3b87dSMatthew G. Knepley } 26739db3b87dSMatthew G. Knepley 26749db3b87dSMatthew G. Knepley #undef __FUNCT__ 26759db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 26769db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 26779db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 26789db3b87dSMatthew G. Knepley { 26799db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 26809db3b87dSMatthew G. Knepley PetscErrorCode ierr; 26819db3b87dSMatthew G. Knepley 26829db3b87dSMatthew G. Knepley PetscFunctionBegin; 26839db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 26849db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 26852e1b13c2SMatthew G. Knepley } 26862e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 26872e1b13c2SMatthew G. Knepley } 26882e1b13c2SMatthew G. Knepley 2689519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2690552f7358SJed Brown #include <triangle.h> 2691552f7358SJed Brown 2692552f7358SJed Brown #undef __FUNCT__ 2693552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 26940adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 26950adebc6cSBarry Smith { 2696552f7358SJed Brown PetscFunctionBegin; 2697552f7358SJed Brown inputCtx->numberofpoints = 0; 2698552f7358SJed Brown inputCtx->numberofpointattributes = 0; 26990298fd71SBarry Smith inputCtx->pointlist = NULL; 27000298fd71SBarry Smith inputCtx->pointattributelist = NULL; 27010298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2702552f7358SJed Brown inputCtx->numberofsegments = 0; 27030298fd71SBarry Smith inputCtx->segmentlist = NULL; 27040298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2705552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27060298fd71SBarry Smith inputCtx->trianglelist = NULL; 2707552f7358SJed Brown inputCtx->numberofholes = 0; 27080298fd71SBarry Smith inputCtx->holelist = NULL; 2709552f7358SJed Brown inputCtx->numberofregions = 0; 27100298fd71SBarry Smith inputCtx->regionlist = NULL; 2711552f7358SJed Brown PetscFunctionReturn(0); 2712552f7358SJed Brown } 2713552f7358SJed Brown 2714552f7358SJed Brown #undef __FUNCT__ 2715552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27160adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27170adebc6cSBarry Smith { 2718552f7358SJed Brown PetscFunctionBegin; 2719552f7358SJed Brown outputCtx->numberofpoints = 0; 27200298fd71SBarry Smith outputCtx->pointlist = NULL; 27210298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27220298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2723552f7358SJed Brown outputCtx->numberoftriangles = 0; 27240298fd71SBarry Smith outputCtx->trianglelist = NULL; 27250298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27260298fd71SBarry Smith outputCtx->neighborlist = NULL; 27270298fd71SBarry Smith outputCtx->segmentlist = NULL; 27280298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2729552f7358SJed Brown outputCtx->numberofedges = 0; 27300298fd71SBarry Smith outputCtx->edgelist = NULL; 27310298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2732552f7358SJed Brown PetscFunctionReturn(0); 2733552f7358SJed Brown } 2734552f7358SJed Brown 2735552f7358SJed Brown #undef __FUNCT__ 2736552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27370adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27380adebc6cSBarry Smith { 2739552f7358SJed Brown PetscFunctionBegin; 274023b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2741552f7358SJed Brown free(outputCtx->pointmarkerlist); 274223b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 274323b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2744552f7358SJed Brown free(outputCtx->edgelist); 2745552f7358SJed Brown free(outputCtx->edgemarkerlist); 2746552f7358SJed Brown free(outputCtx->trianglelist); 2747552f7358SJed Brown free(outputCtx->neighborlist); 2748552f7358SJed Brown PetscFunctionReturn(0); 2749552f7358SJed Brown } 2750552f7358SJed Brown 2751552f7358SJed Brown #undef __FUNCT__ 2752552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2753552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2754552f7358SJed Brown { 275582f516ccSBarry Smith MPI_Comm comm; 2756552f7358SJed Brown PetscInt dim = 2; 2757552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2758552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2759552f7358SJed Brown struct triangulateio in; 2760552f7358SJed Brown struct triangulateio out; 2761552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2762552f7358SJed Brown PetscMPIInt rank; 2763552f7358SJed Brown PetscErrorCode ierr; 2764552f7358SJed Brown 2765552f7358SJed Brown PetscFunctionBegin; 276682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2767552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2768552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2769552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2770552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27710d644c17SKarl Rupp 2772552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2773552f7358SJed Brown if (in.numberofpoints > 0) { 2774552f7358SJed Brown PetscSection coordSection; 2775552f7358SJed Brown Vec coordinates; 2776552f7358SJed Brown PetscScalar *array; 2777552f7358SJed Brown 2778785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2779785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2780552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 278169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2782552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2783552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2784552f7358SJed Brown const PetscInt idx = v - vStart; 2785552f7358SJed Brown PetscInt off, d; 2786552f7358SJed Brown 2787552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2788552f7358SJed Brown for (d = 0; d < dim; ++d) { 2789552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2790552f7358SJed Brown } 2791552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2792552f7358SJed Brown } 2793552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2794552f7358SJed Brown } 2795552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2796552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2797552f7358SJed Brown if (in.numberofsegments > 0) { 2798785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2799785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2800552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2801552f7358SJed Brown const PetscInt idx = e - eStart; 2802552f7358SJed Brown const PetscInt *cone; 2803552f7358SJed Brown 2804552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28050d644c17SKarl Rupp 2806552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2807552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28080d644c17SKarl Rupp 2809552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2810552f7358SJed Brown } 2811552f7358SJed Brown } 2812552f7358SJed Brown #if 0 /* Do not currently support holes */ 2813552f7358SJed Brown PetscReal *holeCoords; 2814552f7358SJed Brown PetscInt h, d; 2815552f7358SJed Brown 2816552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2817552f7358SJed Brown if (in.numberofholes > 0) { 2818785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2819552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2820552f7358SJed Brown for (d = 0; d < dim; ++d) { 2821552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2822552f7358SJed Brown } 2823552f7358SJed Brown } 2824552f7358SJed Brown } 2825552f7358SJed Brown #endif 2826552f7358SJed Brown if (!rank) { 2827552f7358SJed Brown char args[32]; 2828552f7358SJed Brown 2829552f7358SJed Brown /* Take away 'Q' for verbose output */ 2830552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2831552f7358SJed Brown if (createConvexHull) { 2832552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2833552f7358SJed Brown } 2834552f7358SJed Brown if (constrained) { 2835552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2836552f7358SJed Brown } 28370298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2838552f7358SJed Brown } 2839552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2840552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2841552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2842552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2843552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2844552f7358SJed Brown 2845552f7358SJed Brown { 2846552f7358SJed Brown const PetscInt numCorners = 3; 2847552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2848552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2849552f7358SJed Brown const int *cells = out.trianglelist; 2850552f7358SJed Brown const double *meshCoords = out.pointlist; 2851552f7358SJed Brown 28520fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2853552f7358SJed Brown /* Set labels */ 2854552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2855552f7358SJed Brown if (out.pointmarkerlist[v]) { 2856552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2857552f7358SJed Brown } 2858552f7358SJed Brown } 2859552f7358SJed Brown if (interpolate) { 2860552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2861552f7358SJed Brown if (out.edgemarkerlist[e]) { 2862552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2863552f7358SJed Brown const PetscInt *edges; 2864552f7358SJed Brown PetscInt numEdges; 2865552f7358SJed Brown 2866552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2867552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2868552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2869552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2870552f7358SJed Brown } 2871552f7358SJed Brown } 2872552f7358SJed Brown } 2873552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2874552f7358SJed Brown } 2875552f7358SJed Brown #if 0 /* Do not currently support holes */ 2876552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2877552f7358SJed Brown #endif 2878552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2879552f7358SJed Brown PetscFunctionReturn(0); 2880552f7358SJed Brown } 2881552f7358SJed Brown 2882552f7358SJed Brown #undef __FUNCT__ 2883552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2884552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2885552f7358SJed Brown { 288682f516ccSBarry Smith MPI_Comm comm; 2887552f7358SJed Brown PetscInt dim = 2; 2888552f7358SJed Brown struct triangulateio in; 2889552f7358SJed Brown struct triangulateio out; 2890552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2891552f7358SJed Brown PetscMPIInt rank; 2892552f7358SJed Brown PetscErrorCode ierr; 2893552f7358SJed Brown 2894552f7358SJed Brown PetscFunctionBegin; 289582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2896552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2897552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2898552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2899552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2900552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2901552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29020d644c17SKarl Rupp 2903552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2904552f7358SJed Brown if (in.numberofpoints > 0) { 2905552f7358SJed Brown PetscSection coordSection; 2906552f7358SJed Brown Vec coordinates; 2907552f7358SJed Brown PetscScalar *array; 2908552f7358SJed Brown 2909785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2910785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2911552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 291269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2913552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2914552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2915552f7358SJed Brown const PetscInt idx = v - vStart; 2916552f7358SJed Brown PetscInt off, d; 2917552f7358SJed Brown 2918552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2919552f7358SJed Brown for (d = 0; d < dim; ++d) { 2920552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2921552f7358SJed Brown } 2922552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2923552f7358SJed Brown } 2924552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2925552f7358SJed Brown } 2926552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29270d644c17SKarl Rupp 2928552f7358SJed Brown in.numberofcorners = 3; 2929552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29300d644c17SKarl Rupp 2931552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2932552f7358SJed Brown if (in.numberoftriangles > 0) { 2933785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2934552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2935552f7358SJed Brown const PetscInt idx = c - cStart; 29360298fd71SBarry Smith PetscInt *closure = NULL; 2937552f7358SJed Brown PetscInt closureSize; 2938552f7358SJed Brown 2939552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2940552f7358SJed 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); 2941552f7358SJed Brown for (v = 0; v < 3; ++v) { 2942552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2943552f7358SJed Brown } 2944552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2945552f7358SJed Brown } 2946552f7358SJed Brown } 2947552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2948552f7358SJed Brown #if 0 /* Do not currently support holes */ 2949552f7358SJed Brown PetscReal *holeCoords; 2950552f7358SJed Brown PetscInt h, d; 2951552f7358SJed Brown 2952552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2953552f7358SJed Brown if (in.numberofholes > 0) { 2954785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2955552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2956552f7358SJed Brown for (d = 0; d < dim; ++d) { 2957552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2958552f7358SJed Brown } 2959552f7358SJed Brown } 2960552f7358SJed Brown } 2961552f7358SJed Brown #endif 2962552f7358SJed Brown if (!rank) { 2963552f7358SJed Brown char args[32]; 2964552f7358SJed Brown 2965552f7358SJed Brown /* Take away 'Q' for verbose output */ 2966552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29670298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2968552f7358SJed Brown } 2969552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2970552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2971552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2972552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2973552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 2974552f7358SJed Brown 2975552f7358SJed Brown { 2976552f7358SJed Brown const PetscInt numCorners = 3; 2977552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2978552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2979552f7358SJed Brown const int *cells = out.trianglelist; 2980552f7358SJed Brown const double *meshCoords = out.pointlist; 2981552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 2982552f7358SJed Brown 29830fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 2984552f7358SJed Brown /* Set labels */ 2985552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2986552f7358SJed Brown if (out.pointmarkerlist[v]) { 2987552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2988552f7358SJed Brown } 2989552f7358SJed Brown } 2990552f7358SJed Brown if (interpolate) { 2991552f7358SJed Brown PetscInt e; 2992552f7358SJed Brown 2993552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2994552f7358SJed Brown if (out.edgemarkerlist[e]) { 2995552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2996552f7358SJed Brown const PetscInt *edges; 2997552f7358SJed Brown PetscInt numEdges; 2998552f7358SJed Brown 2999552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3000552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3001552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3002552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3003552f7358SJed Brown } 3004552f7358SJed Brown } 3005552f7358SJed Brown } 3006552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3007552f7358SJed Brown } 3008552f7358SJed Brown #if 0 /* Do not currently support holes */ 3009552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3010552f7358SJed Brown #endif 3011552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3012552f7358SJed Brown PetscFunctionReturn(0); 3013552f7358SJed Brown } 3014552f7358SJed Brown #endif 3015552f7358SJed Brown 3016519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3017552f7358SJed Brown #include <tetgen.h> 3018552f7358SJed Brown #undef __FUNCT__ 3019552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3020552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3021552f7358SJed Brown { 302282f516ccSBarry Smith MPI_Comm comm; 3023552f7358SJed Brown const PetscInt dim = 3; 3024552f7358SJed Brown ::tetgenio in; 3025552f7358SJed Brown ::tetgenio out; 3026552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3027552f7358SJed Brown PetscMPIInt rank; 3028552f7358SJed Brown PetscErrorCode ierr; 3029552f7358SJed Brown 3030552f7358SJed Brown PetscFunctionBegin; 303182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3032552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3033552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3034552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3035552f7358SJed Brown if (in.numberofpoints > 0) { 3036552f7358SJed Brown PetscSection coordSection; 3037552f7358SJed Brown Vec coordinates; 3038552f7358SJed Brown PetscScalar *array; 3039552f7358SJed Brown 3040552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3041552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30420d644c17SKarl Rupp 3043552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 304469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3045552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3046552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3047552f7358SJed Brown const PetscInt idx = v - vStart; 3048552f7358SJed Brown PetscInt off, d; 3049552f7358SJed Brown 3050552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 30510d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3052552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3053552f7358SJed Brown } 3054552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3055552f7358SJed Brown } 3056552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30570d644c17SKarl Rupp 3058552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3059552f7358SJed Brown if (in.numberoffacets > 0) { 3060552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3061552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3062552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3063552f7358SJed Brown const PetscInt idx = f - fStart; 30640298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3065552f7358SJed Brown 3066552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3067552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3068552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3069552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3070552f7358SJed Brown 3071552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3072552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3073552f7358SJed Brown const PetscInt point = points[p]; 30740d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3075552f7358SJed Brown } 3076552f7358SJed Brown 3077552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3078552f7358SJed Brown poly->numberofvertices = numVertices; 3079552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3080552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3081552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3082552f7358SJed Brown poly->vertexlist[v] = vIdx; 3083552f7358SJed Brown } 3084552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3085552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3086552f7358SJed Brown } 3087552f7358SJed Brown } 3088552f7358SJed Brown if (!rank) { 3089552f7358SJed Brown char args[32]; 3090552f7358SJed Brown 3091552f7358SJed Brown /* Take away 'Q' for verbose output */ 3092552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3093552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3094552f7358SJed Brown } 3095552f7358SJed Brown { 3096552f7358SJed Brown const PetscInt numCorners = 4; 3097552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3098552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3099552f7358SJed Brown const double *meshCoords = out.pointlist; 31001d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3101552f7358SJed Brown 31029db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31030fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3104552f7358SJed Brown /* Set labels */ 3105552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3106552f7358SJed Brown if (out.pointmarkerlist[v]) { 3107552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3108552f7358SJed Brown } 3109552f7358SJed Brown } 3110552f7358SJed Brown if (interpolate) { 3111552f7358SJed Brown PetscInt e; 3112552f7358SJed Brown 3113552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3114552f7358SJed Brown if (out.edgemarkerlist[e]) { 3115552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3116552f7358SJed Brown const PetscInt *edges; 3117552f7358SJed Brown PetscInt numEdges; 3118552f7358SJed Brown 3119552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3120552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3121552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3122552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3123552f7358SJed Brown } 3124552f7358SJed Brown } 3125552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3126552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3127552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3128552f7358SJed Brown const PetscInt *faces; 3129552f7358SJed Brown PetscInt numFaces; 3130552f7358SJed Brown 3131552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3132552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3133552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3134552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3135552f7358SJed Brown } 3136552f7358SJed Brown } 3137552f7358SJed Brown } 3138552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3139552f7358SJed Brown } 3140552f7358SJed Brown PetscFunctionReturn(0); 3141552f7358SJed Brown } 3142552f7358SJed Brown 3143552f7358SJed Brown #undef __FUNCT__ 3144552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3145552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3146552f7358SJed Brown { 314782f516ccSBarry Smith MPI_Comm comm; 3148552f7358SJed Brown const PetscInt dim = 3; 3149552f7358SJed Brown ::tetgenio in; 3150552f7358SJed Brown ::tetgenio out; 3151552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3152552f7358SJed Brown PetscMPIInt rank; 3153552f7358SJed Brown PetscErrorCode ierr; 3154552f7358SJed Brown 3155552f7358SJed Brown PetscFunctionBegin; 315682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3157552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3158552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3159552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3160552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31610d644c17SKarl Rupp 3162552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3163552f7358SJed Brown if (in.numberofpoints > 0) { 3164552f7358SJed Brown PetscSection coordSection; 3165552f7358SJed Brown Vec coordinates; 3166552f7358SJed Brown PetscScalar *array; 3167552f7358SJed Brown 3168552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3169552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31700d644c17SKarl Rupp 3171552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 317269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3173552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3174552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3175552f7358SJed Brown const PetscInt idx = v - vStart; 3176552f7358SJed Brown PetscInt off, d; 3177552f7358SJed Brown 3178552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 31790d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3180552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3181552f7358SJed Brown } 3182552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3183552f7358SJed Brown } 3184552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 31850d644c17SKarl Rupp 3186552f7358SJed Brown in.numberofcorners = 4; 3187552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3188552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3189552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3190552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3191552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3192552f7358SJed Brown const PetscInt idx = c - cStart; 31930298fd71SBarry Smith PetscInt *closure = NULL; 3194552f7358SJed Brown PetscInt closureSize; 3195552f7358SJed Brown 3196552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3197552f7358SJed 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); 3198552f7358SJed Brown for (v = 0; v < 4; ++v) { 3199552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3200552f7358SJed Brown } 3201552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3202552f7358SJed Brown } 3203552f7358SJed Brown } 320419436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3205552f7358SJed Brown if (!rank) { 3206552f7358SJed Brown char args[32]; 3207552f7358SJed Brown 3208552f7358SJed Brown /* Take away 'Q' for verbose output */ 320919436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3210552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3211552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3212552f7358SJed Brown } 3213552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3214552f7358SJed Brown 3215552f7358SJed Brown { 3216552f7358SJed Brown const PetscInt numCorners = 4; 3217552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3218552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3219552f7358SJed Brown const double *meshCoords = out.pointlist; 32201d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32211d4b4d7bSJed Brown 3222552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3223552f7358SJed Brown 32249db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32250fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3226552f7358SJed Brown /* Set labels */ 3227552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3228552f7358SJed Brown if (out.pointmarkerlist[v]) { 3229552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3230552f7358SJed Brown } 3231552f7358SJed Brown } 3232552f7358SJed Brown if (interpolate) { 3233552f7358SJed Brown PetscInt e, f; 3234552f7358SJed Brown 3235552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3236552f7358SJed Brown if (out.edgemarkerlist[e]) { 3237552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3238552f7358SJed Brown const PetscInt *edges; 3239552f7358SJed Brown PetscInt numEdges; 3240552f7358SJed Brown 3241552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3242552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3243552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3244552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3245552f7358SJed Brown } 3246552f7358SJed Brown } 3247552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3248552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3249552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3250552f7358SJed Brown const PetscInt *faces; 3251552f7358SJed Brown PetscInt numFaces; 3252552f7358SJed Brown 3253552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3254552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3255552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3256552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3257552f7358SJed Brown } 3258552f7358SJed Brown } 3259552f7358SJed Brown } 3260552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3261552f7358SJed Brown } 3262552f7358SJed Brown PetscFunctionReturn(0); 3263552f7358SJed Brown } 3264552f7358SJed Brown #endif 3265552f7358SJed Brown 3266519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3267aaa7dc30SBarry Smith #include <ctetgen.h> 3268552f7358SJed Brown 3269552f7358SJed Brown #undef __FUNCT__ 3270552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3271552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3272552f7358SJed Brown { 327382f516ccSBarry Smith MPI_Comm comm; 3274552f7358SJed Brown const PetscInt dim = 3; 3275552f7358SJed Brown PLC *in, *out; 3276552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3277552f7358SJed Brown PetscMPIInt rank; 3278552f7358SJed Brown PetscErrorCode ierr; 3279552f7358SJed Brown 3280552f7358SJed Brown PetscFunctionBegin; 328182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 32820298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3283552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3284552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3285552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3286552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 32870d644c17SKarl Rupp 3288552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3289552f7358SJed Brown if (in->numberofpoints > 0) { 3290552f7358SJed Brown PetscSection coordSection; 3291552f7358SJed Brown Vec coordinates; 3292552f7358SJed Brown PetscScalar *array; 3293552f7358SJed Brown 3294785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3295785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3296552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 329769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3298552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3299552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3300552f7358SJed Brown const PetscInt idx = v - vStart; 3301552f7358SJed Brown PetscInt off, d, m; 3302552f7358SJed Brown 3303552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3304552f7358SJed Brown for (d = 0; d < dim; ++d) { 3305552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3306552f7358SJed Brown } 3307552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33080d644c17SKarl Rupp 3309552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3310552f7358SJed Brown } 3311552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3312552f7358SJed Brown } 3313552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33140d644c17SKarl Rupp 3315552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3316552f7358SJed Brown if (in->numberoffacets > 0) { 3317785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3318785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3319552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3320552f7358SJed Brown const PetscInt idx = f - fStart; 33210298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3322552f7358SJed Brown polygon *poly; 3323552f7358SJed Brown 3324552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33250d644c17SKarl Rupp 3326785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33270d644c17SKarl Rupp 3328552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33290298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3330552f7358SJed Brown 3331552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3332552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3333552f7358SJed Brown const PetscInt point = points[p]; 33340d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3335552f7358SJed Brown } 3336552f7358SJed Brown 3337552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3338552f7358SJed Brown poly->numberofvertices = numVertices; 3339785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3340552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3341552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3342552f7358SJed Brown poly->vertexlist[v] = vIdx; 3343552f7358SJed Brown } 3344552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3345552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3346552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3347552f7358SJed Brown } 3348552f7358SJed Brown } 3349552f7358SJed Brown if (!rank) { 3350552f7358SJed Brown TetGenOpts t; 3351552f7358SJed Brown 3352552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3353552f7358SJed Brown t.in = boundary; /* Should go away */ 3354552f7358SJed Brown t.plc = 1; 3355552f7358SJed Brown t.quality = 1; 3356552f7358SJed Brown t.edgesout = 1; 3357552f7358SJed Brown t.zeroindex = 1; 3358552f7358SJed Brown t.quiet = 1; 3359552f7358SJed Brown t.verbose = verbose; 3360552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3361552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3362552f7358SJed Brown } 3363552f7358SJed Brown { 3364552f7358SJed Brown const PetscInt numCorners = 4; 3365552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3366552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3367552f7358SJed Brown const double *meshCoords = out->pointlist; 33681d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3369552f7358SJed Brown 33709db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33710fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3372552f7358SJed Brown /* Set labels */ 3373552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3374552f7358SJed Brown if (out->pointmarkerlist[v]) { 3375552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3376552f7358SJed Brown } 3377552f7358SJed Brown } 3378552f7358SJed Brown if (interpolate) { 3379552f7358SJed Brown PetscInt e; 3380552f7358SJed Brown 3381552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3382552f7358SJed Brown if (out->edgemarkerlist[e]) { 3383552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3384552f7358SJed Brown const PetscInt *edges; 3385552f7358SJed Brown PetscInt numEdges; 3386552f7358SJed Brown 3387552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3388552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3389552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3390552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3391552f7358SJed Brown } 3392552f7358SJed Brown } 3393552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3394552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3395552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3396552f7358SJed Brown const PetscInt *faces; 3397552f7358SJed Brown PetscInt numFaces; 3398552f7358SJed Brown 3399552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3400552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3401552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3402552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3403552f7358SJed Brown } 3404552f7358SJed Brown } 3405552f7358SJed Brown } 3406552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3407552f7358SJed Brown } 3408552f7358SJed Brown 3409552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3410552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3411552f7358SJed Brown PetscFunctionReturn(0); 3412552f7358SJed Brown } 3413552f7358SJed Brown 3414552f7358SJed Brown #undef __FUNCT__ 3415552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3416552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3417552f7358SJed Brown { 341882f516ccSBarry Smith MPI_Comm comm; 3419552f7358SJed Brown const PetscInt dim = 3; 3420552f7358SJed Brown PLC *in, *out; 3421552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3422552f7358SJed Brown PetscMPIInt rank; 3423552f7358SJed Brown PetscErrorCode ierr; 3424552f7358SJed Brown 3425552f7358SJed Brown PetscFunctionBegin; 342682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34270298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3428552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3429552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3430552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3431552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3432552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3433552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34340d644c17SKarl Rupp 3435552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3436552f7358SJed Brown if (in->numberofpoints > 0) { 3437552f7358SJed Brown PetscSection coordSection; 3438552f7358SJed Brown Vec coordinates; 3439552f7358SJed Brown PetscScalar *array; 3440552f7358SJed Brown 3441785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3442785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3443552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 344469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3445552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3446552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3447552f7358SJed Brown const PetscInt idx = v - vStart; 3448552f7358SJed Brown PetscInt off, d, m; 3449552f7358SJed Brown 3450552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3451552f7358SJed Brown for (d = 0; d < dim; ++d) { 3452552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3453552f7358SJed Brown } 3454552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34550d644c17SKarl Rupp 3456552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3457552f7358SJed Brown } 3458552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3459552f7358SJed Brown } 3460552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34610d644c17SKarl Rupp 3462552f7358SJed Brown in->numberofcorners = 4; 3463552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3464552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3465552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3466785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3467552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3468552f7358SJed Brown const PetscInt idx = c - cStart; 34690298fd71SBarry Smith PetscInt *closure = NULL; 3470552f7358SJed Brown PetscInt closureSize; 3471552f7358SJed Brown 3472552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3473552f7358SJed 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); 3474552f7358SJed Brown for (v = 0; v < 4; ++v) { 3475552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3476552f7358SJed Brown } 3477552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3478552f7358SJed Brown } 3479552f7358SJed Brown } 3480552f7358SJed Brown if (!rank) { 3481552f7358SJed Brown TetGenOpts t; 3482552f7358SJed Brown 3483552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 34840d644c17SKarl Rupp 3485552f7358SJed Brown t.in = dm; /* Should go away */ 3486552f7358SJed Brown t.refine = 1; 3487552f7358SJed Brown t.varvolume = 1; 3488552f7358SJed Brown t.quality = 1; 3489552f7358SJed Brown t.edgesout = 1; 3490552f7358SJed Brown t.zeroindex = 1; 3491552f7358SJed Brown t.quiet = 1; 3492552f7358SJed Brown t.verbose = verbose; /* Change this */ 34930d644c17SKarl Rupp 3494552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3495552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3496552f7358SJed Brown } 3497552f7358SJed Brown { 3498552f7358SJed Brown const PetscInt numCorners = 4; 3499552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3500552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3501552f7358SJed Brown const double *meshCoords = out->pointlist; 35021d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3503552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3504552f7358SJed Brown 35059db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35060fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3507552f7358SJed Brown /* Set labels */ 3508552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3509552f7358SJed Brown if (out->pointmarkerlist[v]) { 3510552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3511552f7358SJed Brown } 3512552f7358SJed Brown } 3513552f7358SJed Brown if (interpolate) { 3514552f7358SJed Brown PetscInt e, f; 3515552f7358SJed Brown 3516552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3517552f7358SJed Brown if (out->edgemarkerlist[e]) { 3518552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3519552f7358SJed Brown const PetscInt *edges; 3520552f7358SJed Brown PetscInt numEdges; 3521552f7358SJed Brown 3522552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3523552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3524552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3525552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3526552f7358SJed Brown } 3527552f7358SJed Brown } 3528552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3529552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3530552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3531552f7358SJed Brown const PetscInt *faces; 3532552f7358SJed Brown PetscInt numFaces; 3533552f7358SJed Brown 3534552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3535552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3536552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3537552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3538552f7358SJed Brown } 3539552f7358SJed Brown } 3540552f7358SJed Brown } 3541552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3542552f7358SJed Brown } 3543552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3544552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3545552f7358SJed Brown PetscFunctionReturn(0); 3546552f7358SJed Brown } 3547552f7358SJed Brown #endif 3548552f7358SJed Brown 3549552f7358SJed Brown #undef __FUNCT__ 3550552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3551552f7358SJed Brown /*@C 3552552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3553552f7358SJed Brown 3554552f7358SJed Brown Not Collective 3555552f7358SJed Brown 3556552f7358SJed Brown Input Parameters: 3557552f7358SJed Brown + boundary - The DMPlex boundary object 3558552f7358SJed Brown . name - The mesh generation package name 3559552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3560552f7358SJed Brown 3561552f7358SJed Brown Output Parameter: 3562552f7358SJed Brown . mesh - The DMPlex object 3563552f7358SJed Brown 3564552f7358SJed Brown Level: intermediate 3565552f7358SJed Brown 3566552f7358SJed Brown .keywords: mesh, elements 3567552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3568552f7358SJed Brown @*/ 3569552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3570552f7358SJed Brown { 3571552f7358SJed Brown PetscInt dim; 3572552f7358SJed Brown char genname[1024]; 3573552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3574552f7358SJed Brown PetscErrorCode ierr; 3575552f7358SJed Brown 3576552f7358SJed Brown PetscFunctionBegin; 3577552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3578552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3579552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 3580552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 35810d644c17SKarl Rupp if (flg) name = genname; 3582552f7358SJed Brown if (name) { 3583552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3584552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3585552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3586552f7358SJed Brown } 3587552f7358SJed Brown switch (dim) { 3588552f7358SJed Brown case 1: 3589552f7358SJed Brown if (!name || isTriangle) { 3590519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3591552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3592552f7358SJed Brown #else 359382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3594552f7358SJed Brown #endif 359582f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3596552f7358SJed Brown break; 3597552f7358SJed Brown case 2: 3598552f7358SJed Brown if (!name || isCTetgen) { 3599519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3600552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3601552f7358SJed Brown #else 360282f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3603552f7358SJed Brown #endif 3604552f7358SJed Brown } else if (isTetgen) { 3605519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3606552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3607552f7358SJed Brown #else 360882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3609552f7358SJed Brown #endif 361082f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3611552f7358SJed Brown break; 3612552f7358SJed Brown default: 361382f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3614552f7358SJed Brown } 3615552f7358SJed Brown PetscFunctionReturn(0); 3616552f7358SJed Brown } 3617552f7358SJed Brown 3618552f7358SJed Brown #undef __FUNCT__ 3619552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3620552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3621552f7358SJed Brown { 3622552f7358SJed Brown PetscReal refinementLimit; 3623552f7358SJed Brown PetscInt dim, cStart, cEnd; 36240298fd71SBarry Smith char genname[1024], *name = NULL; 3625552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3626552f7358SJed Brown PetscErrorCode ierr; 3627552f7358SJed Brown 3628552f7358SJed Brown PetscFunctionBegin; 3629552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3630552f7358SJed Brown if (isUniform) { 3631552f7358SJed Brown CellRefiner cellRefiner; 3632552f7358SJed Brown 3633509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3634509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 3635552f7358SJed Brown PetscFunctionReturn(0); 3636552f7358SJed Brown } 3637552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3638552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3639552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3640552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3641552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36420d644c17SKarl Rupp if (flg) name = genname; 3643552f7358SJed Brown if (name) { 3644552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3645552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3646552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3647552f7358SJed Brown } 3648552f7358SJed Brown switch (dim) { 3649552f7358SJed Brown case 2: 3650552f7358SJed Brown if (!name || isTriangle) { 3651519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3652552f7358SJed Brown double *maxVolumes; 3653552f7358SJed Brown PetscInt c; 3654552f7358SJed Brown 3655785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36560d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3657552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36586b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3659552f7358SJed Brown #else 366082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3661552f7358SJed Brown #endif 366282f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3663552f7358SJed Brown break; 3664552f7358SJed Brown case 3: 3665552f7358SJed Brown if (!name || isCTetgen) { 3666519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3667552f7358SJed Brown PetscReal *maxVolumes; 3668552f7358SJed Brown PetscInt c; 3669552f7358SJed Brown 3670785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36710d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3672552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3673552f7358SJed Brown #else 367482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3675552f7358SJed Brown #endif 3676552f7358SJed Brown } else if (isTetgen) { 3677519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3678552f7358SJed Brown double *maxVolumes; 3679552f7358SJed Brown PetscInt c; 3680552f7358SJed Brown 3681785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36820d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3683552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3684552f7358SJed Brown #else 368582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3686552f7358SJed Brown #endif 368782f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3688552f7358SJed Brown break; 3689552f7358SJed Brown default: 369082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3691552f7358SJed Brown } 3692552f7358SJed Brown PetscFunctionReturn(0); 3693552f7358SJed Brown } 3694552f7358SJed Brown 3695552f7358SJed Brown #undef __FUNCT__ 36960a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 36970a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 36980a6ba040SMatthew G. Knepley { 36990a6ba040SMatthew G. Knepley DM cdm = dm; 37000a6ba040SMatthew G. Knepley PetscInt r; 37010a6ba040SMatthew G. Knepley PetscBool isUniform; 37020a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37030a6ba040SMatthew G. Knepley 37040a6ba040SMatthew G. Knepley PetscFunctionBegin; 37050a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37060a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37070a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37080a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37090a6ba040SMatthew G. Knepley 37100a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37110a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37120a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37130a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37140a6ba040SMatthew G. Knepley } 37150a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37160a6ba040SMatthew G. Knepley } 37170a6ba040SMatthew G. Knepley 37180a6ba040SMatthew G. Knepley #undef __FUNCT__ 37190a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37200a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37210a6ba040SMatthew G. Knepley { 37220a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3723549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37240a6ba040SMatthew G. Knepley 37250a6ba040SMatthew G. Knepley PetscFunctionBegin; 3726549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37270a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37280a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37290a6ba040SMatthew G. Knepley } 37300a6ba040SMatthew G. Knepley 37310a6ba040SMatthew G. Knepley #undef __FUNCT__ 3732d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3733d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3734d49fcaecSMatthew G. Knepley { 3735d49fcaecSMatthew G. Knepley PetscInt d; 3736d49fcaecSMatthew G. Knepley 3737d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3738d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3739d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3740d49fcaecSMatthew G. Knepley } else { 3741d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3742d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3743858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3744d49fcaecSMatthew G. Knepley } else { 3745d49fcaecSMatthew G. Knepley out[d] = in[d]; 3746d49fcaecSMatthew G. Knepley } 3747d49fcaecSMatthew G. Knepley } 3748d49fcaecSMatthew G. Knepley } 3749d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3750d49fcaecSMatthew G. Knepley } 3751d49fcaecSMatthew G. Knepley 3752d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3753d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3754d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3755d49fcaecSMatthew G. Knepley { 3756d49fcaecSMatthew G. Knepley PetscInt d; 3757d49fcaecSMatthew G. Knepley 3758d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3759d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3760d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3761d49fcaecSMatthew G. Knepley } else { 3762d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3763d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3764858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3765d49fcaecSMatthew G. Knepley } else { 3766d49fcaecSMatthew G. Knepley out[d] += in[d]; 3767d49fcaecSMatthew G. Knepley } 3768d49fcaecSMatthew G. Knepley } 3769d49fcaecSMatthew G. Knepley } 3770d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3771d49fcaecSMatthew G. Knepley } 3772d49fcaecSMatthew G. Knepley 3773d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3774d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3775d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3776d49fcaecSMatthew G. Knepley { 3777d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3778d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3779d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 3780d49fcaecSMatthew G. Knepley PetscInt cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3781d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3782d49fcaecSMatthew G. Knepley 3783d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3784d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3785d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3786d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3787d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3788d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3789d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3790d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 3791d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3792d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3793d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3794d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 3795d49fcaecSMatthew G. Knepley } 3796d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3797d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3798d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 3799d49fcaecSMatthew G. Knepley } 3800d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3801d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3802d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3803d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3804d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3805d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3806d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3807d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3808d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3809d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3810d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3811d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3812d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3813d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3814d49fcaecSMatthew G. Knepley } 3815d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3816d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3817d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3818d49fcaecSMatthew G. Knepley PetscInt b; 3819d49fcaecSMatthew G. Knepley 3820d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3821d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3822d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3823d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3824d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3825d49fcaecSMatthew G. Knepley } 3826d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3827d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3828d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 3829d49fcaecSMatthew G. Knepley ierr = DMSetCoordinateSection(dm, cSection);CHKERRQ(ierr); 3830d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3831d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3832d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3833d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3834d49fcaecSMatthew G. Knepley } 3835d49fcaecSMatthew G. Knepley 3836d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3837aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3838552f7358SJed Brown /*@ 3839aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3840552f7358SJed Brown 3841552f7358SJed Brown Not Collective 3842552f7358SJed Brown 3843aa50250dSMatthew G. Knepley Input Parameter: 3844552f7358SJed Brown . dm - The DMPlex object 3845552f7358SJed Brown 3846aa50250dSMatthew G. Knepley Output Parameter: 3847aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3848552f7358SJed Brown 3849552f7358SJed Brown Level: developer 3850552f7358SJed Brown 3851aa50250dSMatthew G. Knepley .keywords: mesh, points 3852aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3853aa50250dSMatthew G. Knepley @*/ 3854aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3855aa50250dSMatthew G. Knepley { 3856aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3857aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3858aa50250dSMatthew G. Knepley 3859aa50250dSMatthew G. Knepley PetscFunctionBegin; 3860aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3861aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 386263d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3863aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3864aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3865aa50250dSMatthew G. Knepley } 3866aa50250dSMatthew G. Knepley 3867aa50250dSMatthew G. Knepley #undef __FUNCT__ 3868aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3869aa50250dSMatthew G. Knepley /*@ 3870aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3871aa50250dSMatthew G. Knepley 3872aa50250dSMatthew G. Knepley Not Collective 3873aa50250dSMatthew G. Knepley 3874aa50250dSMatthew G. Knepley Input Parameter: 3875aa50250dSMatthew G. Knepley . dm - The DMPlex object 3876aa50250dSMatthew G. Knepley 3877aa50250dSMatthew G. Knepley Output Parameter: 3878aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3879aa50250dSMatthew G. Knepley 3880aa50250dSMatthew G. Knepley Level: developer 3881552f7358SJed Brown 3882552f7358SJed Brown .keywords: mesh, points 3883aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3884552f7358SJed Brown @*/ 3885552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3886552f7358SJed Brown { 3887aa50250dSMatthew G. Knepley DMLabel label; 3888aa50250dSMatthew G. Knepley PetscInt d = 0; 3889552f7358SJed Brown PetscErrorCode ierr; 3890552f7358SJed Brown 3891552f7358SJed Brown PetscFunctionBegin; 3892552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3893552f7358SJed Brown PetscValidPointer(depth, 2); 3894aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3895aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3896552f7358SJed Brown *depth = d-1; 3897552f7358SJed Brown PetscFunctionReturn(0); 3898552f7358SJed Brown } 3899552f7358SJed Brown 3900552f7358SJed Brown #undef __FUNCT__ 3901552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3902552f7358SJed Brown /*@ 3903552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3904552f7358SJed Brown 3905552f7358SJed Brown Not Collective 3906552f7358SJed Brown 3907552f7358SJed Brown Input Parameters: 3908552f7358SJed Brown + dm - The DMPlex object 3909552f7358SJed Brown - stratumValue - The requested depth 3910552f7358SJed Brown 3911552f7358SJed Brown Output Parameters: 3912552f7358SJed Brown + start - The first point at this depth 3913552f7358SJed Brown - end - One beyond the last point at this depth 3914552f7358SJed Brown 3915552f7358SJed Brown Level: developer 3916552f7358SJed Brown 3917552f7358SJed Brown .keywords: mesh, points 3918552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3919552f7358SJed Brown @*/ 39200adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39210adebc6cSBarry Smith { 3922aa50250dSMatthew G. Knepley DMLabel label; 392363d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3924552f7358SJed Brown PetscErrorCode ierr; 3925552f7358SJed Brown 3926552f7358SJed Brown PetscFunctionBegin; 3927552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 392863d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 392963d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3930552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39310d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 393263d1a920SMatthew G. Knepley if (stratumValue < 0) { 393363d1a920SMatthew G. Knepley if (start) *start = pStart; 393463d1a920SMatthew G. Knepley if (end) *end = pEnd; 393563d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3936552f7358SJed Brown } 3937aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 393863d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 393963d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3940552f7358SJed Brown PetscFunctionReturn(0); 3941552f7358SJed Brown } 3942552f7358SJed Brown 3943552f7358SJed Brown #undef __FUNCT__ 3944552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3945552f7358SJed Brown /*@ 3946552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3947552f7358SJed Brown 3948552f7358SJed Brown Not Collective 3949552f7358SJed Brown 3950552f7358SJed Brown Input Parameters: 3951552f7358SJed Brown + dm - The DMPlex object 3952552f7358SJed Brown - stratumValue - The requested height 3953552f7358SJed Brown 3954552f7358SJed Brown Output Parameters: 3955552f7358SJed Brown + start - The first point at this height 3956552f7358SJed Brown - end - One beyond the last point at this height 3957552f7358SJed Brown 3958552f7358SJed Brown Level: developer 3959552f7358SJed Brown 3960552f7358SJed Brown .keywords: mesh, points 3961552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3962552f7358SJed Brown @*/ 39630adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39640adebc6cSBarry Smith { 3965aa50250dSMatthew G. Knepley DMLabel label; 396663d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 3967552f7358SJed Brown PetscErrorCode ierr; 3968552f7358SJed Brown 3969552f7358SJed Brown PetscFunctionBegin; 3970552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 397163d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 397263d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3973552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39740d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 397563d1a920SMatthew G. Knepley if (stratumValue < 0) { 397663d1a920SMatthew G. Knepley if (start) *start = pStart; 397763d1a920SMatthew G. Knepley if (end) *end = pEnd; 397863d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3979552f7358SJed Brown } 3980aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3981aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 398263d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 398363d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 3984552f7358SJed Brown PetscFunctionReturn(0); 3985552f7358SJed Brown } 3986552f7358SJed Brown 3987552f7358SJed Brown #undef __FUNCT__ 3988552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 3989552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 3990a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 3991a6dfd86eSKarl Rupp { 3992552f7358SJed Brown PetscInt *numDofTot; 3993916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 3994916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 3995552f7358SJed Brown PetscErrorCode ierr; 3996552f7358SJed Brown 3997552f7358SJed Brown PetscFunctionBegin; 3998785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 3999552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4000552f7358SJed Brown numDofTot[d] = 0; 40010d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4002552f7358SJed Brown } 400382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4004552f7358SJed Brown if (numFields > 0) { 4005552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4006552f7358SJed Brown if (numComp) { 4007552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4008552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4009552f7358SJed Brown } 4010552f7358SJed Brown } 4011552f7358SJed Brown } 4012552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4013552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4014916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4015916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4016916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4017916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4018552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4019552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4020552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4021552f7358SJed Brown } 4022552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4023552f7358SJed Brown } 4024552f7358SJed Brown } 4025552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4026552f7358SJed Brown PetscFunctionReturn(0); 4027552f7358SJed Brown } 4028552f7358SJed Brown 4029552f7358SJed Brown #undef __FUNCT__ 4030552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4031552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4032552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4033552f7358SJed Brown */ 4034a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4035a6dfd86eSKarl Rupp { 4036552f7358SJed Brown PetscInt numFields; 4037552f7358SJed Brown PetscInt bc; 4038552f7358SJed Brown PetscErrorCode ierr; 4039552f7358SJed Brown 4040552f7358SJed Brown PetscFunctionBegin; 4041552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4042552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4043552f7358SJed Brown PetscInt field = 0; 4044552f7358SJed Brown const PetscInt *idx; 4045552f7358SJed Brown PetscInt n, i; 4046552f7358SJed Brown 40470d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4048552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4049552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4050552f7358SJed Brown for (i = 0; i < n; ++i) { 4051552f7358SJed Brown const PetscInt p = idx[i]; 4052552f7358SJed Brown PetscInt numConst = constDof; 4053552f7358SJed Brown 4054552f7358SJed Brown /* Constrain every dof on the point */ 4055552f7358SJed Brown if (numConst < 0) { 4056552f7358SJed Brown if (numFields) { 4057552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4058552f7358SJed Brown } else { 4059552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4060552f7358SJed Brown } 4061552f7358SJed Brown } 4062552f7358SJed Brown if (numFields) { 4063552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4064552f7358SJed Brown } 4065552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4066552f7358SJed Brown } 4067552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4068552f7358SJed Brown } 4069552f7358SJed Brown PetscFunctionReturn(0); 4070552f7358SJed Brown } 4071552f7358SJed Brown 4072552f7358SJed Brown #undef __FUNCT__ 4073552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4074552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 40750adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 40760adebc6cSBarry Smith { 4077552f7358SJed Brown PetscInt *maxConstraints; 4078552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4079552f7358SJed Brown PetscErrorCode ierr; 4080552f7358SJed Brown 4081552f7358SJed Brown PetscFunctionBegin; 4082552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4083552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4084785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 40850d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4086552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4087552f7358SJed Brown PetscInt cdof; 4088552f7358SJed Brown 4089552f7358SJed Brown if (numFields) { 4090552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4091552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4092552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4093552f7358SJed Brown } 4094552f7358SJed Brown } else { 4095552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4096552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4097552f7358SJed Brown } 4098552f7358SJed Brown } 4099552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4100552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4101552f7358SJed Brown } 4102552f7358SJed Brown if (maxConstraints[numFields]) { 4103552f7358SJed Brown PetscInt *indices; 4104552f7358SJed Brown 4105785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4106552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4107552f7358SJed Brown PetscInt cdof, d; 4108552f7358SJed Brown 4109552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4110552f7358SJed Brown if (cdof) { 4111552f7358SJed 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]); 4112552f7358SJed Brown if (numFields) { 4113552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4114552f7358SJed Brown 4115552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4116552f7358SJed Brown PetscInt cfdof, fdof; 4117552f7358SJed Brown 4118552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4119552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4120552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41210d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4122552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41230d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4124552f7358SJed Brown numConst += cfdof; 4125552f7358SJed Brown foff += fdof; 4126552f7358SJed Brown } 4127552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4128552f7358SJed Brown } else { 41290d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4130552f7358SJed Brown } 4131552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4132552f7358SJed Brown } 4133552f7358SJed Brown } 4134552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4135552f7358SJed Brown } 4136552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4137552f7358SJed Brown PetscFunctionReturn(0); 4138552f7358SJed Brown } 4139552f7358SJed Brown 4140552f7358SJed Brown #undef __FUNCT__ 4141552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4142552f7358SJed Brown /* Set the constrained field indices on each point */ 41430adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 41440adebc6cSBarry Smith { 4145552f7358SJed Brown const PetscInt *points, *indices; 4146552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4147552f7358SJed Brown PetscErrorCode ierr; 4148552f7358SJed Brown 4149552f7358SJed Brown PetscFunctionBegin; 4150552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4151552f7358SJed 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); 4152552f7358SJed Brown 4153552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4154552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4155552f7358SJed Brown if (!constraintIndices) { 4156552f7358SJed Brown PetscInt *idx, i; 4157552f7358SJed Brown 4158552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4159785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 41600d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4161552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4162552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4163552f7358SJed Brown } 4164552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4165552f7358SJed Brown } else { 4166552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4167552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4168552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4169552f7358SJed Brown PetscInt fcdof; 4170552f7358SJed Brown 4171552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 417282f516ccSBarry 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); 4173552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4174552f7358SJed Brown } 4175552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4176552f7358SJed Brown } 4177552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4178552f7358SJed Brown PetscFunctionReturn(0); 4179552f7358SJed Brown } 4180552f7358SJed Brown 4181552f7358SJed Brown #undef __FUNCT__ 4182552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4183552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41840adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 41850adebc6cSBarry Smith { 4186552f7358SJed Brown PetscInt *indices; 4187552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4188552f7358SJed Brown PetscErrorCode ierr; 4189552f7358SJed Brown 4190552f7358SJed Brown PetscFunctionBegin; 4191552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4192785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4193552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 419482f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4195552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4196552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4197552f7358SJed Brown PetscInt cdof, d; 4198552f7358SJed Brown 4199552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4200552f7358SJed Brown if (cdof) { 4201552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4202552f7358SJed Brown 4203552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4204552f7358SJed Brown const PetscInt *fcind; 4205552f7358SJed Brown PetscInt fdof, fcdof; 4206552f7358SJed Brown 4207552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4208552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4209552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4210552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42110d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4212552f7358SJed Brown foff += fdof; 4213552f7358SJed Brown numConst += fcdof; 4214552f7358SJed Brown } 421582f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4216552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4217552f7358SJed Brown } 4218552f7358SJed Brown } 4219552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4220552f7358SJed Brown PetscFunctionReturn(0); 4221552f7358SJed Brown } 4222552f7358SJed Brown 4223552f7358SJed Brown #undef __FUNCT__ 4224552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4225552f7358SJed Brown /*@C 4226552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4227552f7358SJed Brown 4228552f7358SJed Brown Not Collective 4229552f7358SJed Brown 4230552f7358SJed Brown Input Parameters: 4231552f7358SJed Brown + dm - The DMPlex object 4232552f7358SJed Brown . dim - The spatial dimension of the problem 4233552f7358SJed Brown . numFields - The number of fields in the problem 4234552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4235552f7358SJed 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 4236552f7358SJed Brown . numBC - The number of boundary conditions 4237552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4238f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4239f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4240552f7358SJed Brown 4241552f7358SJed Brown Output Parameter: 4242552f7358SJed Brown . section - The PetscSection object 4243552f7358SJed Brown 4244552f7358SJed 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 4245f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4246f8f126e8SMatthew G. Knepley 4247f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4248552f7358SJed Brown 4249552f7358SJed Brown Level: developer 4250552f7358SJed Brown 42513813dfbdSMatthew G Knepley Fortran Notes: 42523813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 42533813dfbdSMatthew G Knepley 4254552f7358SJed Brown .keywords: mesh, elements 4255f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4256552f7358SJed Brown @*/ 4257f8f126e8SMatthew G. Knepley PetscErrorCode DMPlexCreateSection(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], IS perm, PetscSection *section) 4258a6dfd86eSKarl Rupp { 4259552f7358SJed Brown PetscErrorCode ierr; 4260552f7358SJed Brown 4261552f7358SJed Brown PetscFunctionBegin; 4262552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4263552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4264f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4265552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4266552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4267ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4268552f7358SJed Brown PetscFunctionReturn(0); 4269552f7358SJed Brown } 4270552f7358SJed Brown 4271552f7358SJed Brown #undef __FUNCT__ 4272552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 42730adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 42740adebc6cSBarry Smith { 4275552f7358SJed Brown PetscSection section; 4276552f7358SJed Brown PetscErrorCode ierr; 4277552f7358SJed Brown 4278552f7358SJed Brown PetscFunctionBegin; 427938221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 428082f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4281552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 42821d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4283552f7358SJed Brown PetscFunctionReturn(0); 4284552f7358SJed Brown } 4285552f7358SJed Brown 4286552f7358SJed Brown #undef __FUNCT__ 4287552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 42880adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 42890adebc6cSBarry Smith { 4290552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4291552f7358SJed Brown 4292552f7358SJed Brown PetscFunctionBegin; 4293552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4294552f7358SJed Brown if (section) *section = mesh->coneSection; 4295552f7358SJed Brown PetscFunctionReturn(0); 4296552f7358SJed Brown } 4297552f7358SJed Brown 4298552f7358SJed Brown #undef __FUNCT__ 42998cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43008cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43018cb4d582SMatthew G. Knepley { 43028cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43038cb4d582SMatthew G. Knepley 43048cb4d582SMatthew G. Knepley PetscFunctionBegin; 43058cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43068cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43078cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43088cb4d582SMatthew G. Knepley } 43098cb4d582SMatthew G. Knepley 43108cb4d582SMatthew G. Knepley #undef __FUNCT__ 4311552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4312a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4313a6dfd86eSKarl Rupp { 4314552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4315552f7358SJed Brown 4316552f7358SJed Brown PetscFunctionBegin; 4317552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4318552f7358SJed Brown if (cones) *cones = mesh->cones; 4319552f7358SJed Brown PetscFunctionReturn(0); 4320552f7358SJed Brown } 4321552f7358SJed Brown 4322552f7358SJed Brown #undef __FUNCT__ 4323552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4324a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4325a6dfd86eSKarl Rupp { 4326552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4327552f7358SJed Brown 4328552f7358SJed Brown PetscFunctionBegin; 4329552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4330552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4331552f7358SJed Brown PetscFunctionReturn(0); 4332552f7358SJed Brown } 4333552f7358SJed Brown 4334552f7358SJed Brown /******************************** FEM Support **********************************/ 4335552f7358SJed Brown 4336552f7358SJed Brown #undef __FUNCT__ 43371a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 43381a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4339a6dfd86eSKarl Rupp { 4340552f7358SJed Brown PetscScalar *array, *vArray; 4341d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 43421a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4343552f7358SJed Brown PetscErrorCode ierr; 4344552f7358SJed Brown 43451b406b76SMatthew G. Knepley PetscFunctionBeginHot; 43462a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 43475a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 43485a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 43495a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 43503f7cbbe7SMatthew G. Knepley if (!values || !*values) { 43519df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43529df71ca4SMatthew G. Knepley PetscInt dof; 4353d9917b9dSMatthew G. Knepley 43549df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43559df71ca4SMatthew G. Knepley size += dof; 43569df71ca4SMatthew G. Knepley } 43579df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 43589df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 43592a3aaacfSMatthew G. Knepley PetscInt dof; 43605a1bb5cfSMatthew G. Knepley 43615a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 43622a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 43635a1bb5cfSMatthew G. Knepley size += dof; 43645a1bb5cfSMatthew G. Knepley } 43653f7cbbe7SMatthew G. Knepley if (!values) { 43663f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 43673f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 43683f7cbbe7SMatthew G. Knepley } 43695a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4370982e9ed1SMatthew G. Knepley } else { 4371982e9ed1SMatthew G. Knepley array = *values; 4372982e9ed1SMatthew G. Knepley } 43739df71ca4SMatthew G. Knepley size = 0; 43745a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 43759df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43769df71ca4SMatthew G. Knepley PetscInt dof, off, d; 43779df71ca4SMatthew G. Knepley PetscScalar *varr; 4378d9917b9dSMatthew G. Knepley 43799df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43809df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 43819df71ca4SMatthew G. Knepley varr = &vArray[off]; 43821a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 43831a271a75SMatthew G. Knepley array[offset] = varr[d]; 43849df71ca4SMatthew G. Knepley } 43859df71ca4SMatthew G. Knepley size += dof; 43869df71ca4SMatthew G. Knepley } 43879df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 43889df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 43899df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 43905a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 43915a1bb5cfSMatthew G. Knepley PetscScalar *varr; 43925a1bb5cfSMatthew G. Knepley 439352ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 43945a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 43955a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 43965a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 43975a1bb5cfSMatthew G. Knepley if (o >= 0) { 43981a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 43991a271a75SMatthew G. Knepley array[offset] = varr[d]; 44005a1bb5cfSMatthew G. Knepley } 44015a1bb5cfSMatthew G. Knepley } else { 44021a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44031a271a75SMatthew G. Knepley array[offset] = varr[d]; 44045a1bb5cfSMatthew G. Knepley } 44055a1bb5cfSMatthew G. Knepley } 44069df71ca4SMatthew G. Knepley size += dof; 44075a1bb5cfSMatthew G. Knepley } 44085a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44099df71ca4SMatthew G. Knepley if (!*values) { 44105a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44115a1bb5cfSMatthew G. Knepley *values = array; 44129df71ca4SMatthew G. Knepley } else { 44139df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44148c312ff3SMatthew G. Knepley *csize = size; 44159df71ca4SMatthew G. Knepley } 44165a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44175a1bb5cfSMatthew G. Knepley } 4418d9917b9dSMatthew G. Knepley 4419d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44201a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44211a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44221a271a75SMatthew G. Knepley { 44231a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44241a271a75SMatthew G. Knepley PetscErrorCode ierr; 44251a271a75SMatthew G. Knepley 44261a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4427fe02ba77SJed Brown *size = 0; 44281a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44291a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44301a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44311a271a75SMatthew G. Knepley PetscInt dof, off, d; 44321a271a75SMatthew G. Knepley const PetscScalar *varr; 44331a271a75SMatthew G. Knepley 44341a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44351a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44361a271a75SMatthew G. Knepley varr = &vArray[off]; 44371a271a75SMatthew G. Knepley if (o >= 0) { 44381a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 44391a271a75SMatthew G. Knepley } else { 44401a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 44411a271a75SMatthew G. Knepley } 44421a271a75SMatthew G. Knepley } 44431a271a75SMatthew G. Knepley *size = offset; 44441a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44451a271a75SMatthew G. Knepley } 44461a271a75SMatthew G. Knepley 44471a271a75SMatthew G. Knepley #undef __FUNCT__ 44481a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 44491a271a75SMatthew 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[]) 44501a271a75SMatthew G. Knepley { 44511a271a75SMatthew G. Knepley PetscInt offset = 0, f; 44521a271a75SMatthew G. Knepley PetscErrorCode ierr; 44531a271a75SMatthew G. Knepley 44541a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4455fe02ba77SJed Brown *size = 0; 44561a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 44571a271a75SMatthew G. Knepley PetscInt fcomp, p; 44581a271a75SMatthew G. Knepley 44591a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 44601a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44611a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44621a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44631a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 44641a271a75SMatthew G. Knepley const PetscScalar *varr; 44651a271a75SMatthew G. Knepley 44661a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 44671a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 44681a271a75SMatthew G. Knepley varr = &vArray[foff]; 44691a271a75SMatthew G. Knepley if (o >= 0) { 44701a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 44711a271a75SMatthew G. Knepley } else { 44721a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 44731a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 44741a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 44751a271a75SMatthew G. Knepley } 44761a271a75SMatthew G. Knepley } 44771a271a75SMatthew G. Knepley } 44781a271a75SMatthew G. Knepley } 44791a271a75SMatthew G. Knepley } 44801a271a75SMatthew G. Knepley *size = offset; 44811a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44821a271a75SMatthew G. Knepley } 44831a271a75SMatthew G. Knepley 44841a271a75SMatthew G. Knepley #undef __FUNCT__ 4485552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4486552f7358SJed Brown /*@C 4487552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4488552f7358SJed Brown 4489552f7358SJed Brown Not collective 4490552f7358SJed Brown 4491552f7358SJed Brown Input Parameters: 4492552f7358SJed Brown + dm - The DM 4493552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4494552f7358SJed Brown . v - The local vector 4495552f7358SJed Brown - point - The sieve point in the DM 4496552f7358SJed Brown 4497552f7358SJed Brown Output Parameters: 4498552f7358SJed Brown + csize - The number of values in the closure, or NULL 4499552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4500552f7358SJed Brown 4501552f7358SJed Brown Fortran Notes: 4502552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4503552f7358SJed Brown include petsc.h90 in your code. 4504552f7358SJed Brown 4505552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4506552f7358SJed Brown 4507552f7358SJed Brown Level: intermediate 4508552f7358SJed Brown 4509552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4510552f7358SJed Brown @*/ 4511552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4512552f7358SJed Brown { 4513552f7358SJed Brown PetscSection clSection; 4514d9917b9dSMatthew G. Knepley IS clPoints; 4515552f7358SJed Brown PetscScalar *array, *vArray; 4516552f7358SJed Brown PetscInt *points = NULL; 4517d9917b9dSMatthew G. Knepley const PetscInt *clp; 45181a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4519552f7358SJed Brown PetscErrorCode ierr; 4520552f7358SJed Brown 4521d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4522552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4523552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45241a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45251a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4526552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4527552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4528552f7358SJed Brown if (depth == 1 && numFields < 2) { 45291a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4530552f7358SJed Brown PetscFunctionReturn(0); 4531552f7358SJed Brown } 45321a271a75SMatthew G. Knepley /* Get points */ 4533d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4534d9917b9dSMatthew G. Knepley if (!clPoints) { 45351a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4536552f7358SJed Brown 45371a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4538552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4539552f7358SJed Brown /* Compress out points not in the section */ 4540552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4541552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4542552f7358SJed Brown points[q*2] = points[p]; 4543552f7358SJed Brown points[q*2+1] = points[p+1]; 4544552f7358SJed Brown ++q; 4545552f7358SJed Brown } 4546552f7358SJed Brown } 4547552f7358SJed Brown numPoints = q; 4548d9917b9dSMatthew G. Knepley } else { 4549d9917b9dSMatthew G. Knepley PetscInt dof, off; 4550552f7358SJed Brown 4551d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4552d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4553d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 45541a271a75SMatthew G. Knepley numPoints = dof/2; 4555d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4556552f7358SJed Brown } 45571a271a75SMatthew G. Knepley /* Get array */ 4558552f7358SJed Brown if (!values || !*values) { 45591a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4560552f7358SJed Brown 45611a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4562552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 45631a271a75SMatthew G. Knepley asize += dof; 4564552f7358SJed Brown } 4565bd6c0d32SMatthew G. Knepley if (!values) { 4566d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 45671a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 45681a271a75SMatthew G. Knepley if (csize) *csize = asize; 4569bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4570bd6c0d32SMatthew G. Knepley } 45711a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4572d0f6b257SMatthew G. Knepley } else { 4573d0f6b257SMatthew G. Knepley array = *values; 4574d0f6b257SMatthew G. Knepley } 4575552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 45761a271a75SMatthew G. Knepley /* Get values */ 4577ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 45781a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 45791a271a75SMatthew G. Knepley /* Cleanup points */ 45801a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 45811a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 45821a271a75SMatthew G. Knepley /* Cleanup array */ 4583552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4584d0f6b257SMatthew G. Knepley if (!*values) { 4585552f7358SJed Brown if (csize) *csize = size; 4586552f7358SJed Brown *values = array; 4587d0f6b257SMatthew G. Knepley } else { 4588d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4589d0f6b257SMatthew G. Knepley *csize = size; 4590d0f6b257SMatthew G. Knepley } 4591552f7358SJed Brown PetscFunctionReturn(0); 4592552f7358SJed Brown } 4593552f7358SJed Brown 4594552f7358SJed Brown #undef __FUNCT__ 4595552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4596552f7358SJed Brown /*@C 4597552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4598552f7358SJed Brown 4599552f7358SJed Brown Not collective 4600552f7358SJed Brown 4601552f7358SJed Brown Input Parameters: 4602552f7358SJed Brown + dm - The DM 46030298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4604552f7358SJed Brown . v - The local vector 4605552f7358SJed Brown . point - The sieve point in the DM 46060298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4607552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4608552f7358SJed Brown 46093813dfbdSMatthew G Knepley Fortran Notes: 46103813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46113813dfbdSMatthew G Knepley include petsc.h90 in your code. 46123813dfbdSMatthew G Knepley 46133813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46143813dfbdSMatthew G Knepley 4615552f7358SJed Brown Level: intermediate 4616552f7358SJed Brown 4617552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4618552f7358SJed Brown @*/ 46197c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4620a6dfd86eSKarl Rupp { 4621552f7358SJed Brown PetscInt size = 0; 4622552f7358SJed Brown PetscErrorCode ierr; 4623552f7358SJed Brown 4624552f7358SJed Brown PetscFunctionBegin; 4625552f7358SJed Brown /* Should work without recalculating size */ 4626552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4627552f7358SJed Brown PetscFunctionReturn(0); 4628552f7358SJed Brown } 4629552f7358SJed Brown 4630552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4631552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4632552f7358SJed Brown 4633552f7358SJed Brown #undef __FUNCT__ 4634552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 46351a271a75SMatthew 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[]) 4636552f7358SJed Brown { 4637552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4638552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4639552f7358SJed Brown PetscScalar *a; 4640552f7358SJed Brown PetscInt off, cind = 0, k; 4641552f7358SJed Brown PetscErrorCode ierr; 4642552f7358SJed Brown 4643552f7358SJed Brown PetscFunctionBegin; 4644552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4645552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4646552f7358SJed Brown a = &array[off]; 4647552f7358SJed Brown if (!cdof || setBC) { 4648552f7358SJed Brown if (orientation >= 0) { 4649552f7358SJed Brown for (k = 0; k < dof; ++k) { 4650552f7358SJed Brown fuse(&a[k], values[k]); 4651552f7358SJed Brown } 4652552f7358SJed Brown } else { 4653552f7358SJed Brown for (k = 0; k < dof; ++k) { 4654552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4655552f7358SJed Brown } 4656552f7358SJed Brown } 4657552f7358SJed Brown } else { 4658552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4659552f7358SJed Brown if (orientation >= 0) { 4660552f7358SJed Brown for (k = 0; k < dof; ++k) { 4661552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4662552f7358SJed Brown fuse(&a[k], values[k]); 4663552f7358SJed Brown } 4664552f7358SJed Brown } else { 4665552f7358SJed Brown for (k = 0; k < dof; ++k) { 4666552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4667552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4668552f7358SJed Brown } 4669552f7358SJed Brown } 4670552f7358SJed Brown } 4671552f7358SJed Brown PetscFunctionReturn(0); 4672552f7358SJed Brown } 4673552f7358SJed Brown 4674552f7358SJed Brown #undef __FUNCT__ 4675a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 46761a271a75SMatthew 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[]) 4677a5e93ea8SMatthew G. Knepley { 4678a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4679a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4680a5e93ea8SMatthew G. Knepley PetscScalar *a; 4681a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4682a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4683a5e93ea8SMatthew G. Knepley 4684a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4685a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4686a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4687a5e93ea8SMatthew G. Knepley a = &array[off]; 4688a5e93ea8SMatthew G. Knepley if (cdof) { 4689a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4690a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4691a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4692a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4693a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4694a5e93ea8SMatthew G. Knepley ++cind; 4695a5e93ea8SMatthew G. Knepley } 4696a5e93ea8SMatthew G. Knepley } 4697a5e93ea8SMatthew G. Knepley } else { 4698a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4699a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4700a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4701a5e93ea8SMatthew G. Knepley ++cind; 4702a5e93ea8SMatthew G. Knepley } 4703a5e93ea8SMatthew G. Knepley } 4704a5e93ea8SMatthew G. Knepley } 4705a5e93ea8SMatthew G. Knepley } 4706a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4707a5e93ea8SMatthew G. Knepley } 4708a5e93ea8SMatthew G. Knepley 4709a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4710552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47111a271a75SMatthew 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[]) 4712a6dfd86eSKarl Rupp { 4713552f7358SJed Brown PetscScalar *a; 47141a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47151a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47161a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4717552f7358SJed Brown PetscErrorCode ierr; 4718552f7358SJed Brown 4719552f7358SJed Brown PetscFunctionBegin; 4720552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4721552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47221a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47231a271a75SMatthew G. Knepley a = &array[foff]; 4724552f7358SJed Brown if (!fcdof || setBC) { 47251a271a75SMatthew G. Knepley if (o >= 0) { 47261a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4727552f7358SJed Brown } else { 4728552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4729552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47301a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4731552f7358SJed Brown } 4732552f7358SJed Brown } 4733552f7358SJed Brown } 4734552f7358SJed Brown } else { 4735552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47361a271a75SMatthew G. Knepley if (o >= 0) { 4737552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4738552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 47391a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4740552f7358SJed Brown } 4741552f7358SJed Brown } else { 4742552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4743552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4744552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 47451a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4746552f7358SJed Brown } 4747552f7358SJed Brown } 4748552f7358SJed Brown } 4749552f7358SJed Brown } 47501a271a75SMatthew G. Knepley *offset += fdof; 4751552f7358SJed Brown PetscFunctionReturn(0); 4752552f7358SJed Brown } 4753552f7358SJed Brown 4754552f7358SJed Brown #undef __FUNCT__ 4755a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 47561a271a75SMatthew 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[]) 4757a5e93ea8SMatthew G. Knepley { 4758a5e93ea8SMatthew G. Knepley PetscScalar *a; 47591a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47601a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47611a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4762a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4763a5e93ea8SMatthew G. Knepley 4764a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4765a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4766a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47671a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47681a271a75SMatthew G. Knepley a = &array[foff]; 4769a5e93ea8SMatthew G. Knepley if (fcdof) { 4770a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47711a271a75SMatthew G. Knepley if (o >= 0) { 4772a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4773a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 47741a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4775a5e93ea8SMatthew G. Knepley ++cind; 4776a5e93ea8SMatthew G. Knepley } 4777a5e93ea8SMatthew G. Knepley } 4778a5e93ea8SMatthew G. Knepley } else { 4779a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4780a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4781a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 47821a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4783a5e93ea8SMatthew G. Knepley ++cind; 4784a5e93ea8SMatthew G. Knepley } 4785a5e93ea8SMatthew G. Knepley } 4786a5e93ea8SMatthew G. Knepley } 4787a5e93ea8SMatthew G. Knepley } 4788a5e93ea8SMatthew G. Knepley } 47891a271a75SMatthew G. Knepley *offset += fdof; 4790a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4791a5e93ea8SMatthew G. Knepley } 4792a5e93ea8SMatthew G. Knepley 4793a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 47941b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 47951a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4796a6dfd86eSKarl Rupp { 4797552f7358SJed Brown PetscScalar *array; 47981b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 47991b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4800552f7358SJed Brown PetscErrorCode ierr; 4801552f7358SJed Brown 48021b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4803b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4804b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4805b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4806b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4807b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4808b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4809b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4810b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4811b6ebb6e6SMatthew G. Knepley 4812b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4813b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4814b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4815b6ebb6e6SMatthew G. Knepley { 4816b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4817b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4818b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4819b6ebb6e6SMatthew G. Knepley 4820b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4821b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4822b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4823b6ebb6e6SMatthew G. Knepley if (!cdof) { 4824b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4825b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4826b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4827b6ebb6e6SMatthew G. Knepley } 4828b6ebb6e6SMatthew G. Knepley } else { 4829b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4830b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4831b6ebb6e6SMatthew G. Knepley } 4832b6ebb6e6SMatthew G. Knepley } 4833b6ebb6e6SMatthew G. Knepley } else { 4834b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4835b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4836b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4837b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4838b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4839b6ebb6e6SMatthew G. Knepley } 4840b6ebb6e6SMatthew G. Knepley } else { 4841b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4842b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4843b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4844b6ebb6e6SMatthew G. Knepley } 4845b6ebb6e6SMatthew G. Knepley } 4846b6ebb6e6SMatthew G. Knepley } 4847b6ebb6e6SMatthew G. Knepley } 4848b6ebb6e6SMatthew G. Knepley } 4849b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4850b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4851b6ebb6e6SMatthew G. Knepley } 48521b406b76SMatthew G. Knepley 48531b406b76SMatthew G. Knepley #undef __FUNCT__ 48541b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 48551b406b76SMatthew G. Knepley /*@C 48561b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 48571b406b76SMatthew G. Knepley 48581b406b76SMatthew G. Knepley Not collective 48591b406b76SMatthew G. Knepley 48601b406b76SMatthew G. Knepley Input Parameters: 48611b406b76SMatthew G. Knepley + dm - The DM 48621b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 48631b406b76SMatthew G. Knepley . v - The local vector 48641b406b76SMatthew G. Knepley . point - The sieve point in the DM 48651b406b76SMatthew G. Knepley . values - The array of values 48661b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 48671b406b76SMatthew G. Knepley 48681b406b76SMatthew G. Knepley Fortran Notes: 48691b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 48701b406b76SMatthew G. Knepley 48711b406b76SMatthew G. Knepley Level: intermediate 48721b406b76SMatthew G. Knepley 48731b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 48741b406b76SMatthew G. Knepley @*/ 48751b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 48761b406b76SMatthew G. Knepley { 48771b406b76SMatthew G. Knepley PetscSection clSection; 48781b406b76SMatthew G. Knepley IS clPoints; 48791b406b76SMatthew G. Knepley PetscScalar *array; 48801b406b76SMatthew G. Knepley PetscInt *points = NULL; 48811b406b76SMatthew G. Knepley const PetscInt *clp; 48821a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 48831b406b76SMatthew G. Knepley PetscErrorCode ierr; 48841b406b76SMatthew G. Knepley 48851a271a75SMatthew G. Knepley PetscFunctionBeginHot; 48861b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 48871b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 48881a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 48891a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 48901b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 48911b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 48921b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 48931a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 48941b406b76SMatthew G. Knepley PetscFunctionReturn(0); 48951b406b76SMatthew G. Knepley } 48961a271a75SMatthew G. Knepley /* Get points */ 48971b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 48981b406b76SMatthew G. Knepley if (!clPoints) { 48991a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49001a271a75SMatthew G. Knepley 49011a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4902552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4903552f7358SJed Brown /* Compress out points not in the section */ 4904552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4905552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4906552f7358SJed Brown points[q*2] = points[p]; 4907552f7358SJed Brown points[q*2+1] = points[p+1]; 4908552f7358SJed Brown ++q; 4909552f7358SJed Brown } 4910552f7358SJed Brown } 4911552f7358SJed Brown numPoints = q; 49121b406b76SMatthew G. Knepley } else { 49131b406b76SMatthew G. Knepley PetscInt dof, off; 4914552f7358SJed Brown 49151b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49161b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49171b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49181a271a75SMatthew G. Knepley numPoints = dof/2; 49191b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4920552f7358SJed Brown } 49211a271a75SMatthew G. Knepley /* Get array */ 4922552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49231a271a75SMatthew G. Knepley /* Get values */ 4924ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49251a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4926552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49271a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4928552f7358SJed Brown switch (mode) { 4929552f7358SJed Brown case INSERT_VALUES: 4930552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49311a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49321a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49331a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4934552f7358SJed Brown } break; 4935552f7358SJed Brown case INSERT_ALL_VALUES: 4936552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49371a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49381a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49391a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 4940552f7358SJed Brown } break; 4941a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4942a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 49431a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49441a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49451a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 4946a5e93ea8SMatthew G. Knepley } break; 4947552f7358SJed Brown case ADD_VALUES: 4948552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49491a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49501a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49511a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 4952552f7358SJed Brown } break; 4953552f7358SJed Brown case ADD_ALL_VALUES: 4954552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49551a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49561a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49571a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 4958552f7358SJed Brown } break; 4959552f7358SJed Brown default: 496082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4961552f7358SJed Brown } 49621a271a75SMatthew G. Knepley } 4963552f7358SJed Brown } else { 49641a271a75SMatthew G. Knepley PetscInt dof, off; 49651a271a75SMatthew G. Knepley 4966552f7358SJed Brown switch (mode) { 4967552f7358SJed Brown case INSERT_VALUES: 4968552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4969552f7358SJed Brown PetscInt o = points[p+1]; 4970552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4971552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 4972552f7358SJed Brown } break; 4973552f7358SJed Brown case INSERT_ALL_VALUES: 4974552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4975552f7358SJed Brown PetscInt o = points[p+1]; 4976552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4977552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 4978552f7358SJed Brown } break; 4979a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4980a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4981a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 4982a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4983a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 4984a5e93ea8SMatthew G. Knepley } break; 4985552f7358SJed Brown case ADD_VALUES: 4986552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4987552f7358SJed Brown PetscInt o = points[p+1]; 4988552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4989552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 4990552f7358SJed Brown } break; 4991552f7358SJed Brown case ADD_ALL_VALUES: 4992552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4993552f7358SJed Brown PetscInt o = points[p+1]; 4994552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4995552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 4996552f7358SJed Brown } break; 4997552f7358SJed Brown default: 499882f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4999552f7358SJed Brown } 5000552f7358SJed Brown } 50011a271a75SMatthew G. Knepley /* Cleanup points */ 50021a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50031a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50041a271a75SMatthew G. Knepley /* Cleanup array */ 5005552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5006552f7358SJed Brown PetscFunctionReturn(0); 5007552f7358SJed Brown } 5008552f7358SJed Brown 5009552f7358SJed Brown #undef __FUNCT__ 5010552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5011b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5012552f7358SJed Brown { 5013552f7358SJed Brown PetscMPIInt rank; 5014552f7358SJed Brown PetscInt i, j; 5015552f7358SJed Brown PetscErrorCode ierr; 5016552f7358SJed Brown 5017552f7358SJed Brown PetscFunctionBegin; 501882f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 501977a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5020b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5021b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5022b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5023b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 502477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5025b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5026519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 50277eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5028552f7358SJed Brown #else 5029b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5030552f7358SJed Brown #endif 5031552f7358SJed Brown } 503277a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5033552f7358SJed Brown } 5034552f7358SJed Brown PetscFunctionReturn(0); 5035552f7358SJed Brown } 5036552f7358SJed Brown 5037552f7358SJed Brown #undef __FUNCT__ 5038552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5039552f7358SJed Brown /* . off - The global offset of this point */ 5040e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5041a6dfd86eSKarl Rupp { 5042e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5043552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5044552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5045552f7358SJed Brown PetscInt cind = 0, k; 5046552f7358SJed Brown PetscErrorCode ierr; 5047552f7358SJed Brown 5048552f7358SJed Brown PetscFunctionBegin; 5049552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5050552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5051552f7358SJed Brown if (!cdof || setBC) { 5052552f7358SJed Brown if (orientation >= 0) { 5053e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5054552f7358SJed Brown } else { 5055e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5056552f7358SJed Brown } 5057552f7358SJed Brown } else { 5058552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5059552f7358SJed Brown if (orientation >= 0) { 5060552f7358SJed Brown for (k = 0; k < dof; ++k) { 5061552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5062552f7358SJed Brown /* Insert check for returning constrained indices */ 5063e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5064552f7358SJed Brown ++cind; 5065552f7358SJed Brown } else { 5066e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5067552f7358SJed Brown } 5068552f7358SJed Brown } 5069552f7358SJed Brown } else { 5070552f7358SJed Brown for (k = 0; k < dof; ++k) { 5071552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5072552f7358SJed Brown /* Insert check for returning constrained indices */ 5073e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5074552f7358SJed Brown ++cind; 5075552f7358SJed Brown } else { 5076e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5077552f7358SJed Brown } 5078552f7358SJed Brown } 5079552f7358SJed Brown } 5080552f7358SJed Brown } 5081e6ccafaeSMatthew G Knepley *loff += dof; 5082552f7358SJed Brown PetscFunctionReturn(0); 5083552f7358SJed Brown } 5084552f7358SJed Brown 5085552f7358SJed Brown #undef __FUNCT__ 5086552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5087552f7358SJed Brown /* . off - The global offset of this point */ 5088a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5089a6dfd86eSKarl Rupp { 5090552f7358SJed Brown PetscInt numFields, foff, f; 5091552f7358SJed Brown PetscErrorCode ierr; 5092552f7358SJed Brown 5093552f7358SJed Brown PetscFunctionBegin; 5094552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5095552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5096552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5097552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5098552f7358SJed Brown PetscInt cind = 0, k, c; 5099552f7358SJed Brown 5100552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5101552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5102552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5103552f7358SJed Brown if (!cfdof || setBC) { 5104552f7358SJed Brown if (orientation >= 0) { 51050d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5106552f7358SJed Brown } else { 5107552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5108552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5109552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5110552f7358SJed Brown } 5111552f7358SJed Brown } 5112552f7358SJed Brown } 5113552f7358SJed Brown } else { 5114552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5115552f7358SJed Brown if (orientation >= 0) { 5116552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5117552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5118552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5119552f7358SJed Brown ++cind; 5120552f7358SJed Brown } else { 5121552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5122552f7358SJed Brown } 5123552f7358SJed Brown } 5124552f7358SJed Brown } else { 5125552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5126552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5127552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5128552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5129552f7358SJed Brown ++cind; 5130552f7358SJed Brown } else { 5131552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5132552f7358SJed Brown } 5133552f7358SJed Brown } 5134552f7358SJed Brown } 5135552f7358SJed Brown } 5136552f7358SJed Brown } 5137552f7358SJed Brown foff += fdof - cfdof; 5138552f7358SJed Brown foffs[f] += fdof; 5139552f7358SJed Brown } 5140552f7358SJed Brown PetscFunctionReturn(0); 5141552f7358SJed Brown } 5142552f7358SJed Brown 5143552f7358SJed Brown #undef __FUNCT__ 5144552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 51457f5d1fdeSMatthew G. Knepley /*@C 51467f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 51477f5d1fdeSMatthew G. Knepley 51487f5d1fdeSMatthew G. Knepley Not collective 51497f5d1fdeSMatthew G. Knepley 51507f5d1fdeSMatthew G. Knepley Input Parameters: 51517f5d1fdeSMatthew G. Knepley + dm - The DM 5152ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5153ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 51547f5d1fdeSMatthew G. Knepley . A - The matrix 51557f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 51567f5d1fdeSMatthew G. Knepley . values - The array of values 51577f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 51587f5d1fdeSMatthew G. Knepley 51597f5d1fdeSMatthew G. Knepley Fortran Notes: 51607f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 51617f5d1fdeSMatthew G. Knepley 51627f5d1fdeSMatthew G. Knepley Level: intermediate 51637f5d1fdeSMatthew G. Knepley 51647f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 51657f5d1fdeSMatthew G. Knepley @*/ 51667c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5167552f7358SJed Brown { 5168552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 51691b406b76SMatthew G. Knepley PetscSection clSection; 51701b406b76SMatthew G. Knepley IS clPoints; 51710298fd71SBarry Smith PetscInt *points = NULL; 51721b406b76SMatthew G. Knepley const PetscInt *clp; 5173552f7358SJed Brown PetscInt *indices; 5174552f7358SJed Brown PetscInt offsets[32]; 5175552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5176552f7358SJed Brown PetscErrorCode ierr; 5177552f7358SJed Brown 5178552f7358SJed Brown PetscFunctionBegin; 5179552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5180ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 51813dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5182ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 51833dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 51843dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5185552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 518682f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5187552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 51881b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 51891b406b76SMatthew G. Knepley if (!clPoints) { 5190552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5191552f7358SJed Brown /* Compress out points not in the section */ 5192552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5193552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5194552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5195552f7358SJed Brown points[q*2] = points[p]; 5196552f7358SJed Brown points[q*2+1] = points[p+1]; 5197552f7358SJed Brown ++q; 5198552f7358SJed Brown } 5199552f7358SJed Brown } 5200552f7358SJed Brown numPoints = q; 52011b406b76SMatthew G. Knepley } else { 52021b406b76SMatthew G. Knepley PetscInt dof, off; 52031b406b76SMatthew G. Knepley 52041b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 52051b406b76SMatthew G. Knepley numPoints = dof/2; 52061b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 52071b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 52081b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 52091b406b76SMatthew G. Knepley } 5210552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5211552f7358SJed Brown PetscInt fdof; 5212552f7358SJed Brown 5213552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5214552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5215552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5216552f7358SJed Brown offsets[f+1] += fdof; 5217552f7358SJed Brown } 5218552f7358SJed Brown numIndices += dof; 5219552f7358SJed Brown } 52200d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 52210d644c17SKarl Rupp 522282f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5223552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5224552f7358SJed Brown if (numFields) { 5225552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5226552f7358SJed Brown PetscInt o = points[p+1]; 5227552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5228552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5229552f7358SJed Brown } 5230552f7358SJed Brown } else { 5231e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5232552f7358SJed Brown PetscInt o = points[p+1]; 5233552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5234e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5235552f7358SJed Brown } 5236552f7358SJed Brown } 5237b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5238552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5239552f7358SJed Brown if (ierr) { 5240552f7358SJed Brown PetscMPIInt rank; 5241552f7358SJed Brown PetscErrorCode ierr2; 5242552f7358SJed Brown 524382f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 524477a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5245b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 52466a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5247552f7358SJed Brown CHKERRQ(ierr); 5248552f7358SJed Brown } 52491b406b76SMatthew G. Knepley if (!clPoints) { 5250552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 52511b406b76SMatthew G. Knepley } else { 52521b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 52531b406b76SMatthew G. Knepley } 5254552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5255552f7358SJed Brown PetscFunctionReturn(0); 5256552f7358SJed Brown } 5257552f7358SJed Brown 5258552f7358SJed Brown #undef __FUNCT__ 5259de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5260de41b84cSMatthew 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) 5261de41b84cSMatthew G. Knepley { 5262de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5263de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5264de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5265de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5266de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5267de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 52684ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5269de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5270de41b84cSMatthew G. Knepley 5271de41b84cSMatthew G. Knepley PetscFunctionBegin; 5272de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5273de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5274de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5275de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5276de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5277de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5278de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5279de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5280de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5281de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5282de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5283de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5284de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5285de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5286de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5287de41b84cSMatthew G. Knepley /* Column indices */ 5288de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 52894ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5290de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5291de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5292de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5293de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5294de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5295de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5296de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5297de41b84cSMatthew G. Knepley ++q; 5298de41b84cSMatthew G. Knepley } 5299de41b84cSMatthew G. Knepley } 5300de41b84cSMatthew G. Knepley numCPoints = q; 5301de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5302de41b84cSMatthew G. Knepley PetscInt fdof; 5303de41b84cSMatthew G. Knepley 5304de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 53054ca5e9f5SMatthew G. Knepley if (!dof) continue; 5306de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5307de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5308de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5309de41b84cSMatthew G. Knepley } 5310de41b84cSMatthew G. Knepley numCIndices += dof; 5311de41b84cSMatthew G. Knepley } 5312de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5313de41b84cSMatthew G. Knepley /* Row indices */ 5314de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5315de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 53161ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5317de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5318de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5319de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5320de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5321de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5322de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5323de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 53244ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 53254ca5e9f5SMatthew G. Knepley if (!dof) continue; 53264ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 53274ca5e9f5SMatthew G. Knepley if (s < q) continue; 5328de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5329de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5330de41b84cSMatthew G. Knepley ++q; 5331de41b84cSMatthew G. Knepley } 5332de41b84cSMatthew G. Knepley } 5333de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5334de41b84cSMatthew G. Knepley } 5335de41b84cSMatthew G. Knepley numFPoints = q; 5336de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5337de41b84cSMatthew G. Knepley PetscInt fdof; 5338de41b84cSMatthew G. Knepley 5339de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 53404ca5e9f5SMatthew G. Knepley if (!dof) continue; 5341de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5342de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5343de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5344de41b84cSMatthew G. Knepley } 5345de41b84cSMatthew G. Knepley numFIndices += dof; 5346de41b84cSMatthew G. Knepley } 5347de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5348de41b84cSMatthew G. Knepley 5349de41b84cSMatthew 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); 5350de41b84cSMatthew 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); 5351de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5352de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5353de41b84cSMatthew G. Knepley if (numFields) { 5354de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5355de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5356de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5357de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5358de41b84cSMatthew G. Knepley } 5359de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5360de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5361de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5362de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5363de41b84cSMatthew G. Knepley } 5364de41b84cSMatthew G. Knepley } else { 5365de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5366de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5367de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5368de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5369de41b84cSMatthew G. Knepley } 5370de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5371de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5372de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5373de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5374de41b84cSMatthew G. Knepley } 5375de41b84cSMatthew G. Knepley } 5376de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5377de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5378de41b84cSMatthew G. Knepley if (ierr) { 5379de41b84cSMatthew G. Knepley PetscMPIInt rank; 5380de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5381de41b84cSMatthew G. Knepley 5382de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5383de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5384de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5385de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5386de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5387de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5388de41b84cSMatthew G. Knepley } 5389549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5390de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5391de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5392de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5393de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5394de41b84cSMatthew G. Knepley } 5395de41b84cSMatthew G. Knepley 5396de41b84cSMatthew G. Knepley #undef __FUNCT__ 5397770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5398f96281f8SMatthew G. Knepley /*@ 5399f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5400f96281f8SMatthew G. Knepley 5401f96281f8SMatthew G. Knepley Input Parameter: 5402f96281f8SMatthew G. Knepley . dm - The DMPlex object 5403f96281f8SMatthew G. Knepley 5404f96281f8SMatthew G. Knepley Output Parameters: 5405f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5406f96281f8SMatthew G. Knepley . cMax - The first hybrid face 5407f96281f8SMatthew G. Knepley . cMax - The first hybrid edge 5408f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex 5409f96281f8SMatthew G. Knepley 5410f96281f8SMatthew G. Knepley Level: developer 5411f96281f8SMatthew G. Knepley 5412f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh() 5413f96281f8SMatthew G. Knepley @*/ 5414770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5415552f7358SJed Brown { 5416552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5417770b213bSMatthew G Knepley PetscInt dim; 5418770b213bSMatthew G Knepley PetscErrorCode ierr; 5419552f7358SJed Brown 5420552f7358SJed Brown PetscFunctionBegin; 5421552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5422770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5423770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5424770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5425770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5426770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5427552f7358SJed Brown PetscFunctionReturn(0); 5428552f7358SJed Brown } 5429552f7358SJed Brown 5430552f7358SJed Brown #undef __FUNCT__ 5431770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5432770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5433552f7358SJed Brown { 5434552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5435770b213bSMatthew G Knepley PetscInt dim; 5436770b213bSMatthew G Knepley PetscErrorCode ierr; 5437552f7358SJed Brown 5438552f7358SJed Brown PetscFunctionBegin; 5439552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5440770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5441770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5442770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5443770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5444770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5445552f7358SJed Brown PetscFunctionReturn(0); 5446552f7358SJed Brown } 5447552f7358SJed Brown 5448552f7358SJed Brown #undef __FUNCT__ 5449552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5450552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5451552f7358SJed Brown { 5452552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5453552f7358SJed Brown 5454552f7358SJed Brown PetscFunctionBegin; 5455552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5456552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5457552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5458552f7358SJed Brown PetscFunctionReturn(0); 5459552f7358SJed Brown } 5460552f7358SJed Brown 5461552f7358SJed Brown #undef __FUNCT__ 5462552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5463552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5464552f7358SJed Brown { 5465552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5466552f7358SJed Brown 5467552f7358SJed Brown PetscFunctionBegin; 5468552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5469552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5470552f7358SJed Brown PetscFunctionReturn(0); 5471552f7358SJed Brown } 5472552f7358SJed Brown 5473552f7358SJed Brown #undef __FUNCT__ 5474552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5475552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5476ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5477552f7358SJed Brown { 5478552f7358SJed Brown PetscSection section, globalSection; 5479552f7358SJed Brown PetscInt *numbers, p; 5480552f7358SJed Brown PetscErrorCode ierr; 5481552f7358SJed Brown 5482552f7358SJed Brown PetscFunctionBegin; 548382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5484552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5485552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5486552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5487552f7358SJed Brown } 5488552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5489552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5490785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5491552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5492552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5493ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5494ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5495552f7358SJed Brown } 549682f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5497ef48cebcSMatthew G. Knepley if (globalSize) { 5498ef48cebcSMatthew G. Knepley PetscLayout layout; 5499ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5500ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5501ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5502ef48cebcSMatthew G. Knepley } 5503552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5504552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5505552f7358SJed Brown PetscFunctionReturn(0); 5506552f7358SJed Brown } 5507552f7358SJed Brown 5508552f7358SJed Brown #undef __FUNCT__ 5509552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5510552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5511552f7358SJed Brown { 5512552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5513552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5514552f7358SJed Brown PetscErrorCode ierr; 5515552f7358SJed Brown 5516552f7358SJed Brown PetscFunctionBegin; 5517552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5518552f7358SJed Brown if (!mesh->globalCellNumbers) { 5519552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5520552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 55210298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 55220d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5523ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5524552f7358SJed Brown } 5525552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5526552f7358SJed Brown PetscFunctionReturn(0); 5527552f7358SJed Brown } 5528552f7358SJed Brown 5529552f7358SJed Brown #undef __FUNCT__ 5530552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5531552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5532552f7358SJed Brown { 5533552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5534552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5535552f7358SJed Brown PetscErrorCode ierr; 5536552f7358SJed Brown 5537552f7358SJed Brown PetscFunctionBegin; 5538552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5539552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5540552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 55410298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 55420d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5543ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5544552f7358SJed Brown } 5545552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5546552f7358SJed Brown PetscFunctionReturn(0); 5547552f7358SJed Brown } 5548552f7358SJed Brown 5549ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5550ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5551ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5552ef48cebcSMatthew G. Knepley { 5553ef48cebcSMatthew G. Knepley IS nums[4]; 5554ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5555ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5556ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5557ef48cebcSMatthew G. Knepley 5558ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5559ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5560ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5561ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5562ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5563ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5564ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5565ef48cebcSMatthew G. Knepley 5566ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5567ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5568ef48cebcSMatthew G. Knepley shift += gsize; 5569ef48cebcSMatthew G. Knepley } 5570ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 5571ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5572ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5573ef48cebcSMatthew G. Knepley } 5574ef48cebcSMatthew G. Knepley 5575552f7358SJed Brown 5576552f7358SJed Brown #undef __FUNCT__ 5577552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5578552f7358SJed Brown /*@C 5579552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5580552f7358SJed Brown the local section and an SF describing the section point overlap. 5581552f7358SJed Brown 5582552f7358SJed Brown Input Parameters: 5583552f7358SJed Brown + s - The PetscSection for the local field layout 5584552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5585552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5586552f7358SJed Brown . label - The label specifying the points 5587552f7358SJed Brown - labelValue - The label stratum specifying the points 5588552f7358SJed Brown 5589552f7358SJed Brown Output Parameter: 5590552f7358SJed Brown . gsection - The PetscSection for the global field layout 5591552f7358SJed Brown 5592552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5593552f7358SJed Brown 5594552f7358SJed Brown Level: developer 5595552f7358SJed Brown 5596552f7358SJed Brown .seealso: PetscSectionCreate() 5597552f7358SJed Brown @*/ 5598552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5599552f7358SJed Brown { 56007ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5601552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5602552f7358SJed Brown PetscErrorCode ierr; 5603552f7358SJed Brown 5604552f7358SJed Brown PetscFunctionBegin; 56054c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5606552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5607552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 56087ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 56097ec39499SMatthew G. Knepley if (nroots >= 0) { 56107ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 56111795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 56127ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 56131795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 56147ec39499SMatthew G. Knepley } else { 56157ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 56167ec39499SMatthew G. Knepley } 56177ec39499SMatthew G. Knepley } 5618552f7358SJed Brown /* Mark ghost points with negative dof */ 5619552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5620552f7358SJed Brown PetscInt value; 5621552f7358SJed Brown 5622552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5623552f7358SJed Brown if (value != labelValue) continue; 5624552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5625552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5626552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5627552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 56287ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5629552f7358SJed Brown } 5630552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5631552f7358SJed Brown if (nroots >= 0) { 56327ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 56337ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5634552f7358SJed Brown if (nroots > pEnd-pStart) { 56357ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5636552f7358SJed Brown } 5637552f7358SJed Brown } 5638552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5639552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5640552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5641552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5642552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5643552f7358SJed Brown } 56444c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5645552f7358SJed Brown globalOff -= off; 5646552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5647552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 56487ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5649552f7358SJed Brown } 5650552f7358SJed Brown /* Put in negative offsets for ghost points */ 5651552f7358SJed Brown if (nroots >= 0) { 56527ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 56537ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5654552f7358SJed Brown if (nroots > pEnd-pStart) { 56557ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5656552f7358SJed Brown } 5657552f7358SJed Brown } 56587ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5659552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5660552f7358SJed Brown PetscFunctionReturn(0); 5661552f7358SJed Brown } 5662ca8062c8SMatthew G. Knepley 5663ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5664ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5665ca8062c8SMatthew G. Knepley /*@ 5666ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5667ca8062c8SMatthew G. Knepley 5668ca8062c8SMatthew G. Knepley Input Parameters: 5669ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5670ca8062c8SMatthew G. Knepley 5671ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5672ca8062c8SMatthew G. Knepley 5673ca8062c8SMatthew G. Knepley Level: developer 5674ca8062c8SMatthew G. Knepley 56759bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5676ca8062c8SMatthew G. Knepley @*/ 5677ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5678ca8062c8SMatthew G. Knepley { 5679ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5680ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5681ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5682ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5683ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5684ca8062c8SMatthew G. Knepley 5685ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5686ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5687ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5688ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5689ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5690ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5691ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5692ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5693ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5694ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 569542e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 569642e66dfaSMatthew G. Knepley PetscInt d; 569742e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 569842e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 569942e66dfaSMatthew G. Knepley } 5700ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5701ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5702ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5703ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5704ca8062c8SMatthew G. Knepley } 570542e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5706ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5707ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5708ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5709ca8062c8SMatthew G. Knepley } 5710ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5711ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5712ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5713ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5714ca8062c8SMatthew G. Knepley } 5715ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 571642e66dfaSMatthew G. Knepley if (dup) { 571742e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 571842e66dfaSMatthew G. Knepley } else { 5719ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5720ca8062c8SMatthew G. Knepley } 5721ca8062c8SMatthew G. Knepley } 572242e66dfaSMatthew G. Knepley } 5723ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5724ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5725ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5726ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5727ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5728ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5729ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5730ca8062c8SMatthew G. Knepley } 5731ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5732ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5733ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5734ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5735ca8062c8SMatthew G. Knepley } 5736ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5737ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5738ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5739ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5740ca8062c8SMatthew G. Knepley } 5741ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5742ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5743ca8062c8SMatthew G. Knepley } 5744ca8062c8SMatthew G. Knepley } 5745ca8062c8SMatthew G. Knepley } 5746ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5747ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5748ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5749ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5750ca8062c8SMatthew G. Knepley } 5751ca8062c8SMatthew G. Knepley 5752ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5753ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5754ca8062c8SMatthew G. Knepley /*@ 5755ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5756ca8062c8SMatthew G. Knepley 5757ca8062c8SMatthew G. Knepley Input Parameters: 5758ca8062c8SMatthew G. Knepley + dm - The DMPlex object 575958723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 576058723a97SMatthew G. Knepley - cellHeight - Normally 0 5761ca8062c8SMatthew G. Knepley 5762ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5763ca8062c8SMatthew G. Knepley 5764ca8062c8SMatthew G. Knepley Level: developer 5765ca8062c8SMatthew G. Knepley 57669bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 5767ca8062c8SMatthew G. Knepley @*/ 576858723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 5769ca8062c8SMatthew G. Knepley { 577042363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 5771ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5772ca8062c8SMatthew G. Knepley 5773ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5774ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5775ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5776ca8062c8SMatthew G. Knepley switch (dim) { 577742363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 577842363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 577942363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 5780ca8062c8SMatthew G. Knepley default: 5781ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 5782ca8062c8SMatthew G. Knepley } 578358723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 578458723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 5785ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 5786ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 5787ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 578858723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 578958723a97SMatthew G. Knepley 579058723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 579158723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 579258723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 579358723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 579458723a97SMatthew G. Knepley } 579558723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 5796ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 5797ca8062c8SMatthew G. Knepley } 579842363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 579942363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 580042363296SMatthew G. Knepley 580142363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 580242363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 580342363296SMatthew G. Knepley const PetscInt p = closure[cl]; 580442363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 580542363296SMatthew G. Knepley } 580642363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 580742363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 580842363296SMatthew G. Knepley } 5809ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5810ca8062c8SMatthew G. Knepley } 58119bf0dad6SMatthew G. Knepley 58129bf0dad6SMatthew G. Knepley #undef __FUNCT__ 58139bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 58149bf0dad6SMatthew G. Knepley /*@ 58159bf0dad6SMatthew 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 58169bf0dad6SMatthew G. Knepley 58179bf0dad6SMatthew G. Knepley Input Parameters: 58189bf0dad6SMatthew G. Knepley + dm - The DMPlex object 58199bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 58209bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 58219bf0dad6SMatthew G. Knepley 58229bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 58239bf0dad6SMatthew G. Knepley 58249bf0dad6SMatthew G. Knepley Level: developer 58259bf0dad6SMatthew G. Knepley 58269bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 58279bf0dad6SMatthew G. Knepley @*/ 58289bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 58299bf0dad6SMatthew G. Knepley { 58303554e41dSMatthew G. Knepley PetscInt pMax[4]; 58313554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 58329bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 58339bf0dad6SMatthew G. Knepley 58349bf0dad6SMatthew G. Knepley PetscFunctionBegin; 58359bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 58369bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 58379bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 583825abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 58393554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 58403554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 58413554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 58429bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 58439bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 58449bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 58459bf0dad6SMatthew G. Knepley 584625abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 58479bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 58489bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 58499bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 58509bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 58519bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 58529bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 58539bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 58549bf0dad6SMatthew G. Knepley } 58553554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 58569bf0dad6SMatthew 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); 58579bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 58589bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 58599bf0dad6SMatthew G. Knepley 58609bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 58619bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 58629bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 58639bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 58649bf0dad6SMatthew G. Knepley } 5865e003ed69SMatthew 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); 58669bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 5867e003ed69SMatthew 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]); 58689bf0dad6SMatthew G. Knepley } 58699bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 58709bf0dad6SMatthew G. Knepley } 58719bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 58729bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 58739bf0dad6SMatthew G. Knepley } 58743554e41dSMatthew G. Knepley } 5875552f7358SJed Brown PetscFunctionReturn(0); 5876552f7358SJed Brown } 58773913d7c8SMatthew G. Knepley 58783913d7c8SMatthew G. Knepley #undef __FUNCT__ 5879bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 5880bceba477SMatthew G. Knepley /* Pointwise interpolation 5881bceba477SMatthew G. Knepley Just code FEM for now 5882bceba477SMatthew G. Knepley u^f = I u^c 58834ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 58844ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 58854ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 5886bceba477SMatthew G. Knepley */ 5887bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 5888bceba477SMatthew G. Knepley { 5889bceba477SMatthew G. Knepley PetscSection gsc, gsf; 5890bceba477SMatthew G. Knepley PetscInt m, n; 5891a063dac3SMatthew G. Knepley void *ctx; 5892bceba477SMatthew G. Knepley PetscErrorCode ierr; 5893bceba477SMatthew G. Knepley 5894bceba477SMatthew G. Knepley PetscFunctionBegin; 5895bceba477SMatthew G. Knepley /* 5896bceba477SMatthew G. Knepley Loop over coarse cells 5897bceba477SMatthew G. Knepley Loop over coarse basis functions 5898bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 5899bceba477SMatthew G. Knepley Loop over fine dual basis functions 5900bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 5901bceba477SMatthew G. Knepley Sum 5902bceba477SMatthew G. Knepley Update local element matrix 5903bceba477SMatthew G. Knepley Accumulate to interpolation matrix 5904bceba477SMatthew G. Knepley 5905bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 5906bceba477SMatthew G. Knepley */ 5907bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 5908bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 5909bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 5910bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 5911bceba477SMatthew G. Knepley /* We need to preallocate properly */ 5912bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 5913bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5914bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 5915bceba477SMatthew G. Knepley ierr = MatSetUp(*interpolation);CHKERRQ(ierr); 5916bceba477SMatthew G. Knepley ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr); 5917bceba477SMatthew G. Knepley ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr); 5918a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 5919a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 59205d1c2e58SMatthew G. Knepley /* Use naive scaling */ 59215d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 5922a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 5923a063dac3SMatthew G. Knepley } 5924bceba477SMatthew G. Knepley 5925a063dac3SMatthew G. Knepley #undef __FUNCT__ 5926a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 5927a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 5928a063dac3SMatthew G. Knepley { 592990748bafSMatthew G. Knepley Vec cv, fv; 593090748bafSMatthew G. Knepley IS cis, fis, fpointIS; 593190748bafSMatthew G. Knepley PetscSection sc, gsc, gsf; 593290748bafSMatthew G. Knepley const PetscInt *fpoints; 593390748bafSMatthew G. Knepley PetscInt *cindices, *findices; 593490748bafSMatthew G. Knepley PetscInt cpStart, cpEnd, m, off, cp; 593590748bafSMatthew G. Knepley PetscErrorCode ierr; 593690748bafSMatthew G. Knepley 5937a063dac3SMatthew G. Knepley PetscFunctionBegin; 593890748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 593990748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmFine, &fv);CHKERRQ(ierr); 594090748bafSMatthew G. Knepley ierr = DMGetDefaultSection(dmCoarse, &sc);CHKERRQ(ierr); 594190748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 594290748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 594390748bafSMatthew G. Knepley ierr = DMPlexCreateCoarsePointIS(dmCoarse, &fpointIS);CHKERRQ(ierr); 594490748bafSMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &m);CHKERRQ(ierr); 594590748bafSMatthew G. Knepley ierr = PetscMalloc2(m,&cindices,m,&findices);CHKERRQ(ierr); 594690748bafSMatthew G. Knepley ierr = PetscSectionGetChart(gsc, &cpStart, &cpEnd);CHKERRQ(ierr); 594790748bafSMatthew G. Knepley ierr = ISGetIndices(fpointIS, &fpoints);CHKERRQ(ierr); 594890748bafSMatthew G. Knepley for (cp = cpStart, off = 0; cp < cpEnd; ++cp) { 594990748bafSMatthew G. Knepley const PetscInt *cdofsC = NULL; 595090748bafSMatthew G. Knepley PetscInt fp = fpoints[cp-cpStart], dofC, cdofC, dofF, offC, offF, d, e; 595190748bafSMatthew G. Knepley 595290748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsc, cp, &dofC);CHKERRQ(ierr); 595390748bafSMatthew G. Knepley if (dofC <= 0) continue; 595490748bafSMatthew G. Knepley ierr = PetscSectionGetConstraintDof(sc, cp, &cdofC);CHKERRQ(ierr); 595590748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsf, fp, &dofF);CHKERRQ(ierr); 595690748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsc, cp, &offC);CHKERRQ(ierr); 595790748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsf, fp, &offF);CHKERRQ(ierr); 595890748bafSMatthew G. Knepley if (cdofC) {ierr = PetscSectionGetConstraintIndices(sc, cp, &cdofsC);CHKERRQ(ierr);} 595990748bafSMatthew 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); 596090748bafSMatthew 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); 596190748bafSMatthew G. Knepley for (d = 0, e = 0; d < dofC; ++d) { 596290748bafSMatthew G. Knepley if (cdofsC && cdofsC[e] == d) {++e; continue;} 596390748bafSMatthew G. Knepley cindices[off+d-e] = offC+d; findices[off+d-e] = offF+d; 596490748bafSMatthew G. Knepley } 596590748bafSMatthew 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); 596690748bafSMatthew G. Knepley off += dofC-cdofC; 596790748bafSMatthew G. Knepley } 596890748bafSMatthew G. Knepley ierr = ISRestoreIndices(fpointIS, &fpoints);CHKERRQ(ierr); 596990748bafSMatthew G. Knepley if (off != m) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of coarse dofs %d != %d", off, m); 597090748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, cindices, PETSC_OWN_POINTER, &cis);CHKERRQ(ierr); 597190748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, findices, PETSC_OWN_POINTER, &fis);CHKERRQ(ierr); 597290748bafSMatthew G. Knepley ierr = VecScatterCreate(cv, cis, fv, fis, ctx);CHKERRQ(ierr); 597390748bafSMatthew G. Knepley ierr = ISDestroy(&cis);CHKERRQ(ierr); 597490748bafSMatthew G. Knepley ierr = ISDestroy(&fis);CHKERRQ(ierr); 597590748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmFine, &fv);CHKERRQ(ierr); 597690748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 597790748bafSMatthew G. Knepley ierr = ISDestroy(&fpointIS);CHKERRQ(ierr); 5978bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5979bceba477SMatthew G. Knepley } 5980bceba477SMatthew G. Knepley 5981bceba477SMatthew G. Knepley #undef __FUNCT__ 5982fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 5983fd59a867SMatthew G. Knepley /* Pointwise interpolation 5984fd59a867SMatthew G. Knepley Just code FEM for now 5985fd59a867SMatthew G. Knepley u^f = I u^c 5986fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 5987fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 5988fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 5989fd59a867SMatthew G. Knepley */ 5990fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 5991fd59a867SMatthew G. Knepley { 5992fd59a867SMatthew G. Knepley PetscSection section; 5993fd59a867SMatthew G. Knepley IS *bcPoints; 5994286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 5995286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 5996fd59a867SMatthew G. Knepley PetscErrorCode ierr; 5997fd59a867SMatthew G. Knepley 5998fd59a867SMatthew G. Knepley PetscFunctionBegin; 5999fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6000286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6001fd59a867SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6002fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6003fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6004fd59a867SMatthew G. Knepley PetscBool isEssential; 6005fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6006fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6007fd59a867SMatthew G. Knepley } 6008fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6009fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6010fd59a867SMatthew G. Knepley const char *bdLabel; 6011fd59a867SMatthew G. Knepley DMLabel label; 6012fd59a867SMatthew G. Knepley const PetscInt *values; 6013fd59a867SMatthew G. Knepley PetscInt field, numValues; 6014fd59a867SMatthew G. Knepley PetscBool isEssential, has; 6015fd59a867SMatthew G. Knepley 6016fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6017fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6018fd59a867SMatthew G. Knepley ierr = DMPlexHasLabel(dm, bdLabel, &has);CHKERRQ(ierr); 6019fd59a867SMatthew G. Knepley if (!has) { 6020fd59a867SMatthew G. Knepley ierr = DMPlexCreateLabel(dm, bdLabel);CHKERRQ(ierr); 6021fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 6022fd59a867SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 6023fd59a867SMatthew G. Knepley } 6024fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 602532720fa8SMatthew G. Knepley /* Only want to do this for FEM */ 6026fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 602732720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 602893a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6029fd59a867SMatthew G. Knepley if (isEssential) { 603093a5981aSMatthew G. Knepley IS tmp; 603193a5981aSMatthew G. Knepley PetscInt *newidx; 603293a5981aSMatthew G. Knepley const PetscInt *idx; 603393a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 603493a5981aSMatthew G. Knepley 6035fd59a867SMatthew G. Knepley bcFields[bc] = field; 603693a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 603793a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 603893a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 603993a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 604093a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 604193a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 604293a5981aSMatthew G. Knepley newn = 0; 604393a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 604493a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 604593a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 604693a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6047fd59a867SMatthew G. Knepley } 6048fd59a867SMatthew G. Knepley } 6049fd59a867SMatthew G. Knepley /* Handle discretization */ 6050fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6051286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6052fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6053fd59a867SMatthew G. Knepley PetscFE fe; 6054286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6055fd59a867SMatthew G. Knepley PetscInt d; 6056fd59a867SMatthew G. Knepley 605718abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6058fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6059286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6060286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6061fd59a867SMatthew G. Knepley } 6062286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6063286d8613SMatthew G. Knepley PetscInt d; 6064286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6065286d8613SMatthew 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."); 6066286d8613SMatthew G. Knepley } 6067286d8613SMatthew G. Knepley } 6068f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6069fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6070fd59a867SMatthew G. Knepley PetscFE fe; 6071fd59a867SMatthew G. Knepley const char *name; 607218abd763SMatthew G. Knepley 607318abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6074fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6075fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6076fd59a867SMatthew G. Knepley } 6077fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6078fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6079fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6080fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6081286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6082bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6083bceba477SMatthew G. Knepley } 6084bceba477SMatthew G. Knepley 6085bceba477SMatthew G. Knepley #undef __FUNCT__ 60863913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 60873913d7c8SMatthew G. Knepley /*@ 60883913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 60893913d7c8SMatthew G. Knepley 60903913d7c8SMatthew G. Knepley Input Parameter: 60913913d7c8SMatthew G. Knepley . dm - The DMPlex object 60923913d7c8SMatthew G. Knepley 60933913d7c8SMatthew G. Knepley Output Parameter: 60943913d7c8SMatthew G. Knepley . cdm - The coarse DM 60953913d7c8SMatthew G. Knepley 60963913d7c8SMatthew G. Knepley Level: intermediate 60973913d7c8SMatthew G. Knepley 60983913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 60993913d7c8SMatthew G. Knepley @*/ 61003913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 61013913d7c8SMatthew G. Knepley { 61023913d7c8SMatthew G. Knepley PetscFunctionBegin; 61033913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 61043913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 61053913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 61063913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 61073913d7c8SMatthew G. Knepley } 61083913d7c8SMatthew G. Knepley 61093913d7c8SMatthew G. Knepley #undef __FUNCT__ 61103913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 61113913d7c8SMatthew G. Knepley /*@ 61123913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 61133913d7c8SMatthew G. Knepley 61143913d7c8SMatthew G. Knepley Input Parameters: 61153913d7c8SMatthew G. Knepley + dm - The DMPlex object 61163913d7c8SMatthew G. Knepley - cdm - The coarse DM 61173913d7c8SMatthew G. Knepley 61183913d7c8SMatthew G. Knepley Level: intermediate 61193913d7c8SMatthew G. Knepley 61203913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 61213913d7c8SMatthew G. Knepley @*/ 61223913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 61233913d7c8SMatthew G. Knepley { 61243913d7c8SMatthew G. Knepley DM_Plex *mesh; 61253913d7c8SMatthew G. Knepley PetscErrorCode ierr; 61263913d7c8SMatthew G. Knepley 61273913d7c8SMatthew G. Knepley PetscFunctionBegin; 61283913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 61293913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 61303913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 61313913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 61323913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 61333913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 61343913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 61353913d7c8SMatthew G. Knepley } 6136