134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2*a68b90caSToby Isaac #include <petsc-private/dmimpl.h> 3552f7358SJed Brown #include <../src/sys/utils/hash.h> 4d53a3d6fSBarry Smith #include <petsc-private/isimpl.h> 50c312b8eSJed Brown #include <petscsf.h> 6552f7358SJed Brown 7552f7358SJed Brown /* Logging support */ 875a69067SMatthew 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; 9552f7358SJed Brown 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 115a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 122c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer); 13552f7358SJed Brown 147e42fee7SMatthew G. Knepley #undef __FUNCT__ 157afe7537SMatthew G. Knepley #define __FUNCT__ "DMPlexGetFieldType_Internal" 167afe7537SMatthew G. Knepley PetscErrorCode DMPlexGetFieldType_Internal(DM dm, PetscSection section, PetscInt field, PetscInt *sStart, PetscInt *sEnd, PetscViewerVTKFieldType *ft) 177e42fee7SMatthew G. Knepley { 187e42fee7SMatthew G. Knepley PetscInt dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, vdof = 0, cdof = 0; 197e42fee7SMatthew G. Knepley PetscErrorCode ierr; 207e42fee7SMatthew G. Knepley 217e42fee7SMatthew G. Knepley PetscFunctionBegin; 227e42fee7SMatthew G. Knepley *ft = PETSC_VTK_POINT_FIELD; 23c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 247e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 257e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 267e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 277e42fee7SMatthew G. Knepley if (field >= 0) { 287e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 297e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 307e42fee7SMatthew G. Knepley } else { 317e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 327e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 337e42fee7SMatthew G. Knepley } 347e42fee7SMatthew G. Knepley if (vdof) { 357e42fee7SMatthew G. Knepley *sStart = vStart; 367e42fee7SMatthew G. Knepley *sEnd = vEnd; 377e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 387e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 397e42fee7SMatthew G. Knepley } else if (cdof) { 407e42fee7SMatthew G. Knepley *sStart = cStart; 417e42fee7SMatthew G. Knepley *sEnd = cEnd; 427e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 437e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 447e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 457e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 467e42fee7SMatthew G. Knepley } 477e42fee7SMatthew G. Knepley 48552f7358SJed Brown #undef __FUNCT__ 49552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 50552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 51552f7358SJed Brown { 52552f7358SJed Brown DM dm; 53b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 54552f7358SJed Brown PetscErrorCode ierr; 55552f7358SJed Brown 56552f7358SJed Brown PetscFunctionBegin; 57552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 5882f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 59552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 60b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 61b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 62ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 63ef31f671SMatthew G. Knepley PetscInt numFields; 64ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 65ef31f671SMatthew G. Knepley 66ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 67ef31f671SMatthew G. Knepley if (numFields) { 68ef31f671SMatthew G. Knepley PetscObject fe; 69ef31f671SMatthew G. Knepley 70ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 71ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 72ef31f671SMatthew G. Knepley } 734959657aSMatthew G. Knepley if (fem) {ierr = DMPlexInsertBoundaryValuesFEM(dm, v);CHKERRQ(ierr);} 74ef31f671SMatthew G. Knepley } 75552f7358SJed Brown if (isvtk) { 76552f7358SJed Brown PetscSection section; 77b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 78b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 79552f7358SJed Brown 80552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 817afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 82552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 83552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 84552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 85b136c2c9SMatthew G. Knepley } else if (ishdf5) { 86b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 87b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 88b136c2c9SMatthew G. Knepley #else 89b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 90b136c2c9SMatthew G. Knepley #endif 91552f7358SJed Brown } else { 9255f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 9355f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 94552f7358SJed Brown } 95552f7358SJed Brown PetscFunctionReturn(0); 96552f7358SJed Brown } 97552f7358SJed Brown 98552f7358SJed Brown #undef __FUNCT__ 99552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 100552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 101552f7358SJed Brown { 102552f7358SJed Brown DM dm; 10355f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 104552f7358SJed Brown PetscErrorCode ierr; 105552f7358SJed Brown 106552f7358SJed Brown PetscFunctionBegin; 107552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 10882f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 109552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 11033c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11155f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 112552f7358SJed Brown if (isvtk) { 113552f7358SJed Brown Vec locv; 114552f7358SJed Brown const char *name; 115552f7358SJed Brown 116552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 117552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 118552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 119552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 120552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 121552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 122552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 123b136c2c9SMatthew G. Knepley } else if (ishdf5) { 124b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 125b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 126b136c2c9SMatthew G. Knepley #else 127b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 128b136c2c9SMatthew G. Knepley #endif 129552f7358SJed Brown } else { 13055f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13155f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 132552f7358SJed Brown } 133552f7358SJed Brown PetscFunctionReturn(0); 134552f7358SJed Brown } 135552f7358SJed Brown 136552f7358SJed Brown #undef __FUNCT__ 1372c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1382c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1392c40f234SMatthew G. Knepley { 1402c40f234SMatthew G. Knepley DM dm; 1412c40f234SMatthew G. Knepley PetscBool ishdf5; 1422c40f234SMatthew G. Knepley PetscErrorCode ierr; 1432c40f234SMatthew G. Knepley 1442c40f234SMatthew G. Knepley PetscFunctionBegin; 1452c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1462c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1472c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1482c40f234SMatthew G. Knepley if (ishdf5) { 1492c40f234SMatthew G. Knepley DM dmBC; 1502c40f234SMatthew G. Knepley Vec gv; 1512c40f234SMatthew G. Knepley const char *name; 1522c40f234SMatthew G. Knepley 1532c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1542c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1552c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1562c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1582c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1592c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1602c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1612c40f234SMatthew G. Knepley } else { 1622c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1632c40f234SMatthew G. Knepley } 1642c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1652c40f234SMatthew G. Knepley } 1662c40f234SMatthew G. Knepley 1672c40f234SMatthew G. Knepley #undef __FUNCT__ 1682c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1692c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1702c40f234SMatthew G. Knepley { 1712c40f234SMatthew G. Knepley DM dm; 1722c40f234SMatthew G. Knepley PetscBool ishdf5; 1732c40f234SMatthew G. Knepley PetscErrorCode ierr; 1742c40f234SMatthew G. Knepley 1752c40f234SMatthew G. Knepley PetscFunctionBegin; 1762c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1772c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1782c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1792c40f234SMatthew G. Knepley if (ishdf5) { 180878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 181b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 182b136c2c9SMatthew G. Knepley #else 183b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 184878b459fSMatthew G. Knepley #endif 1852c40f234SMatthew G. Knepley } else { 1862c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 187552f7358SJed Brown } 188552f7358SJed Brown PetscFunctionReturn(0); 189552f7358SJed Brown } 190552f7358SJed Brown 191552f7358SJed Brown #undef __FUNCT__ 192552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 193552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 194552f7358SJed Brown { 195552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 196552f7358SJed Brown DM cdm; 197552f7358SJed Brown DMLabel markers; 198552f7358SJed Brown PetscSection coordSection; 199552f7358SJed Brown Vec coordinates; 200552f7358SJed Brown PetscViewerFormat format; 201552f7358SJed Brown PetscErrorCode ierr; 202552f7358SJed Brown 203552f7358SJed Brown PetscFunctionBegin; 204552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 205552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 206552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 207552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 208552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 209552f7358SJed Brown const char *name; 210552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 211552f7358SJed Brown PetscInt pStart, pEnd, p; 212552f7358SJed Brown PetscMPIInt rank, size; 213552f7358SJed Brown 21482f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 21582f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 216552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 217552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 218552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 220552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 221552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 222552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 223552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 224552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 225552f7358SJed Brown PetscInt dof, off, s; 226552f7358SJed Brown 227552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 228552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 229552f7358SJed Brown for (s = off; s < off+dof; ++s) { 230552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 231552f7358SJed Brown } 232552f7358SJed Brown } 233552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 234552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 235552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 236552f7358SJed Brown PetscInt dof, off, c; 237552f7358SJed Brown 238552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 239552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 240552f7358SJed Brown for (c = off; c < off+dof; ++c) { 241552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 242552f7358SJed Brown } 243552f7358SJed Brown } 244552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2450298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 246552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 247552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 248552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 249552f7358SJed Brown if (size > 1) { 250552f7358SJed Brown PetscSF sf; 251552f7358SJed Brown 252552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 253552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 254552f7358SJed Brown } 255552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 256552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 257552f7358SJed Brown const char *name; 258552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 259552f7358SJed Brown const int numColors = 3; 260552f7358SJed Brown PetscReal scale = 2.0; 261552f7358SJed Brown PetscScalar *coords; 262552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 263552f7358SJed Brown PetscMPIInt rank, size; 264552f7358SJed Brown 265552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 26682f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 26782f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 268552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 269552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 270770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 271770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 272552f7358SJed Brown \\usepackage{tikz}\n\ 273552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 274552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 275552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 276552f7358SJed Brown \\begin{document}\n\ 277552f7358SJed Brown \\section{%s}\n\ 278770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 279770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 280770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 281770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 282770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 283770b213bSMatthew G Knepley } else if (p > 0) { 284770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 285770b213bSMatthew G Knepley } 286770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 287770b213bSMatthew G Knepley } 288770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 289770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 290552f7358SJed Brown /* Plot vertices */ 291552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 292552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 293552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 294552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 295552f7358SJed Brown PetscInt off, dof, d; 296552f7358SJed Brown 297552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 298552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 299552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 300552f7358SJed Brown for (d = 0; d < dof; ++d) { 301552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3026712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 303552f7358SJed Brown } 304552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 305552f7358SJed Brown } 306552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 307552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 308552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 309552f7358SJed Brown /* Plot edges */ 310552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 311552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 312552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 313552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 314552f7358SJed Brown const PetscInt *cone; 315552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 316552f7358SJed Brown 317552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 31882f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 319552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 320552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 321552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 322552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 323552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 324552f7358SJed Brown for (d = 0; d < dof; ++d) { 325552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3266712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 327552f7358SJed Brown } 328552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 329552f7358SJed Brown } 330552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 331552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 332552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 333552f7358SJed Brown /* Plot cells */ 334552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 335552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3360298fd71SBarry Smith PetscInt *closure = NULL; 337552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 338552f7358SJed Brown 339552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 340552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 341552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 342552f7358SJed Brown const PetscInt point = closure[p]; 343552f7358SJed Brown 344552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 345552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 346552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 347552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 348552f7358SJed Brown } 349552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 350552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 351552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 352552f7358SJed Brown } 353552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 354552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 355770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 356552f7358SJed Brown } else { 35782f516ccSBarry Smith MPI_Comm comm; 358834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 359834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 360552f7358SJed Brown PetscInt pStart, pEnd, p; 361a57dd577SMatthew G Knepley PetscInt numLabels, l; 3621143a3c0SMatthew G. Knepley const char *name; 363552f7358SJed Brown PetscMPIInt size; 364552f7358SJed Brown 36582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 366552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 367c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3685f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3691143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3701143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 371552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 372552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 373bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 374dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 375552f7358SJed Brown if (depth == 1) { 376552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 377552f7358SJed Brown pEnd = pEnd - pStart; 378552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 379552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 380552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 381552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 382552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 383552f7358SJed Brown pEnd = pEnd - pStart; 384552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 385552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 386552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 387552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 388552f7358SJed Brown } else { 389552f7358SJed Brown for (d = 0; d <= dim; d++) { 390552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 391834065abSMatthew G. Knepley pEnd -= pStart; 392834065abSMatthew G. Knepley pMax[d] -= pStart; 393552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 394834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 395552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 396834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 397834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 398834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 399834065abSMatthew G. Knepley } 400552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 401552f7358SJed Brown } 402552f7358SJed Brown } 403834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 404a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 405a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 406a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 407a57dd577SMatthew G Knepley DMLabel label; 408a57dd577SMatthew G Knepley const char *name; 409a57dd577SMatthew G Knepley IS valueIS; 410a57dd577SMatthew G Knepley const PetscInt *values; 411a57dd577SMatthew G Knepley PetscInt numValues, v; 412a57dd577SMatthew G Knepley 413a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 414a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 415a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 416a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 417a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 418a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 419a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 420a57dd577SMatthew G Knepley PetscInt size; 421a57dd577SMatthew G Knepley 422a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 423a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 424a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 425a57dd577SMatthew G Knepley } 426a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 427a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4284d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 429a57dd577SMatthew G Knepley } 430552f7358SJed Brown } 431552f7358SJed Brown PetscFunctionReturn(0); 432552f7358SJed Brown } 433552f7358SJed Brown 434552f7358SJed Brown #undef __FUNCT__ 435552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 436552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 437552f7358SJed Brown { 438fcf6c8fdSToby Isaac PetscBool iascii, ishdf5, isvtk; 439552f7358SJed Brown PetscErrorCode ierr; 440552f7358SJed Brown 441552f7358SJed Brown PetscFunctionBegin; 442552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 443552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 444552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 445fcf6c8fdSToby Isaac ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 446c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 447552f7358SJed Brown if (iascii) { 448552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 449c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 450c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4517afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 452c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4537afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 454c6ccd67eSMatthew G. Knepley #else 455c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 456552f7358SJed Brown #endif 45711aeaf0aSBarry Smith } 458fcf6c8fdSToby Isaac else if (isvtk) { 459fcf6c8fdSToby Isaac ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr); 460fcf6c8fdSToby Isaac } 461552f7358SJed Brown PetscFunctionReturn(0); 462552f7358SJed Brown } 463552f7358SJed Brown 4642c40f234SMatthew G. Knepley #undef __FUNCT__ 4652c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4662c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4672c40f234SMatthew G. Knepley { 4682c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4692c40f234SMatthew G. Knepley PetscErrorCode ierr; 4702c40f234SMatthew G. Knepley 4712c40f234SMatthew G. Knepley PetscFunctionBegin; 4722c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4732c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4742c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4752c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4762c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4772c40f234SMatthew G. Knepley else if (ishdf5) { 4782c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 47910b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4802c40f234SMatthew G. Knepley #else 4812c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 482552f7358SJed Brown #endif 483552f7358SJed Brown } 484552f7358SJed Brown PetscFunctionReturn(0); 485552f7358SJed Brown } 486552f7358SJed Brown 487552f7358SJed Brown #undef __FUNCT__ 4886c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4896c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4906c73c22cSMatthew G. Knepley { 4916c73c22cSMatthew G. Knepley DMBoundary b, next; 4926c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4936c73c22cSMatthew G. Knepley 4948e136ac0SMatthew G. Knepley PetscFunctionBegin; 4956c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4966c73c22cSMatthew G. Knepley b = *boundary; 4976c73c22cSMatthew G. Knepley *boundary = NULL; 4986c73c22cSMatthew G. Knepley for (; b; b = next) { 4996c73c22cSMatthew G. Knepley next = b->next; 5006c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 5016c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 50263d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 5036c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 5046c73c22cSMatthew G. Knepley } 5056c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5066c73c22cSMatthew G. Knepley } 5076c73c22cSMatthew G. Knepley 5086c73c22cSMatthew G. Knepley #undef __FUNCT__ 509552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 510552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 511552f7358SJed Brown { 512552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 513552f7358SJed Brown DMLabel next = mesh->labels; 514552f7358SJed Brown PetscErrorCode ierr; 515552f7358SJed Brown 516552f7358SJed Brown PetscFunctionBegin; 5170d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 518552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 519552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 520552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 521552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 522552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 523552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 524552f7358SJed Brown while (next) { 525552f7358SJed Brown DMLabel tmp = next->next; 526552f7358SJed Brown 527552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 528552f7358SJed Brown next = tmp; 529552f7358SJed Brown } 5303913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 531a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 532552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 533552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5346c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 535*a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr); 536*a68b90caSToby Isaac ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr); 537*a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->constraintSection);CHKERRQ(ierr); 538*a68b90caSToby Isaac ierr = MatDestroy(&mesh->constraintMat);CHKERRQ(ierr); 539552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 540552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 541552f7358SJed Brown PetscFunctionReturn(0); 542552f7358SJed Brown } 543552f7358SJed Brown 544552f7358SJed Brown #undef __FUNCT__ 545552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 546b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 547552f7358SJed Brown { 548552f7358SJed Brown PetscSection section, sectionGlobal; 549552f7358SJed Brown PetscInt bs = -1; 550552f7358SJed Brown PetscInt localSize; 55189545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 552552f7358SJed Brown PetscErrorCode ierr; 553b412c318SBarry Smith MatType mtype; 554552f7358SJed Brown 555552f7358SJed Brown PetscFunctionBegin; 556607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 557b412c318SBarry Smith mtype = dm->mattype; 558552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 559552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 560552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 561552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 56282f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 563552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 564552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 565552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 566552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 567552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 568552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 569552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 570552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 571552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 572552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 573552f7358SJed Brown if (!isShell) { 574552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5752a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 576552f7358SJed Brown 577552f7358SJed Brown if (bs < 0) { 578552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 579fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 580552f7358SJed Brown 581552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 582552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 583552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 584fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 585fad22124SMatthew G Knepley if (dof-cdof) { 5862a28c762SMatthew G Knepley if (bs < 0) { 587fad22124SMatthew G Knepley bs = dof-cdof; 588fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5892a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5902a28c762SMatthew G Knepley bs = 1; 591552f7358SJed Brown break; 592552f7358SJed Brown } 593552f7358SJed Brown } 5942a28c762SMatthew G Knepley } 5952a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5962a28c762SMatthew G Knepley bsLocal = bs; 59782f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5982a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 59982f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6002a28c762SMatthew G Knepley if (bsMin != bsMax) { 6012a28c762SMatthew G Knepley bs = 1; 6022a28c762SMatthew G Knepley } else { 6032a28c762SMatthew G Knepley bs = bsMax; 6042a28c762SMatthew G Knepley } 605552f7358SJed Brown } else { 606552f7358SJed Brown bs = 1; 607552f7358SJed Brown } 608552f7358SJed Brown } 6091795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 610552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 611552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 612552f7358SJed Brown } 613552f7358SJed Brown PetscFunctionReturn(0); 614552f7358SJed Brown } 615552f7358SJed Brown 616552f7358SJed Brown #undef __FUNCT__ 617552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 618552f7358SJed Brown /*@ 619552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 620552f7358SJed Brown 621552f7358SJed Brown Not collective 622552f7358SJed Brown 623552f7358SJed Brown Input Parameter: 624552f7358SJed Brown . mesh - The DMPlex 625552f7358SJed Brown 626552f7358SJed Brown Output Parameters: 627552f7358SJed Brown + pStart - The first mesh point 628552f7358SJed Brown - pEnd - The upper bound for mesh points 629552f7358SJed Brown 630552f7358SJed Brown Level: beginner 631552f7358SJed Brown 632552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 633552f7358SJed Brown @*/ 634552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 635552f7358SJed Brown { 636552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 637552f7358SJed Brown PetscErrorCode ierr; 638552f7358SJed Brown 639552f7358SJed Brown PetscFunctionBegin; 640552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 641552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 642552f7358SJed Brown PetscFunctionReturn(0); 643552f7358SJed Brown } 644552f7358SJed Brown 645552f7358SJed Brown #undef __FUNCT__ 646552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 647552f7358SJed Brown /*@ 648552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 649552f7358SJed Brown 650552f7358SJed Brown Not collective 651552f7358SJed Brown 652552f7358SJed Brown Input Parameters: 653552f7358SJed Brown + mesh - The DMPlex 654552f7358SJed Brown . pStart - The first mesh point 655552f7358SJed Brown - pEnd - The upper bound for mesh points 656552f7358SJed Brown 657552f7358SJed Brown Output Parameters: 658552f7358SJed Brown 659552f7358SJed Brown Level: beginner 660552f7358SJed Brown 661552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 662552f7358SJed Brown @*/ 663552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 664552f7358SJed Brown { 665552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 666552f7358SJed Brown PetscErrorCode ierr; 667552f7358SJed Brown 668552f7358SJed Brown PetscFunctionBegin; 669552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 670552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 671552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 672552f7358SJed Brown PetscFunctionReturn(0); 673552f7358SJed Brown } 674552f7358SJed Brown 675552f7358SJed Brown #undef __FUNCT__ 676552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 677552f7358SJed Brown /*@ 678552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 679552f7358SJed Brown 680552f7358SJed Brown Not collective 681552f7358SJed Brown 682552f7358SJed Brown Input Parameters: 683552f7358SJed Brown + mesh - The DMPlex 684552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 685552f7358SJed Brown 686552f7358SJed Brown Output Parameter: 687552f7358SJed Brown . size - The cone size for point p 688552f7358SJed Brown 689552f7358SJed Brown Level: beginner 690552f7358SJed Brown 691552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 692552f7358SJed Brown @*/ 693552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 694552f7358SJed Brown { 695552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 696552f7358SJed Brown PetscErrorCode ierr; 697552f7358SJed Brown 698552f7358SJed Brown PetscFunctionBegin; 699552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 700552f7358SJed Brown PetscValidPointer(size, 3); 701552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 702552f7358SJed Brown PetscFunctionReturn(0); 703552f7358SJed Brown } 704552f7358SJed Brown 705552f7358SJed Brown #undef __FUNCT__ 706552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 707552f7358SJed Brown /*@ 708552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 709552f7358SJed Brown 710552f7358SJed Brown Not collective 711552f7358SJed Brown 712552f7358SJed Brown Input Parameters: 713552f7358SJed Brown + mesh - The DMPlex 714552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 715552f7358SJed Brown - size - The cone size for point p 716552f7358SJed Brown 717552f7358SJed Brown Output Parameter: 718552f7358SJed Brown 719552f7358SJed Brown Note: 720552f7358SJed Brown This should be called after DMPlexSetChart(). 721552f7358SJed Brown 722552f7358SJed Brown Level: beginner 723552f7358SJed Brown 724552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 725552f7358SJed Brown @*/ 726552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 727552f7358SJed Brown { 728552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 729552f7358SJed Brown PetscErrorCode ierr; 730552f7358SJed Brown 731552f7358SJed Brown PetscFunctionBegin; 732552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 733552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7340d644c17SKarl Rupp 735552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 736552f7358SJed Brown PetscFunctionReturn(0); 737552f7358SJed Brown } 738552f7358SJed Brown 739552f7358SJed Brown #undef __FUNCT__ 740f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 741f5a469b9SMatthew G. Knepley /*@ 742f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 743f5a469b9SMatthew G. Knepley 744f5a469b9SMatthew G. Knepley Not collective 745f5a469b9SMatthew G. Knepley 746f5a469b9SMatthew G. Knepley Input Parameters: 747f5a469b9SMatthew G. Knepley + mesh - The DMPlex 748f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 749f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 750f5a469b9SMatthew G. Knepley 751f5a469b9SMatthew G. Knepley Output Parameter: 752f5a469b9SMatthew G. Knepley 753f5a469b9SMatthew G. Knepley Note: 754f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 755f5a469b9SMatthew G. Knepley 756f5a469b9SMatthew G. Knepley Level: beginner 757f5a469b9SMatthew G. Knepley 758f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 759f5a469b9SMatthew G. Knepley @*/ 760f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 761f5a469b9SMatthew G. Knepley { 762f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 763f5a469b9SMatthew G. Knepley PetscInt csize; 764f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 765f5a469b9SMatthew G. Knepley 766f5a469b9SMatthew G. Knepley PetscFunctionBegin; 767f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 768f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 769f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 770f5a469b9SMatthew G. Knepley 771f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 772f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 773f5a469b9SMatthew G. Knepley } 774f5a469b9SMatthew G. Knepley 775f5a469b9SMatthew G. Knepley #undef __FUNCT__ 776552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 777552f7358SJed Brown /*@C 778552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 779552f7358SJed Brown 780552f7358SJed Brown Not collective 781552f7358SJed Brown 782552f7358SJed Brown Input Parameters: 783552f7358SJed Brown + mesh - The DMPlex 784552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 785552f7358SJed Brown 786552f7358SJed Brown Output Parameter: 787552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 788552f7358SJed Brown 789552f7358SJed Brown Level: beginner 790552f7358SJed Brown 7913813dfbdSMatthew G Knepley Fortran Notes: 7923813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7933813dfbdSMatthew G Knepley include petsc.h90 in your code. 7943813dfbdSMatthew G Knepley 7953813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 796552f7358SJed Brown 797552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 798552f7358SJed Brown @*/ 799552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 800552f7358SJed Brown { 801552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 802552f7358SJed Brown PetscInt off; 803552f7358SJed Brown PetscErrorCode ierr; 804552f7358SJed Brown 805552f7358SJed Brown PetscFunctionBegin; 806552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 807552f7358SJed Brown PetscValidPointer(cone, 3); 808552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 809552f7358SJed Brown *cone = &mesh->cones[off]; 810552f7358SJed Brown PetscFunctionReturn(0); 811552f7358SJed Brown } 812552f7358SJed Brown 813552f7358SJed Brown #undef __FUNCT__ 814552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 815552f7358SJed Brown /*@ 816552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 817552f7358SJed Brown 818552f7358SJed Brown Not collective 819552f7358SJed Brown 820552f7358SJed Brown Input Parameters: 821552f7358SJed Brown + mesh - The DMPlex 822552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 823552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 824552f7358SJed Brown 825552f7358SJed Brown Output Parameter: 826552f7358SJed Brown 827552f7358SJed Brown Note: 828552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 829552f7358SJed Brown 830552f7358SJed Brown Level: beginner 831552f7358SJed Brown 832552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 833552f7358SJed Brown @*/ 834552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 835552f7358SJed Brown { 836552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 837552f7358SJed Brown PetscInt pStart, pEnd; 838552f7358SJed Brown PetscInt dof, off, c; 839552f7358SJed Brown PetscErrorCode ierr; 840552f7358SJed Brown 841552f7358SJed Brown PetscFunctionBegin; 842552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 843552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 844552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 845552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 846552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 84782f516ccSBarry 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); 848552f7358SJed Brown for (c = 0; c < dof; ++c) { 84982f516ccSBarry 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); 850552f7358SJed Brown mesh->cones[off+c] = cone[c]; 851552f7358SJed Brown } 852552f7358SJed Brown PetscFunctionReturn(0); 853552f7358SJed Brown } 854552f7358SJed Brown 855552f7358SJed Brown #undef __FUNCT__ 856552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 857552f7358SJed Brown /*@C 858552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 859552f7358SJed Brown 860552f7358SJed Brown Not collective 861552f7358SJed Brown 862552f7358SJed Brown Input Parameters: 863552f7358SJed Brown + mesh - The DMPlex 864552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 865552f7358SJed Brown 866552f7358SJed Brown Output Parameter: 867552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 868552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 869552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 870552f7358SJed Brown the index of the cone point on which to start. 871552f7358SJed Brown 872552f7358SJed Brown Level: beginner 873552f7358SJed Brown 8743813dfbdSMatthew G Knepley Fortran Notes: 8753813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8763813dfbdSMatthew G Knepley include petsc.h90 in your code. 8773813dfbdSMatthew G Knepley 8783813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 879552f7358SJed Brown 880552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 881552f7358SJed Brown @*/ 882552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 883552f7358SJed Brown { 884552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 885552f7358SJed Brown PetscInt off; 886552f7358SJed Brown PetscErrorCode ierr; 887552f7358SJed Brown 888552f7358SJed Brown PetscFunctionBegin; 889552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 890552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 891552f7358SJed Brown { 892552f7358SJed Brown PetscInt dof; 893552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 894552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 895552f7358SJed Brown } 896552f7358SJed Brown #endif 897552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 8980d644c17SKarl Rupp 899552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 900552f7358SJed Brown PetscFunctionReturn(0); 901552f7358SJed Brown } 902552f7358SJed Brown 903552f7358SJed Brown #undef __FUNCT__ 904552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 905552f7358SJed Brown /*@ 906552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 907552f7358SJed Brown 908552f7358SJed Brown Not collective 909552f7358SJed Brown 910552f7358SJed Brown Input Parameters: 911552f7358SJed Brown + mesh - The DMPlex 912552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 913552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 914552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 915552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 916552f7358SJed Brown the index of the cone point on which to start. 917552f7358SJed Brown 918552f7358SJed Brown Output Parameter: 919552f7358SJed Brown 920552f7358SJed Brown Note: 921552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 922552f7358SJed Brown 923552f7358SJed Brown Level: beginner 924552f7358SJed Brown 925552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 926552f7358SJed Brown @*/ 927552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 928552f7358SJed Brown { 929552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 930552f7358SJed Brown PetscInt pStart, pEnd; 931552f7358SJed Brown PetscInt dof, off, c; 932552f7358SJed Brown PetscErrorCode ierr; 933552f7358SJed Brown 934552f7358SJed Brown PetscFunctionBegin; 935552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 936552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 937552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 938552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 939552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 94082f516ccSBarry 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); 941552f7358SJed Brown for (c = 0; c < dof; ++c) { 942552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 943552f7358SJed Brown 944552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 94582f516ccSBarry 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); 946552f7358SJed Brown mesh->coneOrientations[off+c] = o; 947552f7358SJed Brown } 948552f7358SJed Brown PetscFunctionReturn(0); 949552f7358SJed Brown } 950552f7358SJed Brown 951552f7358SJed Brown #undef __FUNCT__ 952552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 953552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 954552f7358SJed Brown { 955552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 956552f7358SJed Brown PetscInt pStart, pEnd; 957552f7358SJed Brown PetscInt dof, off; 958552f7358SJed Brown PetscErrorCode ierr; 959552f7358SJed Brown 960552f7358SJed Brown PetscFunctionBegin; 961552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 962552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 96382f516ccSBarry 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); 96482f516ccSBarry 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); 96577c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 96677c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 96777c88f5bSMatthew 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); 968552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 969552f7358SJed Brown PetscFunctionReturn(0); 970552f7358SJed Brown } 971552f7358SJed Brown 972552f7358SJed Brown #undef __FUNCT__ 97377c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 97477c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 97577c88f5bSMatthew G Knepley { 97677c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 97777c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 97877c88f5bSMatthew G Knepley PetscInt dof, off; 97977c88f5bSMatthew G Knepley PetscErrorCode ierr; 98077c88f5bSMatthew G Knepley 98177c88f5bSMatthew G Knepley PetscFunctionBegin; 98277c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 98377c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 98477c88f5bSMatthew 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); 98577c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 98677c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98777c88f5bSMatthew 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); 98877c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 98977c88f5bSMatthew G Knepley PetscFunctionReturn(0); 99077c88f5bSMatthew G Knepley } 99177c88f5bSMatthew G Knepley 99277c88f5bSMatthew G Knepley #undef __FUNCT__ 993552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 994552f7358SJed Brown /*@ 995552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 996552f7358SJed Brown 997552f7358SJed Brown Not collective 998552f7358SJed Brown 999552f7358SJed Brown Input Parameters: 1000552f7358SJed Brown + mesh - The DMPlex 1001552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1002552f7358SJed Brown 1003552f7358SJed Brown Output Parameter: 1004552f7358SJed Brown . size - The support size for point p 1005552f7358SJed Brown 1006552f7358SJed Brown Level: beginner 1007552f7358SJed Brown 1008552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1009552f7358SJed Brown @*/ 1010552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1011552f7358SJed Brown { 1012552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1013552f7358SJed Brown PetscErrorCode ierr; 1014552f7358SJed Brown 1015552f7358SJed Brown PetscFunctionBegin; 1016552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1017552f7358SJed Brown PetscValidPointer(size, 3); 1018552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1019552f7358SJed Brown PetscFunctionReturn(0); 1020552f7358SJed Brown } 1021552f7358SJed Brown 1022552f7358SJed Brown #undef __FUNCT__ 1023552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1024552f7358SJed Brown /*@ 1025552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1026552f7358SJed Brown 1027552f7358SJed Brown Not collective 1028552f7358SJed Brown 1029552f7358SJed Brown Input Parameters: 1030552f7358SJed Brown + mesh - The DMPlex 1031552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1032552f7358SJed Brown - size - The support size for point p 1033552f7358SJed Brown 1034552f7358SJed Brown Output Parameter: 1035552f7358SJed Brown 1036552f7358SJed Brown Note: 1037552f7358SJed Brown This should be called after DMPlexSetChart(). 1038552f7358SJed Brown 1039552f7358SJed Brown Level: beginner 1040552f7358SJed Brown 1041552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1042552f7358SJed Brown @*/ 1043552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1044552f7358SJed Brown { 1045552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1046552f7358SJed Brown PetscErrorCode ierr; 1047552f7358SJed Brown 1048552f7358SJed Brown PetscFunctionBegin; 1049552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1050552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10510d644c17SKarl Rupp 1052552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1053552f7358SJed Brown PetscFunctionReturn(0); 1054552f7358SJed Brown } 1055552f7358SJed Brown 1056552f7358SJed Brown #undef __FUNCT__ 1057552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1058552f7358SJed Brown /*@C 1059552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1060552f7358SJed Brown 1061552f7358SJed Brown Not collective 1062552f7358SJed Brown 1063552f7358SJed Brown Input Parameters: 1064552f7358SJed Brown + mesh - The DMPlex 1065552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1066552f7358SJed Brown 1067552f7358SJed Brown Output Parameter: 1068552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1069552f7358SJed Brown 1070552f7358SJed Brown Level: beginner 1071552f7358SJed Brown 10723813dfbdSMatthew G Knepley Fortran Notes: 10733813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10743813dfbdSMatthew G Knepley include petsc.h90 in your code. 10753813dfbdSMatthew G Knepley 10763813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10773813dfbdSMatthew G Knepley 1078552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1079552f7358SJed Brown @*/ 1080552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1081552f7358SJed Brown { 1082552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1083552f7358SJed Brown PetscInt off; 1084552f7358SJed Brown PetscErrorCode ierr; 1085552f7358SJed Brown 1086552f7358SJed Brown PetscFunctionBegin; 1087552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1088552f7358SJed Brown PetscValidPointer(support, 3); 1089552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1090552f7358SJed Brown *support = &mesh->supports[off]; 1091552f7358SJed Brown PetscFunctionReturn(0); 1092552f7358SJed Brown } 1093552f7358SJed Brown 1094552f7358SJed Brown #undef __FUNCT__ 1095552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1096552f7358SJed Brown /*@ 1097552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1098552f7358SJed Brown 1099552f7358SJed Brown Not collective 1100552f7358SJed Brown 1101552f7358SJed Brown Input Parameters: 1102552f7358SJed Brown + mesh - The DMPlex 1103552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1104552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1105552f7358SJed Brown 1106552f7358SJed Brown Output Parameter: 1107552f7358SJed Brown 1108552f7358SJed Brown Note: 1109552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1110552f7358SJed Brown 1111552f7358SJed Brown Level: beginner 1112552f7358SJed Brown 1113552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1114552f7358SJed Brown @*/ 1115552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1116552f7358SJed Brown { 1117552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1118552f7358SJed Brown PetscInt pStart, pEnd; 1119552f7358SJed Brown PetscInt dof, off, c; 1120552f7358SJed Brown PetscErrorCode ierr; 1121552f7358SJed Brown 1122552f7358SJed Brown PetscFunctionBegin; 1123552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1124552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1125552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1126552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1127552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 112882f516ccSBarry 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); 1129552f7358SJed Brown for (c = 0; c < dof; ++c) { 113082f516ccSBarry 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); 1131552f7358SJed Brown mesh->supports[off+c] = support[c]; 1132552f7358SJed Brown } 1133552f7358SJed Brown PetscFunctionReturn(0); 1134552f7358SJed Brown } 1135552f7358SJed Brown 1136552f7358SJed Brown #undef __FUNCT__ 1137552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1138552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1139552f7358SJed Brown { 1140552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1141552f7358SJed Brown PetscInt pStart, pEnd; 1142552f7358SJed Brown PetscInt dof, off; 1143552f7358SJed Brown PetscErrorCode ierr; 1144552f7358SJed Brown 1145552f7358SJed Brown PetscFunctionBegin; 1146552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1147552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1148552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1149552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 115082f516ccSBarry 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); 115182f516ccSBarry 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); 115282f516ccSBarry 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); 1153552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1154552f7358SJed Brown PetscFunctionReturn(0); 1155552f7358SJed Brown } 1156552f7358SJed Brown 1157552f7358SJed Brown #undef __FUNCT__ 1158552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1159552f7358SJed Brown /*@C 1160552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1161552f7358SJed Brown 1162552f7358SJed Brown Not collective 1163552f7358SJed Brown 1164552f7358SJed Brown Input Parameters: 1165552f7358SJed Brown + mesh - The DMPlex 1166552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1167552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11680298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1169552f7358SJed Brown 1170552f7358SJed Brown Output Parameters: 1171552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1172552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1173552f7358SJed Brown 1174552f7358SJed Brown Note: 11750298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1176552f7358SJed Brown 11773813dfbdSMatthew G Knepley Fortran Notes: 11783813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11793813dfbdSMatthew G Knepley include petsc.h90 in your code. 11803813dfbdSMatthew G Knepley 11813813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11823813dfbdSMatthew G Knepley 1183552f7358SJed Brown Level: beginner 1184552f7358SJed Brown 1185552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1186552f7358SJed Brown @*/ 1187552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1188552f7358SJed Brown { 1189552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1190552f7358SJed Brown PetscInt *closure, *fifo; 11910298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1192552f7358SJed Brown PetscInt tmpSize, t; 1193552f7358SJed Brown PetscInt depth = 0, maxSize; 1194552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1195552f7358SJed Brown PetscErrorCode ierr; 1196552f7358SJed Brown 1197552f7358SJed Brown PetscFunctionBegin; 1198552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1199552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1200552f7358SJed Brown /* This is only 1-level */ 1201552f7358SJed Brown if (useCone) { 1202552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1203552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1204552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1205552f7358SJed Brown } else { 1206552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1207552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1208552f7358SJed Brown } 1209bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1210bfbcdd7aSMatthew G. Knepley if (*points) { 1211bfbcdd7aSMatthew G. Knepley closure = *points; 1212bfbcdd7aSMatthew G. Knepley } else { 1213bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1214bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1215bfbcdd7aSMatthew G. Knepley } 1216bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1217bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1218bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1219bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1220bfbcdd7aSMatthew G. Knepley } 1221bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1222bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1223bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1224bfbcdd7aSMatthew G. Knepley } 1225bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1226bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1227bfbcdd7aSMatthew G. Knepley if (*points) { 1228bfbcdd7aSMatthew G. Knepley closure = *points; 1229bfbcdd7aSMatthew G. Knepley } else { 1230bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1231bfbcdd7aSMatthew G. Knepley } 1232bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1233552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1234552f7358SJed Brown const PetscInt cp = tmp[t]; 1235552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1236552f7358SJed Brown 1237552f7358SJed Brown closure[closureSize] = cp; 1238552f7358SJed Brown closure[closureSize+1] = co; 1239552f7358SJed Brown fifo[fifoSize] = cp; 1240552f7358SJed Brown fifo[fifoSize+1] = co; 1241552f7358SJed Brown } 1242bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1243552f7358SJed Brown while (fifoSize - fifoStart) { 1244552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1245552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1246552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1247552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1248552f7358SJed Brown 1249552f7358SJed Brown if (useCone) { 1250552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1251552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1252552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1253552f7358SJed Brown } else { 1254552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1255552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12560298fd71SBarry Smith tmpO = NULL; 1257552f7358SJed Brown } 1258552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1259552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1260552f7358SJed Brown const PetscInt cp = tmp[i]; 12612e1b13c2SMatthew 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. */ 12622e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12632e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12642e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1265552f7358SJed Brown PetscInt c; 1266552f7358SJed Brown 12672e1b13c2SMatthew G. Knepley if (rev) { 12682e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12692e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12702e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12712e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12722e1b13c2SMatthew G. Knepley } 1273552f7358SJed Brown /* Check for duplicate */ 1274552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1275552f7358SJed Brown if (closure[c] == cp) break; 1276552f7358SJed Brown } 1277552f7358SJed Brown if (c == closureSize) { 1278552f7358SJed Brown closure[closureSize] = cp; 1279552f7358SJed Brown closure[closureSize+1] = co; 1280552f7358SJed Brown fifo[fifoSize] = cp; 1281552f7358SJed Brown fifo[fifoSize+1] = co; 1282552f7358SJed Brown closureSize += 2; 1283552f7358SJed Brown fifoSize += 2; 1284552f7358SJed Brown } 1285552f7358SJed Brown } 1286552f7358SJed Brown fifoStart += 2; 1287552f7358SJed Brown } 1288552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1289552f7358SJed Brown if (points) *points = closure; 1290552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1291552f7358SJed Brown PetscFunctionReturn(0); 1292552f7358SJed Brown } 1293552f7358SJed Brown 1294552f7358SJed Brown #undef __FUNCT__ 12959bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 12969bf0dad6SMatthew G. Knepley /*@C 12979bf0dad6SMatthew 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 12989bf0dad6SMatthew G. Knepley 12999bf0dad6SMatthew G. Knepley Not collective 13009bf0dad6SMatthew G. Knepley 13019bf0dad6SMatthew G. Knepley Input Parameters: 13029bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13039bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13049bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13059bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13069bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13079bf0dad6SMatthew G. Knepley 13089bf0dad6SMatthew G. Knepley Output Parameters: 13099bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13109bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13119bf0dad6SMatthew G. Knepley 13129bf0dad6SMatthew G. Knepley Note: 13139bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13149bf0dad6SMatthew G. Knepley 13159bf0dad6SMatthew G. Knepley Fortran Notes: 13169bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13179bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13189bf0dad6SMatthew G. Knepley 13199bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13209bf0dad6SMatthew G. Knepley 13219bf0dad6SMatthew G. Knepley Level: beginner 13229bf0dad6SMatthew G. Knepley 13239bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13249bf0dad6SMatthew G. Knepley @*/ 13259bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13269bf0dad6SMatthew G. Knepley { 13279bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13289bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13299bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13309bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13319bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13329bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13339bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13349bf0dad6SMatthew G. Knepley 13359bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13369bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13379bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13389bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13399bf0dad6SMatthew G. Knepley if (useCone) { 13409bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13419bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13429bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13439bf0dad6SMatthew G. Knepley } else { 13449bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13459bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13469bf0dad6SMatthew G. Knepley } 13479bf0dad6SMatthew G. Knepley if (depth == 1) { 13489bf0dad6SMatthew G. Knepley if (*points) { 13499bf0dad6SMatthew G. Knepley closure = *points; 13509bf0dad6SMatthew G. Knepley } else { 13519bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13529bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13539bf0dad6SMatthew G. Knepley } 13549bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13559bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13569bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13579bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13589bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13599bf0dad6SMatthew G. Knepley } 13609bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13619bf0dad6SMatthew G. Knepley if (points) *points = closure; 13629bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13639bf0dad6SMatthew G. Knepley } 13649bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 13659bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13669bf0dad6SMatthew G. Knepley if (*points) { 13679bf0dad6SMatthew G. Knepley closure = *points; 13689bf0dad6SMatthew G. Knepley } else { 13699bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13709bf0dad6SMatthew G. Knepley } 13719bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13729bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13739bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13749bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13759bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13769bf0dad6SMatthew G. Knepley 13779bf0dad6SMatthew G. Knepley if (ornt < 0) { 13789bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13799bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13809bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13819bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13829bf0dad6SMatthew G. Knepley } 13839bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13849bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13859bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13869bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13879bf0dad6SMatthew G. Knepley } 13889bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 13899bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 13909bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 13919bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 13929bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 13939bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 13949bf0dad6SMatthew G. Knepley 13959bf0dad6SMatthew G. Knepley if (useCone) { 13969bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 13979bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 13989bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 13999bf0dad6SMatthew G. Knepley } else { 14009bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14019bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14029bf0dad6SMatthew G. Knepley tmpO = NULL; 14039bf0dad6SMatthew G. Knepley } 14049bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14059bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14069bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14079bf0dad6SMatthew 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. */ 14089bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14099bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14109bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14119bf0dad6SMatthew G. Knepley PetscInt c; 14129bf0dad6SMatthew G. Knepley 14139bf0dad6SMatthew G. Knepley if (rev) { 14149bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14159bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14169bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14179bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14189bf0dad6SMatthew G. Knepley } 14199bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14209bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14219bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14229bf0dad6SMatthew G. Knepley } 14239bf0dad6SMatthew G. Knepley if (c == closureSize) { 14249bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14259bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14269bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14279bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14289bf0dad6SMatthew G. Knepley closureSize += 2; 14299bf0dad6SMatthew G. Knepley fifoSize += 2; 14309bf0dad6SMatthew G. Knepley } 14319bf0dad6SMatthew G. Knepley } 14329bf0dad6SMatthew G. Knepley fifoStart += 2; 14339bf0dad6SMatthew G. Knepley } 14349bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14359bf0dad6SMatthew G. Knepley if (points) *points = closure; 14369bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14379bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14389bf0dad6SMatthew G. Knepley } 14399bf0dad6SMatthew G. Knepley 14409bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1441552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1442552f7358SJed Brown /*@C 1443552f7358SJed 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 1444552f7358SJed Brown 1445552f7358SJed Brown Not collective 1446552f7358SJed Brown 1447552f7358SJed Brown Input Parameters: 1448552f7358SJed Brown + mesh - The DMPlex 1449552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1450552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1451e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1452e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1453552f7358SJed Brown 1454552f7358SJed Brown Note: 14550298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1456552f7358SJed Brown 14573813dfbdSMatthew G Knepley Fortran Notes: 14583813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14593813dfbdSMatthew G Knepley include petsc.h90 in your code. 14603813dfbdSMatthew G Knepley 14613813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14623813dfbdSMatthew G Knepley 1463552f7358SJed Brown Level: beginner 1464552f7358SJed Brown 1465552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1466552f7358SJed Brown @*/ 1467552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1468552f7358SJed Brown { 1469552f7358SJed Brown PetscErrorCode ierr; 1470552f7358SJed Brown 1471552f7358SJed Brown PetscFunctionBegin; 1472552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1473e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1474e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1475552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14764ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1477552f7358SJed Brown PetscFunctionReturn(0); 1478552f7358SJed Brown } 1479552f7358SJed Brown 1480552f7358SJed Brown #undef __FUNCT__ 1481552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1482552f7358SJed Brown /*@ 1483552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1484552f7358SJed Brown 1485552f7358SJed Brown Not collective 1486552f7358SJed Brown 1487552f7358SJed Brown Input Parameter: 1488552f7358SJed Brown . mesh - The DMPlex 1489552f7358SJed Brown 1490552f7358SJed Brown Output Parameters: 1491552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1492552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1493552f7358SJed Brown 1494552f7358SJed Brown Level: beginner 1495552f7358SJed Brown 1496552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1497552f7358SJed Brown @*/ 1498552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1499552f7358SJed Brown { 1500552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1501552f7358SJed Brown 1502552f7358SJed Brown PetscFunctionBegin; 1503552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1504552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1505552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1506552f7358SJed Brown PetscFunctionReturn(0); 1507552f7358SJed Brown } 1508552f7358SJed Brown 1509552f7358SJed Brown #undef __FUNCT__ 1510552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1511552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1512552f7358SJed Brown { 1513552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1514552f7358SJed Brown PetscInt size; 1515552f7358SJed Brown PetscErrorCode ierr; 1516552f7358SJed Brown 1517552f7358SJed Brown PetscFunctionBegin; 1518552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1519552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1520552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15211795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15221795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1523552f7358SJed Brown if (mesh->maxSupportSize) { 1524552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1525552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15261795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1527552f7358SJed Brown } 1528552f7358SJed Brown PetscFunctionReturn(0); 1529552f7358SJed Brown } 1530552f7358SJed Brown 1531552f7358SJed Brown #undef __FUNCT__ 1532552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1533552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1534552f7358SJed Brown { 1535552f7358SJed Brown PetscErrorCode ierr; 1536552f7358SJed Brown 1537552f7358SJed Brown PetscFunctionBegin; 15384d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15394d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1540552f7358SJed Brown PetscFunctionReturn(0); 1541552f7358SJed Brown } 1542552f7358SJed Brown 1543552f7358SJed Brown #undef __FUNCT__ 1544552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1545552f7358SJed Brown /*@ 1546552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1547552f7358SJed Brown 1548552f7358SJed Brown Not collective 1549552f7358SJed Brown 1550552f7358SJed Brown Input Parameter: 1551552f7358SJed Brown . mesh - The DMPlex 1552552f7358SJed Brown 1553552f7358SJed Brown Output Parameter: 1554552f7358SJed Brown 1555552f7358SJed Brown Note: 1556552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1557552f7358SJed Brown 1558552f7358SJed Brown Level: beginner 1559552f7358SJed Brown 1560552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1561552f7358SJed Brown @*/ 1562552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1563552f7358SJed Brown { 1564552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1565552f7358SJed Brown PetscInt *offsets; 1566552f7358SJed Brown PetscInt supportSize; 1567552f7358SJed Brown PetscInt pStart, pEnd, p; 1568552f7358SJed Brown PetscErrorCode ierr; 1569552f7358SJed Brown 1570552f7358SJed Brown PetscFunctionBegin; 1571552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 157282f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1573552f7358SJed Brown /* Calculate support sizes */ 1574552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1575552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1576552f7358SJed Brown PetscInt dof, off, c; 1577552f7358SJed Brown 1578552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1579552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1580552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1581552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1582552f7358SJed Brown } 1583552f7358SJed Brown } 1584552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1585552f7358SJed Brown PetscInt dof; 1586552f7358SJed Brown 1587552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 15880d644c17SKarl Rupp 1589552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1590552f7358SJed Brown } 1591552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1592552f7358SJed Brown /* Calculate supports */ 1593552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 15941795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 15951795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1596552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1597552f7358SJed Brown PetscInt dof, off, c; 1598552f7358SJed Brown 1599552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1600552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1601552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1602552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1603552f7358SJed Brown PetscInt offS; 1604552f7358SJed Brown 1605552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16060d644c17SKarl Rupp 1607552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1608552f7358SJed Brown ++offsets[q]; 1609552f7358SJed Brown } 1610552f7358SJed Brown } 1611552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1612552f7358SJed Brown PetscFunctionReturn(0); 1613552f7358SJed Brown } 1614552f7358SJed Brown 1615552f7358SJed Brown #undef __FUNCT__ 1616552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1617552f7358SJed Brown /*@ 1618552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1619552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1620552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1621552f7358SJed Brown the DAG. 1622552f7358SJed Brown 1623552f7358SJed Brown Not collective 1624552f7358SJed Brown 1625552f7358SJed Brown Input Parameter: 1626552f7358SJed Brown . mesh - The DMPlex 1627552f7358SJed Brown 1628552f7358SJed Brown Output Parameter: 1629552f7358SJed Brown 1630552f7358SJed Brown Notes: 1631150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1632150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1633150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1634150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1635552f7358SJed Brown 1636150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1637552f7358SJed Brown 1638552f7358SJed Brown Level: beginner 1639552f7358SJed Brown 1640552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1641552f7358SJed Brown @*/ 1642552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1643552f7358SJed Brown { 1644aa50250dSMatthew G. Knepley DMLabel label; 1645552f7358SJed Brown PetscInt pStart, pEnd, p; 1646552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1647552f7358SJed Brown PetscErrorCode ierr; 1648552f7358SJed Brown 1649552f7358SJed Brown PetscFunctionBegin; 1650552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1651552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1652552f7358SJed Brown /* Calculate depth */ 1653aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1654aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1655aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1656552f7358SJed Brown /* Initialize roots and count leaves */ 1657552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1658552f7358SJed Brown PetscInt coneSize, supportSize; 1659552f7358SJed Brown 1660552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1661552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1662552f7358SJed Brown if (!coneSize && supportSize) { 1663552f7358SJed Brown ++numRoots; 1664aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1665552f7358SJed Brown } else if (!supportSize && coneSize) { 1666552f7358SJed Brown ++numLeaves; 1667552f7358SJed Brown } else if (!supportSize && !coneSize) { 1668552f7358SJed Brown /* Isolated points */ 1669aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1670552f7358SJed Brown } 1671552f7358SJed Brown } 1672552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1673552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1674552f7358SJed Brown PetscInt coneSize, supportSize; 1675552f7358SJed Brown 1676552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1677552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1678552f7358SJed Brown if (!supportSize && coneSize) { 1679aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1680552f7358SJed Brown } 1681552f7358SJed Brown } 1682552f7358SJed Brown } else { 168374ef644bSMatthew G. Knepley IS pointIS; 168474ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1685552f7358SJed Brown 168674ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 168774ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 168874ef644bSMatthew G. Knepley while (numPoints) { 168974ef644bSMatthew G. Knepley const PetscInt *points; 169074ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 169174ef644bSMatthew G. Knepley 169274ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 169374ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 169474ef644bSMatthew G. Knepley const PetscInt point = points[p]; 169574ef644bSMatthew G. Knepley const PetscInt *support; 169674ef644bSMatthew G. Knepley PetscInt supportSize, s; 169774ef644bSMatthew G. Knepley 169874ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 169974ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 170074ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 170174ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1702552f7358SJed Brown } 1703552f7358SJed Brown } 17045edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 170574ef644bSMatthew G. Knepley ++level; 170674ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 170774ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 170874ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170974ef644bSMatthew G. Knepley else {numPoints = 0;} 171074ef644bSMatthew G. Knepley } 171174ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 171274ef644bSMatthew G. Knepley } 1713552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1714552f7358SJed Brown PetscFunctionReturn(0); 1715552f7358SJed Brown } 1716552f7358SJed Brown 1717552f7358SJed Brown #undef __FUNCT__ 1718552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1719552f7358SJed Brown /*@C 1720552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1721552f7358SJed Brown 1722552f7358SJed Brown Not Collective 1723552f7358SJed Brown 1724552f7358SJed Brown Input Parameters: 1725552f7358SJed Brown + dm - The DMPlex object 1726552f7358SJed Brown . numPoints - The number of input points for the join 1727552f7358SJed Brown - points - The input points 1728552f7358SJed Brown 1729552f7358SJed Brown Output Parameters: 1730552f7358SJed Brown + numCoveredPoints - The number of points in the join 1731552f7358SJed Brown - coveredPoints - The points in the join 1732552f7358SJed Brown 1733552f7358SJed Brown Level: intermediate 1734552f7358SJed Brown 1735552f7358SJed Brown Note: Currently, this is restricted to a single level join 1736552f7358SJed Brown 17373813dfbdSMatthew G Knepley Fortran Notes: 17383813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17393813dfbdSMatthew G Knepley include petsc.h90 in your code. 17403813dfbdSMatthew G Knepley 17413813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17423813dfbdSMatthew G Knepley 1743552f7358SJed Brown .keywords: mesh 1744552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1745552f7358SJed Brown @*/ 1746552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1747552f7358SJed Brown { 1748552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1749552f7358SJed Brown PetscInt *join[2]; 1750552f7358SJed Brown PetscInt joinSize, i = 0; 1751552f7358SJed Brown PetscInt dof, off, p, c, m; 1752552f7358SJed Brown PetscErrorCode ierr; 1753552f7358SJed Brown 1754552f7358SJed Brown PetscFunctionBegin; 1755552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1756552f7358SJed Brown PetscValidPointer(points, 2); 1757552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1758552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1759552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1760552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1761552f7358SJed Brown /* Copy in support of first point */ 1762552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1763552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1764552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1765552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1766552f7358SJed Brown } 1767552f7358SJed Brown /* Check each successive support */ 1768552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1769552f7358SJed Brown PetscInt newJoinSize = 0; 1770552f7358SJed Brown 1771552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1772552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1773552f7358SJed Brown for (c = 0; c < dof; ++c) { 1774552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1775552f7358SJed Brown 1776552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1777552f7358SJed Brown if (point == join[i][m]) { 1778552f7358SJed Brown join[1-i][newJoinSize++] = point; 1779552f7358SJed Brown break; 1780552f7358SJed Brown } 1781552f7358SJed Brown } 1782552f7358SJed Brown } 1783552f7358SJed Brown joinSize = newJoinSize; 1784552f7358SJed Brown i = 1-i; 1785552f7358SJed Brown } 1786552f7358SJed Brown *numCoveredPoints = joinSize; 1787552f7358SJed Brown *coveredPoints = join[i]; 1788552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1789552f7358SJed Brown PetscFunctionReturn(0); 1790552f7358SJed Brown } 1791552f7358SJed Brown 1792552f7358SJed Brown #undef __FUNCT__ 1793552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1794552f7358SJed Brown /*@C 1795552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1796552f7358SJed Brown 1797552f7358SJed Brown Not Collective 1798552f7358SJed Brown 1799552f7358SJed Brown Input Parameters: 1800552f7358SJed Brown + dm - The DMPlex object 1801552f7358SJed Brown . numPoints - The number of input points for the join 1802552f7358SJed Brown - points - The input points 1803552f7358SJed Brown 1804552f7358SJed Brown Output Parameters: 1805552f7358SJed Brown + numCoveredPoints - The number of points in the join 1806552f7358SJed Brown - coveredPoints - The points in the join 1807552f7358SJed Brown 18083813dfbdSMatthew G Knepley Fortran Notes: 18093813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18103813dfbdSMatthew G Knepley include petsc.h90 in your code. 18113813dfbdSMatthew G Knepley 18123813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18133813dfbdSMatthew G Knepley 1814552f7358SJed Brown Level: intermediate 1815552f7358SJed Brown 1816552f7358SJed Brown .keywords: mesh 1817552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1818552f7358SJed Brown @*/ 1819552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1820552f7358SJed Brown { 1821552f7358SJed Brown PetscErrorCode ierr; 1822552f7358SJed Brown 1823552f7358SJed Brown PetscFunctionBegin; 1824552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1825d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1826d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1827d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1828552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1829d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1830552f7358SJed Brown PetscFunctionReturn(0); 1831552f7358SJed Brown } 1832552f7358SJed Brown 1833552f7358SJed Brown #undef __FUNCT__ 1834552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1835552f7358SJed Brown /*@C 1836552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1837552f7358SJed Brown 1838552f7358SJed Brown Not Collective 1839552f7358SJed Brown 1840552f7358SJed Brown Input Parameters: 1841552f7358SJed Brown + dm - The DMPlex object 1842552f7358SJed Brown . numPoints - The number of input points for the join 1843552f7358SJed Brown - points - The input points 1844552f7358SJed Brown 1845552f7358SJed Brown Output Parameters: 1846552f7358SJed Brown + numCoveredPoints - The number of points in the join 1847552f7358SJed Brown - coveredPoints - The points in the join 1848552f7358SJed Brown 18493813dfbdSMatthew G Knepley Fortran Notes: 18503813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18513813dfbdSMatthew G Knepley include petsc.h90 in your code. 18523813dfbdSMatthew G Knepley 18533813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18543813dfbdSMatthew G Knepley 1855552f7358SJed Brown Level: intermediate 1856552f7358SJed Brown 1857552f7358SJed Brown .keywords: mesh 1858552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1859552f7358SJed Brown @*/ 1860552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1861552f7358SJed Brown { 1862552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1863552f7358SJed Brown PetscInt *offsets, **closures; 1864552f7358SJed Brown PetscInt *join[2]; 1865552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1866552f7358SJed Brown PetscInt p, d, c, m; 1867552f7358SJed Brown PetscErrorCode ierr; 1868552f7358SJed Brown 1869552f7358SJed Brown PetscFunctionBegin; 1870552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1871552f7358SJed Brown PetscValidPointer(points, 2); 1872552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1873552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1874552f7358SJed Brown 1875552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18761795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1877552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1878e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1879552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1880552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1881552f7358SJed Brown 1882552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1883552f7358SJed Brown PetscInt closureSize; 1884552f7358SJed Brown 1885552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 18860d644c17SKarl Rupp 1887552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1888552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1889552f7358SJed Brown PetscInt pStart, pEnd, i; 1890552f7358SJed Brown 1891552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1892552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1893552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1894552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1895552f7358SJed Brown break; 1896552f7358SJed Brown } 1897552f7358SJed Brown } 1898552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1899552f7358SJed Brown } 190082f516ccSBarry 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); 1901552f7358SJed Brown } 1902552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1903552f7358SJed Brown PetscInt dof; 1904552f7358SJed Brown 1905552f7358SJed Brown /* Copy in support of first point */ 1906552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1907552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1908552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1909552f7358SJed Brown } 1910552f7358SJed Brown /* Check each successive cone */ 1911552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1912552f7358SJed Brown PetscInt newJoinSize = 0; 1913552f7358SJed Brown 1914552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1915552f7358SJed Brown for (c = 0; c < dof; ++c) { 1916552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1917552f7358SJed Brown 1918552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1919552f7358SJed Brown if (point == join[i][m]) { 1920552f7358SJed Brown join[1-i][newJoinSize++] = point; 1921552f7358SJed Brown break; 1922552f7358SJed Brown } 1923552f7358SJed Brown } 1924552f7358SJed Brown } 1925552f7358SJed Brown joinSize = newJoinSize; 1926552f7358SJed Brown i = 1-i; 1927552f7358SJed Brown } 1928552f7358SJed Brown if (joinSize) break; 1929552f7358SJed Brown } 1930552f7358SJed Brown *numCoveredPoints = joinSize; 1931552f7358SJed Brown *coveredPoints = join[i]; 1932552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19330298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1934552f7358SJed Brown } 1935552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1936552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1937552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1938552f7358SJed Brown PetscFunctionReturn(0); 1939552f7358SJed Brown } 1940552f7358SJed Brown 1941552f7358SJed Brown #undef __FUNCT__ 1942552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1943552f7358SJed Brown /*@C 1944552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1945552f7358SJed Brown 1946552f7358SJed Brown Not Collective 1947552f7358SJed Brown 1948552f7358SJed Brown Input Parameters: 1949552f7358SJed Brown + dm - The DMPlex object 1950552f7358SJed Brown . numPoints - The number of input points for the meet 1951552f7358SJed Brown - points - The input points 1952552f7358SJed Brown 1953552f7358SJed Brown Output Parameters: 1954552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1955552f7358SJed Brown - coveredPoints - The points in the meet 1956552f7358SJed Brown 1957552f7358SJed Brown Level: intermediate 1958552f7358SJed Brown 1959552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1960552f7358SJed Brown 19613813dfbdSMatthew G Knepley Fortran Notes: 19623813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19633813dfbdSMatthew G Knepley include petsc.h90 in your code. 19643813dfbdSMatthew G Knepley 19653813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19663813dfbdSMatthew G Knepley 1967552f7358SJed Brown .keywords: mesh 1968552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1969552f7358SJed Brown @*/ 1970552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1971552f7358SJed Brown { 1972552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1973552f7358SJed Brown PetscInt *meet[2]; 1974552f7358SJed Brown PetscInt meetSize, i = 0; 1975552f7358SJed Brown PetscInt dof, off, p, c, m; 1976552f7358SJed Brown PetscErrorCode ierr; 1977552f7358SJed Brown 1978552f7358SJed Brown PetscFunctionBegin; 1979552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1980552f7358SJed Brown PetscValidPointer(points, 2); 1981552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1982552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1983552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1984552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1985552f7358SJed Brown /* Copy in cone of first point */ 1986552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1987552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1988552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1989552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1990552f7358SJed Brown } 1991552f7358SJed Brown /* Check each successive cone */ 1992552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1993552f7358SJed Brown PetscInt newMeetSize = 0; 1994552f7358SJed Brown 1995552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1996552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1997552f7358SJed Brown for (c = 0; c < dof; ++c) { 1998552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1999552f7358SJed Brown 2000552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2001552f7358SJed Brown if (point == meet[i][m]) { 2002552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2003552f7358SJed Brown break; 2004552f7358SJed Brown } 2005552f7358SJed Brown } 2006552f7358SJed Brown } 2007552f7358SJed Brown meetSize = newMeetSize; 2008552f7358SJed Brown i = 1-i; 2009552f7358SJed Brown } 2010552f7358SJed Brown *numCoveringPoints = meetSize; 2011552f7358SJed Brown *coveringPoints = meet[i]; 2012552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2013552f7358SJed Brown PetscFunctionReturn(0); 2014552f7358SJed Brown } 2015552f7358SJed Brown 2016552f7358SJed Brown #undef __FUNCT__ 2017552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2018552f7358SJed Brown /*@C 2019552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2020552f7358SJed Brown 2021552f7358SJed Brown Not Collective 2022552f7358SJed Brown 2023552f7358SJed Brown Input Parameters: 2024552f7358SJed Brown + dm - The DMPlex object 2025552f7358SJed Brown . numPoints - The number of input points for the meet 2026552f7358SJed Brown - points - The input points 2027552f7358SJed Brown 2028552f7358SJed Brown Output Parameters: 2029552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2030552f7358SJed Brown - coveredPoints - The points in the meet 2031552f7358SJed Brown 2032552f7358SJed Brown Level: intermediate 2033552f7358SJed Brown 20343813dfbdSMatthew G Knepley Fortran Notes: 20353813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20363813dfbdSMatthew G Knepley include petsc.h90 in your code. 20373813dfbdSMatthew G Knepley 20383813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20393813dfbdSMatthew G Knepley 2040552f7358SJed Brown .keywords: mesh 2041552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2042552f7358SJed Brown @*/ 2043552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2044552f7358SJed Brown { 2045552f7358SJed Brown PetscErrorCode ierr; 2046552f7358SJed Brown 2047552f7358SJed Brown PetscFunctionBegin; 2048552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2049d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2050d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2051d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2052552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2053d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2054552f7358SJed Brown PetscFunctionReturn(0); 2055552f7358SJed Brown } 2056552f7358SJed Brown 2057552f7358SJed Brown #undef __FUNCT__ 2058552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2059552f7358SJed Brown /*@C 2060552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2061552f7358SJed Brown 2062552f7358SJed Brown Not Collective 2063552f7358SJed Brown 2064552f7358SJed Brown Input Parameters: 2065552f7358SJed Brown + dm - The DMPlex object 2066552f7358SJed Brown . numPoints - The number of input points for the meet 2067552f7358SJed Brown - points - The input points 2068552f7358SJed Brown 2069552f7358SJed Brown Output Parameters: 2070552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2071552f7358SJed Brown - coveredPoints - The points in the meet 2072552f7358SJed Brown 2073552f7358SJed Brown Level: intermediate 2074552f7358SJed Brown 20753813dfbdSMatthew G Knepley Fortran Notes: 20763813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20773813dfbdSMatthew G Knepley include petsc.h90 in your code. 20783813dfbdSMatthew G Knepley 20793813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20803813dfbdSMatthew G Knepley 2081552f7358SJed Brown .keywords: mesh 2082552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2083552f7358SJed Brown @*/ 2084552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2085552f7358SJed Brown { 2086552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2087552f7358SJed Brown PetscInt *offsets, **closures; 2088552f7358SJed Brown PetscInt *meet[2]; 2089552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2090552f7358SJed Brown PetscInt p, h, c, m; 2091552f7358SJed Brown PetscErrorCode ierr; 2092552f7358SJed Brown 2093552f7358SJed Brown PetscFunctionBegin; 2094552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2095552f7358SJed Brown PetscValidPointer(points, 2); 2096552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2097552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2098552f7358SJed Brown 2099552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2100785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2101552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2102e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2103552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2104552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2105552f7358SJed Brown 2106552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2107552f7358SJed Brown PetscInt closureSize; 2108552f7358SJed Brown 2109552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21100d644c17SKarl Rupp 2111552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2112552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2113552f7358SJed Brown PetscInt pStart, pEnd, i; 2114552f7358SJed Brown 2115552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2116552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2117552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2118552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2119552f7358SJed Brown break; 2120552f7358SJed Brown } 2121552f7358SJed Brown } 2122552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2123552f7358SJed Brown } 212482f516ccSBarry 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); 2125552f7358SJed Brown } 2126552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2127552f7358SJed Brown PetscInt dof; 2128552f7358SJed Brown 2129552f7358SJed Brown /* Copy in cone of first point */ 2130552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2131552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2132552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2133552f7358SJed Brown } 2134552f7358SJed Brown /* Check each successive cone */ 2135552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2136552f7358SJed Brown PetscInt newMeetSize = 0; 2137552f7358SJed Brown 2138552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2139552f7358SJed Brown for (c = 0; c < dof; ++c) { 2140552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2141552f7358SJed Brown 2142552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2143552f7358SJed Brown if (point == meet[i][m]) { 2144552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2145552f7358SJed Brown break; 2146552f7358SJed Brown } 2147552f7358SJed Brown } 2148552f7358SJed Brown } 2149552f7358SJed Brown meetSize = newMeetSize; 2150552f7358SJed Brown i = 1-i; 2151552f7358SJed Brown } 2152552f7358SJed Brown if (meetSize) break; 2153552f7358SJed Brown } 2154552f7358SJed Brown *numCoveredPoints = meetSize; 2155552f7358SJed Brown *coveredPoints = meet[i]; 2156552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21570298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2158552f7358SJed Brown } 2159552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2160552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2161552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2162552f7358SJed Brown PetscFunctionReturn(0); 2163552f7358SJed Brown } 2164552f7358SJed Brown 2165552f7358SJed Brown #undef __FUNCT__ 21664e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21674e3744c5SMatthew G. Knepley /*@C 21684e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21694e3744c5SMatthew G. Knepley 21704e3744c5SMatthew G. Knepley Not Collective 21714e3744c5SMatthew G. Knepley 21724e3744c5SMatthew G. Knepley Input Parameters: 21734e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21744e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21754e3744c5SMatthew G. Knepley 21764e3744c5SMatthew G. Knepley Output Parameters: 21774e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21784e3744c5SMatthew G. Knepley 21794e3744c5SMatthew G. Knepley Level: intermediate 21804e3744c5SMatthew G. Knepley 21814e3744c5SMatthew G. Knepley Notes: 21824e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 21834e3744c5SMatthew G. Knepley 21844e3744c5SMatthew G. Knepley .keywords: mesh 21854e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 21864e3744c5SMatthew G. Knepley @*/ 21874e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 21884e3744c5SMatthew G. Knepley { 21894e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 21904e3744c5SMatthew G. Knepley PetscErrorCode ierr; 21914e3744c5SMatthew G. Knepley 21924e3744c5SMatthew G. Knepley PetscFunctionBegin; 21934e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 21944e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 21954e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 21964e3744c5SMatthew G. Knepley 21974e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 21984e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 21994e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 22004e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 22014e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 22024e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 22034e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 22044e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22054e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22064e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22074e3744c5SMatthew G. Knepley 22084e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22094e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22104e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22114e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22124e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22134e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22144e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22154e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22164e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22174e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22184e3744c5SMatthew G. Knepley } 22194e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22204e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22214e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22224e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22234e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22244e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22254e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22264e3744c5SMatthew G. Knepley } 22274e3744c5SMatthew G. Knepley } 22284e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22294e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22304e3744c5SMatthew G. Knepley } 22314e3744c5SMatthew G. Knepley 22324e3744c5SMatthew G. Knepley #undef __FUNCT__ 223318ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 223418ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2235a6dfd86eSKarl Rupp { 223682f516ccSBarry Smith MPI_Comm comm; 2237552f7358SJed Brown PetscErrorCode ierr; 2238552f7358SJed Brown 2239552f7358SJed Brown PetscFunctionBegin; 224082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2241552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2242552f7358SJed Brown switch (cellDim) { 2243552f7358SJed Brown case 0: 2244552f7358SJed Brown *numFaceVertices = 0; 2245552f7358SJed Brown break; 2246552f7358SJed Brown case 1: 2247552f7358SJed Brown *numFaceVertices = 1; 2248552f7358SJed Brown break; 2249552f7358SJed Brown case 2: 2250552f7358SJed Brown switch (numCorners) { 225119436ca2SJed Brown case 3: /* triangle */ 225219436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2253552f7358SJed Brown break; 225419436ca2SJed Brown case 4: /* quadrilateral */ 225519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2256552f7358SJed Brown break; 225719436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 225819436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2259552f7358SJed Brown break; 226019436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 226119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2262552f7358SJed Brown break; 2263552f7358SJed Brown default: 2264552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2265552f7358SJed Brown } 2266552f7358SJed Brown break; 2267552f7358SJed Brown case 3: 2268552f7358SJed Brown switch (numCorners) { 226919436ca2SJed Brown case 4: /* tetradehdron */ 227019436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2271552f7358SJed Brown break; 227219436ca2SJed Brown case 6: /* tet cohesive cells */ 227319436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2274552f7358SJed Brown break; 227519436ca2SJed Brown case 8: /* hexahedron */ 227619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2277552f7358SJed Brown break; 227819436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 227919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2280552f7358SJed Brown break; 228119436ca2SJed Brown case 10: /* quadratic tetrahedron */ 228219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2283552f7358SJed Brown break; 228419436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 228519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2286552f7358SJed Brown break; 228719436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 228819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2289552f7358SJed Brown break; 229019436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 229119436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2292552f7358SJed Brown break; 2293552f7358SJed Brown default: 2294552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2295552f7358SJed Brown } 2296552f7358SJed Brown break; 2297552f7358SJed Brown default: 2298552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2299552f7358SJed Brown } 2300552f7358SJed Brown PetscFunctionReturn(0); 2301552f7358SJed Brown } 2302552f7358SJed Brown 2303552f7358SJed Brown #undef __FUNCT__ 2304d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2305d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2306d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2307d27a0f52SMatthew G. Knepley { 2308a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2309a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2310a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2311d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2312d27a0f52SMatthew G. Knepley 2313d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2314d27a0f52SMatthew G. Knepley /* Truth Table 2315d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2316d27a0f52SMatthew G. Knepley F 0 flips no F F F 2317d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2318d27a0f52SMatthew G. Knepley F 2 flips no T F T 2319d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2320d27a0f52SMatthew G. Knepley T 1 flip no 2321d27a0f52SMatthew G. Knepley T 2 flips yes 2322d27a0f52SMatthew G. Knepley */ 2323c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2324d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2325a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2326d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2327a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2328a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2329a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2330a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2331a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2332a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2333785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2334a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2335a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2336defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2337a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2338a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2339a1b4d4a2SMatthew G. Knepley 2340a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2341a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2342a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2343a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2344a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2345a1b4d4a2SMatthew G. Knepley } 2346a1b4d4a2SMatthew G. Knepley } 2347a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2348a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2349d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2350a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2351d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2352d27a0f52SMatthew G. Knepley 2353a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2354a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2355a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2356d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2357d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2358a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 235986cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2360a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 236186cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2362d27a0f52SMatthew G. Knepley 2363d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2364d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2365d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2366d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2367d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2368d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2369a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2370a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2371a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2372a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2373a1b4d4a2SMatthew G. Knepley } 2374a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2375a1b4d4a2SMatthew 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); 2376a1b4d4a2SMatthew G. Knepley } 2377a1b4d4a2SMatthew 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]); 2378a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2379a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2380a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2381a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2382a1b4d4a2SMatthew G. Knepley } 2383a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2384a1b4d4a2SMatthew 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); 2385a1b4d4a2SMatthew G. Knepley } 2386a1b4d4a2SMatthew 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]); 2387d27a0f52SMatthew G. Knepley 2388d27a0f52SMatthew G. Knepley if (dim == 1) { 2389d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2390d27a0f52SMatthew G. Knepley } else { 2391d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2392d27a0f52SMatthew G. Knepley } 2393d27a0f52SMatthew G. Knepley 2394d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2395d27a0f52SMatthew 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]); 2396d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2397a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2398d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2399a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2400d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 240186cff514SMatthew 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"); 2402a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2403a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2404d27a0f52SMatthew G. Knepley } 2405fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2406fedde076SMatthew G. Knepley { 2407fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2408fedde076SMatthew G. Knepley PetscSF sf; 2409fedde076SMatthew G. Knepley const PetscInt *lpoints; 2410fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 241113048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2412fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2413a1b4d4a2SMatthew G. Knepley 2414fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2415fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2416fedde076SMatthew G. Knepley if (numLeaves >= 0) { 241762ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 241862ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 241962ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 242013048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 242162ad4a6aSMatthew G. Knepley 2422fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2423fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2424fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2425fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2426fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2427fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2428fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2429fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2430fedde076SMatthew G. Knepley PetscInt supportSize; 2431fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2432fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2433fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2434fedde076SMatthew G. Knepley } 2435fedde076SMatthew G. Knepley } 2436fedde076SMatthew G. Knepley } 243713048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2438fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2439fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2440fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2441fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2442fedde076SMatthew G. Knepley 2443fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 244462ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2445fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2446fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24475b7033fcSMatthew G. Knepley if (dim == 1) { 24485b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24495b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24505b7033fcSMatthew G. Knepley } else { 2451fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2452fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2453fedde076SMatthew G. Knepley } 24545b7033fcSMatthew G. Knepley } 2455fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2456fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2457fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2458fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2459fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2460fedde076SMatthew G. Knepley 246113048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 246213048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 246313048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2464fedde076SMatthew G. Knepley } 246513048561SMatthew G. Knepley /* Collect the graph on 0 */ 246613048561SMatthew G. Knepley { 246713048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2468e8f90184SMatthew G. Knepley Mat G; 246913048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 247013048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 247113048561SMatthew G. Knepley PetscInt *adj = NULL; 247213048561SMatthew G. Knepley PetscBool *val = NULL; 247313048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 247413048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 247513048561SMatthew G. Knepley PetscInt debug = 0; 247613048561SMatthew G. Knepley 247713048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 247813048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 247913048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 248013048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 248113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 248213048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 248313048561SMatthew G. Knepley } 248413048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 248513048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 248613048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 248713048561SMatthew G. Knepley if (debug) { 248813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 248913048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 249013048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 249113048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 249213048561SMatthew G. Knepley } 249313048561SMatthew G. Knepley } 249413048561SMatthew G. Knepley } 2495e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2496e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2497e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2498e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2499e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2500e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 25019a4fe19dSMatthew G. Knepley const PetscInt r = p; 2502e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 25037406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2504e8f90184SMatthew G. Knepley 25057406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 25067406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2507e8f90184SMatthew G. Knepley } 2508e8f90184SMatthew G. Knepley } 2509e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2510e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2511e8f90184SMatthew G. Knepley 251213048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 251313048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 251413048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 251513048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 251613048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 251713048561SMatthew G. Knepley pTop = pBottom = 0; 251813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 251913048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 252013048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 252113048561SMatthew G. Knepley procFIFO[pBottom++] = p; 252213048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 252313048561SMatthew G. Knepley /* Consider each proc in FIFO */ 252413048561SMatthew G. Knepley while (pTop < pBottom) { 2525e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2526e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2527e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 252813048561SMatthew G. Knepley 252913048561SMatthew G. Knepley proc = procFIFO[pTop++]; 253013048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2531e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 253213048561SMatthew G. Knepley /* Loop over neighboring procs */ 2533e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2534e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25357406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 253613048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 253713048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 253813048561SMatthew G. Knepley 253913048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 254013048561SMatthew 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); 254113048561SMatthew G. Knepley if (!flippedB) { 254213048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 254313048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 254413048561SMatthew 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"); 254513048561SMatthew G. Knepley if (!seen) { 254613048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 254713048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 254813048561SMatthew G. Knepley } 254913048561SMatthew G. Knepley } 255013048561SMatthew G. Knepley } 255113048561SMatthew G. Knepley } 255213048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2553e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 255413048561SMatthew G. Knepley 255513048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 255613048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 255713048561SMatthew G. Knepley { 255813048561SMatthew G. Knepley PetscBool *flips; 255913048561SMatthew G. Knepley 256013048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 256113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 256213048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 256313048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 256413048561SMatthew G. Knepley } 256513048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 256613048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 256713048561SMatthew G. Knepley } 256813048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 256913048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 257013048561SMatthew G. Knepley } 257113048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2572fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 257313048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2574fedde076SMatthew G. Knepley } 2575fedde076SMatthew G. Knepley } 2576fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2577d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2578d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2579d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2580a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2581f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2582f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2583d27a0f52SMatthew G. Knepley 2584a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2585a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2586a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2587a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2588a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2589a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2590a1b4d4a2SMatthew G. Knepley 2591a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2592a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2593a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2594d27a0f52SMatthew G. Knepley } 2595a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2596a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2597f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2598f4e909fcSMatthew G. Knepley faceSize = coneSize; 2599f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2600f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2601f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2602f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2603f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2604f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2605f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2606f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2607f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2608f4e909fcSMatthew G. Knepley } 2609f4e909fcSMatthew G. Knepley } 2610d27a0f52SMatthew G. Knepley } 2611d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2612d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2613d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2614a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2615a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2616a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2617d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2618d27a0f52SMatthew G. Knepley } 2619d27a0f52SMatthew G. Knepley 2620d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2621895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2622895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2623895b8c46SMatthew G. Knepley { 2624895b8c46SMatthew G. Knepley int tmpc; 2625895b8c46SMatthew G. Knepley 2626895b8c46SMatthew G. Knepley PetscFunctionBegin; 2627895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2628895b8c46SMatthew G. Knepley switch (numCorners) { 2629895b8c46SMatthew G. Knepley case 4: 2630895b8c46SMatthew G. Knepley tmpc = cone[0]; 2631895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2632895b8c46SMatthew G. Knepley cone[1] = tmpc; 2633895b8c46SMatthew G. Knepley break; 2634895b8c46SMatthew G. Knepley case 8: 2635895b8c46SMatthew G. Knepley tmpc = cone[1]; 2636895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2637895b8c46SMatthew G. Knepley cone[3] = tmpc; 2638895b8c46SMatthew G. Knepley break; 2639895b8c46SMatthew G. Knepley default: break; 2640895b8c46SMatthew G. Knepley } 2641895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2642895b8c46SMatthew G. Knepley } 2643895b8c46SMatthew G. Knepley 2644895b8c46SMatthew G. Knepley #undef __FUNCT__ 26459db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26469db3b87dSMatthew G. Knepley /*@C 26479db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26489db3b87dSMatthew G. Knepley 26499db3b87dSMatthew G. Knepley Input Parameters: 26509db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26519db3b87dSMatthew G. Knepley - cone - The incoming cone 26529db3b87dSMatthew G. Knepley 26539db3b87dSMatthew G. Knepley Output Parameter: 26549db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26559db3b87dSMatthew G. Knepley 26569db3b87dSMatthew G. Knepley Level: developer 26579db3b87dSMatthew G. Knepley 26589db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26599db3b87dSMatthew G. Knepley @*/ 26609db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26612e1b13c2SMatthew G. Knepley { 26629db3b87dSMatthew G. Knepley int tmpc; 26632e1b13c2SMatthew G. Knepley 26642e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26659db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26669db3b87dSMatthew G. Knepley switch (numCorners) { 26679db3b87dSMatthew G. Knepley case 4: 26681885f254SMatthew G. Knepley tmpc = cone[0]; 26691885f254SMatthew G. Knepley cone[0] = cone[1]; 26701885f254SMatthew G. Knepley cone[1] = tmpc; 26719db3b87dSMatthew G. Knepley break; 26729db3b87dSMatthew G. Knepley case 8: 26739db3b87dSMatthew G. Knepley tmpc = cone[1]; 26749db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26759db3b87dSMatthew G. Knepley cone[3] = tmpc; 26769db3b87dSMatthew G. Knepley break; 26779db3b87dSMatthew G. Knepley default: break; 26789db3b87dSMatthew G. Knepley } 26799db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 26809db3b87dSMatthew G. Knepley } 26819db3b87dSMatthew G. Knepley 26829db3b87dSMatthew G. Knepley #undef __FUNCT__ 26839db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 26849db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 26859db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 26869db3b87dSMatthew G. Knepley { 26879db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 26889db3b87dSMatthew G. Knepley PetscErrorCode ierr; 26899db3b87dSMatthew G. Knepley 26909db3b87dSMatthew G. Knepley PetscFunctionBegin; 26919db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 26929db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 26932e1b13c2SMatthew G. Knepley } 26942e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 26952e1b13c2SMatthew G. Knepley } 26962e1b13c2SMatthew G. Knepley 2697519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2698552f7358SJed Brown #include <triangle.h> 2699552f7358SJed Brown 2700552f7358SJed Brown #undef __FUNCT__ 2701552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 27020adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 27030adebc6cSBarry Smith { 2704552f7358SJed Brown PetscFunctionBegin; 2705552f7358SJed Brown inputCtx->numberofpoints = 0; 2706552f7358SJed Brown inputCtx->numberofpointattributes = 0; 27070298fd71SBarry Smith inputCtx->pointlist = NULL; 27080298fd71SBarry Smith inputCtx->pointattributelist = NULL; 27090298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2710552f7358SJed Brown inputCtx->numberofsegments = 0; 27110298fd71SBarry Smith inputCtx->segmentlist = NULL; 27120298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2713552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27140298fd71SBarry Smith inputCtx->trianglelist = NULL; 2715552f7358SJed Brown inputCtx->numberofholes = 0; 27160298fd71SBarry Smith inputCtx->holelist = NULL; 2717552f7358SJed Brown inputCtx->numberofregions = 0; 27180298fd71SBarry Smith inputCtx->regionlist = NULL; 2719552f7358SJed Brown PetscFunctionReturn(0); 2720552f7358SJed Brown } 2721552f7358SJed Brown 2722552f7358SJed Brown #undef __FUNCT__ 2723552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27240adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27250adebc6cSBarry Smith { 2726552f7358SJed Brown PetscFunctionBegin; 2727552f7358SJed Brown outputCtx->numberofpoints = 0; 27280298fd71SBarry Smith outputCtx->pointlist = NULL; 27290298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27300298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2731552f7358SJed Brown outputCtx->numberoftriangles = 0; 27320298fd71SBarry Smith outputCtx->trianglelist = NULL; 27330298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27340298fd71SBarry Smith outputCtx->neighborlist = NULL; 27350298fd71SBarry Smith outputCtx->segmentlist = NULL; 27360298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2737552f7358SJed Brown outputCtx->numberofedges = 0; 27380298fd71SBarry Smith outputCtx->edgelist = NULL; 27390298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2740552f7358SJed Brown PetscFunctionReturn(0); 2741552f7358SJed Brown } 2742552f7358SJed Brown 2743552f7358SJed Brown #undef __FUNCT__ 2744552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27450adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27460adebc6cSBarry Smith { 2747552f7358SJed Brown PetscFunctionBegin; 274823b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2749552f7358SJed Brown free(outputCtx->pointmarkerlist); 275023b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 275123b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2752552f7358SJed Brown free(outputCtx->edgelist); 2753552f7358SJed Brown free(outputCtx->edgemarkerlist); 2754552f7358SJed Brown free(outputCtx->trianglelist); 2755552f7358SJed Brown free(outputCtx->neighborlist); 2756552f7358SJed Brown PetscFunctionReturn(0); 2757552f7358SJed Brown } 2758552f7358SJed Brown 2759552f7358SJed Brown #undef __FUNCT__ 2760552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2761552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2762552f7358SJed Brown { 276382f516ccSBarry Smith MPI_Comm comm; 2764552f7358SJed Brown PetscInt dim = 2; 2765552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2766552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2767552f7358SJed Brown struct triangulateio in; 2768552f7358SJed Brown struct triangulateio out; 2769552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2770552f7358SJed Brown PetscMPIInt rank; 2771552f7358SJed Brown PetscErrorCode ierr; 2772552f7358SJed Brown 2773552f7358SJed Brown PetscFunctionBegin; 277482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2775552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2776552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2777552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2778552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27790d644c17SKarl Rupp 2780552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2781552f7358SJed Brown if (in.numberofpoints > 0) { 2782552f7358SJed Brown PetscSection coordSection; 2783552f7358SJed Brown Vec coordinates; 2784552f7358SJed Brown PetscScalar *array; 2785552f7358SJed Brown 2786785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2787785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2788552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 278969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2790552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2791552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2792552f7358SJed Brown const PetscInt idx = v - vStart; 2793552f7358SJed Brown PetscInt off, d; 2794552f7358SJed Brown 2795552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2796552f7358SJed Brown for (d = 0; d < dim; ++d) { 2797552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2798552f7358SJed Brown } 2799552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2800552f7358SJed Brown } 2801552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2802552f7358SJed Brown } 2803552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2804552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2805552f7358SJed Brown if (in.numberofsegments > 0) { 2806785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2807785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2808552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2809552f7358SJed Brown const PetscInt idx = e - eStart; 2810552f7358SJed Brown const PetscInt *cone; 2811552f7358SJed Brown 2812552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28130d644c17SKarl Rupp 2814552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2815552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28160d644c17SKarl Rupp 2817552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2818552f7358SJed Brown } 2819552f7358SJed Brown } 2820552f7358SJed Brown #if 0 /* Do not currently support holes */ 2821552f7358SJed Brown PetscReal *holeCoords; 2822552f7358SJed Brown PetscInt h, d; 2823552f7358SJed Brown 2824552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2825552f7358SJed Brown if (in.numberofholes > 0) { 2826785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2827552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2828552f7358SJed Brown for (d = 0; d < dim; ++d) { 2829552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2830552f7358SJed Brown } 2831552f7358SJed Brown } 2832552f7358SJed Brown } 2833552f7358SJed Brown #endif 2834552f7358SJed Brown if (!rank) { 2835552f7358SJed Brown char args[32]; 2836552f7358SJed Brown 2837552f7358SJed Brown /* Take away 'Q' for verbose output */ 2838552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2839552f7358SJed Brown if (createConvexHull) { 2840552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2841552f7358SJed Brown } 2842552f7358SJed Brown if (constrained) { 2843552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2844552f7358SJed Brown } 28450298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2846552f7358SJed Brown } 2847552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2848552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2849552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2850552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2851552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2852552f7358SJed Brown 2853552f7358SJed Brown { 2854552f7358SJed Brown const PetscInt numCorners = 3; 2855552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2856552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2857552f7358SJed Brown const int *cells = out.trianglelist; 2858552f7358SJed Brown const double *meshCoords = out.pointlist; 2859552f7358SJed Brown 28600fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2861552f7358SJed Brown /* Set labels */ 2862552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2863552f7358SJed Brown if (out.pointmarkerlist[v]) { 2864552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2865552f7358SJed Brown } 2866552f7358SJed Brown } 2867552f7358SJed Brown if (interpolate) { 2868552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2869552f7358SJed Brown if (out.edgemarkerlist[e]) { 2870552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2871552f7358SJed Brown const PetscInt *edges; 2872552f7358SJed Brown PetscInt numEdges; 2873552f7358SJed Brown 2874552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2875552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2876552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2877552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2878552f7358SJed Brown } 2879552f7358SJed Brown } 2880552f7358SJed Brown } 2881552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2882552f7358SJed Brown } 2883552f7358SJed Brown #if 0 /* Do not currently support holes */ 2884552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2885552f7358SJed Brown #endif 2886552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2887552f7358SJed Brown PetscFunctionReturn(0); 2888552f7358SJed Brown } 2889552f7358SJed Brown 2890552f7358SJed Brown #undef __FUNCT__ 2891552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2892552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2893552f7358SJed Brown { 289482f516ccSBarry Smith MPI_Comm comm; 2895552f7358SJed Brown PetscInt dim = 2; 2896552f7358SJed Brown struct triangulateio in; 2897552f7358SJed Brown struct triangulateio out; 2898552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2899552f7358SJed Brown PetscMPIInt rank; 2900552f7358SJed Brown PetscErrorCode ierr; 2901552f7358SJed Brown 2902552f7358SJed Brown PetscFunctionBegin; 290382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2904552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2905552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2906552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2907552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2908552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2909552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29100d644c17SKarl Rupp 2911552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2912552f7358SJed Brown if (in.numberofpoints > 0) { 2913552f7358SJed Brown PetscSection coordSection; 2914552f7358SJed Brown Vec coordinates; 2915552f7358SJed Brown PetscScalar *array; 2916552f7358SJed Brown 2917785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2918785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2919552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 292069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2921552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2922552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2923552f7358SJed Brown const PetscInt idx = v - vStart; 2924552f7358SJed Brown PetscInt off, d; 2925552f7358SJed Brown 2926552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2927552f7358SJed Brown for (d = 0; d < dim; ++d) { 2928552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2929552f7358SJed Brown } 2930552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2931552f7358SJed Brown } 2932552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2933552f7358SJed Brown } 2934552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29350d644c17SKarl Rupp 2936552f7358SJed Brown in.numberofcorners = 3; 2937552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29380d644c17SKarl Rupp 2939552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2940552f7358SJed Brown if (in.numberoftriangles > 0) { 2941785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2942552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2943552f7358SJed Brown const PetscInt idx = c - cStart; 29440298fd71SBarry Smith PetscInt *closure = NULL; 2945552f7358SJed Brown PetscInt closureSize; 2946552f7358SJed Brown 2947552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2948552f7358SJed 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); 2949552f7358SJed Brown for (v = 0; v < 3; ++v) { 2950552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2951552f7358SJed Brown } 2952552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2953552f7358SJed Brown } 2954552f7358SJed Brown } 2955552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2956552f7358SJed Brown #if 0 /* Do not currently support holes */ 2957552f7358SJed Brown PetscReal *holeCoords; 2958552f7358SJed Brown PetscInt h, d; 2959552f7358SJed Brown 2960552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2961552f7358SJed Brown if (in.numberofholes > 0) { 2962785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2963552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2964552f7358SJed Brown for (d = 0; d < dim; ++d) { 2965552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2966552f7358SJed Brown } 2967552f7358SJed Brown } 2968552f7358SJed Brown } 2969552f7358SJed Brown #endif 2970552f7358SJed Brown if (!rank) { 2971552f7358SJed Brown char args[32]; 2972552f7358SJed Brown 2973552f7358SJed Brown /* Take away 'Q' for verbose output */ 2974552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29750298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2976552f7358SJed Brown } 2977552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2978552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2979552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2980552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2981552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 2982552f7358SJed Brown 2983552f7358SJed Brown { 2984552f7358SJed Brown const PetscInt numCorners = 3; 2985552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2986552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2987552f7358SJed Brown const int *cells = out.trianglelist; 2988552f7358SJed Brown const double *meshCoords = out.pointlist; 2989552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 2990552f7358SJed Brown 29910fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 2992552f7358SJed Brown /* Set labels */ 2993552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2994552f7358SJed Brown if (out.pointmarkerlist[v]) { 2995552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2996552f7358SJed Brown } 2997552f7358SJed Brown } 2998552f7358SJed Brown if (interpolate) { 2999552f7358SJed Brown PetscInt e; 3000552f7358SJed Brown 3001552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3002552f7358SJed Brown if (out.edgemarkerlist[e]) { 3003552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3004552f7358SJed Brown const PetscInt *edges; 3005552f7358SJed Brown PetscInt numEdges; 3006552f7358SJed Brown 3007552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3008552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3009552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3010552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3011552f7358SJed Brown } 3012552f7358SJed Brown } 3013552f7358SJed Brown } 3014552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3015552f7358SJed Brown } 3016552f7358SJed Brown #if 0 /* Do not currently support holes */ 3017552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3018552f7358SJed Brown #endif 3019552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3020552f7358SJed Brown PetscFunctionReturn(0); 3021552f7358SJed Brown } 3022552f7358SJed Brown #endif 3023552f7358SJed Brown 3024519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3025552f7358SJed Brown #include <tetgen.h> 3026552f7358SJed Brown #undef __FUNCT__ 3027552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3028552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3029552f7358SJed Brown { 303082f516ccSBarry Smith MPI_Comm comm; 3031552f7358SJed Brown const PetscInt dim = 3; 3032552f7358SJed Brown ::tetgenio in; 3033552f7358SJed Brown ::tetgenio out; 3034552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3035552f7358SJed Brown PetscMPIInt rank; 3036552f7358SJed Brown PetscErrorCode ierr; 3037552f7358SJed Brown 3038552f7358SJed Brown PetscFunctionBegin; 303982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3040552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3041552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3042552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3043552f7358SJed Brown if (in.numberofpoints > 0) { 3044552f7358SJed Brown PetscSection coordSection; 3045552f7358SJed Brown Vec coordinates; 3046552f7358SJed Brown PetscScalar *array; 3047552f7358SJed Brown 3048552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3049552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30500d644c17SKarl Rupp 3051552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 305269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3053552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3054552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3055552f7358SJed Brown const PetscInt idx = v - vStart; 3056552f7358SJed Brown PetscInt off, d; 3057552f7358SJed Brown 3058552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3059a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3060552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3061552f7358SJed Brown } 3062552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3063552f7358SJed Brown } 3064552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30650d644c17SKarl Rupp 3066552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3067552f7358SJed Brown if (in.numberoffacets > 0) { 3068552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3069552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3070552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3071552f7358SJed Brown const PetscInt idx = f - fStart; 30720298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3073552f7358SJed Brown 3074552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3075552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3076552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3077552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3078552f7358SJed Brown 3079552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3080552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3081552f7358SJed Brown const PetscInt point = points[p]; 30820d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3083552f7358SJed Brown } 3084552f7358SJed Brown 3085552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3086552f7358SJed Brown poly->numberofvertices = numVertices; 3087552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3088552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3089552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3090552f7358SJed Brown poly->vertexlist[v] = vIdx; 3091552f7358SJed Brown } 3092552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3093552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3094552f7358SJed Brown } 3095552f7358SJed Brown } 3096552f7358SJed Brown if (!rank) { 3097552f7358SJed Brown char args[32]; 3098552f7358SJed Brown 3099552f7358SJed Brown /* Take away 'Q' for verbose output */ 3100552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3101552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3102552f7358SJed Brown } 3103552f7358SJed Brown { 3104552f7358SJed Brown const PetscInt numCorners = 4; 3105552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3106552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3107552f7358SJed Brown const double *meshCoords = out.pointlist; 31081d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3109552f7358SJed Brown 31109db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31110fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3112552f7358SJed Brown /* Set labels */ 3113552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3114552f7358SJed Brown if (out.pointmarkerlist[v]) { 3115552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3116552f7358SJed Brown } 3117552f7358SJed Brown } 3118552f7358SJed Brown if (interpolate) { 3119552f7358SJed Brown PetscInt e; 3120552f7358SJed Brown 3121552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3122552f7358SJed Brown if (out.edgemarkerlist[e]) { 3123552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3124552f7358SJed Brown const PetscInt *edges; 3125552f7358SJed Brown PetscInt numEdges; 3126552f7358SJed Brown 3127552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3128552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3129552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3130552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3131552f7358SJed Brown } 3132552f7358SJed Brown } 3133552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3134552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3135552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3136552f7358SJed Brown const PetscInt *faces; 3137552f7358SJed Brown PetscInt numFaces; 3138552f7358SJed Brown 3139552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3140552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3141552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3142552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3143552f7358SJed Brown } 3144552f7358SJed Brown } 3145552f7358SJed Brown } 3146552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3147552f7358SJed Brown } 3148552f7358SJed Brown PetscFunctionReturn(0); 3149552f7358SJed Brown } 3150552f7358SJed Brown 3151552f7358SJed Brown #undef __FUNCT__ 3152552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3153552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3154552f7358SJed Brown { 315582f516ccSBarry Smith MPI_Comm comm; 3156552f7358SJed Brown const PetscInt dim = 3; 3157552f7358SJed Brown ::tetgenio in; 3158552f7358SJed Brown ::tetgenio out; 3159552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3160552f7358SJed Brown PetscMPIInt rank; 3161552f7358SJed Brown PetscErrorCode ierr; 3162552f7358SJed Brown 3163552f7358SJed Brown PetscFunctionBegin; 316482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3165552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3166552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3167552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3168552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31690d644c17SKarl Rupp 3170552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3171552f7358SJed Brown if (in.numberofpoints > 0) { 3172552f7358SJed Brown PetscSection coordSection; 3173552f7358SJed Brown Vec coordinates; 3174552f7358SJed Brown PetscScalar *array; 3175552f7358SJed Brown 3176552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3177552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31780d644c17SKarl Rupp 3179552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 318069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3181552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3182552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3183552f7358SJed Brown const PetscInt idx = v - vStart; 3184552f7358SJed Brown PetscInt off, d; 3185552f7358SJed Brown 3186552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3187a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3188552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3189552f7358SJed Brown } 3190552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3191552f7358SJed Brown } 3192552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 31930d644c17SKarl Rupp 3194552f7358SJed Brown in.numberofcorners = 4; 3195552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3196552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3197552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3198552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3199552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3200552f7358SJed Brown const PetscInt idx = c - cStart; 32010298fd71SBarry Smith PetscInt *closure = NULL; 3202552f7358SJed Brown PetscInt closureSize; 3203552f7358SJed Brown 3204552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3205552f7358SJed 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); 3206552f7358SJed Brown for (v = 0; v < 4; ++v) { 3207552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3208552f7358SJed Brown } 3209552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3210552f7358SJed Brown } 3211552f7358SJed Brown } 321219436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3213552f7358SJed Brown if (!rank) { 3214552f7358SJed Brown char args[32]; 3215552f7358SJed Brown 3216552f7358SJed Brown /* Take away 'Q' for verbose output */ 321719436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3218552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3219552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3220552f7358SJed Brown } 3221552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3222552f7358SJed Brown 3223552f7358SJed Brown { 3224552f7358SJed Brown const PetscInt numCorners = 4; 3225552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3226552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3227552f7358SJed Brown const double *meshCoords = out.pointlist; 32281d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32291d4b4d7bSJed Brown 3230552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3231552f7358SJed Brown 32329db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32330fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3234552f7358SJed Brown /* Set labels */ 3235552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3236552f7358SJed Brown if (out.pointmarkerlist[v]) { 3237552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3238552f7358SJed Brown } 3239552f7358SJed Brown } 3240552f7358SJed Brown if (interpolate) { 3241552f7358SJed Brown PetscInt e, f; 3242552f7358SJed Brown 3243552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3244552f7358SJed Brown if (out.edgemarkerlist[e]) { 3245552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3246552f7358SJed Brown const PetscInt *edges; 3247552f7358SJed Brown PetscInt numEdges; 3248552f7358SJed Brown 3249552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3250552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3251552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3252552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3253552f7358SJed Brown } 3254552f7358SJed Brown } 3255552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3256552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3257552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3258552f7358SJed Brown const PetscInt *faces; 3259552f7358SJed Brown PetscInt numFaces; 3260552f7358SJed Brown 3261552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3262552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3263552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3264552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3265552f7358SJed Brown } 3266552f7358SJed Brown } 3267552f7358SJed Brown } 3268552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3269552f7358SJed Brown } 3270552f7358SJed Brown PetscFunctionReturn(0); 3271552f7358SJed Brown } 3272552f7358SJed Brown #endif 3273552f7358SJed Brown 3274519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3275aaa7dc30SBarry Smith #include <ctetgen.h> 3276552f7358SJed Brown 3277552f7358SJed Brown #undef __FUNCT__ 3278552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3279552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3280552f7358SJed Brown { 328182f516ccSBarry Smith MPI_Comm comm; 3282552f7358SJed Brown const PetscInt dim = 3; 3283552f7358SJed Brown PLC *in, *out; 3284552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3285552f7358SJed Brown PetscMPIInt rank; 3286552f7358SJed Brown PetscErrorCode ierr; 3287552f7358SJed Brown 3288552f7358SJed Brown PetscFunctionBegin; 328982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 32900298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3291552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3292552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3293552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3294552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 32950d644c17SKarl Rupp 3296552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3297552f7358SJed Brown if (in->numberofpoints > 0) { 3298552f7358SJed Brown PetscSection coordSection; 3299552f7358SJed Brown Vec coordinates; 3300552f7358SJed Brown PetscScalar *array; 3301552f7358SJed Brown 3302785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3303785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3304552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 330569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3306552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3307552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3308552f7358SJed Brown const PetscInt idx = v - vStart; 3309552f7358SJed Brown PetscInt off, d, m; 3310552f7358SJed Brown 3311552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3312552f7358SJed Brown for (d = 0; d < dim; ++d) { 3313552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3314552f7358SJed Brown } 3315552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33160d644c17SKarl Rupp 3317552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3318552f7358SJed Brown } 3319552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3320552f7358SJed Brown } 3321552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33220d644c17SKarl Rupp 3323552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3324552f7358SJed Brown if (in->numberoffacets > 0) { 3325785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3326785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3327552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3328552f7358SJed Brown const PetscInt idx = f - fStart; 33290298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3330552f7358SJed Brown polygon *poly; 3331552f7358SJed Brown 3332552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33330d644c17SKarl Rupp 3334785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33350d644c17SKarl Rupp 3336552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33370298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3338552f7358SJed Brown 3339552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3340552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3341552f7358SJed Brown const PetscInt point = points[p]; 33420d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3343552f7358SJed Brown } 3344552f7358SJed Brown 3345552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3346552f7358SJed Brown poly->numberofvertices = numVertices; 3347785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3348552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3349552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3350552f7358SJed Brown poly->vertexlist[v] = vIdx; 3351552f7358SJed Brown } 3352552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3353552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3354552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3355552f7358SJed Brown } 3356552f7358SJed Brown } 3357552f7358SJed Brown if (!rank) { 3358552f7358SJed Brown TetGenOpts t; 3359552f7358SJed Brown 3360552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3361552f7358SJed Brown t.in = boundary; /* Should go away */ 3362552f7358SJed Brown t.plc = 1; 3363552f7358SJed Brown t.quality = 1; 3364552f7358SJed Brown t.edgesout = 1; 3365552f7358SJed Brown t.zeroindex = 1; 3366552f7358SJed Brown t.quiet = 1; 3367552f7358SJed Brown t.verbose = verbose; 3368552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3369552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3370552f7358SJed Brown } 3371552f7358SJed Brown { 3372552f7358SJed Brown const PetscInt numCorners = 4; 3373552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3374552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3375552f7358SJed Brown const double *meshCoords = out->pointlist; 33761d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3377552f7358SJed Brown 33789db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33790fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3380552f7358SJed Brown /* Set labels */ 3381552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3382552f7358SJed Brown if (out->pointmarkerlist[v]) { 3383552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3384552f7358SJed Brown } 3385552f7358SJed Brown } 3386552f7358SJed Brown if (interpolate) { 3387552f7358SJed Brown PetscInt e; 3388552f7358SJed Brown 3389552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3390552f7358SJed Brown if (out->edgemarkerlist[e]) { 3391552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3392552f7358SJed Brown const PetscInt *edges; 3393552f7358SJed Brown PetscInt numEdges; 3394552f7358SJed Brown 3395552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3396552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3397552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3398552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3399552f7358SJed Brown } 3400552f7358SJed Brown } 3401552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3402552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3403552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3404552f7358SJed Brown const PetscInt *faces; 3405552f7358SJed Brown PetscInt numFaces; 3406552f7358SJed Brown 3407552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3408552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3409552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3410552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3411552f7358SJed Brown } 3412552f7358SJed Brown } 3413552f7358SJed Brown } 3414552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3415552f7358SJed Brown } 3416552f7358SJed Brown 3417552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3418552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3419552f7358SJed Brown PetscFunctionReturn(0); 3420552f7358SJed Brown } 3421552f7358SJed Brown 3422552f7358SJed Brown #undef __FUNCT__ 3423552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3424552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3425552f7358SJed Brown { 342682f516ccSBarry Smith MPI_Comm comm; 3427552f7358SJed Brown const PetscInt dim = 3; 3428552f7358SJed Brown PLC *in, *out; 3429552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3430552f7358SJed Brown PetscMPIInt rank; 3431552f7358SJed Brown PetscErrorCode ierr; 3432552f7358SJed Brown 3433552f7358SJed Brown PetscFunctionBegin; 343482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34350298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3436552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3437552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3438552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3439552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3440552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3441552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34420d644c17SKarl Rupp 3443552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3444552f7358SJed Brown if (in->numberofpoints > 0) { 3445552f7358SJed Brown PetscSection coordSection; 3446552f7358SJed Brown Vec coordinates; 3447552f7358SJed Brown PetscScalar *array; 3448552f7358SJed Brown 3449785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3450785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3451552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 345269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3453552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3454552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3455552f7358SJed Brown const PetscInt idx = v - vStart; 3456552f7358SJed Brown PetscInt off, d, m; 3457552f7358SJed Brown 3458552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3459552f7358SJed Brown for (d = 0; d < dim; ++d) { 3460552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3461552f7358SJed Brown } 3462552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34630d644c17SKarl Rupp 3464552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3465552f7358SJed Brown } 3466552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3467552f7358SJed Brown } 3468552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34690d644c17SKarl Rupp 3470552f7358SJed Brown in->numberofcorners = 4; 3471552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3472552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3473552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3474785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3475552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3476552f7358SJed Brown const PetscInt idx = c - cStart; 34770298fd71SBarry Smith PetscInt *closure = NULL; 3478552f7358SJed Brown PetscInt closureSize; 3479552f7358SJed Brown 3480552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3481552f7358SJed 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); 3482552f7358SJed Brown for (v = 0; v < 4; ++v) { 3483552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3484552f7358SJed Brown } 3485552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3486552f7358SJed Brown } 3487552f7358SJed Brown } 3488552f7358SJed Brown if (!rank) { 3489552f7358SJed Brown TetGenOpts t; 3490552f7358SJed Brown 3491552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 34920d644c17SKarl Rupp 3493552f7358SJed Brown t.in = dm; /* Should go away */ 3494552f7358SJed Brown t.refine = 1; 3495552f7358SJed Brown t.varvolume = 1; 3496552f7358SJed Brown t.quality = 1; 3497552f7358SJed Brown t.edgesout = 1; 3498552f7358SJed Brown t.zeroindex = 1; 3499552f7358SJed Brown t.quiet = 1; 3500552f7358SJed Brown t.verbose = verbose; /* Change this */ 35010d644c17SKarl Rupp 3502552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3503552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3504552f7358SJed Brown } 3505552f7358SJed Brown { 3506552f7358SJed Brown const PetscInt numCorners = 4; 3507552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3508552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3509552f7358SJed Brown const double *meshCoords = out->pointlist; 35101d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3511552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3512552f7358SJed Brown 35139db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35140fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3515552f7358SJed Brown /* Set labels */ 3516552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3517552f7358SJed Brown if (out->pointmarkerlist[v]) { 3518552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3519552f7358SJed Brown } 3520552f7358SJed Brown } 3521552f7358SJed Brown if (interpolate) { 3522552f7358SJed Brown PetscInt e, f; 3523552f7358SJed Brown 3524552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3525552f7358SJed Brown if (out->edgemarkerlist[e]) { 3526552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3527552f7358SJed Brown const PetscInt *edges; 3528552f7358SJed Brown PetscInt numEdges; 3529552f7358SJed Brown 3530552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3531552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3532552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3533552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3534552f7358SJed Brown } 3535552f7358SJed Brown } 3536552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3537552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3538552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3539552f7358SJed Brown const PetscInt *faces; 3540552f7358SJed Brown PetscInt numFaces; 3541552f7358SJed Brown 3542552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3543552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3544552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3545552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3546552f7358SJed Brown } 3547552f7358SJed Brown } 3548552f7358SJed Brown } 3549552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3550552f7358SJed Brown } 3551552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3552552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3553552f7358SJed Brown PetscFunctionReturn(0); 3554552f7358SJed Brown } 3555552f7358SJed Brown #endif 3556552f7358SJed Brown 3557552f7358SJed Brown #undef __FUNCT__ 3558552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3559552f7358SJed Brown /*@C 3560552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3561552f7358SJed Brown 3562552f7358SJed Brown Not Collective 3563552f7358SJed Brown 3564552f7358SJed Brown Input Parameters: 3565552f7358SJed Brown + boundary - The DMPlex boundary object 3566552f7358SJed Brown . name - The mesh generation package name 3567552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3568552f7358SJed Brown 3569552f7358SJed Brown Output Parameter: 3570552f7358SJed Brown . mesh - The DMPlex object 3571552f7358SJed Brown 3572552f7358SJed Brown Level: intermediate 3573552f7358SJed Brown 3574552f7358SJed Brown .keywords: mesh, elements 3575552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3576552f7358SJed Brown @*/ 3577552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3578552f7358SJed Brown { 3579552f7358SJed Brown PetscInt dim; 3580552f7358SJed Brown char genname[1024]; 3581552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3582552f7358SJed Brown PetscErrorCode ierr; 3583552f7358SJed Brown 3584552f7358SJed Brown PetscFunctionBegin; 3585552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3586552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3587c73cfb54SMatthew G. Knepley ierr = DMGetDimension(boundary, &dim);CHKERRQ(ierr); 3588552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 35890d644c17SKarl Rupp if (flg) name = genname; 3590552f7358SJed Brown if (name) { 3591552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3592552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3593552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3594552f7358SJed Brown } 3595552f7358SJed Brown switch (dim) { 3596552f7358SJed Brown case 1: 3597552f7358SJed Brown if (!name || isTriangle) { 3598519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3599552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3600552f7358SJed Brown #else 360182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3602552f7358SJed Brown #endif 360382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3604552f7358SJed Brown break; 3605552f7358SJed Brown case 2: 3606552f7358SJed Brown if (!name || isCTetgen) { 3607519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3608552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3609552f7358SJed Brown #else 361082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3611552f7358SJed Brown #endif 3612552f7358SJed Brown } else if (isTetgen) { 3613519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3614552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3615552f7358SJed Brown #else 361682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3617552f7358SJed Brown #endif 361882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3619552f7358SJed Brown break; 3620552f7358SJed Brown default: 362182f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3622552f7358SJed Brown } 3623552f7358SJed Brown PetscFunctionReturn(0); 3624552f7358SJed Brown } 3625552f7358SJed Brown 3626552f7358SJed Brown #undef __FUNCT__ 3627552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3628552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3629552f7358SJed Brown { 3630552f7358SJed Brown PetscReal refinementLimit; 3631552f7358SJed Brown PetscInt dim, cStart, cEnd; 36320298fd71SBarry Smith char genname[1024], *name = NULL; 3633552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3634552f7358SJed Brown PetscErrorCode ierr; 3635552f7358SJed Brown 3636552f7358SJed Brown PetscFunctionBegin; 3637552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3638552f7358SJed Brown if (isUniform) { 3639552f7358SJed Brown CellRefiner cellRefiner; 3640552f7358SJed Brown 3641509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3642509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 36438e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3644552f7358SJed Brown PetscFunctionReturn(0); 3645552f7358SJed Brown } 3646552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3647552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3648c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3649552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3650552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36510d644c17SKarl Rupp if (flg) name = genname; 3652552f7358SJed Brown if (name) { 3653552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3654552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3655552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3656552f7358SJed Brown } 3657552f7358SJed Brown switch (dim) { 3658552f7358SJed Brown case 2: 3659552f7358SJed Brown if (!name || isTriangle) { 3660519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3661552f7358SJed Brown double *maxVolumes; 3662552f7358SJed Brown PetscInt c; 3663552f7358SJed Brown 3664785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36650d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3666552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36676b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3668552f7358SJed Brown #else 366982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3670552f7358SJed Brown #endif 367182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3672552f7358SJed Brown break; 3673552f7358SJed Brown case 3: 3674552f7358SJed Brown if (!name || isCTetgen) { 3675519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3676552f7358SJed Brown PetscReal *maxVolumes; 3677552f7358SJed Brown PetscInt c; 3678552f7358SJed Brown 3679785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36800d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3681552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3682552f7358SJed Brown #else 368382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3684552f7358SJed Brown #endif 3685552f7358SJed Brown } else if (isTetgen) { 3686519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3687552f7358SJed Brown double *maxVolumes; 3688552f7358SJed Brown PetscInt c; 3689552f7358SJed Brown 3690785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36910d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3692552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3693552f7358SJed Brown #else 369482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3695552f7358SJed Brown #endif 369682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3697552f7358SJed Brown break; 3698552f7358SJed Brown default: 369982f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3700552f7358SJed Brown } 37018e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3702552f7358SJed Brown PetscFunctionReturn(0); 3703552f7358SJed Brown } 3704552f7358SJed Brown 3705552f7358SJed Brown #undef __FUNCT__ 37060a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 37070a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 37080a6ba040SMatthew G. Knepley { 37090a6ba040SMatthew G. Knepley DM cdm = dm; 37100a6ba040SMatthew G. Knepley PetscInt r; 37110a6ba040SMatthew G. Knepley PetscBool isUniform; 37120a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37130a6ba040SMatthew G. Knepley 37140a6ba040SMatthew G. Knepley PetscFunctionBegin; 37150a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37160a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37170a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37180a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37190a6ba040SMatthew G. Knepley 37200a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37210a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37220a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37230a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37240a6ba040SMatthew G. Knepley } 37250a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37260a6ba040SMatthew G. Knepley } 37270a6ba040SMatthew G. Knepley 37280a6ba040SMatthew G. Knepley #undef __FUNCT__ 37290a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37300a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37310a6ba040SMatthew G. Knepley { 37320a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3733549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37340a6ba040SMatthew G. Knepley 37350a6ba040SMatthew G. Knepley PetscFunctionBegin; 3736549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37370a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37380a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37390a6ba040SMatthew G. Knepley } 37400a6ba040SMatthew G. Knepley 37410a6ba040SMatthew G. Knepley #undef __FUNCT__ 3742d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3743d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3744d49fcaecSMatthew G. Knepley { 3745d49fcaecSMatthew G. Knepley PetscInt d; 3746d49fcaecSMatthew G. Knepley 3747d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3748d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3749d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3750d49fcaecSMatthew G. Knepley } else { 3751d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3752d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3753858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3754d49fcaecSMatthew G. Knepley } else { 3755d49fcaecSMatthew G. Knepley out[d] = in[d]; 3756d49fcaecSMatthew G. Knepley } 3757d49fcaecSMatthew G. Knepley } 3758d49fcaecSMatthew G. Knepley } 3759d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3760d49fcaecSMatthew G. Knepley } 3761d49fcaecSMatthew G. Knepley 3762d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3763d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3764d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3765d49fcaecSMatthew G. Knepley { 3766d49fcaecSMatthew G. Knepley PetscInt d; 3767d49fcaecSMatthew G. Knepley 3768d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3769d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3770d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3771d49fcaecSMatthew G. Knepley } else { 3772d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3773d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3774858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3775d49fcaecSMatthew G. Knepley } else { 3776d49fcaecSMatthew G. Knepley out[d] += in[d]; 3777d49fcaecSMatthew G. Knepley } 3778d49fcaecSMatthew G. Knepley } 3779d49fcaecSMatthew G. Knepley } 3780d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3781d49fcaecSMatthew G. Knepley } 3782d49fcaecSMatthew G. Knepley 3783d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3784d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3785d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3786d49fcaecSMatthew G. Knepley { 3787d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3788d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3789d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 37908c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3791d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3792d49fcaecSMatthew G. Knepley 3793d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3794d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3795d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3796d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3797d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3798d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3799d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3800d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 38018c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 38028c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 38038c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 3804d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3805d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3806d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3807d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 38088c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 3809d49fcaecSMatthew G. Knepley } 3810d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3811d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3812d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 38138c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 3814d49fcaecSMatthew G. Knepley } 3815d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3816d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3817d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3818d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3819d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3820d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3821d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3822d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3823d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3824d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3825d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3826d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3827d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3828d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3829d49fcaecSMatthew G. Knepley } 3830d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3831d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3832d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3833d49fcaecSMatthew G. Knepley PetscInt b; 3834d49fcaecSMatthew G. Knepley 3835d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3836d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3837d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3838d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3839d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3840d49fcaecSMatthew G. Knepley } 3841d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3842d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3843d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 384446e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 3845d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3846d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3847d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3848d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3849d49fcaecSMatthew G. Knepley } 3850d49fcaecSMatthew G. Knepley 3851d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3852aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3853552f7358SJed Brown /*@ 3854aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3855552f7358SJed Brown 3856552f7358SJed Brown Not Collective 3857552f7358SJed Brown 3858aa50250dSMatthew G. Knepley Input Parameter: 3859552f7358SJed Brown . dm - The DMPlex object 3860552f7358SJed Brown 3861aa50250dSMatthew G. Knepley Output Parameter: 3862aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3863552f7358SJed Brown 3864552f7358SJed Brown Level: developer 3865552f7358SJed Brown 3866aa50250dSMatthew G. Knepley .keywords: mesh, points 3867aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3868aa50250dSMatthew G. Knepley @*/ 3869aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3870aa50250dSMatthew G. Knepley { 3871aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3872aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3873aa50250dSMatthew G. Knepley 3874aa50250dSMatthew G. Knepley PetscFunctionBegin; 3875aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3876aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 387763d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3878aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3879aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3880aa50250dSMatthew G. Knepley } 3881aa50250dSMatthew G. Knepley 3882aa50250dSMatthew G. Knepley #undef __FUNCT__ 3883aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3884aa50250dSMatthew G. Knepley /*@ 3885aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3886aa50250dSMatthew G. Knepley 3887aa50250dSMatthew G. Knepley Not Collective 3888aa50250dSMatthew G. Knepley 3889aa50250dSMatthew G. Knepley Input Parameter: 3890aa50250dSMatthew G. Knepley . dm - The DMPlex object 3891aa50250dSMatthew G. Knepley 3892aa50250dSMatthew G. Knepley Output Parameter: 3893aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3894aa50250dSMatthew G. Knepley 3895aa50250dSMatthew G. Knepley Level: developer 3896552f7358SJed Brown 3897552f7358SJed Brown .keywords: mesh, points 3898aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3899552f7358SJed Brown @*/ 3900552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3901552f7358SJed Brown { 3902aa50250dSMatthew G. Knepley DMLabel label; 3903aa50250dSMatthew G. Knepley PetscInt d = 0; 3904552f7358SJed Brown PetscErrorCode ierr; 3905552f7358SJed Brown 3906552f7358SJed Brown PetscFunctionBegin; 3907552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3908552f7358SJed Brown PetscValidPointer(depth, 2); 3909aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3910aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3911552f7358SJed Brown *depth = d-1; 3912552f7358SJed Brown PetscFunctionReturn(0); 3913552f7358SJed Brown } 3914552f7358SJed Brown 3915552f7358SJed Brown #undef __FUNCT__ 3916552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3917552f7358SJed Brown /*@ 3918552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3919552f7358SJed Brown 3920552f7358SJed Brown Not Collective 3921552f7358SJed Brown 3922552f7358SJed Brown Input Parameters: 3923552f7358SJed Brown + dm - The DMPlex object 3924552f7358SJed Brown - stratumValue - The requested depth 3925552f7358SJed Brown 3926552f7358SJed Brown Output Parameters: 3927552f7358SJed Brown + start - The first point at this depth 3928552f7358SJed Brown - end - One beyond the last point at this depth 3929552f7358SJed Brown 3930552f7358SJed Brown Level: developer 3931552f7358SJed Brown 3932552f7358SJed Brown .keywords: mesh, points 3933552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3934552f7358SJed Brown @*/ 39350adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39360adebc6cSBarry Smith { 3937aa50250dSMatthew G. Knepley DMLabel label; 393863d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3939552f7358SJed Brown PetscErrorCode ierr; 3940552f7358SJed Brown 3941552f7358SJed Brown PetscFunctionBegin; 3942552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 394363d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 394463d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3945552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39460d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 394763d1a920SMatthew G. Knepley if (stratumValue < 0) { 394863d1a920SMatthew G. Knepley if (start) *start = pStart; 394963d1a920SMatthew G. Knepley if (end) *end = pEnd; 395063d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3951552f7358SJed Brown } 3952aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 395363d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 395463d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3955552f7358SJed Brown PetscFunctionReturn(0); 3956552f7358SJed Brown } 3957552f7358SJed Brown 3958552f7358SJed Brown #undef __FUNCT__ 3959552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3960552f7358SJed Brown /*@ 3961552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3962552f7358SJed Brown 3963552f7358SJed Brown Not Collective 3964552f7358SJed Brown 3965552f7358SJed Brown Input Parameters: 3966552f7358SJed Brown + dm - The DMPlex object 3967552f7358SJed Brown - stratumValue - The requested height 3968552f7358SJed Brown 3969552f7358SJed Brown Output Parameters: 3970552f7358SJed Brown + start - The first point at this height 3971552f7358SJed Brown - end - One beyond the last point at this height 3972552f7358SJed Brown 3973552f7358SJed Brown Level: developer 3974552f7358SJed Brown 3975552f7358SJed Brown .keywords: mesh, points 3976552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3977552f7358SJed Brown @*/ 39780adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39790adebc6cSBarry Smith { 3980aa50250dSMatthew G. Knepley DMLabel label; 398163d1a920SMatthew G. Knepley PetscInt depth, 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); 3996aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 399763d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 399863d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 3999552f7358SJed Brown PetscFunctionReturn(0); 4000552f7358SJed Brown } 4001552f7358SJed Brown 4002552f7358SJed Brown #undef __FUNCT__ 4003552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4004552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4005a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4006a6dfd86eSKarl Rupp { 4007552f7358SJed Brown PetscInt *numDofTot; 4008916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4009916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4010552f7358SJed Brown PetscErrorCode ierr; 4011552f7358SJed Brown 4012552f7358SJed Brown PetscFunctionBegin; 4013785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4014552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4015552f7358SJed Brown numDofTot[d] = 0; 40160d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4017552f7358SJed Brown } 401882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4019552f7358SJed Brown if (numFields > 0) { 4020552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4021552f7358SJed Brown if (numComp) { 4022552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4023552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4024552f7358SJed Brown } 4025552f7358SJed Brown } 4026552f7358SJed Brown } 4027552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4028552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4029916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4030916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4031916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4032916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4033552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4034552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4035552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4036552f7358SJed Brown } 4037552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4038552f7358SJed Brown } 4039552f7358SJed Brown } 4040552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4041552f7358SJed Brown PetscFunctionReturn(0); 4042552f7358SJed Brown } 4043552f7358SJed Brown 4044552f7358SJed Brown #undef __FUNCT__ 4045552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4046552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4047552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4048552f7358SJed Brown */ 4049a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4050a6dfd86eSKarl Rupp { 4051552f7358SJed Brown PetscInt numFields; 4052552f7358SJed Brown PetscInt bc; 4053*a68b90caSToby Isaac PetscSection aSec; 4054552f7358SJed Brown PetscErrorCode ierr; 4055552f7358SJed Brown 4056552f7358SJed Brown PetscFunctionBegin; 4057552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4058552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4059552f7358SJed Brown PetscInt field = 0; 4060552f7358SJed Brown const PetscInt *idx; 4061552f7358SJed Brown PetscInt n, i; 4062552f7358SJed Brown 40630d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4064552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4065552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4066552f7358SJed Brown for (i = 0; i < n; ++i) { 4067552f7358SJed Brown const PetscInt p = idx[i]; 4068552f7358SJed Brown PetscInt numConst = constDof; 4069552f7358SJed Brown 4070552f7358SJed Brown /* Constrain every dof on the point */ 4071552f7358SJed Brown if (numConst < 0) { 4072552f7358SJed Brown if (numFields) { 4073552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4074552f7358SJed Brown } else { 4075552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4076552f7358SJed Brown } 4077552f7358SJed Brown } 4078552f7358SJed Brown if (numFields) { 4079552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4080552f7358SJed Brown } 4081552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4082552f7358SJed Brown } 4083552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4084552f7358SJed Brown } 4085*a68b90caSToby Isaac ierr = DMPlexGetConstraints(dm, &aSec, NULL);CHKERRQ(ierr); 4086*a68b90caSToby Isaac if (aSec) { 4087*a68b90caSToby Isaac PetscInt aStart, aEnd, a; 4088*a68b90caSToby Isaac 4089*a68b90caSToby Isaac ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 4090*a68b90caSToby Isaac for (a = aStart; a < aEnd; a++) { 4091*a68b90caSToby Isaac PetscInt dof; 4092*a68b90caSToby Isaac 4093*a68b90caSToby Isaac ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 4094*a68b90caSToby Isaac if (dof) { 4095*a68b90caSToby Isaac /* if there are point-to-point constraints, then all dofs are constrained */ 4096*a68b90caSToby Isaac ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 4097*a68b90caSToby Isaac ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 4098*a68b90caSToby Isaac if (numFields) { 4099*a68b90caSToby Isaac PetscInt f; 4100*a68b90caSToby Isaac 4101*a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 4102*a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr); 4103*a68b90caSToby Isaac ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr); 4104*a68b90caSToby Isaac } 4105*a68b90caSToby Isaac } 4106*a68b90caSToby Isaac } 4107*a68b90caSToby Isaac } 4108*a68b90caSToby Isaac } 4109552f7358SJed Brown PetscFunctionReturn(0); 4110552f7358SJed Brown } 4111552f7358SJed Brown 4112552f7358SJed Brown #undef __FUNCT__ 4113552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4114552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41150adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 41160adebc6cSBarry Smith { 4117552f7358SJed Brown PetscInt *maxConstraints; 4118552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4119552f7358SJed Brown PetscErrorCode ierr; 4120552f7358SJed Brown 4121552f7358SJed Brown PetscFunctionBegin; 4122552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4123552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4124785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 41250d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4126552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4127552f7358SJed Brown PetscInt cdof; 4128552f7358SJed Brown 4129552f7358SJed Brown if (numFields) { 4130552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4131552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4132552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4133552f7358SJed Brown } 4134552f7358SJed Brown } else { 4135552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4136552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4137552f7358SJed Brown } 4138552f7358SJed Brown } 4139552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4140552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4141552f7358SJed Brown } 4142552f7358SJed Brown if (maxConstraints[numFields]) { 4143552f7358SJed Brown PetscInt *indices; 4144552f7358SJed Brown 4145785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4146552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4147552f7358SJed Brown PetscInt cdof, d; 4148552f7358SJed Brown 4149552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4150552f7358SJed Brown if (cdof) { 4151552f7358SJed 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]); 4152552f7358SJed Brown if (numFields) { 4153552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4154552f7358SJed Brown 4155552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4156552f7358SJed Brown PetscInt cfdof, fdof; 4157552f7358SJed Brown 4158552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4159552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4160552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41610d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4162552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41630d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4164552f7358SJed Brown numConst += cfdof; 4165552f7358SJed Brown foff += fdof; 4166552f7358SJed Brown } 4167552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4168552f7358SJed Brown } else { 41690d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4170552f7358SJed Brown } 4171552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4172552f7358SJed Brown } 4173552f7358SJed Brown } 4174552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4175552f7358SJed Brown } 4176552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4177552f7358SJed Brown PetscFunctionReturn(0); 4178552f7358SJed Brown } 4179552f7358SJed Brown 4180552f7358SJed Brown #undef __FUNCT__ 4181552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4182552f7358SJed Brown /* Set the constrained field indices on each point */ 41830adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 41840adebc6cSBarry Smith { 4185552f7358SJed Brown const PetscInt *points, *indices; 4186552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4187552f7358SJed Brown PetscErrorCode ierr; 4188552f7358SJed Brown 4189552f7358SJed Brown PetscFunctionBegin; 4190552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4191552f7358SJed 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); 4192552f7358SJed Brown 4193552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4194552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4195552f7358SJed Brown if (!constraintIndices) { 4196552f7358SJed Brown PetscInt *idx, i; 4197552f7358SJed Brown 4198552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4199785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 42000d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4201552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4202552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4203552f7358SJed Brown } 4204552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4205552f7358SJed Brown } else { 4206552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4207552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4208552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4209552f7358SJed Brown PetscInt fcdof; 4210552f7358SJed Brown 4211552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 421282f516ccSBarry 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); 4213552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4214552f7358SJed Brown } 4215552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4216552f7358SJed Brown } 4217552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4218552f7358SJed Brown PetscFunctionReturn(0); 4219552f7358SJed Brown } 4220552f7358SJed Brown 4221552f7358SJed Brown #undef __FUNCT__ 4222552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4223552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 42240adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 42250adebc6cSBarry Smith { 4226552f7358SJed Brown PetscInt *indices; 4227552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4228552f7358SJed Brown PetscErrorCode ierr; 4229552f7358SJed Brown 4230552f7358SJed Brown PetscFunctionBegin; 4231552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4232785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4233552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 423482f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4235552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4236552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4237552f7358SJed Brown PetscInt cdof, d; 4238552f7358SJed Brown 4239552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4240552f7358SJed Brown if (cdof) { 4241552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4242552f7358SJed Brown 4243552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4244552f7358SJed Brown const PetscInt *fcind; 4245552f7358SJed Brown PetscInt fdof, fcdof; 4246552f7358SJed Brown 4247552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4248552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4249552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4250552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42510d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4252552f7358SJed Brown foff += fdof; 4253552f7358SJed Brown numConst += fcdof; 4254552f7358SJed Brown } 425582f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4256552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4257552f7358SJed Brown } 4258552f7358SJed Brown } 4259552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4260552f7358SJed Brown PetscFunctionReturn(0); 4261552f7358SJed Brown } 4262552f7358SJed Brown 4263552f7358SJed Brown #undef __FUNCT__ 4264552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4265552f7358SJed Brown /*@C 4266552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4267552f7358SJed Brown 4268552f7358SJed Brown Not Collective 4269552f7358SJed Brown 4270552f7358SJed Brown Input Parameters: 4271552f7358SJed Brown + dm - The DMPlex object 4272552f7358SJed Brown . dim - The spatial dimension of the problem 4273552f7358SJed Brown . numFields - The number of fields in the problem 4274552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4275552f7358SJed 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 4276552f7358SJed Brown . numBC - The number of boundary conditions 4277552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4278f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4279f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4280552f7358SJed Brown 4281552f7358SJed Brown Output Parameter: 4282552f7358SJed Brown . section - The PetscSection object 4283552f7358SJed Brown 4284552f7358SJed 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 4285f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4286f8f126e8SMatthew G. Knepley 4287f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4288552f7358SJed Brown 4289552f7358SJed Brown Level: developer 4290552f7358SJed Brown 42913813dfbdSMatthew G Knepley Fortran Notes: 42923813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 42933813dfbdSMatthew G Knepley 4294552f7358SJed Brown .keywords: mesh, elements 4295f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4296552f7358SJed Brown @*/ 4297f8f126e8SMatthew 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) 4298a6dfd86eSKarl Rupp { 4299*a68b90caSToby Isaac PetscSection aSec; 4300552f7358SJed Brown PetscErrorCode ierr; 4301552f7358SJed Brown 4302552f7358SJed Brown PetscFunctionBegin; 4303552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4304552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4305f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4306552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4307*a68b90caSToby Isaac ierr = DMPlexGetConstraints(dm,&aSec,NULL);CHKERRQ(ierr); 4308*a68b90caSToby Isaac if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4309ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4310552f7358SJed Brown PetscFunctionReturn(0); 4311552f7358SJed Brown } 4312552f7358SJed Brown 4313552f7358SJed Brown #undef __FUNCT__ 4314552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 43150adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 43160adebc6cSBarry Smith { 4317552f7358SJed Brown PetscSection section; 4318552f7358SJed Brown PetscErrorCode ierr; 4319552f7358SJed Brown 4320552f7358SJed Brown PetscFunctionBegin; 432138221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 432282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4323552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 43241d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4325552f7358SJed Brown PetscFunctionReturn(0); 4326552f7358SJed Brown } 4327552f7358SJed Brown 4328552f7358SJed Brown #undef __FUNCT__ 4329552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 43300adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 43310adebc6cSBarry Smith { 4332552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4333552f7358SJed Brown 4334552f7358SJed Brown PetscFunctionBegin; 4335552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4336552f7358SJed Brown if (section) *section = mesh->coneSection; 4337552f7358SJed Brown PetscFunctionReturn(0); 4338552f7358SJed Brown } 4339552f7358SJed Brown 4340552f7358SJed Brown #undef __FUNCT__ 43418cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43428cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43438cb4d582SMatthew G. Knepley { 43448cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43458cb4d582SMatthew G. Knepley 43468cb4d582SMatthew G. Knepley PetscFunctionBegin; 43478cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43488cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43498cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43508cb4d582SMatthew G. Knepley } 43518cb4d582SMatthew G. Knepley 43528cb4d582SMatthew G. Knepley #undef __FUNCT__ 4353552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4354a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4355a6dfd86eSKarl Rupp { 4356552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4357552f7358SJed Brown 4358552f7358SJed Brown PetscFunctionBegin; 4359552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4360552f7358SJed Brown if (cones) *cones = mesh->cones; 4361552f7358SJed Brown PetscFunctionReturn(0); 4362552f7358SJed Brown } 4363552f7358SJed Brown 4364552f7358SJed Brown #undef __FUNCT__ 4365552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4366a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4367a6dfd86eSKarl Rupp { 4368552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4369552f7358SJed Brown 4370552f7358SJed Brown PetscFunctionBegin; 4371552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4372552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4373552f7358SJed Brown PetscFunctionReturn(0); 4374552f7358SJed Brown } 4375552f7358SJed Brown 4376552f7358SJed Brown /******************************** FEM Support **********************************/ 4377552f7358SJed Brown 4378552f7358SJed Brown #undef __FUNCT__ 43791a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 43801a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4381a6dfd86eSKarl Rupp { 4382552f7358SJed Brown PetscScalar *array, *vArray; 4383d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 43841a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4385552f7358SJed Brown PetscErrorCode ierr; 4386552f7358SJed Brown 43871b406b76SMatthew G. Knepley PetscFunctionBeginHot; 43882a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 43895a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 43905a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 43915a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 43923f7cbbe7SMatthew G. Knepley if (!values || !*values) { 43939df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43949df71ca4SMatthew G. Knepley PetscInt dof; 4395d9917b9dSMatthew G. Knepley 43969df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43979df71ca4SMatthew G. Knepley size += dof; 43989df71ca4SMatthew G. Knepley } 43999df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44009df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44012a3aaacfSMatthew G. Knepley PetscInt dof; 44025a1bb5cfSMatthew G. Knepley 44035a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44042a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44055a1bb5cfSMatthew G. Knepley size += dof; 44065a1bb5cfSMatthew G. Knepley } 44073f7cbbe7SMatthew G. Knepley if (!values) { 44083f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 44093f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 44103f7cbbe7SMatthew G. Knepley } 44115a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4412982e9ed1SMatthew G. Knepley } else { 4413982e9ed1SMatthew G. Knepley array = *values; 4414982e9ed1SMatthew G. Knepley } 44159df71ca4SMatthew G. Knepley size = 0; 44165a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 44179df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44189df71ca4SMatthew G. Knepley PetscInt dof, off, d; 44199df71ca4SMatthew G. Knepley PetscScalar *varr; 4420d9917b9dSMatthew G. Knepley 44219df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44229df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44239df71ca4SMatthew G. Knepley varr = &vArray[off]; 44241a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44251a271a75SMatthew G. Knepley array[offset] = varr[d]; 44269df71ca4SMatthew G. Knepley } 44279df71ca4SMatthew G. Knepley size += dof; 44289df71ca4SMatthew G. Knepley } 44299df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44309df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44319df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 44325a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 44335a1bb5cfSMatthew G. Knepley PetscScalar *varr; 44345a1bb5cfSMatthew G. Knepley 443552ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44365a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44375a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 44385a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 44395a1bb5cfSMatthew G. Knepley if (o >= 0) { 44401a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44411a271a75SMatthew G. Knepley array[offset] = varr[d]; 44425a1bb5cfSMatthew G. Knepley } 44435a1bb5cfSMatthew G. Knepley } else { 44441a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44451a271a75SMatthew G. Knepley array[offset] = varr[d]; 44465a1bb5cfSMatthew G. Knepley } 44475a1bb5cfSMatthew G. Knepley } 44489df71ca4SMatthew G. Knepley size += dof; 44495a1bb5cfSMatthew G. Knepley } 44505a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44519df71ca4SMatthew G. Knepley if (!*values) { 44525a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44535a1bb5cfSMatthew G. Knepley *values = array; 44549df71ca4SMatthew G. Knepley } else { 44559df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44568c312ff3SMatthew G. Knepley *csize = size; 44579df71ca4SMatthew G. Knepley } 44585a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44595a1bb5cfSMatthew G. Knepley } 4460d9917b9dSMatthew G. Knepley 4461d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44621a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44631a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44641a271a75SMatthew G. Knepley { 44651a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44661a271a75SMatthew G. Knepley PetscErrorCode ierr; 44671a271a75SMatthew G. Knepley 44681a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4469fe02ba77SJed Brown *size = 0; 44701a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44711a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44721a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44731a271a75SMatthew G. Knepley PetscInt dof, off, d; 44741a271a75SMatthew G. Knepley const PetscScalar *varr; 44751a271a75SMatthew G. Knepley 44761a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44771a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44781a271a75SMatthew G. Knepley varr = &vArray[off]; 44791a271a75SMatthew G. Knepley if (o >= 0) { 44801a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 44811a271a75SMatthew G. Knepley } else { 44821a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 44831a271a75SMatthew G. Knepley } 44841a271a75SMatthew G. Knepley } 44851a271a75SMatthew G. Knepley *size = offset; 44861a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44871a271a75SMatthew G. Knepley } 44881a271a75SMatthew G. Knepley 44891a271a75SMatthew G. Knepley #undef __FUNCT__ 44901a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 44911a271a75SMatthew 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[]) 44921a271a75SMatthew G. Knepley { 44931a271a75SMatthew G. Knepley PetscInt offset = 0, f; 44941a271a75SMatthew G. Knepley PetscErrorCode ierr; 44951a271a75SMatthew G. Knepley 44961a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4497fe02ba77SJed Brown *size = 0; 44981a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 44991a271a75SMatthew G. Knepley PetscInt fcomp, p; 45001a271a75SMatthew G. Knepley 45011a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 45021a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 45031a271a75SMatthew G. Knepley const PetscInt point = points[p]; 45041a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 45051a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 45061a271a75SMatthew G. Knepley const PetscScalar *varr; 45071a271a75SMatthew G. Knepley 45081a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 45091a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 45101a271a75SMatthew G. Knepley varr = &vArray[foff]; 45111a271a75SMatthew G. Knepley if (o >= 0) { 45121a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 45131a271a75SMatthew G. Knepley } else { 45141a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 45151a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 45161a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 45171a271a75SMatthew G. Knepley } 45181a271a75SMatthew G. Knepley } 45191a271a75SMatthew G. Knepley } 45201a271a75SMatthew G. Knepley } 45211a271a75SMatthew G. Knepley } 45221a271a75SMatthew G. Knepley *size = offset; 45231a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45241a271a75SMatthew G. Knepley } 45251a271a75SMatthew G. Knepley 45261a271a75SMatthew G. Knepley #undef __FUNCT__ 4527552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4528552f7358SJed Brown /*@C 4529552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4530552f7358SJed Brown 4531552f7358SJed Brown Not collective 4532552f7358SJed Brown 4533552f7358SJed Brown Input Parameters: 4534552f7358SJed Brown + dm - The DM 4535552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4536552f7358SJed Brown . v - The local vector 4537552f7358SJed Brown - point - The sieve point in the DM 4538552f7358SJed Brown 4539552f7358SJed Brown Output Parameters: 4540552f7358SJed Brown + csize - The number of values in the closure, or NULL 4541552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4542552f7358SJed Brown 4543552f7358SJed Brown Fortran Notes: 4544552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4545552f7358SJed Brown include petsc.h90 in your code. 4546552f7358SJed Brown 4547552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4548552f7358SJed Brown 4549552f7358SJed Brown Level: intermediate 4550552f7358SJed Brown 4551552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4552552f7358SJed Brown @*/ 4553552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4554552f7358SJed Brown { 4555552f7358SJed Brown PetscSection clSection; 4556d9917b9dSMatthew G. Knepley IS clPoints; 4557552f7358SJed Brown PetscScalar *array, *vArray; 4558552f7358SJed Brown PetscInt *points = NULL; 4559d9917b9dSMatthew G. Knepley const PetscInt *clp; 45601a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4561552f7358SJed Brown PetscErrorCode ierr; 4562552f7358SJed Brown 4563d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4564552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4565552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45661a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45671a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4568552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4569552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4570552f7358SJed Brown if (depth == 1 && numFields < 2) { 45711a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4572552f7358SJed Brown PetscFunctionReturn(0); 4573552f7358SJed Brown } 45741a271a75SMatthew G. Knepley /* Get points */ 4575d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4576d9917b9dSMatthew G. Knepley if (!clPoints) { 45771a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4578552f7358SJed Brown 45791a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4580552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4581552f7358SJed Brown /* Compress out points not in the section */ 4582552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4583552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4584552f7358SJed Brown points[q*2] = points[p]; 4585552f7358SJed Brown points[q*2+1] = points[p+1]; 4586552f7358SJed Brown ++q; 4587552f7358SJed Brown } 4588552f7358SJed Brown } 4589552f7358SJed Brown numPoints = q; 4590d9917b9dSMatthew G. Knepley } else { 4591d9917b9dSMatthew G. Knepley PetscInt dof, off; 4592552f7358SJed Brown 4593d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4594d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4595d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 45961a271a75SMatthew G. Knepley numPoints = dof/2; 4597d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4598552f7358SJed Brown } 45991a271a75SMatthew G. Knepley /* Get array */ 4600552f7358SJed Brown if (!values || !*values) { 46011a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4602552f7358SJed Brown 46031a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4604552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 46051a271a75SMatthew G. Knepley asize += dof; 4606552f7358SJed Brown } 4607bd6c0d32SMatthew G. Knepley if (!values) { 4608d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46091a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46101a271a75SMatthew G. Knepley if (csize) *csize = asize; 4611bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4612bd6c0d32SMatthew G. Knepley } 46131a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4614d0f6b257SMatthew G. Knepley } else { 4615d0f6b257SMatthew G. Knepley array = *values; 4616d0f6b257SMatthew G. Knepley } 4617552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 46181a271a75SMatthew G. Knepley /* Get values */ 4619ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 46201a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 46211a271a75SMatthew G. Knepley /* Cleanup points */ 46221a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46231a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46241a271a75SMatthew G. Knepley /* Cleanup array */ 4625552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4626d0f6b257SMatthew G. Knepley if (!*values) { 4627552f7358SJed Brown if (csize) *csize = size; 4628552f7358SJed Brown *values = array; 4629d0f6b257SMatthew G. Knepley } else { 4630d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4631d0f6b257SMatthew G. Knepley *csize = size; 4632d0f6b257SMatthew G. Knepley } 4633552f7358SJed Brown PetscFunctionReturn(0); 4634552f7358SJed Brown } 4635552f7358SJed Brown 4636552f7358SJed Brown #undef __FUNCT__ 4637552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4638552f7358SJed Brown /*@C 4639552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4640552f7358SJed Brown 4641552f7358SJed Brown Not collective 4642552f7358SJed Brown 4643552f7358SJed Brown Input Parameters: 4644552f7358SJed Brown + dm - The DM 46450298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4646552f7358SJed Brown . v - The local vector 4647552f7358SJed Brown . point - The sieve point in the DM 46480298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4649552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4650552f7358SJed Brown 46513813dfbdSMatthew G Knepley Fortran Notes: 46523813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46533813dfbdSMatthew G Knepley include petsc.h90 in your code. 46543813dfbdSMatthew G Knepley 46553813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46563813dfbdSMatthew G Knepley 4657552f7358SJed Brown Level: intermediate 4658552f7358SJed Brown 4659552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4660552f7358SJed Brown @*/ 46617c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4662a6dfd86eSKarl Rupp { 4663552f7358SJed Brown PetscInt size = 0; 4664552f7358SJed Brown PetscErrorCode ierr; 4665552f7358SJed Brown 4666552f7358SJed Brown PetscFunctionBegin; 4667552f7358SJed Brown /* Should work without recalculating size */ 4668552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4669552f7358SJed Brown PetscFunctionReturn(0); 4670552f7358SJed Brown } 4671552f7358SJed Brown 4672552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4673552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4674552f7358SJed Brown 4675552f7358SJed Brown #undef __FUNCT__ 4676552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 46771a271a75SMatthew 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[]) 4678552f7358SJed Brown { 4679552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4680552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4681552f7358SJed Brown PetscScalar *a; 4682552f7358SJed Brown PetscInt off, cind = 0, k; 4683552f7358SJed Brown PetscErrorCode ierr; 4684552f7358SJed Brown 4685552f7358SJed Brown PetscFunctionBegin; 4686552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4687552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4688552f7358SJed Brown a = &array[off]; 4689552f7358SJed Brown if (!cdof || setBC) { 4690552f7358SJed Brown if (orientation >= 0) { 4691552f7358SJed Brown for (k = 0; k < dof; ++k) { 4692552f7358SJed Brown fuse(&a[k], values[k]); 4693552f7358SJed Brown } 4694552f7358SJed Brown } else { 4695552f7358SJed Brown for (k = 0; k < dof; ++k) { 4696552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4697552f7358SJed Brown } 4698552f7358SJed Brown } 4699552f7358SJed Brown } else { 4700552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4701552f7358SJed Brown if (orientation >= 0) { 4702552f7358SJed Brown for (k = 0; k < dof; ++k) { 4703552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4704552f7358SJed Brown fuse(&a[k], values[k]); 4705552f7358SJed Brown } 4706552f7358SJed Brown } else { 4707552f7358SJed Brown for (k = 0; k < dof; ++k) { 4708552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4709552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4710552f7358SJed Brown } 4711552f7358SJed Brown } 4712552f7358SJed Brown } 4713552f7358SJed Brown PetscFunctionReturn(0); 4714552f7358SJed Brown } 4715552f7358SJed Brown 4716552f7358SJed Brown #undef __FUNCT__ 4717a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 47181a271a75SMatthew 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[]) 4719a5e93ea8SMatthew G. Knepley { 4720a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4721a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4722a5e93ea8SMatthew G. Knepley PetscScalar *a; 4723a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4724a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4725a5e93ea8SMatthew G. Knepley 4726a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4727a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4728a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4729a5e93ea8SMatthew G. Knepley a = &array[off]; 4730a5e93ea8SMatthew G. Knepley if (cdof) { 4731a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4732a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4733a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4734a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4735a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4736a5e93ea8SMatthew G. Knepley ++cind; 4737a5e93ea8SMatthew G. Knepley } 4738a5e93ea8SMatthew G. Knepley } 4739a5e93ea8SMatthew G. Knepley } else { 4740a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4741a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4742a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4743a5e93ea8SMatthew G. Knepley ++cind; 4744a5e93ea8SMatthew G. Knepley } 4745a5e93ea8SMatthew G. Knepley } 4746a5e93ea8SMatthew G. Knepley } 4747a5e93ea8SMatthew G. Knepley } 4748a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4749a5e93ea8SMatthew G. Knepley } 4750a5e93ea8SMatthew G. Knepley 4751a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4752552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47531a271a75SMatthew 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[]) 4754a6dfd86eSKarl Rupp { 4755552f7358SJed Brown PetscScalar *a; 47561a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47571a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47581a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4759552f7358SJed Brown PetscErrorCode ierr; 4760552f7358SJed Brown 4761552f7358SJed Brown PetscFunctionBegin; 4762552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4763552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47641a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47651a271a75SMatthew G. Knepley a = &array[foff]; 4766552f7358SJed Brown if (!fcdof || setBC) { 47671a271a75SMatthew G. Knepley if (o >= 0) { 47681a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4769552f7358SJed Brown } else { 4770552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4771552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47721a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4773552f7358SJed Brown } 4774552f7358SJed Brown } 4775552f7358SJed Brown } 4776552f7358SJed Brown } else { 4777552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47781a271a75SMatthew G. Knepley if (o >= 0) { 4779552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4780552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 47811a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4782552f7358SJed Brown } 4783552f7358SJed Brown } else { 4784552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4785552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4786552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 47871a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4788552f7358SJed Brown } 4789552f7358SJed Brown } 4790552f7358SJed Brown } 4791552f7358SJed Brown } 47921a271a75SMatthew G. Knepley *offset += fdof; 4793552f7358SJed Brown PetscFunctionReturn(0); 4794552f7358SJed Brown } 4795552f7358SJed Brown 4796552f7358SJed Brown #undef __FUNCT__ 4797a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 47981a271a75SMatthew 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[]) 4799a5e93ea8SMatthew G. Knepley { 4800a5e93ea8SMatthew G. Knepley PetscScalar *a; 48011a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 48021a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 48031a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4804a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4805a5e93ea8SMatthew G. Knepley 4806a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4807a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4808a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 48091a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 48101a271a75SMatthew G. Knepley a = &array[foff]; 4811a5e93ea8SMatthew G. Knepley if (fcdof) { 4812a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 48131a271a75SMatthew G. Knepley if (o >= 0) { 4814a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4815a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 48161a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4817a5e93ea8SMatthew G. Knepley ++cind; 4818a5e93ea8SMatthew G. Knepley } 4819a5e93ea8SMatthew G. Knepley } 4820a5e93ea8SMatthew G. Knepley } else { 4821a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4822a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4823a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 48241a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4825a5e93ea8SMatthew G. Knepley ++cind; 4826a5e93ea8SMatthew G. Knepley } 4827a5e93ea8SMatthew G. Knepley } 4828a5e93ea8SMatthew G. Knepley } 4829a5e93ea8SMatthew G. Knepley } 4830a5e93ea8SMatthew G. Knepley } 48311a271a75SMatthew G. Knepley *offset += fdof; 4832a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4833a5e93ea8SMatthew G. Knepley } 4834a5e93ea8SMatthew G. Knepley 4835a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 48361b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 48371a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4838a6dfd86eSKarl Rupp { 4839552f7358SJed Brown PetscScalar *array; 48401b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 48411b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4842552f7358SJed Brown PetscErrorCode ierr; 4843552f7358SJed Brown 48441b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4845b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4846b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4847b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4848b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4849b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4850b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4851b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4852b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4853b6ebb6e6SMatthew G. Knepley 4854b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4855b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4856b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4857b6ebb6e6SMatthew G. Knepley { 4858b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4859b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4860b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4861b6ebb6e6SMatthew G. Knepley 4862b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4863b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4864b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4865b6ebb6e6SMatthew G. Knepley if (!cdof) { 4866b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4867b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4868b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4869b6ebb6e6SMatthew G. Knepley } 4870b6ebb6e6SMatthew G. Knepley } else { 4871b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4872b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4873b6ebb6e6SMatthew G. Knepley } 4874b6ebb6e6SMatthew G. Knepley } 4875b6ebb6e6SMatthew G. Knepley } else { 4876b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4877b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4878b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4879b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4880b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4881b6ebb6e6SMatthew G. Knepley } 4882b6ebb6e6SMatthew G. Knepley } else { 4883b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4884b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4885b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4886b6ebb6e6SMatthew G. Knepley } 4887b6ebb6e6SMatthew G. Knepley } 4888b6ebb6e6SMatthew G. Knepley } 4889b6ebb6e6SMatthew G. Knepley } 4890b6ebb6e6SMatthew G. Knepley } 4891b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4892b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4893b6ebb6e6SMatthew G. Knepley } 48941b406b76SMatthew G. Knepley 48951b406b76SMatthew G. Knepley #undef __FUNCT__ 48961b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 48971b406b76SMatthew G. Knepley /*@C 48981b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 48991b406b76SMatthew G. Knepley 49001b406b76SMatthew G. Knepley Not collective 49011b406b76SMatthew G. Knepley 49021b406b76SMatthew G. Knepley Input Parameters: 49031b406b76SMatthew G. Knepley + dm - The DM 49041b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 49051b406b76SMatthew G. Knepley . v - The local vector 49061b406b76SMatthew G. Knepley . point - The sieve point in the DM 49071b406b76SMatthew G. Knepley . values - The array of values 49081b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 49091b406b76SMatthew G. Knepley 49101b406b76SMatthew G. Knepley Fortran Notes: 49111b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 49121b406b76SMatthew G. Knepley 49131b406b76SMatthew G. Knepley Level: intermediate 49141b406b76SMatthew G. Knepley 49151b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 49161b406b76SMatthew G. Knepley @*/ 49171b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 49181b406b76SMatthew G. Knepley { 49191b406b76SMatthew G. Knepley PetscSection clSection; 49201b406b76SMatthew G. Knepley IS clPoints; 49211b406b76SMatthew G. Knepley PetscScalar *array; 49221b406b76SMatthew G. Knepley PetscInt *points = NULL; 49231b406b76SMatthew G. Knepley const PetscInt *clp; 49241a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 49251b406b76SMatthew G. Knepley PetscErrorCode ierr; 49261b406b76SMatthew G. Knepley 49271a271a75SMatthew G. Knepley PetscFunctionBeginHot; 49281b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49291b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 49301a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 49311a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 49321b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 49331b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 49341b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 49351a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 49361b406b76SMatthew G. Knepley PetscFunctionReturn(0); 49371b406b76SMatthew G. Knepley } 49381a271a75SMatthew G. Knepley /* Get points */ 49391b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 49401b406b76SMatthew G. Knepley if (!clPoints) { 49411a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49421a271a75SMatthew G. Knepley 49431a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4944552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4945552f7358SJed Brown /* Compress out points not in the section */ 4946552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4947552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4948552f7358SJed Brown points[q*2] = points[p]; 4949552f7358SJed Brown points[q*2+1] = points[p+1]; 4950552f7358SJed Brown ++q; 4951552f7358SJed Brown } 4952552f7358SJed Brown } 4953552f7358SJed Brown numPoints = q; 49541b406b76SMatthew G. Knepley } else { 49551b406b76SMatthew G. Knepley PetscInt dof, off; 4956552f7358SJed Brown 49571b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49581b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49591b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49601a271a75SMatthew G. Knepley numPoints = dof/2; 49611b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4962552f7358SJed Brown } 49631a271a75SMatthew G. Knepley /* Get array */ 4964552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49651a271a75SMatthew G. Knepley /* Get values */ 4966ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49671a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4968552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49691a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4970552f7358SJed Brown switch (mode) { 4971552f7358SJed Brown case INSERT_VALUES: 4972552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49731a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49741a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49751a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4976552f7358SJed Brown } break; 4977552f7358SJed Brown case INSERT_ALL_VALUES: 4978552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49791a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49801a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49811a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 4982552f7358SJed Brown } break; 4983a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4984a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 49851a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49861a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49871a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 4988a5e93ea8SMatthew G. Knepley } break; 4989552f7358SJed Brown case ADD_VALUES: 4990552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49911a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49921a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49931a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 4994552f7358SJed Brown } break; 4995552f7358SJed Brown case ADD_ALL_VALUES: 4996552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49971a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49981a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49991a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5000552f7358SJed Brown } break; 5001552f7358SJed Brown default: 500282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5003552f7358SJed Brown } 50041a271a75SMatthew G. Knepley } 5005552f7358SJed Brown } else { 50061a271a75SMatthew G. Knepley PetscInt dof, off; 50071a271a75SMatthew G. Knepley 5008552f7358SJed Brown switch (mode) { 5009552f7358SJed Brown case INSERT_VALUES: 5010552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5011552f7358SJed Brown PetscInt o = points[p+1]; 5012552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5013552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5014552f7358SJed Brown } break; 5015552f7358SJed Brown case INSERT_ALL_VALUES: 5016552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5017552f7358SJed Brown PetscInt o = points[p+1]; 5018552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5019552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5020552f7358SJed Brown } break; 5021a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5022a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5023a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5024a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5025a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5026a5e93ea8SMatthew G. Knepley } break; 5027552f7358SJed Brown case ADD_VALUES: 5028552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5029552f7358SJed Brown PetscInt o = points[p+1]; 5030552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5031552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5032552f7358SJed Brown } break; 5033552f7358SJed Brown case ADD_ALL_VALUES: 5034552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5035552f7358SJed Brown PetscInt o = points[p+1]; 5036552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5037552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5038552f7358SJed Brown } break; 5039552f7358SJed Brown default: 504082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5041552f7358SJed Brown } 5042552f7358SJed Brown } 50431a271a75SMatthew G. Knepley /* Cleanup points */ 50441a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50451a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50461a271a75SMatthew G. Knepley /* Cleanup array */ 5047552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5048552f7358SJed Brown PetscFunctionReturn(0); 5049552f7358SJed Brown } 5050552f7358SJed Brown 5051552f7358SJed Brown #undef __FUNCT__ 5052e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 5053e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 5054e07394fbSMatthew G. Knepley { 5055e07394fbSMatthew G. Knepley PetscSection clSection; 5056e07394fbSMatthew G. Knepley IS clPoints; 5057e07394fbSMatthew G. Knepley PetscScalar *array; 5058e07394fbSMatthew G. Knepley PetscInt *points = NULL; 5059e07394fbSMatthew G. Knepley const PetscInt *clp; 5060e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 5061e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5062e07394fbSMatthew G. Knepley PetscErrorCode ierr; 5063e07394fbSMatthew G. Knepley 5064e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 5065e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5066e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5067e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5068e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5069e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5070e07394fbSMatthew G. Knepley /* Get points */ 5071e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5072e07394fbSMatthew G. Knepley if (!clPoints) { 5073e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 5074e07394fbSMatthew G. Knepley 5075e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5076e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5077e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 5078e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5079e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5080e07394fbSMatthew G. Knepley points[q*2] = points[p]; 5081e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 5082e07394fbSMatthew G. Knepley ++q; 5083e07394fbSMatthew G. Knepley } 5084e07394fbSMatthew G. Knepley } 5085e07394fbSMatthew G. Knepley numPoints = q; 5086e07394fbSMatthew G. Knepley } else { 5087e07394fbSMatthew G. Knepley PetscInt dof, off; 5088e07394fbSMatthew G. Knepley 5089e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5090e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5091e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 5092e07394fbSMatthew G. Knepley numPoints = dof/2; 5093e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5094e07394fbSMatthew G. Knepley } 5095e07394fbSMatthew G. Knepley /* Get array */ 5096e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5097e07394fbSMatthew G. Knepley /* Get values */ 5098e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5099e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5100e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 5101e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5102e07394fbSMatthew G. Knepley PetscInt fdof; 5103e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5104e07394fbSMatthew G. Knepley offset += fdof; 5105e07394fbSMatthew G. Knepley } 5106e07394fbSMatthew G. Knepley continue; 5107e07394fbSMatthew G. Knepley } 5108e07394fbSMatthew G. Knepley switch (mode) { 5109e07394fbSMatthew G. Knepley case INSERT_VALUES: 5110e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5111e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5112e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5113e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5114e07394fbSMatthew G. Knepley } break; 5115e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 5116e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5117e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5118e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5119e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5120e07394fbSMatthew G. Knepley } break; 5121e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 5122e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5123e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5124e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5125e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5126e07394fbSMatthew G. Knepley } break; 5127e07394fbSMatthew G. Knepley case ADD_VALUES: 5128e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5129e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5130e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5131e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5132e07394fbSMatthew G. Knepley } break; 5133e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 5134e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5135e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5136e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5137e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5138e07394fbSMatthew G. Knepley } break; 5139e07394fbSMatthew G. Knepley default: 5140e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5141e07394fbSMatthew G. Knepley } 5142e07394fbSMatthew G. Knepley } 5143e07394fbSMatthew G. Knepley /* Cleanup points */ 5144e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 5145e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 5146e07394fbSMatthew G. Knepley /* Cleanup array */ 5147e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5148e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 5149e07394fbSMatthew G. Knepley } 5150e07394fbSMatthew G. Knepley 5151e07394fbSMatthew G. Knepley #undef __FUNCT__ 5152552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5153b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5154552f7358SJed Brown { 5155552f7358SJed Brown PetscMPIInt rank; 5156552f7358SJed Brown PetscInt i, j; 5157552f7358SJed Brown PetscErrorCode ierr; 5158552f7358SJed Brown 5159552f7358SJed Brown PetscFunctionBegin; 516082f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 516177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5162b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5163b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5164b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5165b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 516677a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5167b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5168519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51697eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5170552f7358SJed Brown #else 5171b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5172552f7358SJed Brown #endif 5173552f7358SJed Brown } 517477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5175552f7358SJed Brown } 5176552f7358SJed Brown PetscFunctionReturn(0); 5177552f7358SJed Brown } 5178552f7358SJed Brown 5179552f7358SJed Brown #undef __FUNCT__ 5180552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5181552f7358SJed Brown /* . off - The global offset of this point */ 5182e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5183a6dfd86eSKarl Rupp { 5184e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5185552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5186552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5187552f7358SJed Brown PetscInt cind = 0, k; 5188552f7358SJed Brown PetscErrorCode ierr; 5189552f7358SJed Brown 5190552f7358SJed Brown PetscFunctionBegin; 5191552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5192552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5193552f7358SJed Brown if (!cdof || setBC) { 5194552f7358SJed Brown if (orientation >= 0) { 5195e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5196552f7358SJed Brown } else { 5197e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5198552f7358SJed Brown } 5199552f7358SJed Brown } else { 5200552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5201552f7358SJed Brown if (orientation >= 0) { 5202552f7358SJed Brown for (k = 0; k < dof; ++k) { 5203552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5204552f7358SJed Brown /* Insert check for returning constrained indices */ 5205e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5206552f7358SJed Brown ++cind; 5207552f7358SJed Brown } else { 5208e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5209552f7358SJed Brown } 5210552f7358SJed Brown } 5211552f7358SJed Brown } else { 5212552f7358SJed Brown for (k = 0; k < dof; ++k) { 5213552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5214552f7358SJed Brown /* Insert check for returning constrained indices */ 5215e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5216552f7358SJed Brown ++cind; 5217552f7358SJed Brown } else { 5218e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5219552f7358SJed Brown } 5220552f7358SJed Brown } 5221552f7358SJed Brown } 5222552f7358SJed Brown } 5223e6ccafaeSMatthew G Knepley *loff += dof; 5224552f7358SJed Brown PetscFunctionReturn(0); 5225552f7358SJed Brown } 5226552f7358SJed Brown 5227552f7358SJed Brown #undef __FUNCT__ 5228552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5229552f7358SJed Brown /* . off - The global offset of this point */ 5230a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5231a6dfd86eSKarl Rupp { 5232552f7358SJed Brown PetscInt numFields, foff, f; 5233552f7358SJed Brown PetscErrorCode ierr; 5234552f7358SJed Brown 5235552f7358SJed Brown PetscFunctionBegin; 5236552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5237552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5238552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5239552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5240552f7358SJed Brown PetscInt cind = 0, k, c; 5241552f7358SJed Brown 5242552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5243552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5244552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5245552f7358SJed Brown if (!cfdof || setBC) { 5246552f7358SJed Brown if (orientation >= 0) { 52470d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5248552f7358SJed Brown } else { 5249552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5250552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5251552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5252552f7358SJed Brown } 5253552f7358SJed Brown } 5254552f7358SJed Brown } 5255552f7358SJed Brown } else { 5256552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5257552f7358SJed Brown if (orientation >= 0) { 5258552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5259552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5260552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5261552f7358SJed Brown ++cind; 5262552f7358SJed Brown } else { 5263552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5264552f7358SJed Brown } 5265552f7358SJed Brown } 5266552f7358SJed Brown } else { 5267552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5268552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5269552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5270552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5271552f7358SJed Brown ++cind; 5272552f7358SJed Brown } else { 5273552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5274552f7358SJed Brown } 5275552f7358SJed Brown } 5276552f7358SJed Brown } 5277552f7358SJed Brown } 5278552f7358SJed Brown } 5279552f7358SJed Brown foff += fdof - cfdof; 5280552f7358SJed Brown foffs[f] += fdof; 5281552f7358SJed Brown } 5282552f7358SJed Brown PetscFunctionReturn(0); 5283552f7358SJed Brown } 5284552f7358SJed Brown 5285552f7358SJed Brown #undef __FUNCT__ 5286552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 52877f5d1fdeSMatthew G. Knepley /*@C 52887f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 52897f5d1fdeSMatthew G. Knepley 52907f5d1fdeSMatthew G. Knepley Not collective 52917f5d1fdeSMatthew G. Knepley 52927f5d1fdeSMatthew G. Knepley Input Parameters: 52937f5d1fdeSMatthew G. Knepley + dm - The DM 5294ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5295ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 52967f5d1fdeSMatthew G. Knepley . A - The matrix 52977f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 52987f5d1fdeSMatthew G. Knepley . values - The array of values 52997f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 53007f5d1fdeSMatthew G. Knepley 53017f5d1fdeSMatthew G. Knepley Fortran Notes: 53027f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 53037f5d1fdeSMatthew G. Knepley 53047f5d1fdeSMatthew G. Knepley Level: intermediate 53057f5d1fdeSMatthew G. Knepley 53067f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 53077f5d1fdeSMatthew G. Knepley @*/ 53087c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5309552f7358SJed Brown { 5310552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 53111b406b76SMatthew G. Knepley PetscSection clSection; 53121b406b76SMatthew G. Knepley IS clPoints; 53130298fd71SBarry Smith PetscInt *points = NULL; 53141b406b76SMatthew G. Knepley const PetscInt *clp; 5315552f7358SJed Brown PetscInt *indices; 5316552f7358SJed Brown PetscInt offsets[32]; 5317552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5318552f7358SJed Brown PetscErrorCode ierr; 5319552f7358SJed Brown 5320552f7358SJed Brown PetscFunctionBegin; 5321552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5322ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 53233dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5324ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 53253dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 53263dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5327552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 532882f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5329552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 53301b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 53311b406b76SMatthew G. Knepley if (!clPoints) { 5332552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5333552f7358SJed Brown /* Compress out points not in the section */ 5334552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5335552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5336552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5337552f7358SJed Brown points[q*2] = points[p]; 5338552f7358SJed Brown points[q*2+1] = points[p+1]; 5339552f7358SJed Brown ++q; 5340552f7358SJed Brown } 5341552f7358SJed Brown } 5342552f7358SJed Brown numPoints = q; 53431b406b76SMatthew G. Knepley } else { 53441b406b76SMatthew G. Knepley PetscInt dof, off; 53451b406b76SMatthew G. Knepley 53461b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 53471b406b76SMatthew G. Knepley numPoints = dof/2; 53481b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 53491b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 53501b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 53511b406b76SMatthew G. Knepley } 5352552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5353552f7358SJed Brown PetscInt fdof; 5354552f7358SJed Brown 5355552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5356552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5357552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5358552f7358SJed Brown offsets[f+1] += fdof; 5359552f7358SJed Brown } 5360552f7358SJed Brown numIndices += dof; 5361552f7358SJed Brown } 53620d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 53630d644c17SKarl Rupp 536482f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5365552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5366552f7358SJed Brown if (numFields) { 5367552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5368552f7358SJed Brown PetscInt o = points[p+1]; 5369552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5370552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5371552f7358SJed Brown } 5372552f7358SJed Brown } else { 5373e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5374552f7358SJed Brown PetscInt o = points[p+1]; 5375552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5376e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5377552f7358SJed Brown } 5378552f7358SJed Brown } 5379b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5380552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5381552f7358SJed Brown if (ierr) { 5382552f7358SJed Brown PetscMPIInt rank; 5383552f7358SJed Brown PetscErrorCode ierr2; 5384552f7358SJed Brown 538582f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 538677a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5387b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 53886a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5389552f7358SJed Brown CHKERRQ(ierr); 5390552f7358SJed Brown } 53911b406b76SMatthew G. Knepley if (!clPoints) { 5392552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 53931b406b76SMatthew G. Knepley } else { 53941b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 53951b406b76SMatthew G. Knepley } 5396552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5397552f7358SJed Brown PetscFunctionReturn(0); 5398552f7358SJed Brown } 5399552f7358SJed Brown 5400552f7358SJed Brown #undef __FUNCT__ 5401de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5402de41b84cSMatthew 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) 5403de41b84cSMatthew G. Knepley { 5404de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5405de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5406de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5407de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5408de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5409de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 54104ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5411de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5412de41b84cSMatthew G. Knepley 5413de41b84cSMatthew G. Knepley PetscFunctionBegin; 5414de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5415de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5416de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5417de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5418de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5419de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5420de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5421de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5422de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5423de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5424de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5425de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5426de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5427de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5428de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5429de41b84cSMatthew G. Knepley /* Column indices */ 5430de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 54314ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5432de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5433de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5434de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5435de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5436de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5437de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5438de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5439de41b84cSMatthew G. Knepley ++q; 5440de41b84cSMatthew G. Knepley } 5441de41b84cSMatthew G. Knepley } 5442de41b84cSMatthew G. Knepley numCPoints = q; 5443de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5444de41b84cSMatthew G. Knepley PetscInt fdof; 5445de41b84cSMatthew G. Knepley 5446de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 54474ca5e9f5SMatthew G. Knepley if (!dof) continue; 5448de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5449de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5450de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5451de41b84cSMatthew G. Knepley } 5452de41b84cSMatthew G. Knepley numCIndices += dof; 5453de41b84cSMatthew G. Knepley } 5454de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5455de41b84cSMatthew G. Knepley /* Row indices */ 5456de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5457de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 54581ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5459de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5460de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5461de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5462de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5463de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5464de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5465de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 54664ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 54674ca5e9f5SMatthew G. Knepley if (!dof) continue; 54684ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 54694ca5e9f5SMatthew G. Knepley if (s < q) continue; 5470de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5471de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5472de41b84cSMatthew G. Knepley ++q; 5473de41b84cSMatthew G. Knepley } 5474de41b84cSMatthew G. Knepley } 5475de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5476de41b84cSMatthew G. Knepley } 5477de41b84cSMatthew G. Knepley numFPoints = q; 5478de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5479de41b84cSMatthew G. Knepley PetscInt fdof; 5480de41b84cSMatthew G. Knepley 5481de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 54824ca5e9f5SMatthew G. Knepley if (!dof) continue; 5483de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5484de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5485de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5486de41b84cSMatthew G. Knepley } 5487de41b84cSMatthew G. Knepley numFIndices += dof; 5488de41b84cSMatthew G. Knepley } 5489de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5490de41b84cSMatthew G. Knepley 5491de41b84cSMatthew 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); 5492de41b84cSMatthew 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); 5493de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5494de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5495de41b84cSMatthew G. Knepley if (numFields) { 5496de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5497de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5498de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5499de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5500de41b84cSMatthew G. Knepley } 5501de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5502de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5503de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5504de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5505de41b84cSMatthew G. Knepley } 5506de41b84cSMatthew G. Knepley } else { 5507de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5508de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5509de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5510de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5511de41b84cSMatthew G. Knepley } 5512de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5513de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5514de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5515de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5516de41b84cSMatthew G. Knepley } 5517de41b84cSMatthew G. Knepley } 5518de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5519de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5520de41b84cSMatthew G. Knepley if (ierr) { 5521de41b84cSMatthew G. Knepley PetscMPIInt rank; 5522de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5523de41b84cSMatthew G. Knepley 5524de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5525de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5526de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5527de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5528de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5529de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5530de41b84cSMatthew G. Knepley } 5531549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5532de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5533de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5534de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5535de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5536de41b84cSMatthew G. Knepley } 5537de41b84cSMatthew G. Knepley 5538de41b84cSMatthew G. Knepley #undef __FUNCT__ 55397c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 55407c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 55417c927364SMatthew G. Knepley { 55427c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 55437c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 55447c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 55457c927364SMatthew G. Knepley CellRefiner cellRefiner; 55467c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 55477c927364SMatthew G. Knepley PetscErrorCode ierr; 55487c927364SMatthew G. Knepley 55497c927364SMatthew G. Knepley PetscFunctionBegin; 55507c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 55517c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 55527c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 55537c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 55547c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 55557c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 55567c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 55577c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 55587c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 55597c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 55607c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 55617c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 55627c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55637c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55647c927364SMatthew G. Knepley /* Column indices */ 55657c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 55667c927364SMatthew G. Knepley maxFPoints = numCPoints; 55677c927364SMatthew G. Knepley /* Compress out points not in the section */ 55687c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 55697c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 55707c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 55717c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 55727c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 55737c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 55747c927364SMatthew G. Knepley ++q; 55757c927364SMatthew G. Knepley } 55767c927364SMatthew G. Knepley } 55777c927364SMatthew G. Knepley numCPoints = q; 55787c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 55797c927364SMatthew G. Knepley PetscInt fdof; 55807c927364SMatthew G. Knepley 55817c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 55827c927364SMatthew G. Knepley if (!dof) continue; 55837c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 55847c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 55857c927364SMatthew G. Knepley coffsets[f+1] += fdof; 55867c927364SMatthew G. Knepley } 55877c927364SMatthew G. Knepley numCIndices += dof; 55887c927364SMatthew G. Knepley } 55897c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 55907c927364SMatthew G. Knepley /* Row indices */ 55917c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 55927c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 55937c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 55947c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 55957c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 55967c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 55977c927364SMatthew G. Knepley /* Compress out points not in the section */ 55987c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 55997c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 56007c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 56017c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 56027c927364SMatthew G. Knepley if (!dof) continue; 56037c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 56047c927364SMatthew G. Knepley if (s < q) continue; 56057c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 56067c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 56077c927364SMatthew G. Knepley ++q; 56087c927364SMatthew G. Knepley } 56097c927364SMatthew G. Knepley } 56107c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 56117c927364SMatthew G. Knepley } 56127c927364SMatthew G. Knepley numFPoints = q; 56137c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 56147c927364SMatthew G. Knepley PetscInt fdof; 56157c927364SMatthew G. Knepley 56167c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 56177c927364SMatthew G. Knepley if (!dof) continue; 56187c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 56197c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 56207c927364SMatthew G. Knepley foffsets[f+1] += fdof; 56217c927364SMatthew G. Knepley } 56227c927364SMatthew G. Knepley numFIndices += dof; 56237c927364SMatthew G. Knepley } 56247c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 56257c927364SMatthew G. Knepley 56267c927364SMatthew 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); 56277c927364SMatthew 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); 56287c927364SMatthew G. Knepley if (numFields) { 56297c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 56307c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 56317c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 56327c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 56337c927364SMatthew G. Knepley } 56347c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 56357c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56367c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56377c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 56387c927364SMatthew G. Knepley } 56397c927364SMatthew G. Knepley } else { 56407c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 56417c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 56427c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 56437c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 56447c927364SMatthew G. Knepley } 56457c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 56467c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56477c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56487c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 56497c927364SMatthew G. Knepley } 56507c927364SMatthew G. Knepley } 56517c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 56527c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 56537c927364SMatthew G. Knepley PetscFunctionReturn(0); 56547c927364SMatthew G. Knepley } 56557c927364SMatthew G. Knepley 56567c927364SMatthew G. Knepley #undef __FUNCT__ 5657770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5658f96281f8SMatthew G. Knepley /*@ 5659f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5660f96281f8SMatthew G. Knepley 5661f96281f8SMatthew G. Knepley Input Parameter: 5662f96281f8SMatthew G. Knepley . dm - The DMPlex object 5663f96281f8SMatthew G. Knepley 5664f96281f8SMatthew G. Knepley Output Parameters: 5665f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5666dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5667dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5668dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5669f96281f8SMatthew G. Knepley 5670f96281f8SMatthew G. Knepley Level: developer 5671f96281f8SMatthew G. Knepley 5672dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 5673f96281f8SMatthew G. Knepley @*/ 5674770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5675552f7358SJed Brown { 5676552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5677770b213bSMatthew G Knepley PetscInt dim; 5678770b213bSMatthew G Knepley PetscErrorCode ierr; 5679552f7358SJed Brown 5680552f7358SJed Brown PetscFunctionBegin; 5681552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5682c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5683770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5684770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5685770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5686770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5687552f7358SJed Brown PetscFunctionReturn(0); 5688552f7358SJed Brown } 5689552f7358SJed Brown 5690552f7358SJed Brown #undef __FUNCT__ 5691770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5692dc5a3409SMatthew G. Knepley /*@ 5693dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 5694dc5a3409SMatthew G. Knepley 5695dc5a3409SMatthew G. Knepley Input Parameters: 5696dc5a3409SMatthew G. Knepley . dm - The DMPlex object 5697dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 5698dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5699dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5700dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5701dc5a3409SMatthew G. Knepley 5702dc5a3409SMatthew G. Knepley Level: developer 5703dc5a3409SMatthew G. Knepley 5704dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 5705dc5a3409SMatthew G. Knepley @*/ 5706770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5707552f7358SJed Brown { 5708552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5709770b213bSMatthew G Knepley PetscInt dim; 5710770b213bSMatthew G Knepley PetscErrorCode ierr; 5711552f7358SJed Brown 5712552f7358SJed Brown PetscFunctionBegin; 5713552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5714c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5715770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5716770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5717770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5718770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5719552f7358SJed Brown PetscFunctionReturn(0); 5720552f7358SJed Brown } 5721552f7358SJed Brown 5722552f7358SJed Brown #undef __FUNCT__ 5723552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5724552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5725552f7358SJed Brown { 5726552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5727552f7358SJed Brown 5728552f7358SJed Brown PetscFunctionBegin; 5729552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5730552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5731552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5732552f7358SJed Brown PetscFunctionReturn(0); 5733552f7358SJed Brown } 5734552f7358SJed Brown 5735552f7358SJed Brown #undef __FUNCT__ 5736552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5737552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5738552f7358SJed Brown { 5739552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5740552f7358SJed Brown 5741552f7358SJed Brown PetscFunctionBegin; 5742552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5743552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5744552f7358SJed Brown PetscFunctionReturn(0); 5745552f7358SJed Brown } 5746552f7358SJed Brown 5747552f7358SJed Brown #undef __FUNCT__ 5748552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5749552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5750ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5751552f7358SJed Brown { 5752552f7358SJed Brown PetscSection section, globalSection; 5753552f7358SJed Brown PetscInt *numbers, p; 5754552f7358SJed Brown PetscErrorCode ierr; 5755552f7358SJed Brown 5756552f7358SJed Brown PetscFunctionBegin; 575782f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5758552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5759552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5760552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5761552f7358SJed Brown } 5762552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5763552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5764785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5765552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5766552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5767ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5768ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5769552f7358SJed Brown } 577082f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5771ef48cebcSMatthew G. Knepley if (globalSize) { 5772ef48cebcSMatthew G. Knepley PetscLayout layout; 5773ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5774ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5775ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5776ef48cebcSMatthew G. Knepley } 5777552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5778552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5779552f7358SJed Brown PetscFunctionReturn(0); 5780552f7358SJed Brown } 5781552f7358SJed Brown 5782552f7358SJed Brown #undef __FUNCT__ 5783552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5784552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5785552f7358SJed Brown { 5786552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5787552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5788552f7358SJed Brown PetscErrorCode ierr; 5789552f7358SJed Brown 5790552f7358SJed Brown PetscFunctionBegin; 5791552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5792552f7358SJed Brown if (!mesh->globalCellNumbers) { 5793552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5794552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 57950298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 57960d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5797ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5798552f7358SJed Brown } 5799552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5800552f7358SJed Brown PetscFunctionReturn(0); 5801552f7358SJed Brown } 5802552f7358SJed Brown 5803552f7358SJed Brown #undef __FUNCT__ 5804552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5805552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5806552f7358SJed Brown { 5807552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5808552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5809552f7358SJed Brown PetscErrorCode ierr; 5810552f7358SJed Brown 5811552f7358SJed Brown PetscFunctionBegin; 5812552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5813552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5814552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 58150298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 58160d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5817ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5818552f7358SJed Brown } 5819552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5820552f7358SJed Brown PetscFunctionReturn(0); 5821552f7358SJed Brown } 5822552f7358SJed Brown 5823ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5824ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5825ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5826ef48cebcSMatthew G. Knepley { 5827ef48cebcSMatthew G. Knepley IS nums[4]; 5828ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5829ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5830ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5831ef48cebcSMatthew G. Knepley 5832ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5833ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5834ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5835ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5836ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5837ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5838ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5839ef48cebcSMatthew G. Knepley 5840ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5841ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5842ef48cebcSMatthew G. Knepley shift += gsize; 5843ef48cebcSMatthew G. Knepley } 5844ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 5845ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5846ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5847ef48cebcSMatthew G. Knepley } 5848ef48cebcSMatthew G. Knepley 5849552f7358SJed Brown 5850552f7358SJed Brown #undef __FUNCT__ 5851552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5852552f7358SJed Brown /*@C 5853552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5854552f7358SJed Brown the local section and an SF describing the section point overlap. 5855552f7358SJed Brown 5856552f7358SJed Brown Input Parameters: 5857552f7358SJed Brown + s - The PetscSection for the local field layout 5858552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5859552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5860552f7358SJed Brown . label - The label specifying the points 5861552f7358SJed Brown - labelValue - The label stratum specifying the points 5862552f7358SJed Brown 5863552f7358SJed Brown Output Parameter: 5864552f7358SJed Brown . gsection - The PetscSection for the global field layout 5865552f7358SJed Brown 5866552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5867552f7358SJed Brown 5868552f7358SJed Brown Level: developer 5869552f7358SJed Brown 5870552f7358SJed Brown .seealso: PetscSectionCreate() 5871552f7358SJed Brown @*/ 5872552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5873552f7358SJed Brown { 58747ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5875552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5876552f7358SJed Brown PetscErrorCode ierr; 5877552f7358SJed Brown 5878552f7358SJed Brown PetscFunctionBegin; 58794c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5880552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5881552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 58827ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 58837ec39499SMatthew G. Knepley if (nroots >= 0) { 58847ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 58851795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 58867ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 58871795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 58887ec39499SMatthew G. Knepley } else { 58897ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 58907ec39499SMatthew G. Knepley } 58917ec39499SMatthew G. Knepley } 5892552f7358SJed Brown /* Mark ghost points with negative dof */ 5893552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5894552f7358SJed Brown PetscInt value; 5895552f7358SJed Brown 5896552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5897552f7358SJed Brown if (value != labelValue) continue; 5898552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5899552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5900552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5901552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 59027ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5903552f7358SJed Brown } 5904552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5905552f7358SJed Brown if (nroots >= 0) { 59067ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 59077ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5908552f7358SJed Brown if (nroots > pEnd-pStart) { 59097ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5910552f7358SJed Brown } 5911552f7358SJed Brown } 5912552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5913552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5914552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5915552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5916552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5917552f7358SJed Brown } 59184c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5919552f7358SJed Brown globalOff -= off; 5920552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5921552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 59227ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5923552f7358SJed Brown } 5924552f7358SJed Brown /* Put in negative offsets for ghost points */ 5925552f7358SJed Brown if (nroots >= 0) { 59267ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 59277ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5928552f7358SJed Brown if (nroots > pEnd-pStart) { 59297ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5930552f7358SJed Brown } 5931552f7358SJed Brown } 59327ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5933552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5934552f7358SJed Brown PetscFunctionReturn(0); 5935552f7358SJed Brown } 5936ca8062c8SMatthew G. Knepley 5937ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5938ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5939ca8062c8SMatthew G. Knepley /*@ 5940ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5941ca8062c8SMatthew G. Knepley 5942ca8062c8SMatthew G. Knepley Input Parameters: 5943ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5944ca8062c8SMatthew G. Knepley 5945ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5946ca8062c8SMatthew G. Knepley 5947ca8062c8SMatthew G. Knepley Level: developer 5948ca8062c8SMatthew G. Knepley 59499bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5950ca8062c8SMatthew G. Knepley @*/ 5951ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5952ca8062c8SMatthew G. Knepley { 5953ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5954ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5955ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5956ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5957ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5958ca8062c8SMatthew G. Knepley 5959ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5960ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5961ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5962ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5963ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5964ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5965ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5966ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5967ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5968ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 596942e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 597042e66dfaSMatthew G. Knepley PetscInt d; 597142e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 597242e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 597342e66dfaSMatthew G. Knepley } 5974ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5975ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5976ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5977ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5978ca8062c8SMatthew G. Knepley } 597942e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5980ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5981ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5982ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5983ca8062c8SMatthew G. Knepley } 5984ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5985ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5986ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5987ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5988ca8062c8SMatthew G. Knepley } 5989ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 599042e66dfaSMatthew G. Knepley if (dup) { 599142e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 599242e66dfaSMatthew G. Knepley } else { 5993ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5994ca8062c8SMatthew G. Knepley } 5995ca8062c8SMatthew G. Knepley } 599642e66dfaSMatthew G. Knepley } 5997ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5998ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5999ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6000ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6001ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6002ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6003ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6004ca8062c8SMatthew G. Knepley } 6005ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6006ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6007ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6008ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6009ca8062c8SMatthew G. Knepley } 6010ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6011ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6012ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6013ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6014ca8062c8SMatthew G. Knepley } 6015ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6016ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6017ca8062c8SMatthew G. Knepley } 6018ca8062c8SMatthew G. Knepley } 6019ca8062c8SMatthew G. Knepley } 6020ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6021ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6022ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6023ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6024ca8062c8SMatthew G. Knepley } 6025ca8062c8SMatthew G. Knepley 6026ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6027ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6028ca8062c8SMatthew G. Knepley /*@ 6029ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6030ca8062c8SMatthew G. Knepley 6031ca8062c8SMatthew G. Knepley Input Parameters: 6032ca8062c8SMatthew G. Knepley + dm - The DMPlex object 603358723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 603458723a97SMatthew G. Knepley - cellHeight - Normally 0 6035ca8062c8SMatthew G. Knepley 6036ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6037ca8062c8SMatthew G. Knepley 6038ca8062c8SMatthew G. Knepley Level: developer 6039ca8062c8SMatthew G. Knepley 60409bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6041ca8062c8SMatthew G. Knepley @*/ 604258723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6043ca8062c8SMatthew G. Knepley { 604442363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6045ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6046ca8062c8SMatthew G. Knepley 6047ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6048ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6049c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6050ca8062c8SMatthew G. Knepley switch (dim) { 605142363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 605242363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 605342363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6054ca8062c8SMatthew G. Knepley default: 6055ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6056ca8062c8SMatthew G. Knepley } 605758723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 605858723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6059ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6060ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6061ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 606258723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 606358723a97SMatthew G. Knepley 606458723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 606558723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 606658723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 606758723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 606858723a97SMatthew G. Knepley } 606958723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6070ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6071ca8062c8SMatthew G. Knepley } 607242363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 607342363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 607442363296SMatthew G. Knepley 607542363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 607642363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 607742363296SMatthew G. Knepley const PetscInt p = closure[cl]; 607842363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 607942363296SMatthew G. Knepley } 608042363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 608142363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 608242363296SMatthew G. Knepley } 6083ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6084ca8062c8SMatthew G. Knepley } 60859bf0dad6SMatthew G. Knepley 60869bf0dad6SMatthew G. Knepley #undef __FUNCT__ 60879bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 60889bf0dad6SMatthew G. Knepley /*@ 60899bf0dad6SMatthew 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 60909bf0dad6SMatthew G. Knepley 60919bf0dad6SMatthew G. Knepley Input Parameters: 60929bf0dad6SMatthew G. Knepley + dm - The DMPlex object 60939bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 60949bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 60959bf0dad6SMatthew G. Knepley 60969bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 60979bf0dad6SMatthew G. Knepley 60989bf0dad6SMatthew G. Knepley Level: developer 60999bf0dad6SMatthew G. Knepley 61009bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 61019bf0dad6SMatthew G. Knepley @*/ 61029bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 61039bf0dad6SMatthew G. Knepley { 61043554e41dSMatthew G. Knepley PetscInt pMax[4]; 61053554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 61069bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 61079bf0dad6SMatthew G. Knepley 61089bf0dad6SMatthew G. Knepley PetscFunctionBegin; 61099bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6110c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 61119bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 611225abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 61133554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 61143554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 61153554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 61169bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 61179bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 61189bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 61199bf0dad6SMatthew G. Knepley 612025abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 61219bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 61229bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 61239bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 61249bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 61259bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 61269bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 61279bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 61289bf0dad6SMatthew G. Knepley } 61293554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 61309bf0dad6SMatthew 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); 61319bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 61329bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 61339bf0dad6SMatthew G. Knepley 61349bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 61359bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 61369bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 61379bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 61389bf0dad6SMatthew G. Knepley } 6139e003ed69SMatthew 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); 61409bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6141e003ed69SMatthew 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]); 61429bf0dad6SMatthew G. Knepley } 61439bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 61449bf0dad6SMatthew G. Knepley } 61459bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 61469bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 61479bf0dad6SMatthew G. Knepley } 61483554e41dSMatthew G. Knepley } 6149552f7358SJed Brown PetscFunctionReturn(0); 6150552f7358SJed Brown } 61513913d7c8SMatthew G. Knepley 61523913d7c8SMatthew G. Knepley #undef __FUNCT__ 6153bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6154bceba477SMatthew G. Knepley /* Pointwise interpolation 6155bceba477SMatthew G. Knepley Just code FEM for now 6156bceba477SMatthew G. Knepley u^f = I u^c 61574ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 61584ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 61594ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6160bceba477SMatthew G. Knepley */ 6161bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6162bceba477SMatthew G. Knepley { 6163bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6164bceba477SMatthew G. Knepley PetscInt m, n; 6165a063dac3SMatthew G. Knepley void *ctx; 6166bceba477SMatthew G. Knepley PetscErrorCode ierr; 6167bceba477SMatthew G. Knepley 6168bceba477SMatthew G. Knepley PetscFunctionBegin; 6169bceba477SMatthew G. Knepley /* 6170bceba477SMatthew G. Knepley Loop over coarse cells 6171bceba477SMatthew G. Knepley Loop over coarse basis functions 6172bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6173bceba477SMatthew G. Knepley Loop over fine dual basis functions 6174bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6175bceba477SMatthew G. Knepley Sum 6176bceba477SMatthew G. Knepley Update local element matrix 6177bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6178bceba477SMatthew G. Knepley 6179bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6180bceba477SMatthew G. Knepley */ 6181bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6182bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6183bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6184bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6185bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6186bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6187bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6188bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6189a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6190a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 61915d1c2e58SMatthew G. Knepley /* Use naive scaling */ 61925d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6193a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6194a063dac3SMatthew G. Knepley } 6195bceba477SMatthew G. Knepley 6196a063dac3SMatthew G. Knepley #undef __FUNCT__ 6197a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6198a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6199a063dac3SMatthew G. Knepley { 620090748bafSMatthew G. Knepley PetscErrorCode ierr; 620190748bafSMatthew G. Knepley 6202a063dac3SMatthew G. Knepley PetscFunctionBegin; 62037c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 6204bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6205bceba477SMatthew G. Knepley } 6206bceba477SMatthew G. Knepley 6207bceba477SMatthew G. Knepley #undef __FUNCT__ 6208fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6209fd59a867SMatthew G. Knepley /* Pointwise interpolation 6210fd59a867SMatthew G. Knepley Just code FEM for now 6211fd59a867SMatthew G. Knepley u^f = I u^c 6212fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6213fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6214fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6215fd59a867SMatthew G. Knepley */ 6216fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6217fd59a867SMatthew G. Knepley { 6218fd59a867SMatthew G. Knepley PetscSection section; 6219fd59a867SMatthew G. Knepley IS *bcPoints; 6220286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6221286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6222fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6223fd59a867SMatthew G. Knepley 6224fd59a867SMatthew G. Knepley PetscFunctionBegin; 6225fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6226286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6227c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6228fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6229fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6230fd59a867SMatthew G. Knepley PetscBool isEssential; 623163d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6232fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6233fd59a867SMatthew G. Knepley } 6234fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6235fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6236fd59a867SMatthew G. Knepley const char *bdLabel; 6237fd59a867SMatthew G. Knepley DMLabel label; 6238fd59a867SMatthew G. Knepley const PetscInt *values; 62397391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 6240c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 6241fd59a867SMatthew G. Knepley 624263d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6243fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6244fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 62457391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 62467391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 62477391c1cbSMatthew G. Knepley const char *bdname; 62482f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 62497391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 62507391c1cbSMatthew G. Knepley if (duplicate) break; 62517391c1cbSMatthew G. Knepley } 62527391c1cbSMatthew G. Knepley if (!duplicate) { 6253fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 625432720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 62557391c1cbSMatthew G. Knepley } 625693a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6257fd59a867SMatthew G. Knepley if (isEssential) { 625893a5981aSMatthew G. Knepley IS tmp; 625993a5981aSMatthew G. Knepley PetscInt *newidx; 626093a5981aSMatthew G. Knepley const PetscInt *idx; 626193a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 626293a5981aSMatthew G. Knepley 6263fd59a867SMatthew G. Knepley bcFields[bc] = field; 626493a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 626593a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 626693a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 626793a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 626893a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 626993a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 627093a5981aSMatthew G. Knepley newn = 0; 627193a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 627293a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 627393a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 627493a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6275fd59a867SMatthew G. Knepley } 6276fd59a867SMatthew G. Knepley } 6277fd59a867SMatthew G. Knepley /* Handle discretization */ 6278fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6279286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6280fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6281fd59a867SMatthew G. Knepley PetscFE fe; 6282286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6283fd59a867SMatthew G. Knepley PetscInt d; 6284fd59a867SMatthew G. Knepley 628518abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6286fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6287286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6288286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6289fd59a867SMatthew G. Knepley } 6290286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6291286d8613SMatthew G. Knepley PetscInt d; 6292286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6293286d8613SMatthew 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."); 6294286d8613SMatthew G. Knepley } 6295286d8613SMatthew G. Knepley } 6296f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6297fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6298fd59a867SMatthew G. Knepley PetscFE fe; 6299fd59a867SMatthew G. Knepley const char *name; 630018abd763SMatthew G. Knepley 630118abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6302fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6303fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6304fd59a867SMatthew G. Knepley } 6305fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6306fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6307fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6308fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6309286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6310bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6311bceba477SMatthew G. Knepley } 6312bceba477SMatthew G. Knepley 6313bceba477SMatthew G. Knepley #undef __FUNCT__ 63143913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 63153913d7c8SMatthew G. Knepley /*@ 63163913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 63173913d7c8SMatthew G. Knepley 63183913d7c8SMatthew G. Knepley Input Parameter: 63193913d7c8SMatthew G. Knepley . dm - The DMPlex object 63203913d7c8SMatthew G. Knepley 63213913d7c8SMatthew G. Knepley Output Parameter: 63223913d7c8SMatthew G. Knepley . cdm - The coarse DM 63233913d7c8SMatthew G. Knepley 63243913d7c8SMatthew G. Knepley Level: intermediate 63253913d7c8SMatthew G. Knepley 63263913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 63273913d7c8SMatthew G. Knepley @*/ 63283913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 63293913d7c8SMatthew G. Knepley { 63303913d7c8SMatthew G. Knepley PetscFunctionBegin; 63313913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63323913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 63333913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 63343913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 63353913d7c8SMatthew G. Knepley } 63363913d7c8SMatthew G. Knepley 63373913d7c8SMatthew G. Knepley #undef __FUNCT__ 63383913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 63393913d7c8SMatthew G. Knepley /*@ 63403913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 63413913d7c8SMatthew G. Knepley 63423913d7c8SMatthew G. Knepley Input Parameters: 63433913d7c8SMatthew G. Knepley + dm - The DMPlex object 63443913d7c8SMatthew G. Knepley - cdm - The coarse DM 63453913d7c8SMatthew G. Knepley 63463913d7c8SMatthew G. Knepley Level: intermediate 63473913d7c8SMatthew G. Knepley 63483913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 63493913d7c8SMatthew G. Knepley @*/ 63503913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 63513913d7c8SMatthew G. Knepley { 63523913d7c8SMatthew G. Knepley DM_Plex *mesh; 63533913d7c8SMatthew G. Knepley PetscErrorCode ierr; 63543913d7c8SMatthew G. Knepley 63553913d7c8SMatthew G. Knepley PetscFunctionBegin; 63563913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63573913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 63583913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 63593913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 63603913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 63613913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 63623913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 63633913d7c8SMatthew G. Knepley } 6364*a68b90caSToby Isaac 6365*a68b90caSToby Isaac /* constraints */ 6366*a68b90caSToby Isaac #undef __FUNCT__ 6367*a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraints" 6368*a68b90caSToby Isaac /*@ 6369*a68b90caSToby Isaac DMPlexGetConstraints - Get the layout of the local point-to-point constraints 6370*a68b90caSToby Isaac 6371*a68b90caSToby Isaac not collective 6372*a68b90caSToby Isaac 6373*a68b90caSToby Isaac Input Parameters: 6374*a68b90caSToby Isaac . dm - The DMPlex object 6375*a68b90caSToby Isaac 6376*a68b90caSToby Isaac Output Parameters: 6377*a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points. 6378*a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection 6379*a68b90caSToby Isaac 6380*a68b90caSToby Isaac 6381*a68b90caSToby Isaac Level: intermediate 6382*a68b90caSToby Isaac 6383*a68b90caSToby Isaac .seealso: DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 6384*a68b90caSToby Isaac @*/ 6385*a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraints(DM dm, PetscSection *anchorSection, IS *anchorIS) 6386*a68b90caSToby Isaac { 6387*a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6388*a68b90caSToby Isaac 6389*a68b90caSToby Isaac PetscFunctionBegin; 6390*a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6391*a68b90caSToby Isaac if (anchorSection) *anchorSection = plex->anchorSection; 6392*a68b90caSToby Isaac if (anchorIS) *anchorIS = plex->anchorIS; 6393*a68b90caSToby Isaac PetscFunctionReturn(0); 6394*a68b90caSToby Isaac } 6395*a68b90caSToby Isaac 6396*a68b90caSToby Isaac #undef __FUNCT__ 6397*a68b90caSToby Isaac #define __FUNCT__ "DMGlobalToLocalHook_Plex_constraints" 6398*a68b90caSToby Isaac static PetscErrorCode DMGlobalToLocalHook_Plex_constraints(DM dm, Vec g, InsertMode mode, Vec l, void *ctx) 6399*a68b90caSToby Isaac { 6400*a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6401*a68b90caSToby Isaac Mat cMat; 6402*a68b90caSToby Isaac Vec cVec; 6403*a68b90caSToby Isaac PetscSection section, cSec; 6404*a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof; 6405*a68b90caSToby Isaac PetscErrorCode ierr; 6406*a68b90caSToby Isaac 6407*a68b90caSToby Isaac PetscFunctionBegin; 6408*a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6409*a68b90caSToby Isaac cMat = plex->constraintMat; 6410*a68b90caSToby Isaac if (cMat && (mode == INSERT_VALUES || mode == INSERT_ALL_VALUES || mode == INSERT_BC_VALUES)) { 6411*a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6412*a68b90caSToby Isaac cSec = plex->constraintSection; 6413*a68b90caSToby Isaac ierr = MatGetVecs(cMat,NULL,&cVec);CHKERRQ(ierr); 6414*a68b90caSToby Isaac ierr = MatMult(cMat,l,cVec);CHKERRQ(ierr); 6415*a68b90caSToby Isaac ierr = PetscSectionGetChart(cSec,&pStart,&pEnd);CHKERRQ(ierr); 6416*a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 6417*a68b90caSToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 6418*a68b90caSToby Isaac if (dof) { 6419*a68b90caSToby Isaac PetscScalar *vals; 6420*a68b90caSToby Isaac ierr = VecGetValuesSection(cVec,cSec,p,&vals);CHKERRQ(ierr); 6421*a68b90caSToby Isaac ierr = VecSetValuesSection(l,section,p,vals,INSERT_ALL_VALUES);CHKERRQ(ierr); 6422*a68b90caSToby Isaac } 6423*a68b90caSToby Isaac } 6424*a68b90caSToby Isaac ierr = VecDestroy(&cVec);CHKERRQ(ierr); 6425*a68b90caSToby Isaac } 6426*a68b90caSToby Isaac PetscFunctionReturn(0); 6427*a68b90caSToby Isaac } 6428*a68b90caSToby Isaac 6429*a68b90caSToby Isaac #undef __FUNCT__ 6430*a68b90caSToby Isaac #define __FUNCT__ "DMLocalToGlobalHook_Plex_constraints" 6431*a68b90caSToby Isaac static PetscErrorCode DMLocalToGlobalHook_Plex_constraints(DM dm, Vec l, InsertMode mode, Vec g, void *ctx) 6432*a68b90caSToby Isaac { 6433*a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6434*a68b90caSToby Isaac Mat cMat; 6435*a68b90caSToby Isaac Vec cVec; 6436*a68b90caSToby Isaac PetscSection section, cSec; 6437*a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof; 6438*a68b90caSToby Isaac PetscErrorCode ierr; 6439*a68b90caSToby Isaac 6440*a68b90caSToby Isaac PetscFunctionBegin; 6441*a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6442*a68b90caSToby Isaac cMat = plex->constraintMat; 6443*a68b90caSToby Isaac if (cMat && (mode == ADD_VALUES || mode == ADD_ALL_VALUES || mode == ADD_BC_VALUES)) { 6444*a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6445*a68b90caSToby Isaac cSec = plex->constraintSection; 6446*a68b90caSToby Isaac ierr = MatGetVecs(cMat,NULL,&cVec);CHKERRQ(ierr); 6447*a68b90caSToby Isaac ierr = PetscSectionGetChart(cSec,&pStart,&pEnd);CHKERRQ(ierr); 6448*a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 6449*a68b90caSToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 6450*a68b90caSToby Isaac if (dof) { 6451*a68b90caSToby Isaac PetscInt d; 6452*a68b90caSToby Isaac PetscScalar *vals; 6453*a68b90caSToby Isaac ierr = VecGetValuesSection(l,section,p,&vals);CHKERRQ(ierr); 6454*a68b90caSToby Isaac ierr = VecSetValuesSection(cVec,cSec,p,vals,mode);CHKERRQ(ierr); 6455*a68b90caSToby Isaac /* for this to be the true transpose, we have to zero the values that 6456*a68b90caSToby Isaac * we just extracted */ 6457*a68b90caSToby Isaac for (d = 0; d < dof; d++) { 6458*a68b90caSToby Isaac vals[d] = 0.; 6459*a68b90caSToby Isaac } 6460*a68b90caSToby Isaac } 6461*a68b90caSToby Isaac } 6462*a68b90caSToby Isaac ierr = MatMultTransposeAdd(cMat,cVec,l,l);CHKERRQ(ierr); 6463*a68b90caSToby Isaac ierr = VecDestroy(&cVec);CHKERRQ(ierr); 6464*a68b90caSToby Isaac } 6465*a68b90caSToby Isaac PetscFunctionReturn(0); 6466*a68b90caSToby Isaac } 6467*a68b90caSToby Isaac 6468*a68b90caSToby Isaac #undef __FUNCT__ 6469*a68b90caSToby Isaac #define __FUNCT__ "DMPlexSetConstraints" 6470*a68b90caSToby Isaac /*@ 6471*a68b90caSToby Isaac DMPlexSetConstraints - Set the layout of the local point-to-point constraints. Unlike boundary conditions, when a 6472*a68b90caSToby Isaac point's degrees of freedom in a section are constrained to an outside value, the point-to-point constraints set a 6473*a68b90caSToby Isaac point's degrees of freedom to be a linear combination of other points' degrees of freedom. 6474*a68b90caSToby Isaac 6475*a68b90caSToby Isaac After specifying the layout of constraints with DMPlexSetConstraints(), one specifies the constraints by calling 6476*a68b90caSToby Isaac DMPlexGetConstraintMatrix() and filling in the entries. This matrix will be used fill in the constrained values 6477*a68b90caSToby Isaac from the anchor values in local vectors in DMGlobalToLocalEnd() with mode = INSERT_VALUES, and its transpose is used 6478*a68b90caSToby Isaac to sum constrained values back to their anchor values in DMLocalToGlobalBegin() with mode = ADD_VALUES. 6479*a68b90caSToby Isaac 6480*a68b90caSToby Isaac logically collective 6481*a68b90caSToby Isaac 6482*a68b90caSToby Isaac Input Parameters: 6483*a68b90caSToby Isaac + dm - The DMPlex object 6484*a68b90caSToby Isaac . anchorSection - The section that describes the mapping from constrained points to the anchor points listed in anchorIS. 6485*a68b90caSToby Isaac - anchorIS - The list of all anchor points. 6486*a68b90caSToby Isaac 6487*a68b90caSToby Isaac The reference counts of anchorSection and anchorIS are incremented. 6488*a68b90caSToby Isaac 6489*a68b90caSToby Isaac 6490*a68b90caSToby Isaac Level: intermediate 6491*a68b90caSToby Isaac 6492*a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 6493*a68b90caSToby Isaac @*/ 6494*a68b90caSToby Isaac PetscErrorCode DMPlexSetConstraints(DM dm, PetscSection anchorSection, IS anchorIS) 6495*a68b90caSToby Isaac { 6496*a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6497*a68b90caSToby Isaac PetscErrorCode ierr; 6498*a68b90caSToby Isaac 6499*a68b90caSToby Isaac PetscFunctionBegin; 6500*a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6501*a68b90caSToby Isaac 6502*a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr); 6503*a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr); 6504*a68b90caSToby Isaac plex->anchorSection = anchorSection; 6505*a68b90caSToby Isaac 6506*a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr); 6507*a68b90caSToby Isaac ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr); 6508*a68b90caSToby Isaac plex->anchorIS = anchorIS; 6509*a68b90caSToby Isaac 6510*a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG) 6511*a68b90caSToby Isaac if (anchorIS && anchorSection) { 6512*a68b90caSToby Isaac PetscInt size, a, pStart, pEnd; 6513*a68b90caSToby Isaac const PetscInt *anchors; 6514*a68b90caSToby Isaac 6515*a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 6516*a68b90caSToby Isaac ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr); 6517*a68b90caSToby Isaac ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr); 6518*a68b90caSToby Isaac for (a = 0; a < size; a++) { 6519*a68b90caSToby Isaac PetscInt p; 6520*a68b90caSToby Isaac 6521*a68b90caSToby Isaac p = anchors[a]; 6522*a68b90caSToby Isaac if (p >= pStart && p < pEnd) { 6523*a68b90caSToby Isaac PetscInt dof; 6524*a68b90caSToby Isaac 6525*a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 6526*a68b90caSToby Isaac if (dof) { 6527*a68b90caSToby Isaac PetscErrorCode ierr2; 6528*a68b90caSToby Isaac 6529*a68b90caSToby Isaac ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2); 6530*a68b90caSToby Isaac SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p); 6531*a68b90caSToby Isaac } 6532*a68b90caSToby Isaac } 6533*a68b90caSToby Isaac } 6534*a68b90caSToby Isaac ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr); 6535*a68b90caSToby Isaac } 6536*a68b90caSToby Isaac #endif 6537*a68b90caSToby Isaac 6538*a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->constraintSection);CHKERRQ(ierr); 6539*a68b90caSToby Isaac ierr = MatDestroy(&plex->constraintMat);CHKERRQ(ierr); 6540*a68b90caSToby Isaac 6541*a68b90caSToby Isaac if (anchorSection) { 6542*a68b90caSToby Isaac /* add the constraint hooks if they have not already been added */ 6543*a68b90caSToby Isaac { 6544*a68b90caSToby Isaac DMGlobalToLocalHookLink link,next=NULL; 6545*a68b90caSToby Isaac for (link=dm->gtolhook; link; link=next) { 6546*a68b90caSToby Isaac next = link->next; 6547*a68b90caSToby Isaac if (link->endhook == DMGlobalToLocalHook_Plex_constraints) { 6548*a68b90caSToby Isaac break; 6549*a68b90caSToby Isaac } 6550*a68b90caSToby Isaac } 6551*a68b90caSToby Isaac if (!link) { 6552*a68b90caSToby Isaac ierr = DMGlobalToLocalHookAdd(dm,NULL,DMGlobalToLocalHook_Plex_constraints,NULL);CHKERRQ(ierr); 6553*a68b90caSToby Isaac } 6554*a68b90caSToby Isaac } 6555*a68b90caSToby Isaac { 6556*a68b90caSToby Isaac DMLocalToGlobalHookLink link,next=NULL; 6557*a68b90caSToby Isaac for (link=dm->ltoghook; link; link=next) { 6558*a68b90caSToby Isaac next = link->next; 6559*a68b90caSToby Isaac if (link->beginhook == DMLocalToGlobalHook_Plex_constraints) { 6560*a68b90caSToby Isaac break; 6561*a68b90caSToby Isaac } 6562*a68b90caSToby Isaac } 6563*a68b90caSToby Isaac if (!link) { 6564*a68b90caSToby Isaac ierr = DMLocalToGlobalHookAdd(dm,DMLocalToGlobalHook_Plex_constraints,NULL,NULL);CHKERRQ(ierr); 6565*a68b90caSToby Isaac } 6566*a68b90caSToby Isaac } 6567*a68b90caSToby Isaac } 6568*a68b90caSToby Isaac else { 6569*a68b90caSToby Isaac /* remove the constraint hooks if they were added before */ 6570*a68b90caSToby Isaac { 6571*a68b90caSToby Isaac DMGlobalToLocalHookLink prev=NULL,link,next=NULL; 6572*a68b90caSToby Isaac for (link=dm->gtolhook; link; link=next) { 6573*a68b90caSToby Isaac next = link->next; 6574*a68b90caSToby Isaac if (link->endhook == DMGlobalToLocalHook_Plex_constraints) { 6575*a68b90caSToby Isaac break; 6576*a68b90caSToby Isaac } 6577*a68b90caSToby Isaac } 6578*a68b90caSToby Isaac if (link) { 6579*a68b90caSToby Isaac ierr = PetscFree(link);CHKERRQ(ierr); 6580*a68b90caSToby Isaac if (prev) { 6581*a68b90caSToby Isaac prev->next = next; 6582*a68b90caSToby Isaac } 6583*a68b90caSToby Isaac else { 6584*a68b90caSToby Isaac dm->gtolhook = next; 6585*a68b90caSToby Isaac } 6586*a68b90caSToby Isaac } 6587*a68b90caSToby Isaac } 6588*a68b90caSToby Isaac { 6589*a68b90caSToby Isaac DMLocalToGlobalHookLink prev=NULL,link,next=NULL; 6590*a68b90caSToby Isaac for (link=dm->ltoghook; link; link=next) { 6591*a68b90caSToby Isaac next = link->next; 6592*a68b90caSToby Isaac if (link->beginhook == DMLocalToGlobalHook_Plex_constraints) { 6593*a68b90caSToby Isaac break; 6594*a68b90caSToby Isaac } 6595*a68b90caSToby Isaac } 6596*a68b90caSToby Isaac if (link) { 6597*a68b90caSToby Isaac ierr = PetscFree(link);CHKERRQ(ierr); 6598*a68b90caSToby Isaac if (prev) { 6599*a68b90caSToby Isaac prev->next = next; 6600*a68b90caSToby Isaac } 6601*a68b90caSToby Isaac else { 6602*a68b90caSToby Isaac dm->ltoghook = next; 6603*a68b90caSToby Isaac } 6604*a68b90caSToby Isaac } 6605*a68b90caSToby Isaac } 6606*a68b90caSToby Isaac } 6607*a68b90caSToby Isaac 6608*a68b90caSToby Isaac PetscFunctionReturn(0); 6609*a68b90caSToby Isaac } 6610*a68b90caSToby Isaac 6611*a68b90caSToby Isaac #undef __FUNCT__ 6612*a68b90caSToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection" 6613*a68b90caSToby Isaac static PetscErrorCode DMPlexCreateConstraintSection(DM dm, PetscSection *cSec) 6614*a68b90caSToby Isaac { 6615*a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6616*a68b90caSToby Isaac PetscSection section, anchorSection; 6617*a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof, numFields, f; 6618*a68b90caSToby Isaac PetscErrorCode ierr; 6619*a68b90caSToby Isaac 6620*a68b90caSToby Isaac PetscFunctionBegin; 6621*a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6622*a68b90caSToby Isaac anchorSection = plex->anchorSection; 6623*a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6624*a68b90caSToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)section),cSec);CHKERRQ(ierr); 6625*a68b90caSToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 6626*a68b90caSToby Isaac ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr); 6627*a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 6628*a68b90caSToby Isaac ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr); 6629*a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 6630*a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 6631*a68b90caSToby Isaac if (dof) { 6632*a68b90caSToby Isaac ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr); 6633*a68b90caSToby Isaac ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr); 6634*a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 6635*a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr); 6636*a68b90caSToby Isaac ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr); 6637*a68b90caSToby Isaac } 6638*a68b90caSToby Isaac } 6639*a68b90caSToby Isaac } 6640*a68b90caSToby Isaac ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr); 6641*a68b90caSToby Isaac PetscFunctionReturn(0); 6642*a68b90caSToby Isaac } 6643*a68b90caSToby Isaac 6644*a68b90caSToby Isaac #undef __FUNCT__ 6645*a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraintSection" 6646*a68b90caSToby Isaac /*@ 6647*a68b90caSToby Isaac DMPlexGetConstraintSection - Get the section that maps constrained points to rows of the constraint matrix. 6648*a68b90caSToby Isaac 6649*a68b90caSToby Isaac The default section obtained with DMGetDefaultSection() maps points to columns of the constraint matrix. 6650*a68b90caSToby Isaac 6651*a68b90caSToby Isaac logically collective 6652*a68b90caSToby Isaac 6653*a68b90caSToby Isaac Input Parameters: 6654*a68b90caSToby Isaac . dm - The DMPlex object 6655*a68b90caSToby Isaac 6656*a68b90caSToby Isaac Output Parameters: 6657*a68b90caSToby Isaac . cSec - If not NULL, set to the section describing which points anchor the constrained points. 6658*a68b90caSToby Isaac 6659*a68b90caSToby Isaac 6660*a68b90caSToby Isaac Level: intermediate 6661*a68b90caSToby Isaac 6662*a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 6663*a68b90caSToby Isaac @*/ 6664*a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraintSection(DM dm, PetscSection *cSec) 6665*a68b90caSToby Isaac { 6666*a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6667*a68b90caSToby Isaac PetscErrorCode ierr; 6668*a68b90caSToby Isaac 6669*a68b90caSToby Isaac PetscFunctionBegin; 6670*a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6671*a68b90caSToby Isaac if (plex->anchorSection && !plex->constraintSection) { 6672*a68b90caSToby Isaac ierr = DMPlexCreateConstraintSection(dm,&plex->constraintSection);CHKERRQ(ierr); 6673*a68b90caSToby Isaac } 6674*a68b90caSToby Isaac if (cSec) *cSec = plex->constraintSection; 6675*a68b90caSToby Isaac PetscFunctionReturn(0); 6676*a68b90caSToby Isaac } 6677*a68b90caSToby Isaac 6678*a68b90caSToby Isaac #undef __FUNCT__ 6679*a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraintMatrix" 6680*a68b90caSToby Isaac /*@ 6681*a68b90caSToby Isaac DMPlexGetConstraintMatrix - Get the matrix that specifies the point-to-point constraints. 6682*a68b90caSToby Isaac 6683*a68b90caSToby Isaac logically collective 6684*a68b90caSToby Isaac 6685*a68b90caSToby Isaac Input Parameters: 6686*a68b90caSToby Isaac . dm - The DMPlex object 6687*a68b90caSToby Isaac 6688*a68b90caSToby Isaac Output Parameters: 6689*a68b90caSToby Isaac . cMat - If not NULL, returns the constraint matrix. If the constraint matrix has not been created before, then it is 6690*a68b90caSToby Isaac created and its nonzero structure is allocated, so that the user can insert values. 6691*a68b90caSToby Isaac 6692*a68b90caSToby Isaac 6693*a68b90caSToby Isaac Level: intermediate 6694*a68b90caSToby Isaac 6695*a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexSetConstraintMatrix() 6696*a68b90caSToby Isaac @*/ 6697*a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraintMatrix(DM dm, Mat *cMat) 6698*a68b90caSToby Isaac { 6699*a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6700*a68b90caSToby Isaac PetscErrorCode ierr; 6701*a68b90caSToby Isaac 6702*a68b90caSToby Isaac PetscFunctionBegin; 6703*a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6704*a68b90caSToby Isaac if (cMat) *cMat = plex->constraintMat; 6705*a68b90caSToby Isaac PetscFunctionReturn(0); 6706*a68b90caSToby Isaac } 6707*a68b90caSToby Isaac 6708*a68b90caSToby Isaac #undef __FUNCT__ 6709*a68b90caSToby Isaac #define __FUNCT__ "DMPlexSetConstraintMatrix" 6710*a68b90caSToby Isaac /*@ 6711*a68b90caSToby Isaac DMPlexSetConstraintMatrix - Set the matrix that specifies the point-to-point constraints. It should have the same 6712*a68b90caSToby Isaac number of rows as the layout size of the section returned by DMPlexGetConstraintSection(), and it should have the 6713*a68b90caSToby Isaac same number of columns as the layout size of the section returned by DMGetDefaultSection(). For the constraint 6714*a68b90caSToby Isaac matrix to be used when constructing a matrix in, e.g., DMPlexSNESComputeJacobianFEM(), then MatGetValues() must be 6715*a68b90caSToby Isaac implemented. 6716*a68b90caSToby Isaac 6717*a68b90caSToby Isaac logically collective 6718*a68b90caSToby Isaac 6719*a68b90caSToby Isaac Input Parameters: 6720*a68b90caSToby Isaac + dm - The DMPlex object 6721*a68b90caSToby Isaac - cMat - The constraint matrix. 6722*a68b90caSToby Isaac 6723*a68b90caSToby Isaac The reference count of cMat is incremented. 6724*a68b90caSToby Isaac 6725*a68b90caSToby Isaac 6726*a68b90caSToby Isaac Level: advanced. 6727*a68b90caSToby Isaac 6728*a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix() 6729*a68b90caSToby Isaac @*/ 6730*a68b90caSToby Isaac PetscErrorCode DMPlexSetConstraintMatrix(DM dm, Mat cMat) 6731*a68b90caSToby Isaac { 6732*a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6733*a68b90caSToby Isaac PetscErrorCode ierr; 6734*a68b90caSToby Isaac 6735*a68b90caSToby Isaac PetscFunctionBegin; 6736*a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6737*a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)cMat);CHKERRQ(ierr); 6738*a68b90caSToby Isaac ierr = MatDestroy(&plex->constraintMat);CHKERRQ(ierr); 6739*a68b90caSToby Isaac plex->constraintMat = cMat; 6740*a68b90caSToby Isaac PetscFunctionReturn(0); 6741*a68b90caSToby Isaac } 6742