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 */ 7*75a69067SMatthew 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, DMPLEX_InterpolatorFEM, DMPLEX_InjectorFEM; 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 } 724959657aSMatthew G. Knepley if (fem) {ierr = DMPlexInsertBoundaryValuesFEM(dm, v);CHKERRQ(ierr);} 73ef31f671SMatthew G. Knepley } 74552f7358SJed Brown if (isvtk) { 75552f7358SJed Brown PetscSection section; 76b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 77b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 78552f7358SJed Brown 79552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 807afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 81552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 82552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 83552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 84b136c2c9SMatthew G. Knepley } else if (ishdf5) { 85b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 86b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 87b136c2c9SMatthew G. Knepley #else 88b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 89b136c2c9SMatthew G. Knepley #endif 90552f7358SJed Brown } else { 9155f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 9255f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 93552f7358SJed Brown } 94552f7358SJed Brown PetscFunctionReturn(0); 95552f7358SJed Brown } 96552f7358SJed Brown 97552f7358SJed Brown #undef __FUNCT__ 98552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 99552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 100552f7358SJed Brown { 101552f7358SJed Brown DM dm; 10255f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 103552f7358SJed Brown PetscErrorCode ierr; 104552f7358SJed Brown 105552f7358SJed Brown PetscFunctionBegin; 106552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 10782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 108552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 10933c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11055f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 111552f7358SJed Brown if (isvtk) { 112552f7358SJed Brown Vec locv; 113552f7358SJed Brown const char *name; 114552f7358SJed Brown 115552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 116552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 117552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 118552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 119552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 120552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 121552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 122b136c2c9SMatthew G. Knepley } else if (ishdf5) { 123b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 124b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 125b136c2c9SMatthew G. Knepley #else 126b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 127b136c2c9SMatthew G. Knepley #endif 128552f7358SJed Brown } else { 12955f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13055f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 131552f7358SJed Brown } 132552f7358SJed Brown PetscFunctionReturn(0); 133552f7358SJed Brown } 134552f7358SJed Brown 135552f7358SJed Brown #undef __FUNCT__ 1362c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1372c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1382c40f234SMatthew G. Knepley { 1392c40f234SMatthew G. Knepley DM dm; 1402c40f234SMatthew G. Knepley PetscBool ishdf5; 1412c40f234SMatthew G. Knepley PetscErrorCode ierr; 1422c40f234SMatthew G. Knepley 1432c40f234SMatthew G. Knepley PetscFunctionBegin; 1442c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1452c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1462c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1472c40f234SMatthew G. Knepley if (ishdf5) { 1482c40f234SMatthew G. Knepley DM dmBC; 1492c40f234SMatthew G. Knepley Vec gv; 1502c40f234SMatthew G. Knepley const char *name; 1512c40f234SMatthew G. Knepley 1522c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1532c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1542c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1552c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1562c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1582c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1592c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1602c40f234SMatthew G. Knepley } else { 1612c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1622c40f234SMatthew G. Knepley } 1632c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1642c40f234SMatthew G. Knepley } 1652c40f234SMatthew G. Knepley 1662c40f234SMatthew G. Knepley #undef __FUNCT__ 1672c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1682c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1692c40f234SMatthew G. Knepley { 1702c40f234SMatthew G. Knepley DM dm; 1712c40f234SMatthew G. Knepley PetscBool ishdf5; 1722c40f234SMatthew G. Knepley PetscErrorCode ierr; 1732c40f234SMatthew G. Knepley 1742c40f234SMatthew G. Knepley PetscFunctionBegin; 1752c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1762c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1772c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1782c40f234SMatthew G. Knepley if (ishdf5) { 179878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 180b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 181b136c2c9SMatthew G. Knepley #else 182b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 183878b459fSMatthew G. Knepley #endif 1842c40f234SMatthew G. Knepley } else { 1852c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 186552f7358SJed Brown } 187552f7358SJed Brown PetscFunctionReturn(0); 188552f7358SJed Brown } 189552f7358SJed Brown 190552f7358SJed Brown #undef __FUNCT__ 191552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 192552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 193552f7358SJed Brown { 194552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 195552f7358SJed Brown DM cdm; 196552f7358SJed Brown DMLabel markers; 197552f7358SJed Brown PetscSection coordSection; 198552f7358SJed Brown Vec coordinates; 199552f7358SJed Brown PetscViewerFormat format; 200552f7358SJed Brown PetscErrorCode ierr; 201552f7358SJed Brown 202552f7358SJed Brown PetscFunctionBegin; 203552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 204552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 205552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 206552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 207552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 208552f7358SJed Brown const char *name; 209552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 210552f7358SJed Brown PetscInt pStart, pEnd, p; 211552f7358SJed Brown PetscMPIInt rank, size; 212552f7358SJed Brown 21382f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 21482f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 215552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 216552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 217552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 218552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 220552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 221552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 222552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 223552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 224552f7358SJed Brown PetscInt dof, off, s; 225552f7358SJed Brown 226552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 227552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 228552f7358SJed Brown for (s = off; s < off+dof; ++s) { 229552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 230552f7358SJed Brown } 231552f7358SJed Brown } 232552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 233552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 234552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 235552f7358SJed Brown PetscInt dof, off, c; 236552f7358SJed Brown 237552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 238552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 239552f7358SJed Brown for (c = off; c < off+dof; ++c) { 240552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 241552f7358SJed Brown } 242552f7358SJed Brown } 243552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2440298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 245552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 246552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 247552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 248552f7358SJed Brown if (size > 1) { 249552f7358SJed Brown PetscSF sf; 250552f7358SJed Brown 251552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 252552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 253552f7358SJed Brown } 254552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 255552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 256552f7358SJed Brown const char *name; 257552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 258552f7358SJed Brown const int numColors = 3; 259552f7358SJed Brown PetscReal scale = 2.0; 260552f7358SJed Brown PetscScalar *coords; 261552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 262552f7358SJed Brown PetscMPIInt rank, size; 263552f7358SJed Brown 264552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 26582f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 26682f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 267552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 268552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 269770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 270770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 271552f7358SJed Brown \\usepackage{tikz}\n\ 272552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 273552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 274552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 275552f7358SJed Brown \\begin{document}\n\ 276552f7358SJed Brown \\section{%s}\n\ 277770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 278770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 279770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 280770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 281770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 282770b213bSMatthew G Knepley } else if (p > 0) { 283770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 284770b213bSMatthew G Knepley } 285770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 286770b213bSMatthew G Knepley } 287770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 288770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 289552f7358SJed Brown /* Plot vertices */ 290552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 291552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 292552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 293552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 294552f7358SJed Brown PetscInt off, dof, d; 295552f7358SJed Brown 296552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 297552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 298552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 299552f7358SJed Brown for (d = 0; d < dof; ++d) { 300552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3016712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 302552f7358SJed Brown } 303552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 304552f7358SJed Brown } 305552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 306552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 307552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 308552f7358SJed Brown /* Plot edges */ 309552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 310552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 311552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 312552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 313552f7358SJed Brown const PetscInt *cone; 314552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 315552f7358SJed Brown 316552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 31782f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 318552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 319552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 320552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 321552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 322552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 323552f7358SJed Brown for (d = 0; d < dof; ++d) { 324552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3256712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 326552f7358SJed Brown } 327552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 328552f7358SJed Brown } 329552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 330552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 331552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 332552f7358SJed Brown /* Plot cells */ 333552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 334552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3350298fd71SBarry Smith PetscInt *closure = NULL; 336552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 337552f7358SJed Brown 338552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 339552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 340552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 341552f7358SJed Brown const PetscInt point = closure[p]; 342552f7358SJed Brown 343552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 344552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 345552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 346552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 347552f7358SJed Brown } 348552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 349552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 350552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 351552f7358SJed Brown } 352552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 353552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 354770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 355552f7358SJed Brown } else { 35682f516ccSBarry Smith MPI_Comm comm; 357834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 358834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 359552f7358SJed Brown PetscInt pStart, pEnd, p; 360a57dd577SMatthew G Knepley PetscInt numLabels, l; 3611143a3c0SMatthew G. Knepley const char *name; 362552f7358SJed Brown PetscMPIInt size; 363552f7358SJed Brown 36482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 365552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 366552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3675f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3681143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3691143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 370552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 371552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 372bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 373dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 374552f7358SJed Brown if (depth == 1) { 375552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 376552f7358SJed Brown pEnd = pEnd - pStart; 377552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 378552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 379552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 380552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 381552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 382552f7358SJed Brown pEnd = pEnd - pStart; 383552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 384552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 385552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 386552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 387552f7358SJed Brown } else { 388552f7358SJed Brown for (d = 0; d <= dim; d++) { 389552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 390834065abSMatthew G. Knepley pEnd -= pStart; 391834065abSMatthew G. Knepley pMax[d] -= pStart; 392552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 393834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 394552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 395834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 396834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 397834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 398834065abSMatthew G. Knepley } 399552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 400552f7358SJed Brown } 401552f7358SJed Brown } 402834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 403a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 404a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 405a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 406a57dd577SMatthew G Knepley DMLabel label; 407a57dd577SMatthew G Knepley const char *name; 408a57dd577SMatthew G Knepley IS valueIS; 409a57dd577SMatthew G Knepley const PetscInt *values; 410a57dd577SMatthew G Knepley PetscInt numValues, v; 411a57dd577SMatthew G Knepley 412a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 413a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 414a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 415a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 416a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 417a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 418a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 419a57dd577SMatthew G Knepley PetscInt size; 420a57dd577SMatthew G Knepley 421a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 422a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 423a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 424a57dd577SMatthew G Knepley } 425a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 426a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4274d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 428a57dd577SMatthew G Knepley } 429552f7358SJed Brown } 430552f7358SJed Brown PetscFunctionReturn(0); 431552f7358SJed Brown } 432552f7358SJed Brown 433552f7358SJed Brown #undef __FUNCT__ 434552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 435552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 436552f7358SJed Brown { 437c6ccd67eSMatthew G. Knepley PetscBool iascii, ishdf5; 438552f7358SJed Brown PetscErrorCode ierr; 439552f7358SJed Brown 440552f7358SJed Brown PetscFunctionBegin; 441552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 442552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 443552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 444c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 445552f7358SJed Brown if (iascii) { 446552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 447c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 448c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4497afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 450c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4517afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 452c6ccd67eSMatthew G. Knepley #else 453c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 454552f7358SJed Brown #endif 45511aeaf0aSBarry Smith } 456552f7358SJed Brown PetscFunctionReturn(0); 457552f7358SJed Brown } 458552f7358SJed Brown 4592c40f234SMatthew G. Knepley #undef __FUNCT__ 4602c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4612c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4622c40f234SMatthew G. Knepley { 4632c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4642c40f234SMatthew G. Knepley PetscErrorCode ierr; 4652c40f234SMatthew G. Knepley 4662c40f234SMatthew G. Knepley PetscFunctionBegin; 4672c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4682c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4692c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4702c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4712c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4722c40f234SMatthew G. Knepley else if (ishdf5) { 4732c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 47410b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4752c40f234SMatthew G. Knepley #else 4762c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 477552f7358SJed Brown #endif 478552f7358SJed Brown } 479552f7358SJed Brown PetscFunctionReturn(0); 480552f7358SJed Brown } 481552f7358SJed Brown 482552f7358SJed Brown #undef __FUNCT__ 4836c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4846c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4856c73c22cSMatthew G. Knepley { 4866c73c22cSMatthew G. Knepley DMBoundary b, next; 4876c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4886c73c22cSMatthew G. Knepley 4898e136ac0SMatthew G. Knepley PetscFunctionBegin; 4906c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4916c73c22cSMatthew G. Knepley b = *boundary; 4926c73c22cSMatthew G. Knepley *boundary = NULL; 4936c73c22cSMatthew G. Knepley for (; b; b = next) { 4946c73c22cSMatthew G. Knepley next = b->next; 4956c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 4966c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 49763d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 4986c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 4996c73c22cSMatthew G. Knepley } 5006c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5016c73c22cSMatthew G. Knepley } 5026c73c22cSMatthew G. Knepley 5036c73c22cSMatthew G. Knepley #undef __FUNCT__ 504552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 505552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 506552f7358SJed Brown { 507552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 508552f7358SJed Brown DMLabel next = mesh->labels; 509552f7358SJed Brown PetscErrorCode ierr; 510552f7358SJed Brown 511552f7358SJed Brown PetscFunctionBegin; 5120d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 513552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 514552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 515552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 516552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 517552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 518552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 519552f7358SJed Brown while (next) { 520552f7358SJed Brown DMLabel tmp = next->next; 521552f7358SJed Brown 522552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 523552f7358SJed Brown next = tmp; 524552f7358SJed Brown } 5253913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 526a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 527552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 528552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5296c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 530552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 531552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 532552f7358SJed Brown PetscFunctionReturn(0); 533552f7358SJed Brown } 534552f7358SJed Brown 535552f7358SJed Brown #undef __FUNCT__ 536552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 537b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 538552f7358SJed Brown { 539552f7358SJed Brown PetscSection section, sectionGlobal; 540552f7358SJed Brown PetscInt bs = -1; 541552f7358SJed Brown PetscInt localSize; 54289545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 543552f7358SJed Brown PetscErrorCode ierr; 544b412c318SBarry Smith MatType mtype; 545552f7358SJed Brown 546552f7358SJed Brown PetscFunctionBegin; 547607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 548b412c318SBarry Smith mtype = dm->mattype; 549552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 550552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 551552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 552552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 55382f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 554552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 555552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 556552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 557552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 558552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 559552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 560552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 561552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 562552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 563552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 564552f7358SJed Brown if (!isShell) { 565552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5662a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 567552f7358SJed Brown 568552f7358SJed Brown if (bs < 0) { 569552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 570fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 571552f7358SJed Brown 572552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 573552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 574552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 575fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 576fad22124SMatthew G Knepley if (dof-cdof) { 5772a28c762SMatthew G Knepley if (bs < 0) { 578fad22124SMatthew G Knepley bs = dof-cdof; 579fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5802a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5812a28c762SMatthew G Knepley bs = 1; 582552f7358SJed Brown break; 583552f7358SJed Brown } 584552f7358SJed Brown } 5852a28c762SMatthew G Knepley } 5862a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5872a28c762SMatthew G Knepley bsLocal = bs; 58882f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5892a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 59082f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5912a28c762SMatthew G Knepley if (bsMin != bsMax) { 5922a28c762SMatthew G Knepley bs = 1; 5932a28c762SMatthew G Knepley } else { 5942a28c762SMatthew G Knepley bs = bsMax; 5952a28c762SMatthew G Knepley } 596552f7358SJed Brown } else { 597552f7358SJed Brown bs = 1; 598552f7358SJed Brown } 599552f7358SJed Brown } 6001795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 601552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 602552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 603552f7358SJed Brown } 604552f7358SJed Brown PetscFunctionReturn(0); 605552f7358SJed Brown } 606552f7358SJed Brown 607552f7358SJed Brown #undef __FUNCT__ 608552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 609552f7358SJed Brown /*@ 610552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 611552f7358SJed Brown 612552f7358SJed Brown Not collective 613552f7358SJed Brown 614552f7358SJed Brown Input Parameter: 615552f7358SJed Brown . mesh - The DMPlex 616552f7358SJed Brown 617552f7358SJed Brown Output Parameter: 618552f7358SJed Brown . dim - The topological mesh dimension 619552f7358SJed Brown 620552f7358SJed Brown Level: beginner 621552f7358SJed Brown 622552f7358SJed Brown .seealso: DMPlexCreate() 623552f7358SJed Brown @*/ 624552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 625552f7358SJed Brown { 626552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 627552f7358SJed Brown 628552f7358SJed Brown PetscFunctionBegin; 629552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 630552f7358SJed Brown PetscValidPointer(dim, 2); 631552f7358SJed Brown *dim = mesh->dim; 632552f7358SJed Brown PetscFunctionReturn(0); 633552f7358SJed Brown } 634552f7358SJed Brown 635552f7358SJed Brown #undef __FUNCT__ 636552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 637552f7358SJed Brown /*@ 638552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 639552f7358SJed Brown 640552f7358SJed Brown Collective on mesh 641552f7358SJed Brown 642552f7358SJed Brown Input Parameters: 643552f7358SJed Brown + mesh - The DMPlex 644552f7358SJed Brown - dim - The topological mesh dimension 645552f7358SJed Brown 646552f7358SJed Brown Level: beginner 647552f7358SJed Brown 648552f7358SJed Brown .seealso: DMPlexCreate() 649552f7358SJed Brown @*/ 650552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 651552f7358SJed Brown { 652552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 653552f7358SJed Brown 654552f7358SJed Brown PetscFunctionBegin; 655552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 656552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 657552f7358SJed Brown mesh->dim = dim; 658552f7358SJed Brown PetscFunctionReturn(0); 659552f7358SJed Brown } 660552f7358SJed Brown 661552f7358SJed Brown #undef __FUNCT__ 662552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 663552f7358SJed Brown /*@ 664552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 665552f7358SJed Brown 666552f7358SJed Brown Not collective 667552f7358SJed Brown 668552f7358SJed Brown Input Parameter: 669552f7358SJed Brown . mesh - The DMPlex 670552f7358SJed Brown 671552f7358SJed Brown Output Parameters: 672552f7358SJed Brown + pStart - The first mesh point 673552f7358SJed Brown - pEnd - The upper bound for mesh points 674552f7358SJed Brown 675552f7358SJed Brown Level: beginner 676552f7358SJed Brown 677552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 678552f7358SJed Brown @*/ 679552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 680552f7358SJed Brown { 681552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 682552f7358SJed Brown PetscErrorCode ierr; 683552f7358SJed Brown 684552f7358SJed Brown PetscFunctionBegin; 685552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 686552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 687552f7358SJed Brown PetscFunctionReturn(0); 688552f7358SJed Brown } 689552f7358SJed Brown 690552f7358SJed Brown #undef __FUNCT__ 691552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 692552f7358SJed Brown /*@ 693552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 694552f7358SJed Brown 695552f7358SJed Brown Not collective 696552f7358SJed Brown 697552f7358SJed Brown Input Parameters: 698552f7358SJed Brown + mesh - The DMPlex 699552f7358SJed Brown . pStart - The first mesh point 700552f7358SJed Brown - pEnd - The upper bound for mesh points 701552f7358SJed Brown 702552f7358SJed Brown Output Parameters: 703552f7358SJed Brown 704552f7358SJed Brown Level: beginner 705552f7358SJed Brown 706552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 707552f7358SJed Brown @*/ 708552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 709552f7358SJed Brown { 710552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 711552f7358SJed Brown PetscErrorCode ierr; 712552f7358SJed Brown 713552f7358SJed Brown PetscFunctionBegin; 714552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 715552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 716552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 717552f7358SJed Brown PetscFunctionReturn(0); 718552f7358SJed Brown } 719552f7358SJed Brown 720552f7358SJed Brown #undef __FUNCT__ 721552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 722552f7358SJed Brown /*@ 723552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 724552f7358SJed Brown 725552f7358SJed Brown Not collective 726552f7358SJed Brown 727552f7358SJed Brown Input Parameters: 728552f7358SJed Brown + mesh - The DMPlex 729552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 730552f7358SJed Brown 731552f7358SJed Brown Output Parameter: 732552f7358SJed Brown . size - The cone size for point p 733552f7358SJed Brown 734552f7358SJed Brown Level: beginner 735552f7358SJed Brown 736552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 737552f7358SJed Brown @*/ 738552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 739552f7358SJed Brown { 740552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 741552f7358SJed Brown PetscErrorCode ierr; 742552f7358SJed Brown 743552f7358SJed Brown PetscFunctionBegin; 744552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 745552f7358SJed Brown PetscValidPointer(size, 3); 746552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 747552f7358SJed Brown PetscFunctionReturn(0); 748552f7358SJed Brown } 749552f7358SJed Brown 750552f7358SJed Brown #undef __FUNCT__ 751552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 752552f7358SJed Brown /*@ 753552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 754552f7358SJed Brown 755552f7358SJed Brown Not collective 756552f7358SJed Brown 757552f7358SJed Brown Input Parameters: 758552f7358SJed Brown + mesh - The DMPlex 759552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 760552f7358SJed Brown - size - The cone size for point p 761552f7358SJed Brown 762552f7358SJed Brown Output Parameter: 763552f7358SJed Brown 764552f7358SJed Brown Note: 765552f7358SJed Brown This should be called after DMPlexSetChart(). 766552f7358SJed Brown 767552f7358SJed Brown Level: beginner 768552f7358SJed Brown 769552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 770552f7358SJed Brown @*/ 771552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 772552f7358SJed Brown { 773552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 774552f7358SJed Brown PetscErrorCode ierr; 775552f7358SJed Brown 776552f7358SJed Brown PetscFunctionBegin; 777552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 778552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7790d644c17SKarl Rupp 780552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 781552f7358SJed Brown PetscFunctionReturn(0); 782552f7358SJed Brown } 783552f7358SJed Brown 784552f7358SJed Brown #undef __FUNCT__ 785f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 786f5a469b9SMatthew G. Knepley /*@ 787f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 788f5a469b9SMatthew G. Knepley 789f5a469b9SMatthew G. Knepley Not collective 790f5a469b9SMatthew G. Knepley 791f5a469b9SMatthew G. Knepley Input Parameters: 792f5a469b9SMatthew G. Knepley + mesh - The DMPlex 793f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 794f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 795f5a469b9SMatthew G. Knepley 796f5a469b9SMatthew G. Knepley Output Parameter: 797f5a469b9SMatthew G. Knepley 798f5a469b9SMatthew G. Knepley Note: 799f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 800f5a469b9SMatthew G. Knepley 801f5a469b9SMatthew G. Knepley Level: beginner 802f5a469b9SMatthew G. Knepley 803f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 804f5a469b9SMatthew G. Knepley @*/ 805f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 806f5a469b9SMatthew G. Knepley { 807f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 808f5a469b9SMatthew G. Knepley PetscInt csize; 809f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 810f5a469b9SMatthew G. Knepley 811f5a469b9SMatthew G. Knepley PetscFunctionBegin; 812f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 813f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 814f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 815f5a469b9SMatthew G. Knepley 816f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 817f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 818f5a469b9SMatthew G. Knepley } 819f5a469b9SMatthew G. Knepley 820f5a469b9SMatthew G. Knepley #undef __FUNCT__ 821552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 822552f7358SJed Brown /*@C 823552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 824552f7358SJed Brown 825552f7358SJed Brown Not collective 826552f7358SJed Brown 827552f7358SJed Brown Input Parameters: 828552f7358SJed Brown + mesh - The DMPlex 829552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 830552f7358SJed Brown 831552f7358SJed Brown Output Parameter: 832552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 833552f7358SJed Brown 834552f7358SJed Brown Level: beginner 835552f7358SJed Brown 8363813dfbdSMatthew G Knepley Fortran Notes: 8373813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8383813dfbdSMatthew G Knepley include petsc.h90 in your code. 8393813dfbdSMatthew G Knepley 8403813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 841552f7358SJed Brown 842552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 843552f7358SJed Brown @*/ 844552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 845552f7358SJed Brown { 846552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 847552f7358SJed Brown PetscInt off; 848552f7358SJed Brown PetscErrorCode ierr; 849552f7358SJed Brown 850552f7358SJed Brown PetscFunctionBegin; 851552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 852552f7358SJed Brown PetscValidPointer(cone, 3); 853552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 854552f7358SJed Brown *cone = &mesh->cones[off]; 855552f7358SJed Brown PetscFunctionReturn(0); 856552f7358SJed Brown } 857552f7358SJed Brown 858552f7358SJed Brown #undef __FUNCT__ 859552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 860552f7358SJed Brown /*@ 861552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 862552f7358SJed Brown 863552f7358SJed Brown Not collective 864552f7358SJed Brown 865552f7358SJed Brown Input Parameters: 866552f7358SJed Brown + mesh - The DMPlex 867552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 868552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 869552f7358SJed Brown 870552f7358SJed Brown Output Parameter: 871552f7358SJed Brown 872552f7358SJed Brown Note: 873552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 874552f7358SJed Brown 875552f7358SJed Brown Level: beginner 876552f7358SJed Brown 877552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 878552f7358SJed Brown @*/ 879552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 880552f7358SJed Brown { 881552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 882552f7358SJed Brown PetscInt pStart, pEnd; 883552f7358SJed Brown PetscInt dof, off, c; 884552f7358SJed Brown PetscErrorCode ierr; 885552f7358SJed Brown 886552f7358SJed Brown PetscFunctionBegin; 887552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 888552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 889552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 890552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 891552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 89282f516ccSBarry 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); 893552f7358SJed Brown for (c = 0; c < dof; ++c) { 89482f516ccSBarry 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); 895552f7358SJed Brown mesh->cones[off+c] = cone[c]; 896552f7358SJed Brown } 897552f7358SJed Brown PetscFunctionReturn(0); 898552f7358SJed Brown } 899552f7358SJed Brown 900552f7358SJed Brown #undef __FUNCT__ 901552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 902552f7358SJed Brown /*@C 903552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 904552f7358SJed Brown 905552f7358SJed Brown Not collective 906552f7358SJed Brown 907552f7358SJed Brown Input Parameters: 908552f7358SJed Brown + mesh - The DMPlex 909552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 910552f7358SJed Brown 911552f7358SJed Brown Output Parameter: 912552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 913552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 914552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 915552f7358SJed Brown the index of the cone point on which to start. 916552f7358SJed Brown 917552f7358SJed Brown Level: beginner 918552f7358SJed Brown 9193813dfbdSMatthew G Knepley Fortran Notes: 9203813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9213813dfbdSMatthew G Knepley include petsc.h90 in your code. 9223813dfbdSMatthew G Knepley 9233813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 924552f7358SJed Brown 925552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 926552f7358SJed Brown @*/ 927552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 928552f7358SJed Brown { 929552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 930552f7358SJed Brown PetscInt off; 931552f7358SJed Brown PetscErrorCode ierr; 932552f7358SJed Brown 933552f7358SJed Brown PetscFunctionBegin; 934552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 935552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 936552f7358SJed Brown { 937552f7358SJed Brown PetscInt dof; 938552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 939552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 940552f7358SJed Brown } 941552f7358SJed Brown #endif 942552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 9430d644c17SKarl Rupp 944552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 945552f7358SJed Brown PetscFunctionReturn(0); 946552f7358SJed Brown } 947552f7358SJed Brown 948552f7358SJed Brown #undef __FUNCT__ 949552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 950552f7358SJed Brown /*@ 951552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 952552f7358SJed Brown 953552f7358SJed Brown Not collective 954552f7358SJed Brown 955552f7358SJed Brown Input Parameters: 956552f7358SJed Brown + mesh - The DMPlex 957552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 958552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 959552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 960552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 961552f7358SJed Brown the index of the cone point on which to start. 962552f7358SJed Brown 963552f7358SJed Brown Output Parameter: 964552f7358SJed Brown 965552f7358SJed Brown Note: 966552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 967552f7358SJed Brown 968552f7358SJed Brown Level: beginner 969552f7358SJed Brown 970552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 971552f7358SJed Brown @*/ 972552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 973552f7358SJed Brown { 974552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 975552f7358SJed Brown PetscInt pStart, pEnd; 976552f7358SJed Brown PetscInt dof, off, c; 977552f7358SJed Brown PetscErrorCode ierr; 978552f7358SJed Brown 979552f7358SJed Brown PetscFunctionBegin; 980552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 981552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 982552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 983552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 984552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98582f516ccSBarry 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); 986552f7358SJed Brown for (c = 0; c < dof; ++c) { 987552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 988552f7358SJed Brown 989552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 99082f516ccSBarry 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); 991552f7358SJed Brown mesh->coneOrientations[off+c] = o; 992552f7358SJed Brown } 993552f7358SJed Brown PetscFunctionReturn(0); 994552f7358SJed Brown } 995552f7358SJed Brown 996552f7358SJed Brown #undef __FUNCT__ 997552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 998552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 999552f7358SJed Brown { 1000552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1001552f7358SJed Brown PetscInt pStart, pEnd; 1002552f7358SJed Brown PetscInt dof, off; 1003552f7358SJed Brown PetscErrorCode ierr; 1004552f7358SJed Brown 1005552f7358SJed Brown PetscFunctionBegin; 1006552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1007552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 100882f516ccSBarry 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); 100982f516ccSBarry 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); 101077c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 101177c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 101277c88f5bSMatthew 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); 1013552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 1014552f7358SJed Brown PetscFunctionReturn(0); 1015552f7358SJed Brown } 1016552f7358SJed Brown 1017552f7358SJed Brown #undef __FUNCT__ 101877c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 101977c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 102077c88f5bSMatthew G Knepley { 102177c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 102277c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 102377c88f5bSMatthew G Knepley PetscInt dof, off; 102477c88f5bSMatthew G Knepley PetscErrorCode ierr; 102577c88f5bSMatthew G Knepley 102677c88f5bSMatthew G Knepley PetscFunctionBegin; 102777c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 102877c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 102977c88f5bSMatthew 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); 103077c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 103177c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 103277c88f5bSMatthew 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); 103377c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 103477c88f5bSMatthew G Knepley PetscFunctionReturn(0); 103577c88f5bSMatthew G Knepley } 103677c88f5bSMatthew G Knepley 103777c88f5bSMatthew G Knepley #undef __FUNCT__ 1038552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1039552f7358SJed Brown /*@ 1040552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1041552f7358SJed Brown 1042552f7358SJed Brown Not collective 1043552f7358SJed Brown 1044552f7358SJed Brown Input Parameters: 1045552f7358SJed Brown + mesh - The DMPlex 1046552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1047552f7358SJed Brown 1048552f7358SJed Brown Output Parameter: 1049552f7358SJed Brown . size - The support size for point p 1050552f7358SJed Brown 1051552f7358SJed Brown Level: beginner 1052552f7358SJed Brown 1053552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1054552f7358SJed Brown @*/ 1055552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1056552f7358SJed Brown { 1057552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1058552f7358SJed Brown PetscErrorCode ierr; 1059552f7358SJed Brown 1060552f7358SJed Brown PetscFunctionBegin; 1061552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1062552f7358SJed Brown PetscValidPointer(size, 3); 1063552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1064552f7358SJed Brown PetscFunctionReturn(0); 1065552f7358SJed Brown } 1066552f7358SJed Brown 1067552f7358SJed Brown #undef __FUNCT__ 1068552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1069552f7358SJed Brown /*@ 1070552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1071552f7358SJed Brown 1072552f7358SJed Brown Not collective 1073552f7358SJed Brown 1074552f7358SJed Brown Input Parameters: 1075552f7358SJed Brown + mesh - The DMPlex 1076552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1077552f7358SJed Brown - size - The support size for point p 1078552f7358SJed Brown 1079552f7358SJed Brown Output Parameter: 1080552f7358SJed Brown 1081552f7358SJed Brown Note: 1082552f7358SJed Brown This should be called after DMPlexSetChart(). 1083552f7358SJed Brown 1084552f7358SJed Brown Level: beginner 1085552f7358SJed Brown 1086552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1087552f7358SJed Brown @*/ 1088552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1089552f7358SJed Brown { 1090552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1091552f7358SJed Brown PetscErrorCode ierr; 1092552f7358SJed Brown 1093552f7358SJed Brown PetscFunctionBegin; 1094552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1095552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10960d644c17SKarl Rupp 1097552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1098552f7358SJed Brown PetscFunctionReturn(0); 1099552f7358SJed Brown } 1100552f7358SJed Brown 1101552f7358SJed Brown #undef __FUNCT__ 1102552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1103552f7358SJed Brown /*@C 1104552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1105552f7358SJed Brown 1106552f7358SJed Brown Not collective 1107552f7358SJed Brown 1108552f7358SJed Brown Input Parameters: 1109552f7358SJed Brown + mesh - The DMPlex 1110552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1111552f7358SJed Brown 1112552f7358SJed Brown Output Parameter: 1113552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1114552f7358SJed Brown 1115552f7358SJed Brown Level: beginner 1116552f7358SJed Brown 11173813dfbdSMatthew G Knepley Fortran Notes: 11183813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11193813dfbdSMatthew G Knepley include petsc.h90 in your code. 11203813dfbdSMatthew G Knepley 11213813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 11223813dfbdSMatthew G Knepley 1123552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1124552f7358SJed Brown @*/ 1125552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1126552f7358SJed Brown { 1127552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1128552f7358SJed Brown PetscInt off; 1129552f7358SJed Brown PetscErrorCode ierr; 1130552f7358SJed Brown 1131552f7358SJed Brown PetscFunctionBegin; 1132552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1133552f7358SJed Brown PetscValidPointer(support, 3); 1134552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1135552f7358SJed Brown *support = &mesh->supports[off]; 1136552f7358SJed Brown PetscFunctionReturn(0); 1137552f7358SJed Brown } 1138552f7358SJed Brown 1139552f7358SJed Brown #undef __FUNCT__ 1140552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1141552f7358SJed Brown /*@ 1142552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1143552f7358SJed Brown 1144552f7358SJed Brown Not collective 1145552f7358SJed Brown 1146552f7358SJed Brown Input Parameters: 1147552f7358SJed Brown + mesh - The DMPlex 1148552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1149552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1150552f7358SJed Brown 1151552f7358SJed Brown Output Parameter: 1152552f7358SJed Brown 1153552f7358SJed Brown Note: 1154552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1155552f7358SJed Brown 1156552f7358SJed Brown Level: beginner 1157552f7358SJed Brown 1158552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1159552f7358SJed Brown @*/ 1160552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1161552f7358SJed Brown { 1162552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1163552f7358SJed Brown PetscInt pStart, pEnd; 1164552f7358SJed Brown PetscInt dof, off, c; 1165552f7358SJed Brown PetscErrorCode ierr; 1166552f7358SJed Brown 1167552f7358SJed Brown PetscFunctionBegin; 1168552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1169552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1170552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1171552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1172552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 117382f516ccSBarry 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); 1174552f7358SJed Brown for (c = 0; c < dof; ++c) { 117582f516ccSBarry 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); 1176552f7358SJed Brown mesh->supports[off+c] = support[c]; 1177552f7358SJed Brown } 1178552f7358SJed Brown PetscFunctionReturn(0); 1179552f7358SJed Brown } 1180552f7358SJed Brown 1181552f7358SJed Brown #undef __FUNCT__ 1182552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1183552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1184552f7358SJed Brown { 1185552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1186552f7358SJed Brown PetscInt pStart, pEnd; 1187552f7358SJed Brown PetscInt dof, off; 1188552f7358SJed Brown PetscErrorCode ierr; 1189552f7358SJed Brown 1190552f7358SJed Brown PetscFunctionBegin; 1191552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1192552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1193552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1194552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 119582f516ccSBarry 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); 119682f516ccSBarry 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); 119782f516ccSBarry 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); 1198552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1199552f7358SJed Brown PetscFunctionReturn(0); 1200552f7358SJed Brown } 1201552f7358SJed Brown 1202552f7358SJed Brown #undef __FUNCT__ 1203552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1204552f7358SJed Brown /*@C 1205552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1206552f7358SJed Brown 1207552f7358SJed Brown Not collective 1208552f7358SJed Brown 1209552f7358SJed Brown Input Parameters: 1210552f7358SJed Brown + mesh - The DMPlex 1211552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1212552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 12130298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1214552f7358SJed Brown 1215552f7358SJed Brown Output Parameters: 1216552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1217552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1218552f7358SJed Brown 1219552f7358SJed Brown Note: 12200298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1221552f7358SJed Brown 12223813dfbdSMatthew G Knepley Fortran Notes: 12233813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 12243813dfbdSMatthew G Knepley include petsc.h90 in your code. 12253813dfbdSMatthew G Knepley 12263813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 12273813dfbdSMatthew G Knepley 1228552f7358SJed Brown Level: beginner 1229552f7358SJed Brown 1230552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1231552f7358SJed Brown @*/ 1232552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1233552f7358SJed Brown { 1234552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1235552f7358SJed Brown PetscInt *closure, *fifo; 12360298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1237552f7358SJed Brown PetscInt tmpSize, t; 1238552f7358SJed Brown PetscInt depth = 0, maxSize; 1239552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1240552f7358SJed Brown PetscErrorCode ierr; 1241552f7358SJed Brown 1242552f7358SJed Brown PetscFunctionBegin; 1243552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1244552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1245552f7358SJed Brown /* This is only 1-level */ 1246552f7358SJed Brown if (useCone) { 1247552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1248552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1249552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1250552f7358SJed Brown } else { 1251552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1252552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1253552f7358SJed Brown } 1254bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1255bfbcdd7aSMatthew G. Knepley if (*points) { 1256bfbcdd7aSMatthew G. Knepley closure = *points; 1257bfbcdd7aSMatthew G. Knepley } else { 1258bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1259bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1260bfbcdd7aSMatthew G. Knepley } 1261bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1262bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1263bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1264bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1265bfbcdd7aSMatthew G. Knepley } 1266bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1267bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1268bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1269bfbcdd7aSMatthew G. Knepley } 1270bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1271bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1272bfbcdd7aSMatthew G. Knepley if (*points) { 1273bfbcdd7aSMatthew G. Knepley closure = *points; 1274bfbcdd7aSMatthew G. Knepley } else { 1275bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1276bfbcdd7aSMatthew G. Knepley } 1277bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1278552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1279552f7358SJed Brown const PetscInt cp = tmp[t]; 1280552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1281552f7358SJed Brown 1282552f7358SJed Brown closure[closureSize] = cp; 1283552f7358SJed Brown closure[closureSize+1] = co; 1284552f7358SJed Brown fifo[fifoSize] = cp; 1285552f7358SJed Brown fifo[fifoSize+1] = co; 1286552f7358SJed Brown } 1287bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1288552f7358SJed Brown while (fifoSize - fifoStart) { 1289552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1290552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1291552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1292552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1293552f7358SJed Brown 1294552f7358SJed Brown if (useCone) { 1295552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1296552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1297552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1298552f7358SJed Brown } else { 1299552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1300552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 13010298fd71SBarry Smith tmpO = NULL; 1302552f7358SJed Brown } 1303552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1304552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1305552f7358SJed Brown const PetscInt cp = tmp[i]; 13062e1b13c2SMatthew 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. */ 13072e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 13082e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 13092e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1310552f7358SJed Brown PetscInt c; 1311552f7358SJed Brown 13122e1b13c2SMatthew G. Knepley if (rev) { 13132e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 13142e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13152e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13162e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13172e1b13c2SMatthew G. Knepley } 1318552f7358SJed Brown /* Check for duplicate */ 1319552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1320552f7358SJed Brown if (closure[c] == cp) break; 1321552f7358SJed Brown } 1322552f7358SJed Brown if (c == closureSize) { 1323552f7358SJed Brown closure[closureSize] = cp; 1324552f7358SJed Brown closure[closureSize+1] = co; 1325552f7358SJed Brown fifo[fifoSize] = cp; 1326552f7358SJed Brown fifo[fifoSize+1] = co; 1327552f7358SJed Brown closureSize += 2; 1328552f7358SJed Brown fifoSize += 2; 1329552f7358SJed Brown } 1330552f7358SJed Brown } 1331552f7358SJed Brown fifoStart += 2; 1332552f7358SJed Brown } 1333552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1334552f7358SJed Brown if (points) *points = closure; 1335552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1336552f7358SJed Brown PetscFunctionReturn(0); 1337552f7358SJed Brown } 1338552f7358SJed Brown 1339552f7358SJed Brown #undef __FUNCT__ 13409bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 13419bf0dad6SMatthew G. Knepley /*@C 13429bf0dad6SMatthew 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 13439bf0dad6SMatthew G. Knepley 13449bf0dad6SMatthew G. Knepley Not collective 13459bf0dad6SMatthew G. Knepley 13469bf0dad6SMatthew G. Knepley Input Parameters: 13479bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13489bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13499bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13509bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13519bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13529bf0dad6SMatthew G. Knepley 13539bf0dad6SMatthew G. Knepley Output Parameters: 13549bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13559bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13569bf0dad6SMatthew G. Knepley 13579bf0dad6SMatthew G. Knepley Note: 13589bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13599bf0dad6SMatthew G. Knepley 13609bf0dad6SMatthew G. Knepley Fortran Notes: 13619bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13629bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13639bf0dad6SMatthew G. Knepley 13649bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13659bf0dad6SMatthew G. Knepley 13669bf0dad6SMatthew G. Knepley Level: beginner 13679bf0dad6SMatthew G. Knepley 13689bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13699bf0dad6SMatthew G. Knepley @*/ 13709bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13719bf0dad6SMatthew G. Knepley { 13729bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13739bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13749bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13759bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13769bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13779bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13789bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13799bf0dad6SMatthew G. Knepley 13809bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13819bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13829bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13839bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13849bf0dad6SMatthew G. Knepley if (useCone) { 13859bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13869bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13879bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13889bf0dad6SMatthew G. Knepley } else { 13899bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13909bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13919bf0dad6SMatthew G. Knepley } 13929bf0dad6SMatthew G. Knepley if (depth == 1) { 13939bf0dad6SMatthew G. Knepley if (*points) { 13949bf0dad6SMatthew G. Knepley closure = *points; 13959bf0dad6SMatthew G. Knepley } else { 13969bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13979bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13989bf0dad6SMatthew G. Knepley } 13999bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 14009bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 14019bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 14029bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 14039bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 14049bf0dad6SMatthew G. Knepley } 14059bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14069bf0dad6SMatthew G. Knepley if (points) *points = closure; 14079bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14089bf0dad6SMatthew G. Knepley } 14099bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 14109bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14119bf0dad6SMatthew G. Knepley if (*points) { 14129bf0dad6SMatthew G. Knepley closure = *points; 14139bf0dad6SMatthew G. Knepley } else { 14149bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 14159bf0dad6SMatthew G. Knepley } 14169bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 14179bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 14189bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 14199bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14209bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14219bf0dad6SMatthew G. Knepley 14229bf0dad6SMatthew G. Knepley if (ornt < 0) { 14239bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14249bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14259bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14269bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14279bf0dad6SMatthew G. Knepley } 14289bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14299bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14309bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14319bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14329bf0dad6SMatthew G. Knepley } 14339bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 14349bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 14359bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 14369bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 14379bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 14389bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 14399bf0dad6SMatthew G. Knepley 14409bf0dad6SMatthew G. Knepley if (useCone) { 14419bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 14429bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 14439bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 14449bf0dad6SMatthew G. Knepley } else { 14459bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14469bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14479bf0dad6SMatthew G. Knepley tmpO = NULL; 14489bf0dad6SMatthew G. Knepley } 14499bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14509bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14519bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14529bf0dad6SMatthew 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. */ 14539bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14549bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14559bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14569bf0dad6SMatthew G. Knepley PetscInt c; 14579bf0dad6SMatthew G. Knepley 14589bf0dad6SMatthew G. Knepley if (rev) { 14599bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14609bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14619bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14629bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14639bf0dad6SMatthew G. Knepley } 14649bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14659bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14669bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14679bf0dad6SMatthew G. Knepley } 14689bf0dad6SMatthew G. Knepley if (c == closureSize) { 14699bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14709bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14719bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14729bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14739bf0dad6SMatthew G. Knepley closureSize += 2; 14749bf0dad6SMatthew G. Knepley fifoSize += 2; 14759bf0dad6SMatthew G. Knepley } 14769bf0dad6SMatthew G. Knepley } 14779bf0dad6SMatthew G. Knepley fifoStart += 2; 14789bf0dad6SMatthew G. Knepley } 14799bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14809bf0dad6SMatthew G. Knepley if (points) *points = closure; 14819bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14829bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14839bf0dad6SMatthew G. Knepley } 14849bf0dad6SMatthew G. Knepley 14859bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1486552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1487552f7358SJed Brown /*@C 1488552f7358SJed 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 1489552f7358SJed Brown 1490552f7358SJed Brown Not collective 1491552f7358SJed Brown 1492552f7358SJed Brown Input Parameters: 1493552f7358SJed Brown + mesh - The DMPlex 1494552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1495552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1496e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1497e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1498552f7358SJed Brown 1499552f7358SJed Brown Note: 15000298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1501552f7358SJed Brown 15023813dfbdSMatthew G Knepley Fortran Notes: 15033813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 15043813dfbdSMatthew G Knepley include petsc.h90 in your code. 15053813dfbdSMatthew G Knepley 15063813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 15073813dfbdSMatthew G Knepley 1508552f7358SJed Brown Level: beginner 1509552f7358SJed Brown 1510552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1511552f7358SJed Brown @*/ 1512552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1513552f7358SJed Brown { 1514552f7358SJed Brown PetscErrorCode ierr; 1515552f7358SJed Brown 1516552f7358SJed Brown PetscFunctionBegin; 1517552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1518e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1519e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1520552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 15214ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1522552f7358SJed Brown PetscFunctionReturn(0); 1523552f7358SJed Brown } 1524552f7358SJed Brown 1525552f7358SJed Brown #undef __FUNCT__ 1526552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1527552f7358SJed Brown /*@ 1528552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1529552f7358SJed Brown 1530552f7358SJed Brown Not collective 1531552f7358SJed Brown 1532552f7358SJed Brown Input Parameter: 1533552f7358SJed Brown . mesh - The DMPlex 1534552f7358SJed Brown 1535552f7358SJed Brown Output Parameters: 1536552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1537552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1538552f7358SJed Brown 1539552f7358SJed Brown Level: beginner 1540552f7358SJed Brown 1541552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1542552f7358SJed Brown @*/ 1543552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1544552f7358SJed Brown { 1545552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1546552f7358SJed Brown 1547552f7358SJed Brown PetscFunctionBegin; 1548552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1549552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1550552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1551552f7358SJed Brown PetscFunctionReturn(0); 1552552f7358SJed Brown } 1553552f7358SJed Brown 1554552f7358SJed Brown #undef __FUNCT__ 1555552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1556552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1557552f7358SJed Brown { 1558552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1559552f7358SJed Brown PetscInt size; 1560552f7358SJed Brown PetscErrorCode ierr; 1561552f7358SJed Brown 1562552f7358SJed Brown PetscFunctionBegin; 1563552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1564552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1565552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15661795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15671795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1568552f7358SJed Brown if (mesh->maxSupportSize) { 1569552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1570552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15711795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1572552f7358SJed Brown } 1573552f7358SJed Brown PetscFunctionReturn(0); 1574552f7358SJed Brown } 1575552f7358SJed Brown 1576552f7358SJed Brown #undef __FUNCT__ 1577552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1578552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1579552f7358SJed Brown { 1580552f7358SJed Brown PetscErrorCode ierr; 1581552f7358SJed Brown 1582552f7358SJed Brown PetscFunctionBegin; 15834d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15844d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1585552f7358SJed Brown PetscFunctionReturn(0); 1586552f7358SJed Brown } 1587552f7358SJed Brown 1588552f7358SJed Brown #undef __FUNCT__ 1589552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1590552f7358SJed Brown /*@ 1591552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1592552f7358SJed Brown 1593552f7358SJed Brown Not collective 1594552f7358SJed Brown 1595552f7358SJed Brown Input Parameter: 1596552f7358SJed Brown . mesh - The DMPlex 1597552f7358SJed Brown 1598552f7358SJed Brown Output Parameter: 1599552f7358SJed Brown 1600552f7358SJed Brown Note: 1601552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1602552f7358SJed Brown 1603552f7358SJed Brown Level: beginner 1604552f7358SJed Brown 1605552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1606552f7358SJed Brown @*/ 1607552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1608552f7358SJed Brown { 1609552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1610552f7358SJed Brown PetscInt *offsets; 1611552f7358SJed Brown PetscInt supportSize; 1612552f7358SJed Brown PetscInt pStart, pEnd, p; 1613552f7358SJed Brown PetscErrorCode ierr; 1614552f7358SJed Brown 1615552f7358SJed Brown PetscFunctionBegin; 1616552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 161782f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1618552f7358SJed Brown /* Calculate support sizes */ 1619552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1620552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1621552f7358SJed Brown PetscInt dof, off, c; 1622552f7358SJed Brown 1623552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1624552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1625552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1626552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1627552f7358SJed Brown } 1628552f7358SJed Brown } 1629552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1630552f7358SJed Brown PetscInt dof; 1631552f7358SJed Brown 1632552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 16330d644c17SKarl Rupp 1634552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1635552f7358SJed Brown } 1636552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1637552f7358SJed Brown /* Calculate supports */ 1638552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 16391795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 16401795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1641552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1642552f7358SJed Brown PetscInt dof, off, c; 1643552f7358SJed Brown 1644552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1645552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1646552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1647552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1648552f7358SJed Brown PetscInt offS; 1649552f7358SJed Brown 1650552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16510d644c17SKarl Rupp 1652552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1653552f7358SJed Brown ++offsets[q]; 1654552f7358SJed Brown } 1655552f7358SJed Brown } 1656552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1657552f7358SJed Brown PetscFunctionReturn(0); 1658552f7358SJed Brown } 1659552f7358SJed Brown 1660552f7358SJed Brown #undef __FUNCT__ 1661552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1662552f7358SJed Brown /*@ 1663552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1664552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1665552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1666552f7358SJed Brown the DAG. 1667552f7358SJed Brown 1668552f7358SJed Brown Not collective 1669552f7358SJed Brown 1670552f7358SJed Brown Input Parameter: 1671552f7358SJed Brown . mesh - The DMPlex 1672552f7358SJed Brown 1673552f7358SJed Brown Output Parameter: 1674552f7358SJed Brown 1675552f7358SJed Brown Notes: 1676552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1677552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1678552f7358SJed Brown 1679552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1680552f7358SJed Brown 1681552f7358SJed Brown Level: beginner 1682552f7358SJed Brown 1683552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1684552f7358SJed Brown @*/ 1685552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1686552f7358SJed Brown { 1687aa50250dSMatthew G. Knepley DMLabel label; 1688552f7358SJed Brown PetscInt pStart, pEnd, p; 1689552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1690552f7358SJed Brown PetscErrorCode ierr; 1691552f7358SJed Brown 1692552f7358SJed Brown PetscFunctionBegin; 1693552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1694552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1695552f7358SJed Brown /* Calculate depth */ 1696aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1697aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1698aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1699552f7358SJed Brown /* Initialize roots and count leaves */ 1700552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1701552f7358SJed Brown PetscInt coneSize, supportSize; 1702552f7358SJed Brown 1703552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1704552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1705552f7358SJed Brown if (!coneSize && supportSize) { 1706552f7358SJed Brown ++numRoots; 1707aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1708552f7358SJed Brown } else if (!supportSize && coneSize) { 1709552f7358SJed Brown ++numLeaves; 1710552f7358SJed Brown } else if (!supportSize && !coneSize) { 1711552f7358SJed Brown /* Isolated points */ 1712aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1713552f7358SJed Brown } 1714552f7358SJed Brown } 1715552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1716552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1717552f7358SJed Brown PetscInt coneSize, supportSize; 1718552f7358SJed Brown 1719552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1720552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1721552f7358SJed Brown if (!supportSize && coneSize) { 1722aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1723552f7358SJed Brown } 1724552f7358SJed Brown } 1725552f7358SJed Brown } else { 172674ef644bSMatthew G. Knepley IS pointIS; 172774ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1728552f7358SJed Brown 172974ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 173074ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 173174ef644bSMatthew G. Knepley while (numPoints) { 173274ef644bSMatthew G. Knepley const PetscInt *points; 173374ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 173474ef644bSMatthew G. Knepley 173574ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 173674ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 173774ef644bSMatthew G. Knepley const PetscInt point = points[p]; 173874ef644bSMatthew G. Knepley const PetscInt *support; 173974ef644bSMatthew G. Knepley PetscInt supportSize, s; 174074ef644bSMatthew G. Knepley 174174ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 174274ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 174374ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 174474ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1745552f7358SJed Brown } 1746552f7358SJed Brown } 17475edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 174874ef644bSMatthew G. Knepley ++level; 174974ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 175074ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 175174ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 175274ef644bSMatthew G. Knepley else {numPoints = 0;} 175374ef644bSMatthew G. Knepley } 175474ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 175574ef644bSMatthew G. Knepley } 1756552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1757552f7358SJed Brown PetscFunctionReturn(0); 1758552f7358SJed Brown } 1759552f7358SJed Brown 1760552f7358SJed Brown #undef __FUNCT__ 1761552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1762552f7358SJed Brown /*@C 1763552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1764552f7358SJed Brown 1765552f7358SJed Brown Not Collective 1766552f7358SJed Brown 1767552f7358SJed Brown Input Parameters: 1768552f7358SJed Brown + dm - The DMPlex object 1769552f7358SJed Brown . numPoints - The number of input points for the join 1770552f7358SJed Brown - points - The input points 1771552f7358SJed Brown 1772552f7358SJed Brown Output Parameters: 1773552f7358SJed Brown + numCoveredPoints - The number of points in the join 1774552f7358SJed Brown - coveredPoints - The points in the join 1775552f7358SJed Brown 1776552f7358SJed Brown Level: intermediate 1777552f7358SJed Brown 1778552f7358SJed Brown Note: Currently, this is restricted to a single level join 1779552f7358SJed Brown 17803813dfbdSMatthew G Knepley Fortran Notes: 17813813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17823813dfbdSMatthew G Knepley include petsc.h90 in your code. 17833813dfbdSMatthew G Knepley 17843813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17853813dfbdSMatthew G Knepley 1786552f7358SJed Brown .keywords: mesh 1787552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1788552f7358SJed Brown @*/ 1789552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1790552f7358SJed Brown { 1791552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1792552f7358SJed Brown PetscInt *join[2]; 1793552f7358SJed Brown PetscInt joinSize, i = 0; 1794552f7358SJed Brown PetscInt dof, off, p, c, m; 1795552f7358SJed Brown PetscErrorCode ierr; 1796552f7358SJed Brown 1797552f7358SJed Brown PetscFunctionBegin; 1798552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1799552f7358SJed Brown PetscValidPointer(points, 2); 1800552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1801552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1802552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1803552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1804552f7358SJed Brown /* Copy in support of first point */ 1805552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1806552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1807552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1808552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1809552f7358SJed Brown } 1810552f7358SJed Brown /* Check each successive support */ 1811552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1812552f7358SJed Brown PetscInt newJoinSize = 0; 1813552f7358SJed Brown 1814552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1815552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1816552f7358SJed Brown for (c = 0; c < dof; ++c) { 1817552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1818552f7358SJed Brown 1819552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1820552f7358SJed Brown if (point == join[i][m]) { 1821552f7358SJed Brown join[1-i][newJoinSize++] = point; 1822552f7358SJed Brown break; 1823552f7358SJed Brown } 1824552f7358SJed Brown } 1825552f7358SJed Brown } 1826552f7358SJed Brown joinSize = newJoinSize; 1827552f7358SJed Brown i = 1-i; 1828552f7358SJed Brown } 1829552f7358SJed Brown *numCoveredPoints = joinSize; 1830552f7358SJed Brown *coveredPoints = join[i]; 1831552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1832552f7358SJed Brown PetscFunctionReturn(0); 1833552f7358SJed Brown } 1834552f7358SJed Brown 1835552f7358SJed Brown #undef __FUNCT__ 1836552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1837552f7358SJed Brown /*@C 1838552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1839552f7358SJed Brown 1840552f7358SJed Brown Not Collective 1841552f7358SJed Brown 1842552f7358SJed Brown Input Parameters: 1843552f7358SJed Brown + dm - The DMPlex object 1844552f7358SJed Brown . numPoints - The number of input points for the join 1845552f7358SJed Brown - points - The input points 1846552f7358SJed Brown 1847552f7358SJed Brown Output Parameters: 1848552f7358SJed Brown + numCoveredPoints - The number of points in the join 1849552f7358SJed Brown - coveredPoints - The points in the join 1850552f7358SJed Brown 18513813dfbdSMatthew G Knepley Fortran Notes: 18523813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18533813dfbdSMatthew G Knepley include petsc.h90 in your code. 18543813dfbdSMatthew G Knepley 18553813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18563813dfbdSMatthew G Knepley 1857552f7358SJed Brown Level: intermediate 1858552f7358SJed Brown 1859552f7358SJed Brown .keywords: mesh 1860552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1861552f7358SJed Brown @*/ 1862552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1863552f7358SJed Brown { 1864552f7358SJed Brown PetscErrorCode ierr; 1865552f7358SJed Brown 1866552f7358SJed Brown PetscFunctionBegin; 1867552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1868d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1869d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1870d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1871552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1872d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1873552f7358SJed Brown PetscFunctionReturn(0); 1874552f7358SJed Brown } 1875552f7358SJed Brown 1876552f7358SJed Brown #undef __FUNCT__ 1877552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1878552f7358SJed Brown /*@C 1879552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1880552f7358SJed Brown 1881552f7358SJed Brown Not Collective 1882552f7358SJed Brown 1883552f7358SJed Brown Input Parameters: 1884552f7358SJed Brown + dm - The DMPlex object 1885552f7358SJed Brown . numPoints - The number of input points for the join 1886552f7358SJed Brown - points - The input points 1887552f7358SJed Brown 1888552f7358SJed Brown Output Parameters: 1889552f7358SJed Brown + numCoveredPoints - The number of points in the join 1890552f7358SJed Brown - coveredPoints - The points in the join 1891552f7358SJed Brown 18923813dfbdSMatthew G Knepley Fortran Notes: 18933813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18943813dfbdSMatthew G Knepley include petsc.h90 in your code. 18953813dfbdSMatthew G Knepley 18963813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18973813dfbdSMatthew G Knepley 1898552f7358SJed Brown Level: intermediate 1899552f7358SJed Brown 1900552f7358SJed Brown .keywords: mesh 1901552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1902552f7358SJed Brown @*/ 1903552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1904552f7358SJed Brown { 1905552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1906552f7358SJed Brown PetscInt *offsets, **closures; 1907552f7358SJed Brown PetscInt *join[2]; 1908552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1909552f7358SJed Brown PetscInt p, d, c, m; 1910552f7358SJed Brown PetscErrorCode ierr; 1911552f7358SJed Brown 1912552f7358SJed Brown PetscFunctionBegin; 1913552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1914552f7358SJed Brown PetscValidPointer(points, 2); 1915552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1916552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1917552f7358SJed Brown 1918552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 19191795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1920552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1921e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1922552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1923552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1924552f7358SJed Brown 1925552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1926552f7358SJed Brown PetscInt closureSize; 1927552f7358SJed Brown 1928552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 19290d644c17SKarl Rupp 1930552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1931552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1932552f7358SJed Brown PetscInt pStart, pEnd, i; 1933552f7358SJed Brown 1934552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1935552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1936552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1937552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1938552f7358SJed Brown break; 1939552f7358SJed Brown } 1940552f7358SJed Brown } 1941552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1942552f7358SJed Brown } 194382f516ccSBarry 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); 1944552f7358SJed Brown } 1945552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1946552f7358SJed Brown PetscInt dof; 1947552f7358SJed Brown 1948552f7358SJed Brown /* Copy in support of first point */ 1949552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1950552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1951552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1952552f7358SJed Brown } 1953552f7358SJed Brown /* Check each successive cone */ 1954552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1955552f7358SJed Brown PetscInt newJoinSize = 0; 1956552f7358SJed Brown 1957552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1958552f7358SJed Brown for (c = 0; c < dof; ++c) { 1959552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1960552f7358SJed Brown 1961552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1962552f7358SJed Brown if (point == join[i][m]) { 1963552f7358SJed Brown join[1-i][newJoinSize++] = point; 1964552f7358SJed Brown break; 1965552f7358SJed Brown } 1966552f7358SJed Brown } 1967552f7358SJed Brown } 1968552f7358SJed Brown joinSize = newJoinSize; 1969552f7358SJed Brown i = 1-i; 1970552f7358SJed Brown } 1971552f7358SJed Brown if (joinSize) break; 1972552f7358SJed Brown } 1973552f7358SJed Brown *numCoveredPoints = joinSize; 1974552f7358SJed Brown *coveredPoints = join[i]; 1975552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19760298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1977552f7358SJed Brown } 1978552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1979552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1980552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1981552f7358SJed Brown PetscFunctionReturn(0); 1982552f7358SJed Brown } 1983552f7358SJed Brown 1984552f7358SJed Brown #undef __FUNCT__ 1985552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1986552f7358SJed Brown /*@C 1987552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1988552f7358SJed Brown 1989552f7358SJed Brown Not Collective 1990552f7358SJed Brown 1991552f7358SJed Brown Input Parameters: 1992552f7358SJed Brown + dm - The DMPlex object 1993552f7358SJed Brown . numPoints - The number of input points for the meet 1994552f7358SJed Brown - points - The input points 1995552f7358SJed Brown 1996552f7358SJed Brown Output Parameters: 1997552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1998552f7358SJed Brown - coveredPoints - The points in the meet 1999552f7358SJed Brown 2000552f7358SJed Brown Level: intermediate 2001552f7358SJed Brown 2002552f7358SJed Brown Note: Currently, this is restricted to a single level meet 2003552f7358SJed Brown 20043813dfbdSMatthew G Knepley Fortran Notes: 20053813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20063813dfbdSMatthew G Knepley include petsc.h90 in your code. 20073813dfbdSMatthew G Knepley 20083813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20093813dfbdSMatthew G Knepley 2010552f7358SJed Brown .keywords: mesh 2011552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 2012552f7358SJed Brown @*/ 2013552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 2014552f7358SJed Brown { 2015552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2016552f7358SJed Brown PetscInt *meet[2]; 2017552f7358SJed Brown PetscInt meetSize, i = 0; 2018552f7358SJed Brown PetscInt dof, off, p, c, m; 2019552f7358SJed Brown PetscErrorCode ierr; 2020552f7358SJed Brown 2021552f7358SJed Brown PetscFunctionBegin; 2022552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2023552f7358SJed Brown PetscValidPointer(points, 2); 2024552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2025552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2026552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2027552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2028552f7358SJed Brown /* Copy in cone of first point */ 2029552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2030552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2031552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2032552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2033552f7358SJed Brown } 2034552f7358SJed Brown /* Check each successive cone */ 2035552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2036552f7358SJed Brown PetscInt newMeetSize = 0; 2037552f7358SJed Brown 2038552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2039552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2040552f7358SJed Brown for (c = 0; c < dof; ++c) { 2041552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2042552f7358SJed Brown 2043552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2044552f7358SJed Brown if (point == meet[i][m]) { 2045552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2046552f7358SJed Brown break; 2047552f7358SJed Brown } 2048552f7358SJed Brown } 2049552f7358SJed Brown } 2050552f7358SJed Brown meetSize = newMeetSize; 2051552f7358SJed Brown i = 1-i; 2052552f7358SJed Brown } 2053552f7358SJed Brown *numCoveringPoints = meetSize; 2054552f7358SJed Brown *coveringPoints = meet[i]; 2055552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2056552f7358SJed Brown PetscFunctionReturn(0); 2057552f7358SJed Brown } 2058552f7358SJed Brown 2059552f7358SJed Brown #undef __FUNCT__ 2060552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2061552f7358SJed Brown /*@C 2062552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2063552f7358SJed Brown 2064552f7358SJed Brown Not Collective 2065552f7358SJed Brown 2066552f7358SJed Brown Input Parameters: 2067552f7358SJed Brown + dm - The DMPlex object 2068552f7358SJed Brown . numPoints - The number of input points for the meet 2069552f7358SJed Brown - points - The input points 2070552f7358SJed Brown 2071552f7358SJed Brown Output Parameters: 2072552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2073552f7358SJed Brown - coveredPoints - The points in the meet 2074552f7358SJed Brown 2075552f7358SJed Brown Level: intermediate 2076552f7358SJed Brown 20773813dfbdSMatthew G Knepley Fortran Notes: 20783813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20793813dfbdSMatthew G Knepley include petsc.h90 in your code. 20803813dfbdSMatthew G Knepley 20813813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20823813dfbdSMatthew G Knepley 2083552f7358SJed Brown .keywords: mesh 2084552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2085552f7358SJed Brown @*/ 2086552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2087552f7358SJed Brown { 2088552f7358SJed Brown PetscErrorCode ierr; 2089552f7358SJed Brown 2090552f7358SJed Brown PetscFunctionBegin; 2091552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2092d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2093d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2094d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2095552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2096d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2097552f7358SJed Brown PetscFunctionReturn(0); 2098552f7358SJed Brown } 2099552f7358SJed Brown 2100552f7358SJed Brown #undef __FUNCT__ 2101552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2102552f7358SJed Brown /*@C 2103552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2104552f7358SJed Brown 2105552f7358SJed Brown Not Collective 2106552f7358SJed Brown 2107552f7358SJed Brown Input Parameters: 2108552f7358SJed Brown + dm - The DMPlex object 2109552f7358SJed Brown . numPoints - The number of input points for the meet 2110552f7358SJed Brown - points - The input points 2111552f7358SJed Brown 2112552f7358SJed Brown Output Parameters: 2113552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2114552f7358SJed Brown - coveredPoints - The points in the meet 2115552f7358SJed Brown 2116552f7358SJed Brown Level: intermediate 2117552f7358SJed Brown 21183813dfbdSMatthew G Knepley Fortran Notes: 21193813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21203813dfbdSMatthew G Knepley include petsc.h90 in your code. 21213813dfbdSMatthew G Knepley 21223813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21233813dfbdSMatthew G Knepley 2124552f7358SJed Brown .keywords: mesh 2125552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2126552f7358SJed Brown @*/ 2127552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2128552f7358SJed Brown { 2129552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2130552f7358SJed Brown PetscInt *offsets, **closures; 2131552f7358SJed Brown PetscInt *meet[2]; 2132552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2133552f7358SJed Brown PetscInt p, h, c, m; 2134552f7358SJed Brown PetscErrorCode ierr; 2135552f7358SJed Brown 2136552f7358SJed Brown PetscFunctionBegin; 2137552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2138552f7358SJed Brown PetscValidPointer(points, 2); 2139552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2140552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2141552f7358SJed Brown 2142552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2143785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2144552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2145e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2146552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2147552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2148552f7358SJed Brown 2149552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2150552f7358SJed Brown PetscInt closureSize; 2151552f7358SJed Brown 2152552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21530d644c17SKarl Rupp 2154552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2155552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2156552f7358SJed Brown PetscInt pStart, pEnd, i; 2157552f7358SJed Brown 2158552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2159552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2160552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2161552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2162552f7358SJed Brown break; 2163552f7358SJed Brown } 2164552f7358SJed Brown } 2165552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2166552f7358SJed Brown } 216782f516ccSBarry 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); 2168552f7358SJed Brown } 2169552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2170552f7358SJed Brown PetscInt dof; 2171552f7358SJed Brown 2172552f7358SJed Brown /* Copy in cone of first point */ 2173552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2174552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2175552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2176552f7358SJed Brown } 2177552f7358SJed Brown /* Check each successive cone */ 2178552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2179552f7358SJed Brown PetscInt newMeetSize = 0; 2180552f7358SJed Brown 2181552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2182552f7358SJed Brown for (c = 0; c < dof; ++c) { 2183552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2184552f7358SJed Brown 2185552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2186552f7358SJed Brown if (point == meet[i][m]) { 2187552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2188552f7358SJed Brown break; 2189552f7358SJed Brown } 2190552f7358SJed Brown } 2191552f7358SJed Brown } 2192552f7358SJed Brown meetSize = newMeetSize; 2193552f7358SJed Brown i = 1-i; 2194552f7358SJed Brown } 2195552f7358SJed Brown if (meetSize) break; 2196552f7358SJed Brown } 2197552f7358SJed Brown *numCoveredPoints = meetSize; 2198552f7358SJed Brown *coveredPoints = meet[i]; 2199552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 22000298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2201552f7358SJed Brown } 2202552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2203552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2204552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2205552f7358SJed Brown PetscFunctionReturn(0); 2206552f7358SJed Brown } 2207552f7358SJed Brown 2208552f7358SJed Brown #undef __FUNCT__ 22094e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 22104e3744c5SMatthew G. Knepley /*@C 22114e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 22124e3744c5SMatthew G. Knepley 22134e3744c5SMatthew G. Knepley Not Collective 22144e3744c5SMatthew G. Knepley 22154e3744c5SMatthew G. Knepley Input Parameters: 22164e3744c5SMatthew G. Knepley + dmA - A DMPlex object 22174e3744c5SMatthew G. Knepley - dmB - A DMPlex object 22184e3744c5SMatthew G. Knepley 22194e3744c5SMatthew G. Knepley Output Parameters: 22204e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 22214e3744c5SMatthew G. Knepley 22224e3744c5SMatthew G. Knepley Level: intermediate 22234e3744c5SMatthew G. Knepley 22244e3744c5SMatthew G. Knepley Notes: 22254e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 22264e3744c5SMatthew G. Knepley 22274e3744c5SMatthew G. Knepley .keywords: mesh 22284e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 22294e3744c5SMatthew G. Knepley @*/ 22304e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 22314e3744c5SMatthew G. Knepley { 22324e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 22334e3744c5SMatthew G. Knepley PetscErrorCode ierr; 22344e3744c5SMatthew G. Knepley 22354e3744c5SMatthew G. Knepley PetscFunctionBegin; 22364e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 22374e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 22384e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 22394e3744c5SMatthew G. Knepley 22404e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 22414e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 22424e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 22434e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 22444e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 22454e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 22464e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 22474e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22484e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22494e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22504e3744c5SMatthew G. Knepley 22514e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22524e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22534e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22544e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22554e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22564e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22574e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22584e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22594e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22604e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22614e3744c5SMatthew G. Knepley } 22624e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22634e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22644e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22654e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22664e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22674e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22684e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22694e3744c5SMatthew G. Knepley } 22704e3744c5SMatthew G. Knepley } 22714e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22724e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22734e3744c5SMatthew G. Knepley } 22744e3744c5SMatthew G. Knepley 22754e3744c5SMatthew G. Knepley #undef __FUNCT__ 227618ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 227718ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2278a6dfd86eSKarl Rupp { 227982f516ccSBarry Smith MPI_Comm comm; 2280552f7358SJed Brown PetscErrorCode ierr; 2281552f7358SJed Brown 2282552f7358SJed Brown PetscFunctionBegin; 228382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2284552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2285552f7358SJed Brown switch (cellDim) { 2286552f7358SJed Brown case 0: 2287552f7358SJed Brown *numFaceVertices = 0; 2288552f7358SJed Brown break; 2289552f7358SJed Brown case 1: 2290552f7358SJed Brown *numFaceVertices = 1; 2291552f7358SJed Brown break; 2292552f7358SJed Brown case 2: 2293552f7358SJed Brown switch (numCorners) { 229419436ca2SJed Brown case 3: /* triangle */ 229519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2296552f7358SJed Brown break; 229719436ca2SJed Brown case 4: /* quadrilateral */ 229819436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2299552f7358SJed Brown break; 230019436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 230119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2302552f7358SJed Brown break; 230319436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 230419436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2305552f7358SJed Brown break; 2306552f7358SJed Brown default: 2307552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2308552f7358SJed Brown } 2309552f7358SJed Brown break; 2310552f7358SJed Brown case 3: 2311552f7358SJed Brown switch (numCorners) { 231219436ca2SJed Brown case 4: /* tetradehdron */ 231319436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2314552f7358SJed Brown break; 231519436ca2SJed Brown case 6: /* tet cohesive cells */ 231619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2317552f7358SJed Brown break; 231819436ca2SJed Brown case 8: /* hexahedron */ 231919436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2320552f7358SJed Brown break; 232119436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 232219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2323552f7358SJed Brown break; 232419436ca2SJed Brown case 10: /* quadratic tetrahedron */ 232519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2326552f7358SJed Brown break; 232719436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 232819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2329552f7358SJed Brown break; 233019436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 233119436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2332552f7358SJed Brown break; 233319436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 233419436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2335552f7358SJed Brown break; 2336552f7358SJed Brown default: 2337552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2338552f7358SJed Brown } 2339552f7358SJed Brown break; 2340552f7358SJed Brown default: 2341552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2342552f7358SJed Brown } 2343552f7358SJed Brown PetscFunctionReturn(0); 2344552f7358SJed Brown } 2345552f7358SJed Brown 2346552f7358SJed Brown #undef __FUNCT__ 2347d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2348d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2349d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2350d27a0f52SMatthew G. Knepley { 2351a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2352a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2353a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2354d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2355d27a0f52SMatthew G. Knepley 2356d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2357d27a0f52SMatthew G. Knepley /* Truth Table 2358d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2359d27a0f52SMatthew G. Knepley F 0 flips no F F F 2360d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2361d27a0f52SMatthew G. Knepley F 2 flips no T F T 2362d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2363d27a0f52SMatthew G. Knepley T 1 flip no 2364d27a0f52SMatthew G. Knepley T 2 flips yes 2365d27a0f52SMatthew G. Knepley */ 2366a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2367d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2368a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2369d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2370a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2371a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2372a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2373a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2374a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2375a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2376785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2377a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2378a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2379defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2380a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2381a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2382a1b4d4a2SMatthew G. Knepley 2383a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2384a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2385a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2386a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2387a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2388a1b4d4a2SMatthew G. Knepley } 2389a1b4d4a2SMatthew G. Knepley } 2390a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2391a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2392d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2393a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2394d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2395d27a0f52SMatthew G. Knepley 2396a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2397a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2398a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2399d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2400d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2401a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 240286cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2403a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 240486cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2405d27a0f52SMatthew G. Knepley 2406d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2407d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2408d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2409d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2410d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2411d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2412a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2413a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2414a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2415a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2416a1b4d4a2SMatthew G. Knepley } 2417a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2418a1b4d4a2SMatthew 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); 2419a1b4d4a2SMatthew G. Knepley } 2420a1b4d4a2SMatthew 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]); 2421a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2422a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2423a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2424a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2425a1b4d4a2SMatthew G. Knepley } 2426a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2427a1b4d4a2SMatthew 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); 2428a1b4d4a2SMatthew G. Knepley } 2429a1b4d4a2SMatthew 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]); 2430d27a0f52SMatthew G. Knepley 2431d27a0f52SMatthew G. Knepley if (dim == 1) { 2432d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2433d27a0f52SMatthew G. Knepley } else { 2434d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2435d27a0f52SMatthew G. Knepley } 2436d27a0f52SMatthew G. Knepley 2437d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2438d27a0f52SMatthew 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]); 2439d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2440a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2441d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2442a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2443d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 244486cff514SMatthew 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"); 2445a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2446a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2447d27a0f52SMatthew G. Knepley } 2448fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2449fedde076SMatthew G. Knepley { 2450fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2451fedde076SMatthew G. Knepley PetscSF sf; 2452fedde076SMatthew G. Knepley const PetscInt *lpoints; 2453fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 245413048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2455fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2456a1b4d4a2SMatthew G. Knepley 2457fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2458fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2459fedde076SMatthew G. Knepley if (numLeaves >= 0) { 246062ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 246162ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 246262ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 246313048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 246462ad4a6aSMatthew G. Knepley 2465fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2466fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2467fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2468fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2469fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2470fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2471fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2472fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2473fedde076SMatthew G. Knepley PetscInt supportSize; 2474fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2475fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2476fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2477fedde076SMatthew G. Knepley } 2478fedde076SMatthew G. Knepley } 2479fedde076SMatthew G. Knepley } 248013048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2481fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2482fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2483fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2484fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2485fedde076SMatthew G. Knepley 2486fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 248762ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2488fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2489fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24905b7033fcSMatthew G. Knepley if (dim == 1) { 24915b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24925b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24935b7033fcSMatthew G. Knepley } else { 2494fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2495fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2496fedde076SMatthew G. Knepley } 24975b7033fcSMatthew G. Knepley } 2498fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2499fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2500fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2501fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2502fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2503fedde076SMatthew G. Knepley 250413048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 250513048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 250613048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2507fedde076SMatthew G. Knepley } 250813048561SMatthew G. Knepley /* Collect the graph on 0 */ 250913048561SMatthew G. Knepley { 251013048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2511e8f90184SMatthew G. Knepley Mat G; 251213048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 251313048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 251413048561SMatthew G. Knepley PetscInt *adj = NULL; 251513048561SMatthew G. Knepley PetscBool *val = NULL; 251613048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 251713048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 251813048561SMatthew G. Knepley PetscInt debug = 0; 251913048561SMatthew G. Knepley 252013048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 252113048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 252213048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 252313048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 252413048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 252513048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 252613048561SMatthew G. Knepley } 252713048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 252813048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 252913048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 253013048561SMatthew G. Knepley if (debug) { 253113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 253213048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 253313048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 253413048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 253513048561SMatthew G. Knepley } 253613048561SMatthew G. Knepley } 253713048561SMatthew G. Knepley } 2538e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2539e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2540e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2541e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2542e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2543e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 25449a4fe19dSMatthew G. Knepley const PetscInt r = p; 2545e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 25467406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2547e8f90184SMatthew G. Knepley 25487406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 25497406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2550e8f90184SMatthew G. Knepley } 2551e8f90184SMatthew G. Knepley } 2552e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2553e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2554e8f90184SMatthew G. Knepley 255513048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 255613048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 255713048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 255813048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 255913048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 256013048561SMatthew G. Knepley pTop = pBottom = 0; 256113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 256213048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 256313048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 256413048561SMatthew G. Knepley procFIFO[pBottom++] = p; 256513048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 256613048561SMatthew G. Knepley /* Consider each proc in FIFO */ 256713048561SMatthew G. Knepley while (pTop < pBottom) { 2568e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2569e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2570e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 257113048561SMatthew G. Knepley 257213048561SMatthew G. Knepley proc = procFIFO[pTop++]; 257313048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2574e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 257513048561SMatthew G. Knepley /* Loop over neighboring procs */ 2576e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2577e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25787406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 257913048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 258013048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 258113048561SMatthew G. Knepley 258213048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 258313048561SMatthew 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); 258413048561SMatthew G. Knepley if (!flippedB) { 258513048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 258613048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 258713048561SMatthew 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"); 258813048561SMatthew G. Knepley if (!seen) { 258913048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 259013048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 259113048561SMatthew G. Knepley } 259213048561SMatthew G. Knepley } 259313048561SMatthew G. Knepley } 259413048561SMatthew G. Knepley } 259513048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2596e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 259713048561SMatthew G. Knepley 259813048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 259913048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 260013048561SMatthew G. Knepley { 260113048561SMatthew G. Knepley PetscBool *flips; 260213048561SMatthew G. Knepley 260313048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 260413048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 260513048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 260613048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 260713048561SMatthew G. Knepley } 260813048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 260913048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 261013048561SMatthew G. Knepley } 261113048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 261213048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 261313048561SMatthew G. Knepley } 261413048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2615fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 261613048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2617fedde076SMatthew G. Knepley } 2618fedde076SMatthew G. Knepley } 2619fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2620d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2621d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2622d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2623a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2624f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2625f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2626d27a0f52SMatthew G. Knepley 2627a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2628a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2629a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2630a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2631a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2632a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2633a1b4d4a2SMatthew G. Knepley 2634a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2635a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2636a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2637d27a0f52SMatthew G. Knepley } 2638a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2639a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2640f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2641f4e909fcSMatthew G. Knepley faceSize = coneSize; 2642f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2643f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2644f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2645f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2646f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2647f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2648f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2649f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2650f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2651f4e909fcSMatthew G. Knepley } 2652f4e909fcSMatthew G. Knepley } 2653d27a0f52SMatthew G. Knepley } 2654d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2655d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2656d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2657a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2658a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2659a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2660d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2661d27a0f52SMatthew G. Knepley } 2662d27a0f52SMatthew G. Knepley 2663d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2664895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2665895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2666895b8c46SMatthew G. Knepley { 2667895b8c46SMatthew G. Knepley int tmpc; 2668895b8c46SMatthew G. Knepley 2669895b8c46SMatthew G. Knepley PetscFunctionBegin; 2670895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2671895b8c46SMatthew G. Knepley switch (numCorners) { 2672895b8c46SMatthew G. Knepley case 4: 2673895b8c46SMatthew G. Knepley tmpc = cone[0]; 2674895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2675895b8c46SMatthew G. Knepley cone[1] = tmpc; 2676895b8c46SMatthew G. Knepley break; 2677895b8c46SMatthew G. Knepley case 8: 2678895b8c46SMatthew G. Knepley tmpc = cone[1]; 2679895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2680895b8c46SMatthew G. Knepley cone[3] = tmpc; 2681895b8c46SMatthew G. Knepley break; 2682895b8c46SMatthew G. Knepley default: break; 2683895b8c46SMatthew G. Knepley } 2684895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2685895b8c46SMatthew G. Knepley } 2686895b8c46SMatthew G. Knepley 2687895b8c46SMatthew G. Knepley #undef __FUNCT__ 26889db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26899db3b87dSMatthew G. Knepley /*@C 26909db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26919db3b87dSMatthew G. Knepley 26929db3b87dSMatthew G. Knepley Input Parameters: 26939db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26949db3b87dSMatthew G. Knepley - cone - The incoming cone 26959db3b87dSMatthew G. Knepley 26969db3b87dSMatthew G. Knepley Output Parameter: 26979db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26989db3b87dSMatthew G. Knepley 26999db3b87dSMatthew G. Knepley Level: developer 27009db3b87dSMatthew G. Knepley 27019db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 27029db3b87dSMatthew G. Knepley @*/ 27039db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 27042e1b13c2SMatthew G. Knepley { 27059db3b87dSMatthew G. Knepley int tmpc; 27062e1b13c2SMatthew G. Knepley 27072e1b13c2SMatthew G. Knepley PetscFunctionBegin; 27089db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 27099db3b87dSMatthew G. Knepley switch (numCorners) { 27109db3b87dSMatthew G. Knepley case 4: 27111885f254SMatthew G. Knepley tmpc = cone[0]; 27121885f254SMatthew G. Knepley cone[0] = cone[1]; 27131885f254SMatthew G. Knepley cone[1] = tmpc; 27149db3b87dSMatthew G. Knepley break; 27159db3b87dSMatthew G. Knepley case 8: 27169db3b87dSMatthew G. Knepley tmpc = cone[1]; 27179db3b87dSMatthew G. Knepley cone[1] = cone[3]; 27189db3b87dSMatthew G. Knepley cone[3] = tmpc; 27199db3b87dSMatthew G. Knepley break; 27209db3b87dSMatthew G. Knepley default: break; 27219db3b87dSMatthew G. Knepley } 27229db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 27239db3b87dSMatthew G. Knepley } 27249db3b87dSMatthew G. Knepley 27259db3b87dSMatthew G. Knepley #undef __FUNCT__ 27269db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 27279db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 27289db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 27299db3b87dSMatthew G. Knepley { 27309db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 27319db3b87dSMatthew G. Knepley PetscErrorCode ierr; 27329db3b87dSMatthew G. Knepley 27339db3b87dSMatthew G. Knepley PetscFunctionBegin; 27349db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 27359db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 27362e1b13c2SMatthew G. Knepley } 27372e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 27382e1b13c2SMatthew G. Knepley } 27392e1b13c2SMatthew G. Knepley 2740519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2741552f7358SJed Brown #include <triangle.h> 2742552f7358SJed Brown 2743552f7358SJed Brown #undef __FUNCT__ 2744552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 27450adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 27460adebc6cSBarry Smith { 2747552f7358SJed Brown PetscFunctionBegin; 2748552f7358SJed Brown inputCtx->numberofpoints = 0; 2749552f7358SJed Brown inputCtx->numberofpointattributes = 0; 27500298fd71SBarry Smith inputCtx->pointlist = NULL; 27510298fd71SBarry Smith inputCtx->pointattributelist = NULL; 27520298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2753552f7358SJed Brown inputCtx->numberofsegments = 0; 27540298fd71SBarry Smith inputCtx->segmentlist = NULL; 27550298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2756552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27570298fd71SBarry Smith inputCtx->trianglelist = NULL; 2758552f7358SJed Brown inputCtx->numberofholes = 0; 27590298fd71SBarry Smith inputCtx->holelist = NULL; 2760552f7358SJed Brown inputCtx->numberofregions = 0; 27610298fd71SBarry Smith inputCtx->regionlist = NULL; 2762552f7358SJed Brown PetscFunctionReturn(0); 2763552f7358SJed Brown } 2764552f7358SJed Brown 2765552f7358SJed Brown #undef __FUNCT__ 2766552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27670adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27680adebc6cSBarry Smith { 2769552f7358SJed Brown PetscFunctionBegin; 2770552f7358SJed Brown outputCtx->numberofpoints = 0; 27710298fd71SBarry Smith outputCtx->pointlist = NULL; 27720298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27730298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2774552f7358SJed Brown outputCtx->numberoftriangles = 0; 27750298fd71SBarry Smith outputCtx->trianglelist = NULL; 27760298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27770298fd71SBarry Smith outputCtx->neighborlist = NULL; 27780298fd71SBarry Smith outputCtx->segmentlist = NULL; 27790298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2780552f7358SJed Brown outputCtx->numberofedges = 0; 27810298fd71SBarry Smith outputCtx->edgelist = NULL; 27820298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2783552f7358SJed Brown PetscFunctionReturn(0); 2784552f7358SJed Brown } 2785552f7358SJed Brown 2786552f7358SJed Brown #undef __FUNCT__ 2787552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27880adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27890adebc6cSBarry Smith { 2790552f7358SJed Brown PetscFunctionBegin; 279123b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2792552f7358SJed Brown free(outputCtx->pointmarkerlist); 279323b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 279423b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2795552f7358SJed Brown free(outputCtx->edgelist); 2796552f7358SJed Brown free(outputCtx->edgemarkerlist); 2797552f7358SJed Brown free(outputCtx->trianglelist); 2798552f7358SJed Brown free(outputCtx->neighborlist); 2799552f7358SJed Brown PetscFunctionReturn(0); 2800552f7358SJed Brown } 2801552f7358SJed Brown 2802552f7358SJed Brown #undef __FUNCT__ 2803552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2804552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2805552f7358SJed Brown { 280682f516ccSBarry Smith MPI_Comm comm; 2807552f7358SJed Brown PetscInt dim = 2; 2808552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2809552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2810552f7358SJed Brown struct triangulateio in; 2811552f7358SJed Brown struct triangulateio out; 2812552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2813552f7358SJed Brown PetscMPIInt rank; 2814552f7358SJed Brown PetscErrorCode ierr; 2815552f7358SJed Brown 2816552f7358SJed Brown PetscFunctionBegin; 281782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2818552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2819552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2820552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2821552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 28220d644c17SKarl Rupp 2823552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2824552f7358SJed Brown if (in.numberofpoints > 0) { 2825552f7358SJed Brown PetscSection coordSection; 2826552f7358SJed Brown Vec coordinates; 2827552f7358SJed Brown PetscScalar *array; 2828552f7358SJed Brown 2829785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2830785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2831552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 283269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2833552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2834552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2835552f7358SJed Brown const PetscInt idx = v - vStart; 2836552f7358SJed Brown PetscInt off, d; 2837552f7358SJed Brown 2838552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2839552f7358SJed Brown for (d = 0; d < dim; ++d) { 2840552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2841552f7358SJed Brown } 2842552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2843552f7358SJed Brown } 2844552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2845552f7358SJed Brown } 2846552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2847552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2848552f7358SJed Brown if (in.numberofsegments > 0) { 2849785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2850785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2851552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2852552f7358SJed Brown const PetscInt idx = e - eStart; 2853552f7358SJed Brown const PetscInt *cone; 2854552f7358SJed Brown 2855552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28560d644c17SKarl Rupp 2857552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2858552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28590d644c17SKarl Rupp 2860552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2861552f7358SJed Brown } 2862552f7358SJed Brown } 2863552f7358SJed Brown #if 0 /* Do not currently support holes */ 2864552f7358SJed Brown PetscReal *holeCoords; 2865552f7358SJed Brown PetscInt h, d; 2866552f7358SJed Brown 2867552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2868552f7358SJed Brown if (in.numberofholes > 0) { 2869785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2870552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2871552f7358SJed Brown for (d = 0; d < dim; ++d) { 2872552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2873552f7358SJed Brown } 2874552f7358SJed Brown } 2875552f7358SJed Brown } 2876552f7358SJed Brown #endif 2877552f7358SJed Brown if (!rank) { 2878552f7358SJed Brown char args[32]; 2879552f7358SJed Brown 2880552f7358SJed Brown /* Take away 'Q' for verbose output */ 2881552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2882552f7358SJed Brown if (createConvexHull) { 2883552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2884552f7358SJed Brown } 2885552f7358SJed Brown if (constrained) { 2886552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2887552f7358SJed Brown } 28880298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2889552f7358SJed Brown } 2890552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2891552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2892552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2893552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2894552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2895552f7358SJed Brown 2896552f7358SJed Brown { 2897552f7358SJed Brown const PetscInt numCorners = 3; 2898552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2899552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2900552f7358SJed Brown const int *cells = out.trianglelist; 2901552f7358SJed Brown const double *meshCoords = out.pointlist; 2902552f7358SJed Brown 29030fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2904552f7358SJed Brown /* Set labels */ 2905552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2906552f7358SJed Brown if (out.pointmarkerlist[v]) { 2907552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2908552f7358SJed Brown } 2909552f7358SJed Brown } 2910552f7358SJed Brown if (interpolate) { 2911552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2912552f7358SJed Brown if (out.edgemarkerlist[e]) { 2913552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2914552f7358SJed Brown const PetscInt *edges; 2915552f7358SJed Brown PetscInt numEdges; 2916552f7358SJed Brown 2917552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2918552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2919552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2920552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2921552f7358SJed Brown } 2922552f7358SJed Brown } 2923552f7358SJed Brown } 2924552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2925552f7358SJed Brown } 2926552f7358SJed Brown #if 0 /* Do not currently support holes */ 2927552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2928552f7358SJed Brown #endif 2929552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2930552f7358SJed Brown PetscFunctionReturn(0); 2931552f7358SJed Brown } 2932552f7358SJed Brown 2933552f7358SJed Brown #undef __FUNCT__ 2934552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2935552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2936552f7358SJed Brown { 293782f516ccSBarry Smith MPI_Comm comm; 2938552f7358SJed Brown PetscInt dim = 2; 2939552f7358SJed Brown struct triangulateio in; 2940552f7358SJed Brown struct triangulateio out; 2941552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2942552f7358SJed Brown PetscMPIInt rank; 2943552f7358SJed Brown PetscErrorCode ierr; 2944552f7358SJed Brown 2945552f7358SJed Brown PetscFunctionBegin; 294682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2947552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2948552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2949552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2950552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2951552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2952552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29530d644c17SKarl Rupp 2954552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2955552f7358SJed Brown if (in.numberofpoints > 0) { 2956552f7358SJed Brown PetscSection coordSection; 2957552f7358SJed Brown Vec coordinates; 2958552f7358SJed Brown PetscScalar *array; 2959552f7358SJed Brown 2960785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2961785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2962552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 296369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2964552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2965552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2966552f7358SJed Brown const PetscInt idx = v - vStart; 2967552f7358SJed Brown PetscInt off, d; 2968552f7358SJed Brown 2969552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2970552f7358SJed Brown for (d = 0; d < dim; ++d) { 2971552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2972552f7358SJed Brown } 2973552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2974552f7358SJed Brown } 2975552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2976552f7358SJed Brown } 2977552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29780d644c17SKarl Rupp 2979552f7358SJed Brown in.numberofcorners = 3; 2980552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29810d644c17SKarl Rupp 2982552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2983552f7358SJed Brown if (in.numberoftriangles > 0) { 2984785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2985552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2986552f7358SJed Brown const PetscInt idx = c - cStart; 29870298fd71SBarry Smith PetscInt *closure = NULL; 2988552f7358SJed Brown PetscInt closureSize; 2989552f7358SJed Brown 2990552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2991552f7358SJed 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); 2992552f7358SJed Brown for (v = 0; v < 3; ++v) { 2993552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2994552f7358SJed Brown } 2995552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2996552f7358SJed Brown } 2997552f7358SJed Brown } 2998552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2999552f7358SJed Brown #if 0 /* Do not currently support holes */ 3000552f7358SJed Brown PetscReal *holeCoords; 3001552f7358SJed Brown PetscInt h, d; 3002552f7358SJed Brown 3003552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3004552f7358SJed Brown if (in.numberofholes > 0) { 3005785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3006552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3007552f7358SJed Brown for (d = 0; d < dim; ++d) { 3008552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3009552f7358SJed Brown } 3010552f7358SJed Brown } 3011552f7358SJed Brown } 3012552f7358SJed Brown #endif 3013552f7358SJed Brown if (!rank) { 3014552f7358SJed Brown char args[32]; 3015552f7358SJed Brown 3016552f7358SJed Brown /* Take away 'Q' for verbose output */ 3017552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 30180298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3019552f7358SJed Brown } 3020552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3021552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3022552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3023552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3024552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3025552f7358SJed Brown 3026552f7358SJed Brown { 3027552f7358SJed Brown const PetscInt numCorners = 3; 3028552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3029552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3030552f7358SJed Brown const int *cells = out.trianglelist; 3031552f7358SJed Brown const double *meshCoords = out.pointlist; 3032552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3033552f7358SJed Brown 30340fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3035552f7358SJed Brown /* Set labels */ 3036552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3037552f7358SJed Brown if (out.pointmarkerlist[v]) { 3038552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3039552f7358SJed Brown } 3040552f7358SJed Brown } 3041552f7358SJed Brown if (interpolate) { 3042552f7358SJed Brown PetscInt e; 3043552f7358SJed Brown 3044552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3045552f7358SJed Brown if (out.edgemarkerlist[e]) { 3046552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3047552f7358SJed Brown const PetscInt *edges; 3048552f7358SJed Brown PetscInt numEdges; 3049552f7358SJed Brown 3050552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3051552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3052552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3053552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3054552f7358SJed Brown } 3055552f7358SJed Brown } 3056552f7358SJed Brown } 3057552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3058552f7358SJed Brown } 3059552f7358SJed Brown #if 0 /* Do not currently support holes */ 3060552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3061552f7358SJed Brown #endif 3062552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3063552f7358SJed Brown PetscFunctionReturn(0); 3064552f7358SJed Brown } 3065552f7358SJed Brown #endif 3066552f7358SJed Brown 3067519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3068552f7358SJed Brown #include <tetgen.h> 3069552f7358SJed Brown #undef __FUNCT__ 3070552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3071552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3072552f7358SJed Brown { 307382f516ccSBarry Smith MPI_Comm comm; 3074552f7358SJed Brown const PetscInt dim = 3; 3075552f7358SJed Brown ::tetgenio in; 3076552f7358SJed Brown ::tetgenio out; 3077552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3078552f7358SJed Brown PetscMPIInt rank; 3079552f7358SJed Brown PetscErrorCode ierr; 3080552f7358SJed Brown 3081552f7358SJed Brown PetscFunctionBegin; 308282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3083552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3084552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3085552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3086552f7358SJed Brown if (in.numberofpoints > 0) { 3087552f7358SJed Brown PetscSection coordSection; 3088552f7358SJed Brown Vec coordinates; 3089552f7358SJed Brown PetscScalar *array; 3090552f7358SJed Brown 3091552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3092552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30930d644c17SKarl Rupp 3094552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 309569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3096552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3097552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3098552f7358SJed Brown const PetscInt idx = v - vStart; 3099552f7358SJed Brown PetscInt off, d; 3100552f7358SJed Brown 3101552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 31020d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3103552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3104552f7358SJed Brown } 3105552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3106552f7358SJed Brown } 3107552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 31080d644c17SKarl Rupp 3109552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3110552f7358SJed Brown if (in.numberoffacets > 0) { 3111552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3112552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3113552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3114552f7358SJed Brown const PetscInt idx = f - fStart; 31150298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3116552f7358SJed Brown 3117552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3118552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3119552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3120552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3121552f7358SJed Brown 3122552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3123552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3124552f7358SJed Brown const PetscInt point = points[p]; 31250d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3126552f7358SJed Brown } 3127552f7358SJed Brown 3128552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3129552f7358SJed Brown poly->numberofvertices = numVertices; 3130552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3131552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3132552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3133552f7358SJed Brown poly->vertexlist[v] = vIdx; 3134552f7358SJed Brown } 3135552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3136552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3137552f7358SJed Brown } 3138552f7358SJed Brown } 3139552f7358SJed Brown if (!rank) { 3140552f7358SJed Brown char args[32]; 3141552f7358SJed Brown 3142552f7358SJed Brown /* Take away 'Q' for verbose output */ 3143552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3144552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3145552f7358SJed Brown } 3146552f7358SJed Brown { 3147552f7358SJed Brown const PetscInt numCorners = 4; 3148552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3149552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3150552f7358SJed Brown const double *meshCoords = out.pointlist; 31511d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3152552f7358SJed Brown 31539db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31540fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3155552f7358SJed Brown /* Set labels */ 3156552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3157552f7358SJed Brown if (out.pointmarkerlist[v]) { 3158552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3159552f7358SJed Brown } 3160552f7358SJed Brown } 3161552f7358SJed Brown if (interpolate) { 3162552f7358SJed Brown PetscInt e; 3163552f7358SJed Brown 3164552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3165552f7358SJed Brown if (out.edgemarkerlist[e]) { 3166552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3167552f7358SJed Brown const PetscInt *edges; 3168552f7358SJed Brown PetscInt numEdges; 3169552f7358SJed Brown 3170552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3171552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3172552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3173552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3174552f7358SJed Brown } 3175552f7358SJed Brown } 3176552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3177552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3178552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3179552f7358SJed Brown const PetscInt *faces; 3180552f7358SJed Brown PetscInt numFaces; 3181552f7358SJed Brown 3182552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3183552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3184552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3185552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3186552f7358SJed Brown } 3187552f7358SJed Brown } 3188552f7358SJed Brown } 3189552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3190552f7358SJed Brown } 3191552f7358SJed Brown PetscFunctionReturn(0); 3192552f7358SJed Brown } 3193552f7358SJed Brown 3194552f7358SJed Brown #undef __FUNCT__ 3195552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3196552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3197552f7358SJed Brown { 319882f516ccSBarry Smith MPI_Comm comm; 3199552f7358SJed Brown const PetscInt dim = 3; 3200552f7358SJed Brown ::tetgenio in; 3201552f7358SJed Brown ::tetgenio out; 3202552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3203552f7358SJed Brown PetscMPIInt rank; 3204552f7358SJed Brown PetscErrorCode ierr; 3205552f7358SJed Brown 3206552f7358SJed Brown PetscFunctionBegin; 320782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3208552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3209552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3210552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3211552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 32120d644c17SKarl Rupp 3213552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3214552f7358SJed Brown if (in.numberofpoints > 0) { 3215552f7358SJed Brown PetscSection coordSection; 3216552f7358SJed Brown Vec coordinates; 3217552f7358SJed Brown PetscScalar *array; 3218552f7358SJed Brown 3219552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3220552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 32210d644c17SKarl Rupp 3222552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 322369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3224552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3225552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3226552f7358SJed Brown const PetscInt idx = v - vStart; 3227552f7358SJed Brown PetscInt off, d; 3228552f7358SJed Brown 3229552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 32300d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3231552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3232552f7358SJed Brown } 3233552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3234552f7358SJed Brown } 3235552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 32360d644c17SKarl Rupp 3237552f7358SJed Brown in.numberofcorners = 4; 3238552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3239552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3240552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3241552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3242552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3243552f7358SJed Brown const PetscInt idx = c - cStart; 32440298fd71SBarry Smith PetscInt *closure = NULL; 3245552f7358SJed Brown PetscInt closureSize; 3246552f7358SJed Brown 3247552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3248552f7358SJed 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); 3249552f7358SJed Brown for (v = 0; v < 4; ++v) { 3250552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3251552f7358SJed Brown } 3252552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3253552f7358SJed Brown } 3254552f7358SJed Brown } 325519436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3256552f7358SJed Brown if (!rank) { 3257552f7358SJed Brown char args[32]; 3258552f7358SJed Brown 3259552f7358SJed Brown /* Take away 'Q' for verbose output */ 326019436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3261552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3262552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3263552f7358SJed Brown } 3264552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3265552f7358SJed Brown 3266552f7358SJed Brown { 3267552f7358SJed Brown const PetscInt numCorners = 4; 3268552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3269552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3270552f7358SJed Brown const double *meshCoords = out.pointlist; 32711d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32721d4b4d7bSJed Brown 3273552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3274552f7358SJed Brown 32759db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32760fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3277552f7358SJed Brown /* Set labels */ 3278552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3279552f7358SJed Brown if (out.pointmarkerlist[v]) { 3280552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3281552f7358SJed Brown } 3282552f7358SJed Brown } 3283552f7358SJed Brown if (interpolate) { 3284552f7358SJed Brown PetscInt e, f; 3285552f7358SJed Brown 3286552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3287552f7358SJed Brown if (out.edgemarkerlist[e]) { 3288552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3289552f7358SJed Brown const PetscInt *edges; 3290552f7358SJed Brown PetscInt numEdges; 3291552f7358SJed Brown 3292552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3293552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3294552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3295552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3296552f7358SJed Brown } 3297552f7358SJed Brown } 3298552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3299552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3300552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3301552f7358SJed Brown const PetscInt *faces; 3302552f7358SJed Brown PetscInt numFaces; 3303552f7358SJed Brown 3304552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3305552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3306552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3307552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3308552f7358SJed Brown } 3309552f7358SJed Brown } 3310552f7358SJed Brown } 3311552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3312552f7358SJed Brown } 3313552f7358SJed Brown PetscFunctionReturn(0); 3314552f7358SJed Brown } 3315552f7358SJed Brown #endif 3316552f7358SJed Brown 3317519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3318aaa7dc30SBarry Smith #include <ctetgen.h> 3319552f7358SJed Brown 3320552f7358SJed Brown #undef __FUNCT__ 3321552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3322552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3323552f7358SJed Brown { 332482f516ccSBarry Smith MPI_Comm comm; 3325552f7358SJed Brown const PetscInt dim = 3; 3326552f7358SJed Brown PLC *in, *out; 3327552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3328552f7358SJed Brown PetscMPIInt rank; 3329552f7358SJed Brown PetscErrorCode ierr; 3330552f7358SJed Brown 3331552f7358SJed Brown PetscFunctionBegin; 333282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 33330298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3334552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3335552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3336552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3337552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 33380d644c17SKarl Rupp 3339552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3340552f7358SJed Brown if (in->numberofpoints > 0) { 3341552f7358SJed Brown PetscSection coordSection; 3342552f7358SJed Brown Vec coordinates; 3343552f7358SJed Brown PetscScalar *array; 3344552f7358SJed Brown 3345785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3346785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3347552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 334869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3349552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3350552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3351552f7358SJed Brown const PetscInt idx = v - vStart; 3352552f7358SJed Brown PetscInt off, d, m; 3353552f7358SJed Brown 3354552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3355552f7358SJed Brown for (d = 0; d < dim; ++d) { 3356552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3357552f7358SJed Brown } 3358552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33590d644c17SKarl Rupp 3360552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3361552f7358SJed Brown } 3362552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3363552f7358SJed Brown } 3364552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33650d644c17SKarl Rupp 3366552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3367552f7358SJed Brown if (in->numberoffacets > 0) { 3368785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3369785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3370552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3371552f7358SJed Brown const PetscInt idx = f - fStart; 33720298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3373552f7358SJed Brown polygon *poly; 3374552f7358SJed Brown 3375552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33760d644c17SKarl Rupp 3377785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33780d644c17SKarl Rupp 3379552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33800298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3381552f7358SJed Brown 3382552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3383552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3384552f7358SJed Brown const PetscInt point = points[p]; 33850d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3386552f7358SJed Brown } 3387552f7358SJed Brown 3388552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3389552f7358SJed Brown poly->numberofvertices = numVertices; 3390785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3391552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3392552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3393552f7358SJed Brown poly->vertexlist[v] = vIdx; 3394552f7358SJed Brown } 3395552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3396552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3397552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3398552f7358SJed Brown } 3399552f7358SJed Brown } 3400552f7358SJed Brown if (!rank) { 3401552f7358SJed Brown TetGenOpts t; 3402552f7358SJed Brown 3403552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3404552f7358SJed Brown t.in = boundary; /* Should go away */ 3405552f7358SJed Brown t.plc = 1; 3406552f7358SJed Brown t.quality = 1; 3407552f7358SJed Brown t.edgesout = 1; 3408552f7358SJed Brown t.zeroindex = 1; 3409552f7358SJed Brown t.quiet = 1; 3410552f7358SJed Brown t.verbose = verbose; 3411552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3412552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3413552f7358SJed Brown } 3414552f7358SJed Brown { 3415552f7358SJed Brown const PetscInt numCorners = 4; 3416552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3417552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3418552f7358SJed Brown const double *meshCoords = out->pointlist; 34191d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3420552f7358SJed Brown 34219db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 34220fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3423552f7358SJed Brown /* Set labels */ 3424552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3425552f7358SJed Brown if (out->pointmarkerlist[v]) { 3426552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3427552f7358SJed Brown } 3428552f7358SJed Brown } 3429552f7358SJed Brown if (interpolate) { 3430552f7358SJed Brown PetscInt e; 3431552f7358SJed Brown 3432552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3433552f7358SJed Brown if (out->edgemarkerlist[e]) { 3434552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3435552f7358SJed Brown const PetscInt *edges; 3436552f7358SJed Brown PetscInt numEdges; 3437552f7358SJed Brown 3438552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3439552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3440552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3441552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3442552f7358SJed Brown } 3443552f7358SJed Brown } 3444552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3445552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3446552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3447552f7358SJed Brown const PetscInt *faces; 3448552f7358SJed Brown PetscInt numFaces; 3449552f7358SJed Brown 3450552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3451552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3452552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3453552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3454552f7358SJed Brown } 3455552f7358SJed Brown } 3456552f7358SJed Brown } 3457552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3458552f7358SJed Brown } 3459552f7358SJed Brown 3460552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3461552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3462552f7358SJed Brown PetscFunctionReturn(0); 3463552f7358SJed Brown } 3464552f7358SJed Brown 3465552f7358SJed Brown #undef __FUNCT__ 3466552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3467552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3468552f7358SJed Brown { 346982f516ccSBarry Smith MPI_Comm comm; 3470552f7358SJed Brown const PetscInt dim = 3; 3471552f7358SJed Brown PLC *in, *out; 3472552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3473552f7358SJed Brown PetscMPIInt rank; 3474552f7358SJed Brown PetscErrorCode ierr; 3475552f7358SJed Brown 3476552f7358SJed Brown PetscFunctionBegin; 347782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34780298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3479552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3480552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3481552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3482552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3483552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3484552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34850d644c17SKarl Rupp 3486552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3487552f7358SJed Brown if (in->numberofpoints > 0) { 3488552f7358SJed Brown PetscSection coordSection; 3489552f7358SJed Brown Vec coordinates; 3490552f7358SJed Brown PetscScalar *array; 3491552f7358SJed Brown 3492785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3493785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3494552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 349569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3496552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3497552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3498552f7358SJed Brown const PetscInt idx = v - vStart; 3499552f7358SJed Brown PetscInt off, d, m; 3500552f7358SJed Brown 3501552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3502552f7358SJed Brown for (d = 0; d < dim; ++d) { 3503552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3504552f7358SJed Brown } 3505552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 35060d644c17SKarl Rupp 3507552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3508552f7358SJed Brown } 3509552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3510552f7358SJed Brown } 3511552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 35120d644c17SKarl Rupp 3513552f7358SJed Brown in->numberofcorners = 4; 3514552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3515552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3516552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3517785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3518552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3519552f7358SJed Brown const PetscInt idx = c - cStart; 35200298fd71SBarry Smith PetscInt *closure = NULL; 3521552f7358SJed Brown PetscInt closureSize; 3522552f7358SJed Brown 3523552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3524552f7358SJed 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); 3525552f7358SJed Brown for (v = 0; v < 4; ++v) { 3526552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3527552f7358SJed Brown } 3528552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3529552f7358SJed Brown } 3530552f7358SJed Brown } 3531552f7358SJed Brown if (!rank) { 3532552f7358SJed Brown TetGenOpts t; 3533552f7358SJed Brown 3534552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 35350d644c17SKarl Rupp 3536552f7358SJed Brown t.in = dm; /* Should go away */ 3537552f7358SJed Brown t.refine = 1; 3538552f7358SJed Brown t.varvolume = 1; 3539552f7358SJed Brown t.quality = 1; 3540552f7358SJed Brown t.edgesout = 1; 3541552f7358SJed Brown t.zeroindex = 1; 3542552f7358SJed Brown t.quiet = 1; 3543552f7358SJed Brown t.verbose = verbose; /* Change this */ 35440d644c17SKarl Rupp 3545552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3546552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3547552f7358SJed Brown } 3548552f7358SJed Brown { 3549552f7358SJed Brown const PetscInt numCorners = 4; 3550552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3551552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3552552f7358SJed Brown const double *meshCoords = out->pointlist; 35531d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3554552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3555552f7358SJed Brown 35569db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35570fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3558552f7358SJed Brown /* Set labels */ 3559552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3560552f7358SJed Brown if (out->pointmarkerlist[v]) { 3561552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3562552f7358SJed Brown } 3563552f7358SJed Brown } 3564552f7358SJed Brown if (interpolate) { 3565552f7358SJed Brown PetscInt e, f; 3566552f7358SJed Brown 3567552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3568552f7358SJed Brown if (out->edgemarkerlist[e]) { 3569552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3570552f7358SJed Brown const PetscInt *edges; 3571552f7358SJed Brown PetscInt numEdges; 3572552f7358SJed Brown 3573552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3574552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3575552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3576552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3577552f7358SJed Brown } 3578552f7358SJed Brown } 3579552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3580552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3581552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3582552f7358SJed Brown const PetscInt *faces; 3583552f7358SJed Brown PetscInt numFaces; 3584552f7358SJed Brown 3585552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3586552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3587552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3588552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3589552f7358SJed Brown } 3590552f7358SJed Brown } 3591552f7358SJed Brown } 3592552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3593552f7358SJed Brown } 3594552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3595552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3596552f7358SJed Brown PetscFunctionReturn(0); 3597552f7358SJed Brown } 3598552f7358SJed Brown #endif 3599552f7358SJed Brown 3600552f7358SJed Brown #undef __FUNCT__ 3601552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3602552f7358SJed Brown /*@C 3603552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3604552f7358SJed Brown 3605552f7358SJed Brown Not Collective 3606552f7358SJed Brown 3607552f7358SJed Brown Input Parameters: 3608552f7358SJed Brown + boundary - The DMPlex boundary object 3609552f7358SJed Brown . name - The mesh generation package name 3610552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3611552f7358SJed Brown 3612552f7358SJed Brown Output Parameter: 3613552f7358SJed Brown . mesh - The DMPlex object 3614552f7358SJed Brown 3615552f7358SJed Brown Level: intermediate 3616552f7358SJed Brown 3617552f7358SJed Brown .keywords: mesh, elements 3618552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3619552f7358SJed Brown @*/ 3620552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3621552f7358SJed Brown { 3622552f7358SJed Brown PetscInt dim; 3623552f7358SJed Brown char genname[1024]; 3624552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3625552f7358SJed Brown PetscErrorCode ierr; 3626552f7358SJed Brown 3627552f7358SJed Brown PetscFunctionBegin; 3628552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3629552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3630552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 3631552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36320d644c17SKarl Rupp if (flg) name = genname; 3633552f7358SJed Brown if (name) { 3634552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3635552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3636552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3637552f7358SJed Brown } 3638552f7358SJed Brown switch (dim) { 3639552f7358SJed Brown case 1: 3640552f7358SJed Brown if (!name || isTriangle) { 3641519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3642552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3643552f7358SJed Brown #else 364482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3645552f7358SJed Brown #endif 364682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3647552f7358SJed Brown break; 3648552f7358SJed Brown case 2: 3649552f7358SJed Brown if (!name || isCTetgen) { 3650519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3651552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3652552f7358SJed Brown #else 365382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3654552f7358SJed Brown #endif 3655552f7358SJed Brown } else if (isTetgen) { 3656519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3657552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3658552f7358SJed Brown #else 365982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3660552f7358SJed Brown #endif 366182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3662552f7358SJed Brown break; 3663552f7358SJed Brown default: 366482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3665552f7358SJed Brown } 3666552f7358SJed Brown PetscFunctionReturn(0); 3667552f7358SJed Brown } 3668552f7358SJed Brown 3669552f7358SJed Brown #undef __FUNCT__ 3670552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3671552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3672552f7358SJed Brown { 3673552f7358SJed Brown PetscReal refinementLimit; 3674552f7358SJed Brown PetscInt dim, cStart, cEnd; 36750298fd71SBarry Smith char genname[1024], *name = NULL; 3676552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3677552f7358SJed Brown PetscErrorCode ierr; 3678552f7358SJed Brown 3679552f7358SJed Brown PetscFunctionBegin; 3680552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3681552f7358SJed Brown if (isUniform) { 3682552f7358SJed Brown CellRefiner cellRefiner; 3683552f7358SJed Brown 3684509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3685509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 36868e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3687552f7358SJed Brown PetscFunctionReturn(0); 3688552f7358SJed Brown } 3689552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3690552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3691552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3692552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3693552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36940d644c17SKarl Rupp if (flg) name = genname; 3695552f7358SJed Brown if (name) { 3696552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3697552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3698552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3699552f7358SJed Brown } 3700552f7358SJed Brown switch (dim) { 3701552f7358SJed Brown case 2: 3702552f7358SJed Brown if (!name || isTriangle) { 3703519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3704552f7358SJed Brown double *maxVolumes; 3705552f7358SJed Brown PetscInt c; 3706552f7358SJed Brown 3707785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 37080d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3709552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 37106b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3711552f7358SJed Brown #else 371282f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3713552f7358SJed Brown #endif 371482f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3715552f7358SJed Brown break; 3716552f7358SJed Brown case 3: 3717552f7358SJed Brown if (!name || isCTetgen) { 3718519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3719552f7358SJed Brown PetscReal *maxVolumes; 3720552f7358SJed Brown PetscInt c; 3721552f7358SJed Brown 3722785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 37230d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3724552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3725552f7358SJed Brown #else 372682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3727552f7358SJed Brown #endif 3728552f7358SJed Brown } else if (isTetgen) { 3729519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3730552f7358SJed Brown double *maxVolumes; 3731552f7358SJed Brown PetscInt c; 3732552f7358SJed Brown 3733785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 37340d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3735552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3736552f7358SJed Brown #else 373782f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3738552f7358SJed Brown #endif 373982f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3740552f7358SJed Brown break; 3741552f7358SJed Brown default: 374282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3743552f7358SJed Brown } 37448e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3745552f7358SJed Brown PetscFunctionReturn(0); 3746552f7358SJed Brown } 3747552f7358SJed Brown 3748552f7358SJed Brown #undef __FUNCT__ 37490a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 37500a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 37510a6ba040SMatthew G. Knepley { 37520a6ba040SMatthew G. Knepley DM cdm = dm; 37530a6ba040SMatthew G. Knepley PetscInt r; 37540a6ba040SMatthew G. Knepley PetscBool isUniform; 37550a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37560a6ba040SMatthew G. Knepley 37570a6ba040SMatthew G. Knepley PetscFunctionBegin; 37580a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37590a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37600a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37610a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37620a6ba040SMatthew G. Knepley 37630a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37640a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37650a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37660a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37670a6ba040SMatthew G. Knepley } 37680a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37690a6ba040SMatthew G. Knepley } 37700a6ba040SMatthew G. Knepley 37710a6ba040SMatthew G. Knepley #undef __FUNCT__ 37720a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37730a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37740a6ba040SMatthew G. Knepley { 37750a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3776549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37770a6ba040SMatthew G. Knepley 37780a6ba040SMatthew G. Knepley PetscFunctionBegin; 3779549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37800a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37810a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37820a6ba040SMatthew G. Knepley } 37830a6ba040SMatthew G. Knepley 37840a6ba040SMatthew G. Knepley #undef __FUNCT__ 3785d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3786d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3787d49fcaecSMatthew G. Knepley { 3788d49fcaecSMatthew G. Knepley PetscInt d; 3789d49fcaecSMatthew G. Knepley 3790d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3791d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3792d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3793d49fcaecSMatthew G. Knepley } else { 3794d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3795d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3796858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3797d49fcaecSMatthew G. Knepley } else { 3798d49fcaecSMatthew G. Knepley out[d] = in[d]; 3799d49fcaecSMatthew G. Knepley } 3800d49fcaecSMatthew G. Knepley } 3801d49fcaecSMatthew G. Knepley } 3802d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3803d49fcaecSMatthew G. Knepley } 3804d49fcaecSMatthew G. Knepley 3805d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3806d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3807d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3808d49fcaecSMatthew G. Knepley { 3809d49fcaecSMatthew G. Knepley PetscInt d; 3810d49fcaecSMatthew G. Knepley 3811d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3812d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3813d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3814d49fcaecSMatthew G. Knepley } else { 3815d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3816d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3817858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3818d49fcaecSMatthew G. Knepley } else { 3819d49fcaecSMatthew G. Knepley out[d] += in[d]; 3820d49fcaecSMatthew G. Knepley } 3821d49fcaecSMatthew G. Knepley } 3822d49fcaecSMatthew G. Knepley } 3823d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3824d49fcaecSMatthew G. Knepley } 3825d49fcaecSMatthew G. Knepley 3826d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3827d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3828d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3829d49fcaecSMatthew G. Knepley { 3830d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3831d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3832d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 38338c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3834d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3835d49fcaecSMatthew G. Knepley 3836d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3837d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3838d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3839d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3840d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3841d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3842d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3843d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 38448c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 38458c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 38468c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 3847d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3848d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3849d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3850d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 38518c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 3852d49fcaecSMatthew G. Knepley } 3853d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3854d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3855d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 38568c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 3857d49fcaecSMatthew G. Knepley } 3858d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3859d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3860d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3861d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3862d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3863d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3864d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3865d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3866d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3867d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3868d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3869d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3870d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3871d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3872d49fcaecSMatthew G. Knepley } 3873d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3874d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3875d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3876d49fcaecSMatthew G. Knepley PetscInt b; 3877d49fcaecSMatthew G. Knepley 3878d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3879d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3880d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3881d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3882d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3883d49fcaecSMatthew G. Knepley } 3884d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3885d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3886d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 3887d49fcaecSMatthew G. Knepley ierr = DMSetCoordinateSection(dm, cSection);CHKERRQ(ierr); 3888d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3889d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3890d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3891d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3892d49fcaecSMatthew G. Knepley } 3893d49fcaecSMatthew G. Knepley 3894d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3895aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3896552f7358SJed Brown /*@ 3897aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3898552f7358SJed Brown 3899552f7358SJed Brown Not Collective 3900552f7358SJed Brown 3901aa50250dSMatthew G. Knepley Input Parameter: 3902552f7358SJed Brown . dm - The DMPlex object 3903552f7358SJed Brown 3904aa50250dSMatthew G. Knepley Output Parameter: 3905aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3906552f7358SJed Brown 3907552f7358SJed Brown Level: developer 3908552f7358SJed Brown 3909aa50250dSMatthew G. Knepley .keywords: mesh, points 3910aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3911aa50250dSMatthew G. Knepley @*/ 3912aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3913aa50250dSMatthew G. Knepley { 3914aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3915aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3916aa50250dSMatthew G. Knepley 3917aa50250dSMatthew G. Knepley PetscFunctionBegin; 3918aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3919aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 392063d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3921aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3922aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3923aa50250dSMatthew G. Knepley } 3924aa50250dSMatthew G. Knepley 3925aa50250dSMatthew G. Knepley #undef __FUNCT__ 3926aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3927aa50250dSMatthew G. Knepley /*@ 3928aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3929aa50250dSMatthew G. Knepley 3930aa50250dSMatthew G. Knepley Not Collective 3931aa50250dSMatthew G. Knepley 3932aa50250dSMatthew G. Knepley Input Parameter: 3933aa50250dSMatthew G. Knepley . dm - The DMPlex object 3934aa50250dSMatthew G. Knepley 3935aa50250dSMatthew G. Knepley Output Parameter: 3936aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3937aa50250dSMatthew G. Knepley 3938aa50250dSMatthew G. Knepley Level: developer 3939552f7358SJed Brown 3940552f7358SJed Brown .keywords: mesh, points 3941aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3942552f7358SJed Brown @*/ 3943552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3944552f7358SJed Brown { 3945aa50250dSMatthew G. Knepley DMLabel label; 3946aa50250dSMatthew G. Knepley PetscInt d = 0; 3947552f7358SJed Brown PetscErrorCode ierr; 3948552f7358SJed Brown 3949552f7358SJed Brown PetscFunctionBegin; 3950552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3951552f7358SJed Brown PetscValidPointer(depth, 2); 3952aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3953aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3954552f7358SJed Brown *depth = d-1; 3955552f7358SJed Brown PetscFunctionReturn(0); 3956552f7358SJed Brown } 3957552f7358SJed Brown 3958552f7358SJed Brown #undef __FUNCT__ 3959552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3960552f7358SJed Brown /*@ 3961552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3962552f7358SJed Brown 3963552f7358SJed Brown Not Collective 3964552f7358SJed Brown 3965552f7358SJed Brown Input Parameters: 3966552f7358SJed Brown + dm - The DMPlex object 3967552f7358SJed Brown - stratumValue - The requested depth 3968552f7358SJed Brown 3969552f7358SJed Brown Output Parameters: 3970552f7358SJed Brown + start - The first point at this depth 3971552f7358SJed Brown - end - One beyond the last point at this depth 3972552f7358SJed Brown 3973552f7358SJed Brown Level: developer 3974552f7358SJed Brown 3975552f7358SJed Brown .keywords: mesh, points 3976552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3977552f7358SJed Brown @*/ 39780adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39790adebc6cSBarry Smith { 3980aa50250dSMatthew G. Knepley DMLabel label; 398163d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3982552f7358SJed Brown PetscErrorCode ierr; 3983552f7358SJed Brown 3984552f7358SJed Brown PetscFunctionBegin; 3985552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 398663d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 398763d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3988552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39890d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 399063d1a920SMatthew G. Knepley if (stratumValue < 0) { 399163d1a920SMatthew G. Knepley if (start) *start = pStart; 399263d1a920SMatthew G. Knepley if (end) *end = pEnd; 399363d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3994552f7358SJed Brown } 3995aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 399663d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 399763d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3998552f7358SJed Brown PetscFunctionReturn(0); 3999552f7358SJed Brown } 4000552f7358SJed Brown 4001552f7358SJed Brown #undef __FUNCT__ 4002552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 4003552f7358SJed Brown /*@ 4004552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 4005552f7358SJed Brown 4006552f7358SJed Brown Not Collective 4007552f7358SJed Brown 4008552f7358SJed Brown Input Parameters: 4009552f7358SJed Brown + dm - The DMPlex object 4010552f7358SJed Brown - stratumValue - The requested height 4011552f7358SJed Brown 4012552f7358SJed Brown Output Parameters: 4013552f7358SJed Brown + start - The first point at this height 4014552f7358SJed Brown - end - One beyond the last point at this height 4015552f7358SJed Brown 4016552f7358SJed Brown Level: developer 4017552f7358SJed Brown 4018552f7358SJed Brown .keywords: mesh, points 4019552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 4020552f7358SJed Brown @*/ 40210adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 40220adebc6cSBarry Smith { 4023aa50250dSMatthew G. Knepley DMLabel label; 402463d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4025552f7358SJed Brown PetscErrorCode ierr; 4026552f7358SJed Brown 4027552f7358SJed Brown PetscFunctionBegin; 4028552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 402963d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 403063d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4031552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 40320d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 403363d1a920SMatthew G. Knepley if (stratumValue < 0) { 403463d1a920SMatthew G. Knepley if (start) *start = pStart; 403563d1a920SMatthew G. Knepley if (end) *end = pEnd; 403663d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4037552f7358SJed Brown } 4038aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4039aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 404063d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 404163d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4042552f7358SJed Brown PetscFunctionReturn(0); 4043552f7358SJed Brown } 4044552f7358SJed Brown 4045552f7358SJed Brown #undef __FUNCT__ 4046552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4047552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4048a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4049a6dfd86eSKarl Rupp { 4050552f7358SJed Brown PetscInt *numDofTot; 4051916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4052916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4053552f7358SJed Brown PetscErrorCode ierr; 4054552f7358SJed Brown 4055552f7358SJed Brown PetscFunctionBegin; 4056785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4057552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4058552f7358SJed Brown numDofTot[d] = 0; 40590d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4060552f7358SJed Brown } 406182f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4062552f7358SJed Brown if (numFields > 0) { 4063552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4064552f7358SJed Brown if (numComp) { 4065552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4066552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4067552f7358SJed Brown } 4068552f7358SJed Brown } 4069552f7358SJed Brown } 4070552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4071552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4072916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4073916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4074916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4075916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4076552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4077552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4078552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4079552f7358SJed Brown } 4080552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4081552f7358SJed Brown } 4082552f7358SJed Brown } 4083552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4084552f7358SJed Brown PetscFunctionReturn(0); 4085552f7358SJed Brown } 4086552f7358SJed Brown 4087552f7358SJed Brown #undef __FUNCT__ 4088552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4089552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4090552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4091552f7358SJed Brown */ 4092a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4093a6dfd86eSKarl Rupp { 4094552f7358SJed Brown PetscInt numFields; 4095552f7358SJed Brown PetscInt bc; 4096552f7358SJed Brown PetscErrorCode ierr; 4097552f7358SJed Brown 4098552f7358SJed Brown PetscFunctionBegin; 4099552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4100552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4101552f7358SJed Brown PetscInt field = 0; 4102552f7358SJed Brown const PetscInt *idx; 4103552f7358SJed Brown PetscInt n, i; 4104552f7358SJed Brown 41050d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4106552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4107552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4108552f7358SJed Brown for (i = 0; i < n; ++i) { 4109552f7358SJed Brown const PetscInt p = idx[i]; 4110552f7358SJed Brown PetscInt numConst = constDof; 4111552f7358SJed Brown 4112552f7358SJed Brown /* Constrain every dof on the point */ 4113552f7358SJed Brown if (numConst < 0) { 4114552f7358SJed Brown if (numFields) { 4115552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4116552f7358SJed Brown } else { 4117552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4118552f7358SJed Brown } 4119552f7358SJed Brown } 4120552f7358SJed Brown if (numFields) { 4121552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4122552f7358SJed Brown } 4123552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4124552f7358SJed Brown } 4125552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4126552f7358SJed Brown } 4127552f7358SJed Brown PetscFunctionReturn(0); 4128552f7358SJed Brown } 4129552f7358SJed Brown 4130552f7358SJed Brown #undef __FUNCT__ 4131552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4132552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41330adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 41340adebc6cSBarry Smith { 4135552f7358SJed Brown PetscInt *maxConstraints; 4136552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4137552f7358SJed Brown PetscErrorCode ierr; 4138552f7358SJed Brown 4139552f7358SJed Brown PetscFunctionBegin; 4140552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4141552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4142785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 41430d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4144552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4145552f7358SJed Brown PetscInt cdof; 4146552f7358SJed Brown 4147552f7358SJed Brown if (numFields) { 4148552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4149552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4150552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4151552f7358SJed Brown } 4152552f7358SJed Brown } else { 4153552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4154552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4155552f7358SJed Brown } 4156552f7358SJed Brown } 4157552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4158552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4159552f7358SJed Brown } 4160552f7358SJed Brown if (maxConstraints[numFields]) { 4161552f7358SJed Brown PetscInt *indices; 4162552f7358SJed Brown 4163785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4164552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4165552f7358SJed Brown PetscInt cdof, d; 4166552f7358SJed Brown 4167552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4168552f7358SJed Brown if (cdof) { 4169552f7358SJed 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]); 4170552f7358SJed Brown if (numFields) { 4171552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4172552f7358SJed Brown 4173552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4174552f7358SJed Brown PetscInt cfdof, fdof; 4175552f7358SJed Brown 4176552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4177552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4178552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41790d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4180552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41810d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4182552f7358SJed Brown numConst += cfdof; 4183552f7358SJed Brown foff += fdof; 4184552f7358SJed Brown } 4185552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4186552f7358SJed Brown } else { 41870d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4188552f7358SJed Brown } 4189552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4190552f7358SJed Brown } 4191552f7358SJed Brown } 4192552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4193552f7358SJed Brown } 4194552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4195552f7358SJed Brown PetscFunctionReturn(0); 4196552f7358SJed Brown } 4197552f7358SJed Brown 4198552f7358SJed Brown #undef __FUNCT__ 4199552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4200552f7358SJed Brown /* Set the constrained field indices on each point */ 42010adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 42020adebc6cSBarry Smith { 4203552f7358SJed Brown const PetscInt *points, *indices; 4204552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4205552f7358SJed Brown PetscErrorCode ierr; 4206552f7358SJed Brown 4207552f7358SJed Brown PetscFunctionBegin; 4208552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4209552f7358SJed 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); 4210552f7358SJed Brown 4211552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4212552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4213552f7358SJed Brown if (!constraintIndices) { 4214552f7358SJed Brown PetscInt *idx, i; 4215552f7358SJed Brown 4216552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4217785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 42180d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4219552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4220552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4221552f7358SJed Brown } 4222552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4223552f7358SJed Brown } else { 4224552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4225552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4226552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4227552f7358SJed Brown PetscInt fcdof; 4228552f7358SJed Brown 4229552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 423082f516ccSBarry 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); 4231552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4232552f7358SJed Brown } 4233552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4234552f7358SJed Brown } 4235552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4236552f7358SJed Brown PetscFunctionReturn(0); 4237552f7358SJed Brown } 4238552f7358SJed Brown 4239552f7358SJed Brown #undef __FUNCT__ 4240552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4241552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 42420adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 42430adebc6cSBarry Smith { 4244552f7358SJed Brown PetscInt *indices; 4245552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4246552f7358SJed Brown PetscErrorCode ierr; 4247552f7358SJed Brown 4248552f7358SJed Brown PetscFunctionBegin; 4249552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4250785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4251552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 425282f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4253552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4254552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4255552f7358SJed Brown PetscInt cdof, d; 4256552f7358SJed Brown 4257552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4258552f7358SJed Brown if (cdof) { 4259552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4260552f7358SJed Brown 4261552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4262552f7358SJed Brown const PetscInt *fcind; 4263552f7358SJed Brown PetscInt fdof, fcdof; 4264552f7358SJed Brown 4265552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4266552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4267552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4268552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42690d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4270552f7358SJed Brown foff += fdof; 4271552f7358SJed Brown numConst += fcdof; 4272552f7358SJed Brown } 427382f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4274552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4275552f7358SJed Brown } 4276552f7358SJed Brown } 4277552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4278552f7358SJed Brown PetscFunctionReturn(0); 4279552f7358SJed Brown } 4280552f7358SJed Brown 4281552f7358SJed Brown #undef __FUNCT__ 4282552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4283552f7358SJed Brown /*@C 4284552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4285552f7358SJed Brown 4286552f7358SJed Brown Not Collective 4287552f7358SJed Brown 4288552f7358SJed Brown Input Parameters: 4289552f7358SJed Brown + dm - The DMPlex object 4290552f7358SJed Brown . dim - The spatial dimension of the problem 4291552f7358SJed Brown . numFields - The number of fields in the problem 4292552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4293552f7358SJed 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 4294552f7358SJed Brown . numBC - The number of boundary conditions 4295552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4296f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4297f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4298552f7358SJed Brown 4299552f7358SJed Brown Output Parameter: 4300552f7358SJed Brown . section - The PetscSection object 4301552f7358SJed Brown 4302552f7358SJed 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 4303f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4304f8f126e8SMatthew G. Knepley 4305f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4306552f7358SJed Brown 4307552f7358SJed Brown Level: developer 4308552f7358SJed Brown 43093813dfbdSMatthew G Knepley Fortran Notes: 43103813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 43113813dfbdSMatthew G Knepley 4312552f7358SJed Brown .keywords: mesh, elements 4313f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4314552f7358SJed Brown @*/ 4315f8f126e8SMatthew 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) 4316a6dfd86eSKarl Rupp { 4317552f7358SJed Brown PetscErrorCode ierr; 4318552f7358SJed Brown 4319552f7358SJed Brown PetscFunctionBegin; 4320552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4321552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4322f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4323552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4324552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4325ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4326552f7358SJed Brown PetscFunctionReturn(0); 4327552f7358SJed Brown } 4328552f7358SJed Brown 4329552f7358SJed Brown #undef __FUNCT__ 4330552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 43310adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 43320adebc6cSBarry Smith { 4333552f7358SJed Brown PetscSection section; 4334552f7358SJed Brown PetscErrorCode ierr; 4335552f7358SJed Brown 4336552f7358SJed Brown PetscFunctionBegin; 433738221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 433882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4339552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 43401d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4341552f7358SJed Brown PetscFunctionReturn(0); 4342552f7358SJed Brown } 4343552f7358SJed Brown 4344552f7358SJed Brown #undef __FUNCT__ 4345552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 43460adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 43470adebc6cSBarry Smith { 4348552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4349552f7358SJed Brown 4350552f7358SJed Brown PetscFunctionBegin; 4351552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4352552f7358SJed Brown if (section) *section = mesh->coneSection; 4353552f7358SJed Brown PetscFunctionReturn(0); 4354552f7358SJed Brown } 4355552f7358SJed Brown 4356552f7358SJed Brown #undef __FUNCT__ 43578cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43588cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43598cb4d582SMatthew G. Knepley { 43608cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43618cb4d582SMatthew G. Knepley 43628cb4d582SMatthew G. Knepley PetscFunctionBegin; 43638cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43648cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43658cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43668cb4d582SMatthew G. Knepley } 43678cb4d582SMatthew G. Knepley 43688cb4d582SMatthew G. Knepley #undef __FUNCT__ 4369552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4370a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4371a6dfd86eSKarl Rupp { 4372552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4373552f7358SJed Brown 4374552f7358SJed Brown PetscFunctionBegin; 4375552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4376552f7358SJed Brown if (cones) *cones = mesh->cones; 4377552f7358SJed Brown PetscFunctionReturn(0); 4378552f7358SJed Brown } 4379552f7358SJed Brown 4380552f7358SJed Brown #undef __FUNCT__ 4381552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4382a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4383a6dfd86eSKarl Rupp { 4384552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4385552f7358SJed Brown 4386552f7358SJed Brown PetscFunctionBegin; 4387552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4388552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4389552f7358SJed Brown PetscFunctionReturn(0); 4390552f7358SJed Brown } 4391552f7358SJed Brown 4392552f7358SJed Brown /******************************** FEM Support **********************************/ 4393552f7358SJed Brown 4394552f7358SJed Brown #undef __FUNCT__ 43951a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 43961a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4397a6dfd86eSKarl Rupp { 4398552f7358SJed Brown PetscScalar *array, *vArray; 4399d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 44001a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4401552f7358SJed Brown PetscErrorCode ierr; 4402552f7358SJed Brown 44031b406b76SMatthew G. Knepley PetscFunctionBeginHot; 44042a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 44055a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 44065a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 44075a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 44083f7cbbe7SMatthew G. Knepley if (!values || !*values) { 44099df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44109df71ca4SMatthew G. Knepley PetscInt dof; 4411d9917b9dSMatthew G. Knepley 44129df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44139df71ca4SMatthew G. Knepley size += dof; 44149df71ca4SMatthew G. Knepley } 44159df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44169df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44172a3aaacfSMatthew G. Knepley PetscInt dof; 44185a1bb5cfSMatthew G. Knepley 44195a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44202a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44215a1bb5cfSMatthew G. Knepley size += dof; 44225a1bb5cfSMatthew G. Knepley } 44233f7cbbe7SMatthew G. Knepley if (!values) { 44243f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 44253f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 44263f7cbbe7SMatthew G. Knepley } 44275a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4428982e9ed1SMatthew G. Knepley } else { 4429982e9ed1SMatthew G. Knepley array = *values; 4430982e9ed1SMatthew G. Knepley } 44319df71ca4SMatthew G. Knepley size = 0; 44325a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 44339df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44349df71ca4SMatthew G. Knepley PetscInt dof, off, d; 44359df71ca4SMatthew G. Knepley PetscScalar *varr; 4436d9917b9dSMatthew G. Knepley 44379df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44389df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44399df71ca4SMatthew G. Knepley varr = &vArray[off]; 44401a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44411a271a75SMatthew G. Knepley array[offset] = varr[d]; 44429df71ca4SMatthew G. Knepley } 44439df71ca4SMatthew G. Knepley size += dof; 44449df71ca4SMatthew G. Knepley } 44459df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44469df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44479df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 44485a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 44495a1bb5cfSMatthew G. Knepley PetscScalar *varr; 44505a1bb5cfSMatthew G. Knepley 445152ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44525a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44535a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 44545a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 44555a1bb5cfSMatthew G. Knepley if (o >= 0) { 44561a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44571a271a75SMatthew G. Knepley array[offset] = varr[d]; 44585a1bb5cfSMatthew G. Knepley } 44595a1bb5cfSMatthew G. Knepley } else { 44601a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44611a271a75SMatthew G. Knepley array[offset] = varr[d]; 44625a1bb5cfSMatthew G. Knepley } 44635a1bb5cfSMatthew G. Knepley } 44649df71ca4SMatthew G. Knepley size += dof; 44655a1bb5cfSMatthew G. Knepley } 44665a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44679df71ca4SMatthew G. Knepley if (!*values) { 44685a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44695a1bb5cfSMatthew G. Knepley *values = array; 44709df71ca4SMatthew G. Knepley } else { 44719df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44728c312ff3SMatthew G. Knepley *csize = size; 44739df71ca4SMatthew G. Knepley } 44745a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44755a1bb5cfSMatthew G. Knepley } 4476d9917b9dSMatthew G. Knepley 4477d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44781a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44791a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44801a271a75SMatthew G. Knepley { 44811a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44821a271a75SMatthew G. Knepley PetscErrorCode ierr; 44831a271a75SMatthew G. Knepley 44841a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4485fe02ba77SJed Brown *size = 0; 44861a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44871a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44881a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44891a271a75SMatthew G. Knepley PetscInt dof, off, d; 44901a271a75SMatthew G. Knepley const PetscScalar *varr; 44911a271a75SMatthew G. Knepley 44921a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44931a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44941a271a75SMatthew G. Knepley varr = &vArray[off]; 44951a271a75SMatthew G. Knepley if (o >= 0) { 44961a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 44971a271a75SMatthew G. Knepley } else { 44981a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 44991a271a75SMatthew G. Knepley } 45001a271a75SMatthew G. Knepley } 45011a271a75SMatthew G. Knepley *size = offset; 45021a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45031a271a75SMatthew G. Knepley } 45041a271a75SMatthew G. Knepley 45051a271a75SMatthew G. Knepley #undef __FUNCT__ 45061a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 45071a271a75SMatthew 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[]) 45081a271a75SMatthew G. Knepley { 45091a271a75SMatthew G. Knepley PetscInt offset = 0, f; 45101a271a75SMatthew G. Knepley PetscErrorCode ierr; 45111a271a75SMatthew G. Knepley 45121a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4513fe02ba77SJed Brown *size = 0; 45141a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 45151a271a75SMatthew G. Knepley PetscInt fcomp, p; 45161a271a75SMatthew G. Knepley 45171a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 45181a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 45191a271a75SMatthew G. Knepley const PetscInt point = points[p]; 45201a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 45211a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 45221a271a75SMatthew G. Knepley const PetscScalar *varr; 45231a271a75SMatthew G. Knepley 45241a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 45251a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 45261a271a75SMatthew G. Knepley varr = &vArray[foff]; 45271a271a75SMatthew G. Knepley if (o >= 0) { 45281a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 45291a271a75SMatthew G. Knepley } else { 45301a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 45311a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 45321a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 45331a271a75SMatthew G. Knepley } 45341a271a75SMatthew G. Knepley } 45351a271a75SMatthew G. Knepley } 45361a271a75SMatthew G. Knepley } 45371a271a75SMatthew G. Knepley } 45381a271a75SMatthew G. Knepley *size = offset; 45391a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45401a271a75SMatthew G. Knepley } 45411a271a75SMatthew G. Knepley 45421a271a75SMatthew G. Knepley #undef __FUNCT__ 4543552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4544552f7358SJed Brown /*@C 4545552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4546552f7358SJed Brown 4547552f7358SJed Brown Not collective 4548552f7358SJed Brown 4549552f7358SJed Brown Input Parameters: 4550552f7358SJed Brown + dm - The DM 4551552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4552552f7358SJed Brown . v - The local vector 4553552f7358SJed Brown - point - The sieve point in the DM 4554552f7358SJed Brown 4555552f7358SJed Brown Output Parameters: 4556552f7358SJed Brown + csize - The number of values in the closure, or NULL 4557552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4558552f7358SJed Brown 4559552f7358SJed Brown Fortran Notes: 4560552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4561552f7358SJed Brown include petsc.h90 in your code. 4562552f7358SJed Brown 4563552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4564552f7358SJed Brown 4565552f7358SJed Brown Level: intermediate 4566552f7358SJed Brown 4567552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4568552f7358SJed Brown @*/ 4569552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4570552f7358SJed Brown { 4571552f7358SJed Brown PetscSection clSection; 4572d9917b9dSMatthew G. Knepley IS clPoints; 4573552f7358SJed Brown PetscScalar *array, *vArray; 4574552f7358SJed Brown PetscInt *points = NULL; 4575d9917b9dSMatthew G. Knepley const PetscInt *clp; 45761a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4577552f7358SJed Brown PetscErrorCode ierr; 4578552f7358SJed Brown 4579d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4580552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4581552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45821a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45831a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4584552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4585552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4586552f7358SJed Brown if (depth == 1 && numFields < 2) { 45871a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4588552f7358SJed Brown PetscFunctionReturn(0); 4589552f7358SJed Brown } 45901a271a75SMatthew G. Knepley /* Get points */ 4591d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4592d9917b9dSMatthew G. Knepley if (!clPoints) { 45931a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4594552f7358SJed Brown 45951a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4596552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4597552f7358SJed Brown /* Compress out points not in the section */ 4598552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4599552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4600552f7358SJed Brown points[q*2] = points[p]; 4601552f7358SJed Brown points[q*2+1] = points[p+1]; 4602552f7358SJed Brown ++q; 4603552f7358SJed Brown } 4604552f7358SJed Brown } 4605552f7358SJed Brown numPoints = q; 4606d9917b9dSMatthew G. Knepley } else { 4607d9917b9dSMatthew G. Knepley PetscInt dof, off; 4608552f7358SJed Brown 4609d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4610d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4611d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 46121a271a75SMatthew G. Knepley numPoints = dof/2; 4613d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4614552f7358SJed Brown } 46151a271a75SMatthew G. Knepley /* Get array */ 4616552f7358SJed Brown if (!values || !*values) { 46171a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4618552f7358SJed Brown 46191a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4620552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 46211a271a75SMatthew G. Knepley asize += dof; 4622552f7358SJed Brown } 4623bd6c0d32SMatthew G. Knepley if (!values) { 4624d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46251a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46261a271a75SMatthew G. Knepley if (csize) *csize = asize; 4627bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4628bd6c0d32SMatthew G. Knepley } 46291a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4630d0f6b257SMatthew G. Knepley } else { 4631d0f6b257SMatthew G. Knepley array = *values; 4632d0f6b257SMatthew G. Knepley } 4633552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 46341a271a75SMatthew G. Knepley /* Get values */ 4635ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 46361a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 46371a271a75SMatthew G. Knepley /* Cleanup points */ 46381a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46391a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46401a271a75SMatthew G. Knepley /* Cleanup array */ 4641552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4642d0f6b257SMatthew G. Knepley if (!*values) { 4643552f7358SJed Brown if (csize) *csize = size; 4644552f7358SJed Brown *values = array; 4645d0f6b257SMatthew G. Knepley } else { 4646d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4647d0f6b257SMatthew G. Knepley *csize = size; 4648d0f6b257SMatthew G. Knepley } 4649552f7358SJed Brown PetscFunctionReturn(0); 4650552f7358SJed Brown } 4651552f7358SJed Brown 4652552f7358SJed Brown #undef __FUNCT__ 4653552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4654552f7358SJed Brown /*@C 4655552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4656552f7358SJed Brown 4657552f7358SJed Brown Not collective 4658552f7358SJed Brown 4659552f7358SJed Brown Input Parameters: 4660552f7358SJed Brown + dm - The DM 46610298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4662552f7358SJed Brown . v - The local vector 4663552f7358SJed Brown . point - The sieve point in the DM 46640298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4665552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4666552f7358SJed Brown 46673813dfbdSMatthew G Knepley Fortran Notes: 46683813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46693813dfbdSMatthew G Knepley include petsc.h90 in your code. 46703813dfbdSMatthew G Knepley 46713813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46723813dfbdSMatthew G Knepley 4673552f7358SJed Brown Level: intermediate 4674552f7358SJed Brown 4675552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4676552f7358SJed Brown @*/ 46777c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4678a6dfd86eSKarl Rupp { 4679552f7358SJed Brown PetscInt size = 0; 4680552f7358SJed Brown PetscErrorCode ierr; 4681552f7358SJed Brown 4682552f7358SJed Brown PetscFunctionBegin; 4683552f7358SJed Brown /* Should work without recalculating size */ 4684552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4685552f7358SJed Brown PetscFunctionReturn(0); 4686552f7358SJed Brown } 4687552f7358SJed Brown 4688552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4689552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4690552f7358SJed Brown 4691552f7358SJed Brown #undef __FUNCT__ 4692552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 46931a271a75SMatthew 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[]) 4694552f7358SJed Brown { 4695552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4696552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4697552f7358SJed Brown PetscScalar *a; 4698552f7358SJed Brown PetscInt off, cind = 0, k; 4699552f7358SJed Brown PetscErrorCode ierr; 4700552f7358SJed Brown 4701552f7358SJed Brown PetscFunctionBegin; 4702552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4703552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4704552f7358SJed Brown a = &array[off]; 4705552f7358SJed Brown if (!cdof || setBC) { 4706552f7358SJed Brown if (orientation >= 0) { 4707552f7358SJed Brown for (k = 0; k < dof; ++k) { 4708552f7358SJed Brown fuse(&a[k], values[k]); 4709552f7358SJed Brown } 4710552f7358SJed Brown } else { 4711552f7358SJed Brown for (k = 0; k < dof; ++k) { 4712552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4713552f7358SJed Brown } 4714552f7358SJed Brown } 4715552f7358SJed Brown } else { 4716552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4717552f7358SJed Brown if (orientation >= 0) { 4718552f7358SJed Brown for (k = 0; k < dof; ++k) { 4719552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4720552f7358SJed Brown fuse(&a[k], values[k]); 4721552f7358SJed Brown } 4722552f7358SJed Brown } else { 4723552f7358SJed Brown for (k = 0; k < dof; ++k) { 4724552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4725552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4726552f7358SJed Brown } 4727552f7358SJed Brown } 4728552f7358SJed Brown } 4729552f7358SJed Brown PetscFunctionReturn(0); 4730552f7358SJed Brown } 4731552f7358SJed Brown 4732552f7358SJed Brown #undef __FUNCT__ 4733a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 47341a271a75SMatthew 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[]) 4735a5e93ea8SMatthew G. Knepley { 4736a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4737a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4738a5e93ea8SMatthew G. Knepley PetscScalar *a; 4739a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4740a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4741a5e93ea8SMatthew G. Knepley 4742a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4743a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4744a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4745a5e93ea8SMatthew G. Knepley a = &array[off]; 4746a5e93ea8SMatthew G. Knepley if (cdof) { 4747a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4748a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4749a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4750a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4751a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4752a5e93ea8SMatthew G. Knepley ++cind; 4753a5e93ea8SMatthew G. Knepley } 4754a5e93ea8SMatthew G. Knepley } 4755a5e93ea8SMatthew G. Knepley } else { 4756a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4757a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4758a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4759a5e93ea8SMatthew G. Knepley ++cind; 4760a5e93ea8SMatthew G. Knepley } 4761a5e93ea8SMatthew G. Knepley } 4762a5e93ea8SMatthew G. Knepley } 4763a5e93ea8SMatthew G. Knepley } 4764a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4765a5e93ea8SMatthew G. Knepley } 4766a5e93ea8SMatthew G. Knepley 4767a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4768552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47691a271a75SMatthew 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[]) 4770a6dfd86eSKarl Rupp { 4771552f7358SJed Brown PetscScalar *a; 47721a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47731a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47741a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4775552f7358SJed Brown PetscErrorCode ierr; 4776552f7358SJed Brown 4777552f7358SJed Brown PetscFunctionBegin; 4778552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4779552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47801a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47811a271a75SMatthew G. Knepley a = &array[foff]; 4782552f7358SJed Brown if (!fcdof || setBC) { 47831a271a75SMatthew G. Knepley if (o >= 0) { 47841a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4785552f7358SJed Brown } else { 4786552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4787552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47881a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4789552f7358SJed Brown } 4790552f7358SJed Brown } 4791552f7358SJed Brown } 4792552f7358SJed Brown } else { 4793552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47941a271a75SMatthew G. Knepley if (o >= 0) { 4795552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4796552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 47971a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4798552f7358SJed Brown } 4799552f7358SJed Brown } else { 4800552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4801552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4802552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 48031a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4804552f7358SJed Brown } 4805552f7358SJed Brown } 4806552f7358SJed Brown } 4807552f7358SJed Brown } 48081a271a75SMatthew G. Knepley *offset += fdof; 4809552f7358SJed Brown PetscFunctionReturn(0); 4810552f7358SJed Brown } 4811552f7358SJed Brown 4812552f7358SJed Brown #undef __FUNCT__ 4813a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 48141a271a75SMatthew 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[]) 4815a5e93ea8SMatthew G. Knepley { 4816a5e93ea8SMatthew G. Knepley PetscScalar *a; 48171a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 48181a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 48191a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4820a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4821a5e93ea8SMatthew G. Knepley 4822a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4823a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4824a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 48251a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 48261a271a75SMatthew G. Knepley a = &array[foff]; 4827a5e93ea8SMatthew G. Knepley if (fcdof) { 4828a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 48291a271a75SMatthew G. Knepley if (o >= 0) { 4830a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4831a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 48321a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4833a5e93ea8SMatthew G. Knepley ++cind; 4834a5e93ea8SMatthew G. Knepley } 4835a5e93ea8SMatthew G. Knepley } 4836a5e93ea8SMatthew G. Knepley } else { 4837a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4838a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4839a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 48401a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4841a5e93ea8SMatthew G. Knepley ++cind; 4842a5e93ea8SMatthew G. Knepley } 4843a5e93ea8SMatthew G. Knepley } 4844a5e93ea8SMatthew G. Knepley } 4845a5e93ea8SMatthew G. Knepley } 4846a5e93ea8SMatthew G. Knepley } 48471a271a75SMatthew G. Knepley *offset += fdof; 4848a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4849a5e93ea8SMatthew G. Knepley } 4850a5e93ea8SMatthew G. Knepley 4851a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 48521b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 48531a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4854a6dfd86eSKarl Rupp { 4855552f7358SJed Brown PetscScalar *array; 48561b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 48571b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4858552f7358SJed Brown PetscErrorCode ierr; 4859552f7358SJed Brown 48601b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4861b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4862b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4863b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4864b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4865b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4866b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4867b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4868b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4869b6ebb6e6SMatthew G. Knepley 4870b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4871b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4872b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4873b6ebb6e6SMatthew G. Knepley { 4874b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4875b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4876b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4877b6ebb6e6SMatthew G. Knepley 4878b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4879b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4880b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4881b6ebb6e6SMatthew G. Knepley if (!cdof) { 4882b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4883b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4884b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4885b6ebb6e6SMatthew G. Knepley } 4886b6ebb6e6SMatthew G. Knepley } else { 4887b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4888b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4889b6ebb6e6SMatthew G. Knepley } 4890b6ebb6e6SMatthew G. Knepley } 4891b6ebb6e6SMatthew G. Knepley } else { 4892b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4893b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4894b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4895b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4896b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4897b6ebb6e6SMatthew G. Knepley } 4898b6ebb6e6SMatthew G. Knepley } else { 4899b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4900b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4901b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4902b6ebb6e6SMatthew G. Knepley } 4903b6ebb6e6SMatthew G. Knepley } 4904b6ebb6e6SMatthew G. Knepley } 4905b6ebb6e6SMatthew G. Knepley } 4906b6ebb6e6SMatthew G. Knepley } 4907b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4908b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4909b6ebb6e6SMatthew G. Knepley } 49101b406b76SMatthew G. Knepley 49111b406b76SMatthew G. Knepley #undef __FUNCT__ 49121b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 49131b406b76SMatthew G. Knepley /*@C 49141b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 49151b406b76SMatthew G. Knepley 49161b406b76SMatthew G. Knepley Not collective 49171b406b76SMatthew G. Knepley 49181b406b76SMatthew G. Knepley Input Parameters: 49191b406b76SMatthew G. Knepley + dm - The DM 49201b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 49211b406b76SMatthew G. Knepley . v - The local vector 49221b406b76SMatthew G. Knepley . point - The sieve point in the DM 49231b406b76SMatthew G. Knepley . values - The array of values 49241b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 49251b406b76SMatthew G. Knepley 49261b406b76SMatthew G. Knepley Fortran Notes: 49271b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 49281b406b76SMatthew G. Knepley 49291b406b76SMatthew G. Knepley Level: intermediate 49301b406b76SMatthew G. Knepley 49311b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 49321b406b76SMatthew G. Knepley @*/ 49331b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 49341b406b76SMatthew G. Knepley { 49351b406b76SMatthew G. Knepley PetscSection clSection; 49361b406b76SMatthew G. Knepley IS clPoints; 49371b406b76SMatthew G. Knepley PetscScalar *array; 49381b406b76SMatthew G. Knepley PetscInt *points = NULL; 49391b406b76SMatthew G. Knepley const PetscInt *clp; 49401a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 49411b406b76SMatthew G. Knepley PetscErrorCode ierr; 49421b406b76SMatthew G. Knepley 49431a271a75SMatthew G. Knepley PetscFunctionBeginHot; 49441b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49451b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 49461a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 49471a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 49481b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 49491b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 49501b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 49511a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 49521b406b76SMatthew G. Knepley PetscFunctionReturn(0); 49531b406b76SMatthew G. Knepley } 49541a271a75SMatthew G. Knepley /* Get points */ 49551b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 49561b406b76SMatthew G. Knepley if (!clPoints) { 49571a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49581a271a75SMatthew G. Knepley 49591a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4960552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4961552f7358SJed Brown /* Compress out points not in the section */ 4962552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4963552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4964552f7358SJed Brown points[q*2] = points[p]; 4965552f7358SJed Brown points[q*2+1] = points[p+1]; 4966552f7358SJed Brown ++q; 4967552f7358SJed Brown } 4968552f7358SJed Brown } 4969552f7358SJed Brown numPoints = q; 49701b406b76SMatthew G. Knepley } else { 49711b406b76SMatthew G. Knepley PetscInt dof, off; 4972552f7358SJed Brown 49731b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49741b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49751b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49761a271a75SMatthew G. Knepley numPoints = dof/2; 49771b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4978552f7358SJed Brown } 49791a271a75SMatthew G. Knepley /* Get array */ 4980552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49811a271a75SMatthew G. Knepley /* Get values */ 4982ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49831a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4984552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49851a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4986552f7358SJed Brown switch (mode) { 4987552f7358SJed Brown case INSERT_VALUES: 4988552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49891a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49901a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49911a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4992552f7358SJed Brown } break; 4993552f7358SJed Brown case INSERT_ALL_VALUES: 4994552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49951a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49961a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49971a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 4998552f7358SJed Brown } break; 4999a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5000a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 50011a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50021a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50031a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5004a5e93ea8SMatthew G. Knepley } break; 5005552f7358SJed Brown case ADD_VALUES: 5006552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50071a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50081a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50091a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5010552f7358SJed Brown } break; 5011552f7358SJed Brown case ADD_ALL_VALUES: 5012552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50131a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50141a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50151a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5016552f7358SJed Brown } break; 5017552f7358SJed Brown default: 501882f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5019552f7358SJed Brown } 50201a271a75SMatthew G. Knepley } 5021552f7358SJed Brown } else { 50221a271a75SMatthew G. Knepley PetscInt dof, off; 50231a271a75SMatthew G. Knepley 5024552f7358SJed Brown switch (mode) { 5025552f7358SJed Brown case INSERT_VALUES: 5026552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5027552f7358SJed Brown PetscInt o = points[p+1]; 5028552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5029552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5030552f7358SJed Brown } break; 5031552f7358SJed Brown case INSERT_ALL_VALUES: 5032552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5033552f7358SJed Brown PetscInt o = points[p+1]; 5034552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5035552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5036552f7358SJed Brown } break; 5037a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5038a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5039a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5040a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5041a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5042a5e93ea8SMatthew G. Knepley } break; 5043552f7358SJed Brown case ADD_VALUES: 5044552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5045552f7358SJed Brown PetscInt o = points[p+1]; 5046552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5047552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5048552f7358SJed Brown } break; 5049552f7358SJed Brown case ADD_ALL_VALUES: 5050552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5051552f7358SJed Brown PetscInt o = points[p+1]; 5052552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5053552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5054552f7358SJed Brown } break; 5055552f7358SJed Brown default: 505682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5057552f7358SJed Brown } 5058552f7358SJed Brown } 50591a271a75SMatthew G. Knepley /* Cleanup points */ 50601a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50611a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50621a271a75SMatthew G. Knepley /* Cleanup array */ 5063552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5064552f7358SJed Brown PetscFunctionReturn(0); 5065552f7358SJed Brown } 5066552f7358SJed Brown 5067552f7358SJed Brown #undef __FUNCT__ 5068e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 5069e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 5070e07394fbSMatthew G. Knepley { 5071e07394fbSMatthew G. Knepley PetscSection clSection; 5072e07394fbSMatthew G. Knepley IS clPoints; 5073e07394fbSMatthew G. Knepley PetscScalar *array; 5074e07394fbSMatthew G. Knepley PetscInt *points = NULL; 5075e07394fbSMatthew G. Knepley const PetscInt *clp; 5076e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 5077e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5078e07394fbSMatthew G. Knepley PetscErrorCode ierr; 5079e07394fbSMatthew G. Knepley 5080e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 5081e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5082e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5083e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5084e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5085e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5086e07394fbSMatthew G. Knepley /* Get points */ 5087e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5088e07394fbSMatthew G. Knepley if (!clPoints) { 5089e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 5090e07394fbSMatthew G. Knepley 5091e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5092e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5093e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 5094e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5095e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5096e07394fbSMatthew G. Knepley points[q*2] = points[p]; 5097e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 5098e07394fbSMatthew G. Knepley ++q; 5099e07394fbSMatthew G. Knepley } 5100e07394fbSMatthew G. Knepley } 5101e07394fbSMatthew G. Knepley numPoints = q; 5102e07394fbSMatthew G. Knepley } else { 5103e07394fbSMatthew G. Knepley PetscInt dof, off; 5104e07394fbSMatthew G. Knepley 5105e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5106e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5107e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 5108e07394fbSMatthew G. Knepley numPoints = dof/2; 5109e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5110e07394fbSMatthew G. Knepley } 5111e07394fbSMatthew G. Knepley /* Get array */ 5112e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5113e07394fbSMatthew G. Knepley /* Get values */ 5114e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5115e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5116e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 5117e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5118e07394fbSMatthew G. Knepley PetscInt fdof; 5119e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5120e07394fbSMatthew G. Knepley offset += fdof; 5121e07394fbSMatthew G. Knepley } 5122e07394fbSMatthew G. Knepley continue; 5123e07394fbSMatthew G. Knepley } 5124e07394fbSMatthew G. Knepley switch (mode) { 5125e07394fbSMatthew G. Knepley case INSERT_VALUES: 5126e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5127e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5128e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5129e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5130e07394fbSMatthew G. Knepley } break; 5131e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 5132e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5133e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5134e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5135e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5136e07394fbSMatthew G. Knepley } break; 5137e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 5138e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5139e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5140e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5141e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5142e07394fbSMatthew G. Knepley } break; 5143e07394fbSMatthew G. Knepley case ADD_VALUES: 5144e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5145e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5146e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5147e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5148e07394fbSMatthew G. Knepley } break; 5149e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 5150e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5151e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5152e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5153e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5154e07394fbSMatthew G. Knepley } break; 5155e07394fbSMatthew G. Knepley default: 5156e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5157e07394fbSMatthew G. Knepley } 5158e07394fbSMatthew G. Knepley } 5159e07394fbSMatthew G. Knepley /* Cleanup points */ 5160e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 5161e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 5162e07394fbSMatthew G. Knepley /* Cleanup array */ 5163e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5164e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 5165e07394fbSMatthew G. Knepley } 5166e07394fbSMatthew G. Knepley 5167e07394fbSMatthew G. Knepley #undef __FUNCT__ 5168552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5169b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5170552f7358SJed Brown { 5171552f7358SJed Brown PetscMPIInt rank; 5172552f7358SJed Brown PetscInt i, j; 5173552f7358SJed Brown PetscErrorCode ierr; 5174552f7358SJed Brown 5175552f7358SJed Brown PetscFunctionBegin; 517682f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 517777a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5178b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5179b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5180b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5181b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 518277a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5183b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5184519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51857eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5186552f7358SJed Brown #else 5187b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5188552f7358SJed Brown #endif 5189552f7358SJed Brown } 519077a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5191552f7358SJed Brown } 5192552f7358SJed Brown PetscFunctionReturn(0); 5193552f7358SJed Brown } 5194552f7358SJed Brown 5195552f7358SJed Brown #undef __FUNCT__ 5196552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5197552f7358SJed Brown /* . off - The global offset of this point */ 5198e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5199a6dfd86eSKarl Rupp { 5200e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5201552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5202552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5203552f7358SJed Brown PetscInt cind = 0, k; 5204552f7358SJed Brown PetscErrorCode ierr; 5205552f7358SJed Brown 5206552f7358SJed Brown PetscFunctionBegin; 5207552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5208552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5209552f7358SJed Brown if (!cdof || setBC) { 5210552f7358SJed Brown if (orientation >= 0) { 5211e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5212552f7358SJed Brown } else { 5213e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5214552f7358SJed Brown } 5215552f7358SJed Brown } else { 5216552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5217552f7358SJed Brown if (orientation >= 0) { 5218552f7358SJed Brown for (k = 0; k < dof; ++k) { 5219552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5220552f7358SJed Brown /* Insert check for returning constrained indices */ 5221e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5222552f7358SJed Brown ++cind; 5223552f7358SJed Brown } else { 5224e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5225552f7358SJed Brown } 5226552f7358SJed Brown } 5227552f7358SJed Brown } else { 5228552f7358SJed Brown for (k = 0; k < dof; ++k) { 5229552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5230552f7358SJed Brown /* Insert check for returning constrained indices */ 5231e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5232552f7358SJed Brown ++cind; 5233552f7358SJed Brown } else { 5234e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5235552f7358SJed Brown } 5236552f7358SJed Brown } 5237552f7358SJed Brown } 5238552f7358SJed Brown } 5239e6ccafaeSMatthew G Knepley *loff += dof; 5240552f7358SJed Brown PetscFunctionReturn(0); 5241552f7358SJed Brown } 5242552f7358SJed Brown 5243552f7358SJed Brown #undef __FUNCT__ 5244552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5245552f7358SJed Brown /* . off - The global offset of this point */ 5246a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5247a6dfd86eSKarl Rupp { 5248552f7358SJed Brown PetscInt numFields, foff, f; 5249552f7358SJed Brown PetscErrorCode ierr; 5250552f7358SJed Brown 5251552f7358SJed Brown PetscFunctionBegin; 5252552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5253552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5254552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5255552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5256552f7358SJed Brown PetscInt cind = 0, k, c; 5257552f7358SJed Brown 5258552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5259552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5260552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5261552f7358SJed Brown if (!cfdof || setBC) { 5262552f7358SJed Brown if (orientation >= 0) { 52630d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5264552f7358SJed Brown } else { 5265552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5266552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5267552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5268552f7358SJed Brown } 5269552f7358SJed Brown } 5270552f7358SJed Brown } 5271552f7358SJed Brown } else { 5272552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5273552f7358SJed Brown if (orientation >= 0) { 5274552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5275552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5276552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5277552f7358SJed Brown ++cind; 5278552f7358SJed Brown } else { 5279552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5280552f7358SJed Brown } 5281552f7358SJed Brown } 5282552f7358SJed Brown } else { 5283552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5284552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5285552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5286552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5287552f7358SJed Brown ++cind; 5288552f7358SJed Brown } else { 5289552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5290552f7358SJed Brown } 5291552f7358SJed Brown } 5292552f7358SJed Brown } 5293552f7358SJed Brown } 5294552f7358SJed Brown } 5295552f7358SJed Brown foff += fdof - cfdof; 5296552f7358SJed Brown foffs[f] += fdof; 5297552f7358SJed Brown } 5298552f7358SJed Brown PetscFunctionReturn(0); 5299552f7358SJed Brown } 5300552f7358SJed Brown 5301552f7358SJed Brown #undef __FUNCT__ 5302552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 53037f5d1fdeSMatthew G. Knepley /*@C 53047f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 53057f5d1fdeSMatthew G. Knepley 53067f5d1fdeSMatthew G. Knepley Not collective 53077f5d1fdeSMatthew G. Knepley 53087f5d1fdeSMatthew G. Knepley Input Parameters: 53097f5d1fdeSMatthew G. Knepley + dm - The DM 5310ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5311ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 53127f5d1fdeSMatthew G. Knepley . A - The matrix 53137f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 53147f5d1fdeSMatthew G. Knepley . values - The array of values 53157f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 53167f5d1fdeSMatthew G. Knepley 53177f5d1fdeSMatthew G. Knepley Fortran Notes: 53187f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 53197f5d1fdeSMatthew G. Knepley 53207f5d1fdeSMatthew G. Knepley Level: intermediate 53217f5d1fdeSMatthew G. Knepley 53227f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 53237f5d1fdeSMatthew G. Knepley @*/ 53247c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5325552f7358SJed Brown { 5326552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 53271b406b76SMatthew G. Knepley PetscSection clSection; 53281b406b76SMatthew G. Knepley IS clPoints; 53290298fd71SBarry Smith PetscInt *points = NULL; 53301b406b76SMatthew G. Knepley const PetscInt *clp; 5331552f7358SJed Brown PetscInt *indices; 5332552f7358SJed Brown PetscInt offsets[32]; 5333552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5334552f7358SJed Brown PetscErrorCode ierr; 5335552f7358SJed Brown 5336552f7358SJed Brown PetscFunctionBegin; 5337552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5338ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 53393dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5340ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 53413dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 53423dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5343552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 534482f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5345552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 53461b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 53471b406b76SMatthew G. Knepley if (!clPoints) { 5348552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5349552f7358SJed Brown /* Compress out points not in the section */ 5350552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5351552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5352552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5353552f7358SJed Brown points[q*2] = points[p]; 5354552f7358SJed Brown points[q*2+1] = points[p+1]; 5355552f7358SJed Brown ++q; 5356552f7358SJed Brown } 5357552f7358SJed Brown } 5358552f7358SJed Brown numPoints = q; 53591b406b76SMatthew G. Knepley } else { 53601b406b76SMatthew G. Knepley PetscInt dof, off; 53611b406b76SMatthew G. Knepley 53621b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 53631b406b76SMatthew G. Knepley numPoints = dof/2; 53641b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 53651b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 53661b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 53671b406b76SMatthew G. Knepley } 5368552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5369552f7358SJed Brown PetscInt fdof; 5370552f7358SJed Brown 5371552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5372552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5373552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5374552f7358SJed Brown offsets[f+1] += fdof; 5375552f7358SJed Brown } 5376552f7358SJed Brown numIndices += dof; 5377552f7358SJed Brown } 53780d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 53790d644c17SKarl Rupp 538082f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5381552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5382552f7358SJed Brown if (numFields) { 5383552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5384552f7358SJed Brown PetscInt o = points[p+1]; 5385552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5386552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5387552f7358SJed Brown } 5388552f7358SJed Brown } else { 5389e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5390552f7358SJed Brown PetscInt o = points[p+1]; 5391552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5392e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5393552f7358SJed Brown } 5394552f7358SJed Brown } 5395b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5396552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5397552f7358SJed Brown if (ierr) { 5398552f7358SJed Brown PetscMPIInt rank; 5399552f7358SJed Brown PetscErrorCode ierr2; 5400552f7358SJed Brown 540182f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 540277a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5403b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 54046a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5405552f7358SJed Brown CHKERRQ(ierr); 5406552f7358SJed Brown } 54071b406b76SMatthew G. Knepley if (!clPoints) { 5408552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 54091b406b76SMatthew G. Knepley } else { 54101b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 54111b406b76SMatthew G. Knepley } 5412552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5413552f7358SJed Brown PetscFunctionReturn(0); 5414552f7358SJed Brown } 5415552f7358SJed Brown 5416552f7358SJed Brown #undef __FUNCT__ 5417de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5418de41b84cSMatthew 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) 5419de41b84cSMatthew G. Knepley { 5420de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5421de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5422de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5423de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5424de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5425de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 54264ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5427de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5428de41b84cSMatthew G. Knepley 5429de41b84cSMatthew G. Knepley PetscFunctionBegin; 5430de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5431de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5432de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5433de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5434de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5435de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5436de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5437de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5438de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5439de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5440de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5441de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5442de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5443de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5444de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5445de41b84cSMatthew G. Knepley /* Column indices */ 5446de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 54474ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5448de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5449de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5450de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5451de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5452de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5453de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5454de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5455de41b84cSMatthew G. Knepley ++q; 5456de41b84cSMatthew G. Knepley } 5457de41b84cSMatthew G. Knepley } 5458de41b84cSMatthew G. Knepley numCPoints = q; 5459de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5460de41b84cSMatthew G. Knepley PetscInt fdof; 5461de41b84cSMatthew G. Knepley 5462de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 54634ca5e9f5SMatthew G. Knepley if (!dof) continue; 5464de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5465de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5466de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5467de41b84cSMatthew G. Knepley } 5468de41b84cSMatthew G. Knepley numCIndices += dof; 5469de41b84cSMatthew G. Knepley } 5470de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5471de41b84cSMatthew G. Knepley /* Row indices */ 5472de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5473de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 54741ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5475de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5476de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5477de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5478de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5479de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5480de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5481de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 54824ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 54834ca5e9f5SMatthew G. Knepley if (!dof) continue; 54844ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 54854ca5e9f5SMatthew G. Knepley if (s < q) continue; 5486de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5487de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5488de41b84cSMatthew G. Knepley ++q; 5489de41b84cSMatthew G. Knepley } 5490de41b84cSMatthew G. Knepley } 5491de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5492de41b84cSMatthew G. Knepley } 5493de41b84cSMatthew G. Knepley numFPoints = q; 5494de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5495de41b84cSMatthew G. Knepley PetscInt fdof; 5496de41b84cSMatthew G. Knepley 5497de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 54984ca5e9f5SMatthew G. Knepley if (!dof) continue; 5499de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5500de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5501de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5502de41b84cSMatthew G. Knepley } 5503de41b84cSMatthew G. Knepley numFIndices += dof; 5504de41b84cSMatthew G. Knepley } 5505de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5506de41b84cSMatthew G. Knepley 5507de41b84cSMatthew 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); 5508de41b84cSMatthew 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); 5509de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5510de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5511de41b84cSMatthew G. Knepley if (numFields) { 5512de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5513de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5514de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5515de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5516de41b84cSMatthew G. Knepley } 5517de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5518de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5519de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5520de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5521de41b84cSMatthew G. Knepley } 5522de41b84cSMatthew G. Knepley } else { 5523de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5524de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5525de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5526de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5527de41b84cSMatthew G. Knepley } 5528de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5529de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5530de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5531de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5532de41b84cSMatthew G. Knepley } 5533de41b84cSMatthew G. Knepley } 5534de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5535de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5536de41b84cSMatthew G. Knepley if (ierr) { 5537de41b84cSMatthew G. Knepley PetscMPIInt rank; 5538de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5539de41b84cSMatthew G. Knepley 5540de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5541de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5542de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5543de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5544de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5545de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5546de41b84cSMatthew G. Knepley } 5547549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5548de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5549de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5550de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5551de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5552de41b84cSMatthew G. Knepley } 5553de41b84cSMatthew G. Knepley 5554de41b84cSMatthew G. Knepley #undef __FUNCT__ 55557c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 55567c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 55577c927364SMatthew G. Knepley { 55587c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 55597c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 55607c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 55617c927364SMatthew G. Knepley CellRefiner cellRefiner; 55627c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 55637c927364SMatthew G. Knepley PetscErrorCode ierr; 55647c927364SMatthew G. Knepley 55657c927364SMatthew G. Knepley PetscFunctionBegin; 55667c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 55677c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 55687c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 55697c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 55707c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 55717c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 55727c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 55737c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 55747c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 55757c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 55767c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 55777c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 55787c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55797c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55807c927364SMatthew G. Knepley /* Column indices */ 55817c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 55827c927364SMatthew G. Knepley maxFPoints = numCPoints; 55837c927364SMatthew G. Knepley /* Compress out points not in the section */ 55847c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 55857c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 55867c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 55877c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 55887c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 55897c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 55907c927364SMatthew G. Knepley ++q; 55917c927364SMatthew G. Knepley } 55927c927364SMatthew G. Knepley } 55937c927364SMatthew G. Knepley numCPoints = q; 55947c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 55957c927364SMatthew G. Knepley PetscInt fdof; 55967c927364SMatthew G. Knepley 55977c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 55987c927364SMatthew G. Knepley if (!dof) continue; 55997c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 56007c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 56017c927364SMatthew G. Knepley coffsets[f+1] += fdof; 56027c927364SMatthew G. Knepley } 56037c927364SMatthew G. Knepley numCIndices += dof; 56047c927364SMatthew G. Knepley } 56057c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 56067c927364SMatthew G. Knepley /* Row indices */ 56077c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 56087c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 56097c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 56107c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 56117c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 56127c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 56137c927364SMatthew G. Knepley /* Compress out points not in the section */ 56147c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 56157c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 56167c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 56177c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 56187c927364SMatthew G. Knepley if (!dof) continue; 56197c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 56207c927364SMatthew G. Knepley if (s < q) continue; 56217c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 56227c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 56237c927364SMatthew G. Knepley ++q; 56247c927364SMatthew G. Knepley } 56257c927364SMatthew G. Knepley } 56267c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 56277c927364SMatthew G. Knepley } 56287c927364SMatthew G. Knepley numFPoints = q; 56297c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 56307c927364SMatthew G. Knepley PetscInt fdof; 56317c927364SMatthew G. Knepley 56327c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 56337c927364SMatthew G. Knepley if (!dof) continue; 56347c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 56357c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 56367c927364SMatthew G. Knepley foffsets[f+1] += fdof; 56377c927364SMatthew G. Knepley } 56387c927364SMatthew G. Knepley numFIndices += dof; 56397c927364SMatthew G. Knepley } 56407c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 56417c927364SMatthew G. Knepley 56427c927364SMatthew 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); 56437c927364SMatthew 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); 56447c927364SMatthew G. Knepley if (numFields) { 56457c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 56467c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 56477c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 56487c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 56497c927364SMatthew G. Knepley } 56507c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 56517c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56527c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56537c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 56547c927364SMatthew G. Knepley } 56557c927364SMatthew G. Knepley } else { 56567c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 56577c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 56587c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 56597c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 56607c927364SMatthew G. Knepley } 56617c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 56627c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56637c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56647c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 56657c927364SMatthew G. Knepley } 56667c927364SMatthew G. Knepley } 56677c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 56687c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 56697c927364SMatthew G. Knepley PetscFunctionReturn(0); 56707c927364SMatthew G. Knepley } 56717c927364SMatthew G. Knepley 56727c927364SMatthew G. Knepley #undef __FUNCT__ 5673770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5674f96281f8SMatthew G. Knepley /*@ 5675f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5676f96281f8SMatthew G. Knepley 5677f96281f8SMatthew G. Knepley Input Parameter: 5678f96281f8SMatthew G. Knepley . dm - The DMPlex object 5679f96281f8SMatthew G. Knepley 5680f96281f8SMatthew G. Knepley Output Parameters: 5681f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5682dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5683dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5684dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5685f96281f8SMatthew G. Knepley 5686f96281f8SMatthew G. Knepley Level: developer 5687f96281f8SMatthew G. Knepley 5688dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 5689f96281f8SMatthew G. Knepley @*/ 5690770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5691552f7358SJed Brown { 5692552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5693770b213bSMatthew G Knepley PetscInt dim; 5694770b213bSMatthew G Knepley PetscErrorCode ierr; 5695552f7358SJed Brown 5696552f7358SJed Brown PetscFunctionBegin; 5697552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5698770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5699770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5700770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5701770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5702770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5703552f7358SJed Brown PetscFunctionReturn(0); 5704552f7358SJed Brown } 5705552f7358SJed Brown 5706552f7358SJed Brown #undef __FUNCT__ 5707770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5708dc5a3409SMatthew G. Knepley /*@ 5709dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 5710dc5a3409SMatthew G. Knepley 5711dc5a3409SMatthew G. Knepley Input Parameters: 5712dc5a3409SMatthew G. Knepley . dm - The DMPlex object 5713dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 5714dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5715dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5716dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5717dc5a3409SMatthew G. Knepley 5718dc5a3409SMatthew G. Knepley Level: developer 5719dc5a3409SMatthew G. Knepley 5720dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 5721dc5a3409SMatthew G. Knepley @*/ 5722770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5723552f7358SJed Brown { 5724552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5725770b213bSMatthew G Knepley PetscInt dim; 5726770b213bSMatthew G Knepley PetscErrorCode ierr; 5727552f7358SJed Brown 5728552f7358SJed Brown PetscFunctionBegin; 5729552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5730770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5731770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5732770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5733770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5734770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5735552f7358SJed Brown PetscFunctionReturn(0); 5736552f7358SJed Brown } 5737552f7358SJed Brown 5738552f7358SJed Brown #undef __FUNCT__ 5739552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5740552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5741552f7358SJed Brown { 5742552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5743552f7358SJed Brown 5744552f7358SJed Brown PetscFunctionBegin; 5745552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5746552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5747552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5748552f7358SJed Brown PetscFunctionReturn(0); 5749552f7358SJed Brown } 5750552f7358SJed Brown 5751552f7358SJed Brown #undef __FUNCT__ 5752552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5753552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5754552f7358SJed Brown { 5755552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5756552f7358SJed Brown 5757552f7358SJed Brown PetscFunctionBegin; 5758552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5759552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5760552f7358SJed Brown PetscFunctionReturn(0); 5761552f7358SJed Brown } 5762552f7358SJed Brown 5763552f7358SJed Brown #undef __FUNCT__ 5764552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5765552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5766ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5767552f7358SJed Brown { 5768552f7358SJed Brown PetscSection section, globalSection; 5769552f7358SJed Brown PetscInt *numbers, p; 5770552f7358SJed Brown PetscErrorCode ierr; 5771552f7358SJed Brown 5772552f7358SJed Brown PetscFunctionBegin; 577382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5774552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5775552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5776552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5777552f7358SJed Brown } 5778552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5779552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5780785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5781552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5782552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5783ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5784ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5785552f7358SJed Brown } 578682f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5787ef48cebcSMatthew G. Knepley if (globalSize) { 5788ef48cebcSMatthew G. Knepley PetscLayout layout; 5789ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5790ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5791ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5792ef48cebcSMatthew G. Knepley } 5793552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5794552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5795552f7358SJed Brown PetscFunctionReturn(0); 5796552f7358SJed Brown } 5797552f7358SJed Brown 5798552f7358SJed Brown #undef __FUNCT__ 5799552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5800552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5801552f7358SJed Brown { 5802552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5803552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5804552f7358SJed Brown PetscErrorCode ierr; 5805552f7358SJed Brown 5806552f7358SJed Brown PetscFunctionBegin; 5807552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5808552f7358SJed Brown if (!mesh->globalCellNumbers) { 5809552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5810552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 58110298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 58120d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5813ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5814552f7358SJed Brown } 5815552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5816552f7358SJed Brown PetscFunctionReturn(0); 5817552f7358SJed Brown } 5818552f7358SJed Brown 5819552f7358SJed Brown #undef __FUNCT__ 5820552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5821552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5822552f7358SJed Brown { 5823552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5824552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5825552f7358SJed Brown PetscErrorCode ierr; 5826552f7358SJed Brown 5827552f7358SJed Brown PetscFunctionBegin; 5828552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5829552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5830552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 58310298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 58320d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5833ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5834552f7358SJed Brown } 5835552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5836552f7358SJed Brown PetscFunctionReturn(0); 5837552f7358SJed Brown } 5838552f7358SJed Brown 5839ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5840ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5841ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5842ef48cebcSMatthew G. Knepley { 5843ef48cebcSMatthew G. Knepley IS nums[4]; 5844ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5845ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5846ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5847ef48cebcSMatthew G. Knepley 5848ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5849ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5850ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5851ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5852ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5853ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5854ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5855ef48cebcSMatthew G. Knepley 5856ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5857ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5858ef48cebcSMatthew G. Knepley shift += gsize; 5859ef48cebcSMatthew G. Knepley } 5860ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 5861ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5862ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5863ef48cebcSMatthew G. Knepley } 5864ef48cebcSMatthew G. Knepley 5865552f7358SJed Brown 5866552f7358SJed Brown #undef __FUNCT__ 5867552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5868552f7358SJed Brown /*@C 5869552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5870552f7358SJed Brown the local section and an SF describing the section point overlap. 5871552f7358SJed Brown 5872552f7358SJed Brown Input Parameters: 5873552f7358SJed Brown + s - The PetscSection for the local field layout 5874552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5875552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5876552f7358SJed Brown . label - The label specifying the points 5877552f7358SJed Brown - labelValue - The label stratum specifying the points 5878552f7358SJed Brown 5879552f7358SJed Brown Output Parameter: 5880552f7358SJed Brown . gsection - The PetscSection for the global field layout 5881552f7358SJed Brown 5882552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5883552f7358SJed Brown 5884552f7358SJed Brown Level: developer 5885552f7358SJed Brown 5886552f7358SJed Brown .seealso: PetscSectionCreate() 5887552f7358SJed Brown @*/ 5888552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5889552f7358SJed Brown { 58907ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5891552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5892552f7358SJed Brown PetscErrorCode ierr; 5893552f7358SJed Brown 5894552f7358SJed Brown PetscFunctionBegin; 58954c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5896552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5897552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 58987ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 58997ec39499SMatthew G. Knepley if (nroots >= 0) { 59007ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 59011795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 59027ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 59031795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 59047ec39499SMatthew G. Knepley } else { 59057ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 59067ec39499SMatthew G. Knepley } 59077ec39499SMatthew G. Knepley } 5908552f7358SJed Brown /* Mark ghost points with negative dof */ 5909552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5910552f7358SJed Brown PetscInt value; 5911552f7358SJed Brown 5912552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5913552f7358SJed Brown if (value != labelValue) continue; 5914552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5915552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5916552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5917552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 59187ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5919552f7358SJed Brown } 5920552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5921552f7358SJed Brown if (nroots >= 0) { 59227ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 59237ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5924552f7358SJed Brown if (nroots > pEnd-pStart) { 59257ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5926552f7358SJed Brown } 5927552f7358SJed Brown } 5928552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5929552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5930552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5931552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5932552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5933552f7358SJed Brown } 59344c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5935552f7358SJed Brown globalOff -= off; 5936552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5937552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 59387ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5939552f7358SJed Brown } 5940552f7358SJed Brown /* Put in negative offsets for ghost points */ 5941552f7358SJed Brown if (nroots >= 0) { 59427ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 59437ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5944552f7358SJed Brown if (nroots > pEnd-pStart) { 59457ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5946552f7358SJed Brown } 5947552f7358SJed Brown } 59487ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5949552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5950552f7358SJed Brown PetscFunctionReturn(0); 5951552f7358SJed Brown } 5952ca8062c8SMatthew G. Knepley 5953ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5954ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5955ca8062c8SMatthew G. Knepley /*@ 5956ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5957ca8062c8SMatthew G. Knepley 5958ca8062c8SMatthew G. Knepley Input Parameters: 5959ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5960ca8062c8SMatthew G. Knepley 5961ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5962ca8062c8SMatthew G. Knepley 5963ca8062c8SMatthew G. Knepley Level: developer 5964ca8062c8SMatthew G. Knepley 59659bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5966ca8062c8SMatthew G. Knepley @*/ 5967ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5968ca8062c8SMatthew G. Knepley { 5969ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5970ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5971ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5972ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5973ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5974ca8062c8SMatthew G. Knepley 5975ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5976ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5977ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5978ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5979ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5980ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5981ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5982ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5983ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5984ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 598542e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 598642e66dfaSMatthew G. Knepley PetscInt d; 598742e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 598842e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 598942e66dfaSMatthew G. Knepley } 5990ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5991ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5992ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5993ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5994ca8062c8SMatthew G. Knepley } 599542e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5996ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5997ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5998ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5999ca8062c8SMatthew G. Knepley } 6000ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6001ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6002ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6003ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6004ca8062c8SMatthew G. Knepley } 6005ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 600642e66dfaSMatthew G. Knepley if (dup) { 600742e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 600842e66dfaSMatthew G. Knepley } else { 6009ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6010ca8062c8SMatthew G. Knepley } 6011ca8062c8SMatthew G. Knepley } 601242e66dfaSMatthew G. Knepley } 6013ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6014ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6015ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6016ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6017ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6018ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6019ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6020ca8062c8SMatthew G. Knepley } 6021ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6022ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6023ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6024ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6025ca8062c8SMatthew G. Knepley } 6026ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6027ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6028ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6029ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6030ca8062c8SMatthew G. Knepley } 6031ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6032ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6033ca8062c8SMatthew G. Knepley } 6034ca8062c8SMatthew G. Knepley } 6035ca8062c8SMatthew G. Knepley } 6036ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6037ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6038ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6039ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6040ca8062c8SMatthew G. Knepley } 6041ca8062c8SMatthew G. Knepley 6042ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6043ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6044ca8062c8SMatthew G. Knepley /*@ 6045ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6046ca8062c8SMatthew G. Knepley 6047ca8062c8SMatthew G. Knepley Input Parameters: 6048ca8062c8SMatthew G. Knepley + dm - The DMPlex object 604958723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 605058723a97SMatthew G. Knepley - cellHeight - Normally 0 6051ca8062c8SMatthew G. Knepley 6052ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6053ca8062c8SMatthew G. Knepley 6054ca8062c8SMatthew G. Knepley Level: developer 6055ca8062c8SMatthew G. Knepley 60569bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6057ca8062c8SMatthew G. Knepley @*/ 605858723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6059ca8062c8SMatthew G. Knepley { 606042363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6061ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6062ca8062c8SMatthew G. Knepley 6063ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6064ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6065ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6066ca8062c8SMatthew G. Knepley switch (dim) { 606742363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 606842363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 606942363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6070ca8062c8SMatthew G. Knepley default: 6071ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6072ca8062c8SMatthew G. Knepley } 607358723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 607458723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6075ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6076ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6077ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 607858723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 607958723a97SMatthew G. Knepley 608058723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 608158723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 608258723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 608358723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 608458723a97SMatthew G. Knepley } 608558723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6086ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6087ca8062c8SMatthew G. Knepley } 608842363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 608942363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 609042363296SMatthew G. Knepley 609142363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 609242363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 609342363296SMatthew G. Knepley const PetscInt p = closure[cl]; 609442363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 609542363296SMatthew G. Knepley } 609642363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 609742363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 609842363296SMatthew G. Knepley } 6099ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6100ca8062c8SMatthew G. Knepley } 61019bf0dad6SMatthew G. Knepley 61029bf0dad6SMatthew G. Knepley #undef __FUNCT__ 61039bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 61049bf0dad6SMatthew G. Knepley /*@ 61059bf0dad6SMatthew 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 61069bf0dad6SMatthew G. Knepley 61079bf0dad6SMatthew G. Knepley Input Parameters: 61089bf0dad6SMatthew G. Knepley + dm - The DMPlex object 61099bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 61109bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 61119bf0dad6SMatthew G. Knepley 61129bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 61139bf0dad6SMatthew G. Knepley 61149bf0dad6SMatthew G. Knepley Level: developer 61159bf0dad6SMatthew G. Knepley 61169bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 61179bf0dad6SMatthew G. Knepley @*/ 61189bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 61199bf0dad6SMatthew G. Knepley { 61203554e41dSMatthew G. Knepley PetscInt pMax[4]; 61213554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 61229bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 61239bf0dad6SMatthew G. Knepley 61249bf0dad6SMatthew G. Knepley PetscFunctionBegin; 61259bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 61269bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 61279bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 612825abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 61293554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 61303554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 61313554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 61329bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 61339bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 61349bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 61359bf0dad6SMatthew G. Knepley 613625abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 61379bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 61389bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 61399bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 61409bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 61419bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 61429bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 61439bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 61449bf0dad6SMatthew G. Knepley } 61453554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 61469bf0dad6SMatthew 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); 61479bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 61489bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 61499bf0dad6SMatthew G. Knepley 61509bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 61519bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 61529bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 61539bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 61549bf0dad6SMatthew G. Knepley } 6155e003ed69SMatthew 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); 61569bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6157e003ed69SMatthew 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]); 61589bf0dad6SMatthew G. Knepley } 61599bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 61609bf0dad6SMatthew G. Knepley } 61619bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 61629bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 61639bf0dad6SMatthew G. Knepley } 61643554e41dSMatthew G. Knepley } 6165552f7358SJed Brown PetscFunctionReturn(0); 6166552f7358SJed Brown } 61673913d7c8SMatthew G. Knepley 61683913d7c8SMatthew G. Knepley #undef __FUNCT__ 6169bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6170bceba477SMatthew G. Knepley /* Pointwise interpolation 6171bceba477SMatthew G. Knepley Just code FEM for now 6172bceba477SMatthew G. Knepley u^f = I u^c 61734ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 61744ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 61754ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6176bceba477SMatthew G. Knepley */ 6177bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6178bceba477SMatthew G. Knepley { 6179bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6180bceba477SMatthew G. Knepley PetscInt m, n; 6181a063dac3SMatthew G. Knepley void *ctx; 6182bceba477SMatthew G. Knepley PetscErrorCode ierr; 6183bceba477SMatthew G. Knepley 6184bceba477SMatthew G. Knepley PetscFunctionBegin; 6185bceba477SMatthew G. Knepley /* 6186bceba477SMatthew G. Knepley Loop over coarse cells 6187bceba477SMatthew G. Knepley Loop over coarse basis functions 6188bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6189bceba477SMatthew G. Knepley Loop over fine dual basis functions 6190bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6191bceba477SMatthew G. Knepley Sum 6192bceba477SMatthew G. Knepley Update local element matrix 6193bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6194bceba477SMatthew G. Knepley 6195bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6196bceba477SMatthew G. Knepley */ 6197bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6198bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6199bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6200bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6201bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6202bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6203bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6204bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6205bceba477SMatthew G. Knepley ierr = MatSetUp(*interpolation);CHKERRQ(ierr); 6206bceba477SMatthew G. Knepley ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr); 6207bceba477SMatthew G. Knepley ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr); 6208a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6209a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 62105d1c2e58SMatthew G. Knepley /* Use naive scaling */ 62115d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6212a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6213a063dac3SMatthew G. Knepley } 6214bceba477SMatthew G. Knepley 6215a063dac3SMatthew G. Knepley #undef __FUNCT__ 6216a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6217a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6218a063dac3SMatthew G. Knepley { 621990748bafSMatthew G. Knepley PetscErrorCode ierr; 622090748bafSMatthew G. Knepley 6221a063dac3SMatthew G. Knepley PetscFunctionBegin; 62227c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 6223bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6224bceba477SMatthew G. Knepley } 6225bceba477SMatthew G. Knepley 6226bceba477SMatthew G. Knepley #undef __FUNCT__ 6227fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6228fd59a867SMatthew G. Knepley /* Pointwise interpolation 6229fd59a867SMatthew G. Knepley Just code FEM for now 6230fd59a867SMatthew G. Knepley u^f = I u^c 6231fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6232fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6233fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6234fd59a867SMatthew G. Knepley */ 6235fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6236fd59a867SMatthew G. Knepley { 6237fd59a867SMatthew G. Knepley PetscSection section; 6238fd59a867SMatthew G. Knepley IS *bcPoints; 6239286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6240286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6241fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6242fd59a867SMatthew G. Knepley 6243fd59a867SMatthew G. Knepley PetscFunctionBegin; 6244fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6245286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6246fd59a867SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6247fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6248fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6249fd59a867SMatthew G. Knepley PetscBool isEssential; 625063d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6251fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6252fd59a867SMatthew G. Knepley } 6253fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6254fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6255fd59a867SMatthew G. Knepley const char *bdLabel; 6256fd59a867SMatthew G. Knepley DMLabel label; 6257fd59a867SMatthew G. Knepley const PetscInt *values; 62587391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 6259c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 6260fd59a867SMatthew G. Knepley 626163d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6262fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6263fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 62647391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 62657391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 62667391c1cbSMatthew G. Knepley const char *bdname; 62672f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 62687391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 62697391c1cbSMatthew G. Knepley if (duplicate) break; 62707391c1cbSMatthew G. Knepley } 62717391c1cbSMatthew G. Knepley if (!duplicate) { 6272fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 627332720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 62747391c1cbSMatthew G. Knepley } 627593a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6276fd59a867SMatthew G. Knepley if (isEssential) { 627793a5981aSMatthew G. Knepley IS tmp; 627893a5981aSMatthew G. Knepley PetscInt *newidx; 627993a5981aSMatthew G. Knepley const PetscInt *idx; 628093a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 628193a5981aSMatthew G. Knepley 6282fd59a867SMatthew G. Knepley bcFields[bc] = field; 628393a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 628493a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 628593a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 628693a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 628793a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 628893a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 628993a5981aSMatthew G. Knepley newn = 0; 629093a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 629193a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 629293a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 629393a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6294fd59a867SMatthew G. Knepley } 6295fd59a867SMatthew G. Knepley } 6296fd59a867SMatthew G. Knepley /* Handle discretization */ 6297fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6298286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6299fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6300fd59a867SMatthew G. Knepley PetscFE fe; 6301286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6302fd59a867SMatthew G. Knepley PetscInt d; 6303fd59a867SMatthew G. Knepley 630418abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6305fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6306286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6307286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6308fd59a867SMatthew G. Knepley } 6309286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6310286d8613SMatthew G. Knepley PetscInt d; 6311286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6312286d8613SMatthew 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."); 6313286d8613SMatthew G. Knepley } 6314286d8613SMatthew G. Knepley } 6315f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6316fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6317fd59a867SMatthew G. Knepley PetscFE fe; 6318fd59a867SMatthew G. Knepley const char *name; 631918abd763SMatthew G. Knepley 632018abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6321fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6322fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6323fd59a867SMatthew G. Knepley } 6324fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6325fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6326fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6327fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6328286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6329bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6330bceba477SMatthew G. Knepley } 6331bceba477SMatthew G. Knepley 6332bceba477SMatthew G. Knepley #undef __FUNCT__ 63333913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 63343913d7c8SMatthew G. Knepley /*@ 63353913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 63363913d7c8SMatthew G. Knepley 63373913d7c8SMatthew G. Knepley Input Parameter: 63383913d7c8SMatthew G. Knepley . dm - The DMPlex object 63393913d7c8SMatthew G. Knepley 63403913d7c8SMatthew G. Knepley Output Parameter: 63413913d7c8SMatthew G. Knepley . cdm - The coarse DM 63423913d7c8SMatthew G. Knepley 63433913d7c8SMatthew G. Knepley Level: intermediate 63443913d7c8SMatthew G. Knepley 63453913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 63463913d7c8SMatthew G. Knepley @*/ 63473913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 63483913d7c8SMatthew G. Knepley { 63493913d7c8SMatthew G. Knepley PetscFunctionBegin; 63503913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63513913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 63523913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 63533913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 63543913d7c8SMatthew G. Knepley } 63553913d7c8SMatthew G. Knepley 63563913d7c8SMatthew G. Knepley #undef __FUNCT__ 63573913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 63583913d7c8SMatthew G. Knepley /*@ 63593913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 63603913d7c8SMatthew G. Knepley 63613913d7c8SMatthew G. Knepley Input Parameters: 63623913d7c8SMatthew G. Knepley + dm - The DMPlex object 63633913d7c8SMatthew G. Knepley - cdm - The coarse DM 63643913d7c8SMatthew G. Knepley 63653913d7c8SMatthew G. Knepley Level: intermediate 63663913d7c8SMatthew G. Knepley 63673913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 63683913d7c8SMatthew G. Knepley @*/ 63693913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 63703913d7c8SMatthew G. Knepley { 63713913d7c8SMatthew G. Knepley DM_Plex *mesh; 63723913d7c8SMatthew G. Knepley PetscErrorCode ierr; 63733913d7c8SMatthew G. Knepley 63743913d7c8SMatthew G. Knepley PetscFunctionBegin; 63753913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63763913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 63773913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 63783913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 63793913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 63803913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 63813913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 63823913d7c8SMatthew G. Knepley } 6383